/usr/share/doc/python-rdflib-doc/html/_modules/rdflib/compare.html is in python-rdflib-doc 4.1.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
<title>rdflib.compare — rdflib 4.1.2 documentation</title>
<meta name="viewport" content="width=device-width; initial-scale=1.0; maximum-scale=1.0; user-scalable=0;"/>
<link rel="stylesheet" href="../../_static/rtd.css" type="text/css" />
<link rel="stylesheet" href="../../_static/pygments.css" type="text/css" />
<script type="text/javascript">
var DOCUMENTATION_OPTIONS = {
URL_ROOT: '../../',
VERSION: '4.1.2',
COLLAPSE_INDEX: false,
FILE_SUFFIX: '.html',
HAS_SOURCE: true
};
</script>
<script type="text/javascript" src="../../_static/jquery.js"></script>
<script type="text/javascript" src="../../_static/underscore.js"></script>
<script type="text/javascript" src="../../_static/doctools.js"></script>
<script type="text/javascript" src="../../../../_static/searchtools.js"></script>
<link rel="top" title="rdflib 4.1.2 documentation" href="../../index.html" />
<link rel="up" title="Module code" href="../index.html" />
</head>
<body>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="../../genindex.html" title="General Index"
accesskey="I">index</a></li>
<li class="right" >
<a href="../../py-modindex.html" title="Python Module Index"
>modules</a> |</li>
<li><a href="../../index.html">rdflib 4.1.2 documentation</a> »</li>
<li><a href="../index.html" accesskey="U">Module code</a> »</li>
</ul>
</div>
<div class="document">
<div class="documentwrapper">
<div class="bodywrapper">
<div class="body">
<h1>Source code for rdflib.compare</h1><div class="highlight"><pre>
<span class="c"># -*- coding: utf-8 -*-</span>
<span class="sd">"""</span>
<span class="sd">A collection of utilities for canonicalizing and inspecting graphs.</span>
<span class="sd">Among other things, they solve of the problem of deterministic bnode</span>
<span class="sd">comparisons.</span>
<span class="sd">Warning: the time to canonicalize bnodes may increase exponentially on larger</span>
<span class="sd">graphs. Use with care!</span>
<span class="sd">Example of comparing two graphs::</span>
<span class="sd"> >>> g1 = Graph().parse(format='n3', data='''</span>
<span class="sd"> ... @prefix : <http://example.org/ns#> .</span>
<span class="sd"> ... <http://example.org> :rel</span>
<span class="sd"> ... <http://example.org/same>,</span>
<span class="sd"> ... [ :label "Same" ],</span>
<span class="sd"> ... <http://example.org/a>,</span>
<span class="sd"> ... [ :label "A" ] .</span>
<span class="sd"> ... ''')</span>
<span class="sd"> >>> g2 = Graph().parse(format='n3', data='''</span>
<span class="sd"> ... @prefix : <http://example.org/ns#> .</span>
<span class="sd"> ... <http://example.org> :rel</span>
<span class="sd"> ... <http://example.org/same>,</span>
<span class="sd"> ... [ :label "Same" ],</span>
<span class="sd"> ... <http://example.org/b>,</span>
<span class="sd"> ... [ :label "B" ] .</span>
<span class="sd"> ... ''')</span>
<span class="sd"> >>></span>
<span class="sd"> >>> iso1 = to_isomorphic(g1)</span>
<span class="sd"> >>> iso2 = to_isomorphic(g2)</span>
<span class="sd">These are not isomorphic::</span>
<span class="sd"> >>> iso1 == iso2</span>
<span class="sd"> False</span>
<span class="sd">Diff the two graphs::</span>
<span class="sd"> >>> in_both, in_first, in_second = graph_diff(iso1, iso2)</span>
<span class="sd">Present in both::</span>
<span class="sd"> >>> def dump_nt_sorted(g):</span>
<span class="sd"> ... for l in sorted(g.serialize(format='nt').splitlines()):</span>
<span class="sd"> ... if l: print(l.decode('ascii'))</span>
<span class="sd"> >>> dump_nt_sorted(in_both) #doctest: +SKIP</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> <http://example.org/same> .</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> _:cbcaabaaba17fecbc304a64f8edee4335e .</span>
<span class="sd"> _:cbcaabaaba17fecbc304a64f8edee4335e</span>
<span class="sd"> <http://example.org/ns#label> "Same" .</span>
<span class="sd">Only in first::</span>
<span class="sd"> >>> dump_nt_sorted(in_first) #doctest: +SKIP</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> <http://example.org/a> .</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> _:cb124e4c6da0579f810c0ffe4eff485bd9 .</span>
<span class="sd"> _:cb124e4c6da0579f810c0ffe4eff485bd9</span>
<span class="sd"> <http://example.org/ns#label> "A" .</span>
<span class="sd">Only in second::</span>
<span class="sd"> >>> dump_nt_sorted(in_second) #doctest: +SKIP</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> <http://example.org/b> .</span>
<span class="sd"> <http://example.org></span>
<span class="sd"> <http://example.org/ns#rel> _:cb558f30e21ddfc05ca53108348338ade8 .</span>
<span class="sd"> _:cb558f30e21ddfc05ca53108348338ade8</span>
<span class="sd"> <http://example.org/ns#label> "B" .</span>
<span class="sd">"""</span>
<span class="c"># TODO:</span>
<span class="c"># - Doesn't handle quads.</span>
<span class="c"># - Add warning and/or safety mechanism before working on large graphs?</span>
<span class="c"># - use this in existing Graph.isomorphic?</span>
<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s">'IsomorphicGraph'</span><span class="p">,</span> <span class="s">'to_isomorphic'</span><span class="p">,</span> <span class="s">'isomorphic'</span><span class="p">,</span>
<span class="s">'to_canonical_graph'</span><span class="p">,</span> <span class="s">'graph_diff'</span><span class="p">,</span> <span class="s">'similar'</span><span class="p">]</span>
<span class="kn">from</span> <span class="nn">rdflib.graph</span> <span class="kn">import</span> <span class="n">Graph</span><span class="p">,</span> <span class="n">ConjunctiveGraph</span><span class="p">,</span> <span class="n">ReadOnlyGraphAggregate</span>
<span class="kn">from</span> <span class="nn">rdflib.term</span> <span class="kn">import</span> <span class="n">BNode</span>
<span class="k">try</span><span class="p">:</span>
<span class="kn">import</span> <span class="nn">hashlib</span>
<span class="n">md</span> <span class="o">=</span> <span class="n">hashlib</span><span class="o">.</span><span class="n">md5</span>
<span class="k">except</span> <span class="ne">ImportError</span><span class="p">:</span>
<span class="c"># for Python << 2.5</span>
<span class="kn">import</span> <span class="nn">md5</span>
<span class="n">md</span> <span class="o">=</span> <span class="n">md5</span><span class="o">.</span><span class="n">new</span>
<div class="viewcode-block" id="IsomorphicGraph"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.IsomorphicGraph">[docs]</a><span class="k">class</span> <span class="nc">IsomorphicGraph</span><span class="p">(</span><span class="n">ConjunctiveGraph</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Ported from</span>
<span class="sd"> <http://www.w3.org/2001/sw/DataAccess/proto-tests/tools/rdfdiff.py></span>
<span class="sd"> (Sean B Palmer's RDF Graph Isomorphism Tester).</span>
<span class="sd"> """</span>
<div class="viewcode-block" id="IsomorphicGraph.__init__"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.IsomorphicGraph.__init__">[docs]</a> <span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="o">**</span><span class="n">kwargs</span><span class="p">):</span>
<span class="nb">super</span><span class="p">(</span><span class="n">IsomorphicGraph</span><span class="p">,</span> <span class="bp">self</span><span class="p">)</span><span class="o">.</span><span class="n">__init__</span><span class="p">(</span><span class="o">**</span><span class="n">kwargs</span><span class="p">)</span>
</div>
<div class="viewcode-block" id="IsomorphicGraph.__eq__"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.IsomorphicGraph.__eq__">[docs]</a> <span class="k">def</span> <span class="nf">__eq__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">other</span><span class="p">):</span>
<span class="sd">"""Graph isomorphism testing."""</span>
<span class="k">if</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">other</span><span class="p">,</span> <span class="n">IsomorphicGraph</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">False</span>
<span class="k">elif</span> <span class="nb">len</span><span class="p">(</span><span class="bp">self</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">other</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">False</span>
<span class="k">elif</span> <span class="nb">list</span><span class="p">(</span><span class="bp">self</span><span class="p">)</span> <span class="o">==</span> <span class="nb">list</span><span class="p">(</span><span class="n">other</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">True</span> <span class="c"># TODO: really generally cheaper?</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">internal_hash</span><span class="p">()</span> <span class="o">==</span> <span class="n">other</span><span class="o">.</span><span class="n">internal_hash</span><span class="p">()</span>
</div>
<div class="viewcode-block" id="IsomorphicGraph.__ne__"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.IsomorphicGraph.__ne__">[docs]</a> <span class="k">def</span> <span class="nf">__ne__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">other</span><span class="p">):</span>
<span class="sd">"""Negative graph isomorphism testing."""</span>
<span class="k">return</span> <span class="ow">not</span> <span class="bp">self</span><span class="o">.</span><span class="n">__eq__</span><span class="p">(</span><span class="n">other</span><span class="p">)</span>
</div>
<div class="viewcode-block" id="IsomorphicGraph.internal_hash"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.IsomorphicGraph.internal_hash">[docs]</a> <span class="k">def</span> <span class="nf">internal_hash</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> This is defined instead of __hash__ to avoid a circular recursion</span>
<span class="sd"> scenario with the Memory store for rdflib which requires a hash lookup</span>
<span class="sd"> in order to return a generator of triples.</span>
<span class="sd"> """</span>
<span class="k">return</span> <span class="n">_TripleCanonicalizer</span><span class="p">(</span><span class="bp">self</span><span class="p">)</span><span class="o">.</span><span class="n">to_hash</span><span class="p">()</span>
</div></div>
<span class="k">class</span> <span class="nc">_TripleCanonicalizer</span><span class="p">(</span><span class="nb">object</span><span class="p">):</span>
<span class="k">def</span> <span class="nf">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">graph</span><span class="p">,</span> <span class="n">hashfunc</span><span class="o">=</span><span class="nb">hash</span><span class="p">):</span>
<span class="bp">self</span><span class="o">.</span><span class="n">graph</span> <span class="o">=</span> <span class="n">graph</span>
<span class="bp">self</span><span class="o">.</span><span class="n">hashfunc</span> <span class="o">=</span> <span class="n">hashfunc</span>
<span class="k">def</span> <span class="nf">to_hash</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">hashfunc</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span>
<span class="nb">map</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">hashfunc</span><span class="p">,</span> <span class="bp">self</span><span class="o">.</span><span class="n">canonical_triples</span><span class="p">()))))</span>
<span class="k">def</span> <span class="nf">canonical_triples</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span>
<span class="k">for</span> <span class="n">triple</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">graph</span><span class="p">:</span>
<span class="k">yield</span> <span class="nb">tuple</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">_canonicalize_bnodes</span><span class="p">(</span><span class="n">triple</span><span class="p">))</span>
<span class="k">def</span> <span class="nf">_canonicalize_bnodes</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">triple</span><span class="p">):</span>
<span class="k">for</span> <span class="n">term</span> <span class="ow">in</span> <span class="n">triple</span><span class="p">:</span>
<span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">term</span><span class="p">,</span> <span class="n">BNode</span><span class="p">):</span>
<span class="k">yield</span> <span class="n">BNode</span><span class="p">(</span><span class="n">value</span><span class="o">=</span><span class="s">"cb</span><span class="si">%s</span><span class="s">"</span> <span class="o">%</span> <span class="bp">self</span><span class="o">.</span><span class="n">_canonicalize</span><span class="p">(</span><span class="n">term</span><span class="p">))</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="n">term</span>
<span class="k">def</span> <span class="nf">_canonicalize</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">term</span><span class="p">,</span> <span class="n">done</span><span class="o">=</span><span class="bp">False</span><span class="p">):</span>
<span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">hashfunc</span><span class="p">(</span><span class="nb">tuple</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">_vhashtriples</span><span class="p">(</span><span class="n">term</span><span class="p">,</span> <span class="n">done</span><span class="p">),</span>
<span class="n">key</span><span class="o">=</span><span class="n">_hetero_tuple_key</span><span class="p">)))</span>
<span class="k">def</span> <span class="nf">_vhashtriples</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">term</span><span class="p">,</span> <span class="n">done</span><span class="p">):</span>
<span class="k">for</span> <span class="n">triple</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">graph</span><span class="p">:</span>
<span class="k">if</span> <span class="n">term</span> <span class="ow">in</span> <span class="n">triple</span><span class="p">:</span>
<span class="k">yield</span> <span class="nb">tuple</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">_vhashtriple</span><span class="p">(</span><span class="n">triple</span><span class="p">,</span> <span class="n">term</span><span class="p">,</span> <span class="n">done</span><span class="p">))</span>
<span class="k">def</span> <span class="nf">_vhashtriple</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">triple</span><span class="p">,</span> <span class="n">target_term</span><span class="p">,</span> <span class="n">done</span><span class="p">):</span>
<span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">term</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">triple</span><span class="p">):</span>
<span class="k">if</span> <span class="ow">not</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">term</span><span class="p">,</span> <span class="n">BNode</span><span class="p">):</span>
<span class="k">yield</span> <span class="n">term</span>
<span class="k">elif</span> <span class="n">done</span> <span class="ow">or</span> <span class="p">(</span><span class="n">term</span> <span class="o">==</span> <span class="n">target_term</span><span class="p">):</span>
<span class="k">yield</span> <span class="n">i</span>
<span class="k">else</span><span class="p">:</span>
<span class="k">yield</span> <span class="bp">self</span><span class="o">.</span><span class="n">_canonicalize</span><span class="p">(</span><span class="n">term</span><span class="p">,</span> <span class="n">done</span><span class="o">=</span><span class="bp">True</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">_hetero_tuple_key</span><span class="p">(</span><span class="n">x</span><span class="p">):</span>
<span class="s">"Sort like Python 2 - by name of type, then by value. Expects tuples."</span>
<span class="k">return</span> <span class="nb">tuple</span><span class="p">((</span><span class="nb">type</span><span class="p">(</span><span class="n">a</span><span class="p">)</span><span class="o">.</span><span class="n">__name__</span><span class="p">,</span> <span class="n">a</span><span class="p">)</span> <span class="k">for</span> <span class="n">a</span> <span class="ow">in</span> <span class="n">x</span><span class="p">)</span>
<div class="viewcode-block" id="to_isomorphic"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.to_isomorphic">[docs]</a><span class="k">def</span> <span class="nf">to_isomorphic</span><span class="p">(</span><span class="n">graph</span><span class="p">):</span>
<span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">graph</span><span class="p">,</span> <span class="n">IsomorphicGraph</span><span class="p">):</span>
<span class="k">return</span> <span class="n">graph</span>
<span class="k">return</span> <span class="n">IsomorphicGraph</span><span class="p">(</span><span class="n">store</span><span class="o">=</span><span class="n">graph</span><span class="o">.</span><span class="n">store</span><span class="p">)</span>
</div>
<div class="viewcode-block" id="isomorphic"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.isomorphic">[docs]</a><span class="k">def</span> <span class="nf">isomorphic</span><span class="p">(</span><span class="n">graph1</span><span class="p">,</span> <span class="n">graph2</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Compare graph for equality. Uses an algorithm to compute unique hashes</span>
<span class="sd"> which takes bnodes into account.</span>
<span class="sd"> Examples::</span>
<span class="sd"> >>> g1 = Graph().parse(format='n3', data='''</span>
<span class="sd"> ... @prefix : <http://example.org/ns#> .</span>
<span class="sd"> ... <http://example.org> :rel <http://example.org/a> .</span>
<span class="sd"> ... <http://example.org> :rel <http://example.org/b> .</span>
<span class="sd"> ... <http://example.org> :rel [ :label "A bnode." ] .</span>
<span class="sd"> ... ''')</span>
<span class="sd"> >>> g2 = Graph().parse(format='n3', data='''</span>
<span class="sd"> ... @prefix ns: <http://example.org/ns#> .</span>
<span class="sd"> ... <http://example.org> ns:rel [ ns:label "A bnode." ] .</span>
<span class="sd"> ... <http://example.org> ns:rel <http://example.org/b>,</span>
<span class="sd"> ... <http://example.org/a> .</span>
<span class="sd"> ... ''')</span>
<span class="sd"> >>> isomorphic(g1, g2)</span>
<span class="sd"> True</span>
<span class="sd"> >>> g3 = Graph().parse(format='n3', data='''</span>
<span class="sd"> ... @prefix : <http://example.org/ns#> .</span>
<span class="sd"> ... <http://example.org> :rel <http://example.org/a> .</span>
<span class="sd"> ... <http://example.org> :rel <http://example.org/b> .</span>
<span class="sd"> ... <http://example.org> :rel <http://example.org/c> .</span>
<span class="sd"> ... ''')</span>
<span class="sd"> >>> isomorphic(g1, g3)</span>
<span class="sd"> False</span>
<span class="sd"> """</span>
<span class="k">return</span> <span class="n">_TripleCanonicalizer</span><span class="p">(</span><span class="n">graph1</span><span class="p">)</span><span class="o">.</span><span class="n">to_hash</span><span class="p">()</span> <span class="o">==</span> \
<span class="n">_TripleCanonicalizer</span><span class="p">(</span><span class="n">graph2</span><span class="p">)</span><span class="o">.</span><span class="n">to_hash</span><span class="p">()</span>
</div>
<div class="viewcode-block" id="to_canonical_graph"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.to_canonical_graph">[docs]</a><span class="k">def</span> <span class="nf">to_canonical_graph</span><span class="p">(</span><span class="n">g1</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Creates a canonical, read-only graph where all bnode id:s are based on</span>
<span class="sd"> deterministical MD5 checksums, correlated with the graph contents.</span>
<span class="sd"> """</span>
<span class="n">graph</span> <span class="o">=</span> <span class="n">Graph</span><span class="p">()</span>
<span class="n">graph</span> <span class="o">+=</span> <span class="n">_TripleCanonicalizer</span><span class="p">(</span><span class="n">g1</span><span class="p">,</span> <span class="n">_md5_hash</span><span class="p">)</span><span class="o">.</span><span class="n">canonical_triples</span><span class="p">()</span>
<span class="k">return</span> <span class="n">ReadOnlyGraphAggregate</span><span class="p">([</span><span class="n">graph</span><span class="p">])</span>
</div>
<div class="viewcode-block" id="graph_diff"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.graph_diff">[docs]</a><span class="k">def</span> <span class="nf">graph_diff</span><span class="p">(</span><span class="n">g1</span><span class="p">,</span> <span class="n">g2</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Returns three sets of triples: "in both", "in first" and "in second".</span>
<span class="sd"> """</span>
<span class="c"># bnodes have deterministic values in canonical graphs:</span>
<span class="n">cg1</span> <span class="o">=</span> <span class="n">to_canonical_graph</span><span class="p">(</span><span class="n">g1</span><span class="p">)</span>
<span class="n">cg2</span> <span class="o">=</span> <span class="n">to_canonical_graph</span><span class="p">(</span><span class="n">g2</span><span class="p">)</span>
<span class="n">in_both</span> <span class="o">=</span> <span class="n">cg1</span> <span class="o">*</span> <span class="n">cg2</span>
<span class="n">in_first</span> <span class="o">=</span> <span class="n">cg1</span> <span class="o">-</span> <span class="n">cg2</span>
<span class="n">in_second</span> <span class="o">=</span> <span class="n">cg2</span> <span class="o">-</span> <span class="n">cg1</span>
<span class="k">return</span> <span class="p">(</span><span class="n">in_both</span><span class="p">,</span> <span class="n">in_first</span><span class="p">,</span> <span class="n">in_second</span><span class="p">)</span>
</div>
<span class="k">def</span> <span class="nf">_md5_hash</span><span class="p">(</span><span class="n">t</span><span class="p">):</span>
<span class="n">h</span> <span class="o">=</span> <span class="n">md</span><span class="p">()</span>
<span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">t</span><span class="p">:</span>
<span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="nb">tuple</span><span class="p">):</span>
<span class="n">h</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">_md5_hash</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="s">'ascii'</span><span class="p">))</span>
<span class="k">else</span><span class="p">:</span>
<span class="n">h</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="nb">unicode</span><span class="p">(</span><span class="n">i</span><span class="p">)</span><span class="o">.</span><span class="n">encode</span><span class="p">(</span><span class="s">"utf8"</span><span class="p">))</span>
<span class="k">return</span> <span class="n">h</span><span class="o">.</span><span class="n">hexdigest</span><span class="p">()</span>
<span class="n">_MOCK_BNODE</span> <span class="o">=</span> <span class="n">BNode</span><span class="p">()</span>
<div class="viewcode-block" id="similar"><a class="viewcode-back" href="../../apidocs/rdflib.html#rdflib.compare.similar">[docs]</a><span class="k">def</span> <span class="nf">similar</span><span class="p">(</span><span class="n">g1</span><span class="p">,</span> <span class="n">g2</span><span class="p">):</span>
<span class="sd">"""</span>
<span class="sd"> Checks if the two graphs are "similar", by comparing sorted triples where</span>
<span class="sd"> all bnodes have been replaced by a singular mock bnode (the</span>
<span class="sd"> ``_MOCK_BNODE``).</span>
<span class="sd"> This is a much cheaper, but less reliable, alternative to the comparison</span>
<span class="sd"> algorithm in ``isomorphic``.</span>
<span class="sd"> """</span>
<span class="k">return</span> <span class="nb">all</span><span class="p">(</span><span class="n">t1</span> <span class="o">==</span> <span class="n">t2</span> <span class="k">for</span> <span class="p">(</span><span class="n">t1</span><span class="p">,</span> <span class="n">t2</span><span class="p">)</span> <span class="ow">in</span> <span class="n">_squashed_graphs_triples</span><span class="p">(</span><span class="n">g1</span><span class="p">,</span> <span class="n">g2</span><span class="p">))</span>
</div>
<span class="k">def</span> <span class="nf">_squashed_graphs_triples</span><span class="p">(</span><span class="n">g1</span><span class="p">,</span> <span class="n">g2</span><span class="p">):</span>
<span class="k">for</span> <span class="p">(</span><span class="n">t1</span><span class="p">,</span> <span class="n">t2</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">_squash_graph</span><span class="p">(</span><span class="n">g1</span><span class="p">)),</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">_squash_graph</span><span class="p">(</span><span class="n">g2</span><span class="p">))):</span>
<span class="k">yield</span> <span class="n">t1</span><span class="p">,</span> <span class="n">t2</span>
<span class="k">def</span> <span class="nf">_squash_graph</span><span class="p">(</span><span class="n">graph</span><span class="p">):</span>
<span class="k">return</span> <span class="p">(</span><span class="n">_squash_bnodes</span><span class="p">(</span><span class="n">triple</span><span class="p">)</span> <span class="k">for</span> <span class="n">triple</span> <span class="ow">in</span> <span class="n">graph</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">_squash_bnodes</span><span class="p">(</span><span class="n">triple</span><span class="p">):</span>
<span class="k">return</span> <span class="nb">tuple</span><span class="p">((</span><span class="nb">isinstance</span><span class="p">(</span><span class="n">t</span><span class="p">,</span> <span class="n">BNode</span><span class="p">)</span> <span class="ow">and</span> <span class="n">_MOCK_BNODE</span><span class="p">)</span> <span class="ow">or</span> <span class="n">t</span> <span class="k">for</span> <span class="n">t</span> <span class="ow">in</span> <span class="n">triple</span><span class="p">)</span>
</pre></div>
</div>
</div>
</div>
<div class="sphinxsidebar">
<div class="sphinxsidebarwrapper">
<p class="logo"><a href="../../index.html">
<img class="logo" src="../../_static/logo.svg" alt="Logo"/>
</a></p>
<div id="searchbox" style="display: none">
<h3>Quick search</h3>
<form class="search" action="../../search.html" method="get">
<input type="text" name="q" />
<input type="submit" value="Go" />
<input type="hidden" name="check_keywords" value="yes" />
<input type="hidden" name="area" value="default" />
</form>
<p class="searchtip" style="font-size: 90%">
Enter search terms or a module, class or function name.
</p>
</div>
<script type="text/javascript">$('#searchbox').show(0);</script>
</div>
</div>
<div class="clearer"></div>
</div>
<div class="related">
<h3>Navigation</h3>
<ul>
<li class="right" style="margin-right: 10px">
<a href="../../genindex.html" title="General Index"
>index</a></li>
<li class="right" >
<a href="../../py-modindex.html" title="Python Module Index"
>modules</a> |</li>
<li><a href="../../index.html">rdflib 4.1.2 documentation</a> »</li>
<li><a href="../index.html" >Module code</a> »</li>
</ul>
</div>
<div class="footer">
© Copyright 2009 - 2013, RDFLib Team.
Created using <a href="http://sphinx.pocoo.org/">Sphinx</a> 1.2.2.
<br />Theme based on <a href="http://readthedocs.org/">Read The Docs</a>
</div>
</body>
</html>
|