/usr/share/pyshared/guppy/doc/sets.html is in python-guppy 0.1.9-2ubuntu4.
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 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0//EN"
"http://www.w3.org/TR/REC-html40/strict.dtd">
<html lang=en>
<head>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8'>
<title></title></head>
<body>
<div><a name='sets.module_sets'>
<h1>.tgt.sets.module_sets</h1></a>
<dl>
<dt>
<h2>Name</h2></dt>
<dd>
<h2>module_sets</h2></dd>
<dt>
<h2>Synopsis</h2></dt>
<dd>
<dl>
<dt><strong><big>Methods</big></strong></dt>
<dd><big><a href='#sets.module_sets.mutnodeset'>mutnodeset</a></big>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.MutNodeSet'>MutNodeSet</a></dd>
<dd><big><a href='#sets.module_sets.immnodeset'>immnodeset</a></big>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dd></dl></dd>
<dt>
<h2>Methods</h2></dt>
<dd><a name='sets.module_sets.mutnodeset'><strong><big>mutnodeset</big></strong></a>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.MutNodeSet'>MutNodeSet</a>
<dl>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Returns </strong>
a new mutable nodeset with specified elements.
</dt></dl></dd></dl></dd>
<dd><a name='sets.module_sets.immnodeset'><strong><big>immnodeset</big></strong></a>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>
<dl>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Returns </strong>
a new immutable nodeset with specified elements.
</dt></dl></dd></dl></dd></dl><a name='kindnames.CommonSet'>
<h1>.tgt.kindnames.CommonSet</h1></a>
<dl>
<dt>
<h2>Name</h2></dt>
<dd>
<h2>CommonSet</h2></dd>
<dt>
<h2>Synopsis</h2></dt>
<dd>
<dl>
<dt><strong><big>Conditions</big></strong></dt>
<dd><a href='#sets.CommonSet.cond:contains'><strong><big>cond:contains</big></strong></a>(x, y)</dd>
<dd><a href='#sets.CommonSet.cond:empty'><strong><big>cond:empty</big></strong></a>(x)</dd>
<dd><a href='#sets.CommonSet.cond:equalset'><strong><big>cond:equalset</big></strong></a>(x, y)</dd>
<dd><a href='#sets.CommonSet.cond:istrue'><strong><big>cond:istrue</big></strong></a>(x)</dd>
<dd><a href='#sets.CommonSet.cond:subset'><strong><big>cond:subset</big></strong></a>(x, y)</dd></dl></dd>
<dt>
<h2>Conditions</h2></dt>
<dt><a name='sets.CommonSet.cond:contains'><strong><big>cond:contains</big></strong></a>(x, y)</dt>
<dd> True if the set x contains the element y.</dd>
<dd>
<dl>
<dt><strong>Python code: </strong><code>y in x</code></dt></dl></dd>
<dt><a name='sets.CommonSet.cond:empty'><strong><big>cond:empty</big></strong></a>(x)</dt>
<dd> True if the set x is empty.</dd>
<dd>
<dl>
<dt><strong>Python code: </strong><code>not x</code></dt></dl></dd>
<dt><a name='sets.CommonSet.cond:equalset'><strong><big>cond:equalset</big></strong></a>(x, y)</dt>
<dd> True if x contains the same elements as y.</dd>
<dd>
<dl>
<dt><strong>Python code: </strong><code>immnodeset(x) == immnodeset(y)</code></dt>
<dd>
<dl>
<dt><strong>in context: </strong><code>from guppy.sets import immnodeset</code></dt></dl></dd></dl></dd>
<dt><a name='sets.CommonSet.cond:istrue'><strong><big>cond:istrue</big></strong></a>(x)</dt>
<dd> True if the argument is true in the Python sense.</dd>
<dd>
<dl>
<dt><strong>Python code: </strong><code>bool(x)</code></dt></dl></dd>
<dt><a name='sets.CommonSet.cond:subset'><strong><big>cond:subset</big></strong></a>(x, y)</dt>
<dd> True if x represents a non-strict subset of y:</dd>
<dd> all elements in x are also in y.</dd>
<dd>
<dl>
<dt><strong>Python code: </strong><code>immnodeset(x) <= immnodeset(y)</code></dt>
<dd>
<dl>
<dt><strong>in context: </strong><code>from guppy.sets import immnodeset</code></dt></dl></dd></dl></dd></dl><a name='kindnames.NodeSet'>
<h1>.tgt.kindnames.NodeSet</h1></a>
<dl>
<dt>
<h2>Name</h2></dt>
<dd>
<h2>NodeSet</h2></dd>
<dt>
<h2>Synopsis</h2></dt>
<dd>
<dl>
<dt>
<h3>For any object <var>x</var> of kind <a href='#kindnames.NodeSet'>NodeSet</a>:</h3></dt>
<dt><strong><big>Operators</big></strong></dt>
<dd><a href='#sets.NodeSet.op:-38-'># </a>x <big><strong>&</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dd>
<dd><a href='#sets.NodeSet.op:-124-'># </a>x <big><strong>|</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dd>
<dd><a href='#sets.NodeSet.op:-94-'># </a>x <big><strong>^</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dd>
<dd><a href='#sets.NodeSet.op:--'># </a>x <big><strong>-</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dd>
<dd><a href='#sets.NodeSet.iop:-38--61-'># </a>x <big><strong>&=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a></dd>
<dd><a href='#sets.NodeSet.iop:-124--61-'># </a>x <big><strong>|=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a></dd>
<dd><a href='#sets.NodeSet.iop:-94--61-'># </a>x <big><strong>^=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a></dd>
<dd><a href='#sets.NodeSet.iop:---61-'># </a>x <big><strong>-=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a></dd>
<dd><a href='#sets.NodeSet.rop:in'># </a><var>y</var><code>:</code> <em>Any+</em><big> <strong>in</strong> </big>x <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-61--61-'># </a>x <big><strong>==</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-33--61-'># </a>x <big><strong>!=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-60--61-'># </a>x <big><strong><=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-60-'># </a>x <big><strong><</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-62--61-'># </a>x <big><strong>>=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.op:-62-'># </a>x <big><strong>></strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em></dd>
<dd><a href='#sets.NodeSet.fop:iter'><big><strong>iter</strong></big></a>(x) <strong>-></strong> <em>iterator</em></dd>
<dd><a href='#sets.NodeSet.fop:len'><big><strong>len</strong></big></a>(x) <strong>-></strong> <em>int</em></dd></dl></dd>
<dt>
<h2>Description</h2></dt>
<dd>
A nodeset is a set of objects with equality based on heap address.
</dd>
<dt>
<h2>Operators</h2></dt>
<dd><a name='sets.NodeSet.op:-38-'></a>x <big><strong>&</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>
<dl>
<dd>
Intersection: the set of objects that are in both x and y.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(<em>returned value</em>, x)</dt>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(<em>returned value</em>, y)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-124-'></a>x <big><strong>|</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>
<dl>
<dd>
Union: the set of objects that are in either x or y.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(x, <em>returned value</em>)</dt>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(y, <em>returned value</em>)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-94-'></a>x <big><strong>^</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>
<dl>
<dd>
Symmetric set difference: the set of objects that are in exactly one of x and y.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:--'></a>x <big><strong>-</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>
<dl>
<dd>
Set difference: the set of objects that are in x but not in y.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.iop:-38--61-'></a>x <big><strong>&=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a>
<dl>
<dd>
In-place intersection.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(<em>returned value</em>, x)</dt>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(<em>returned value</em>, y)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.iop:-124--61-'></a>x <big><strong>|=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a>
<dl>
<dd>
In-place union.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(x, <em>returned value</em>)</dt>
<dt><a href='#sets.CommonSet.cond:subset'>CommonSet.cond:subset</a>(y, <em>returned value</em>)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.iop:-94--61-'></a>x <big><strong>^=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a>
<dl>
<dd>
In-place symmetric set difference.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.iop:---61-'></a>x <big><strong>-=</strong></big> <var>y</var><code>:</code> <em>iterable+</em> <strong>-></strong> <a href='#kindnames.NodeSet'>NodeSet</a>
<dl>
<dd>
In-place set difference.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.rop:in'></a><var>y</var><code>:</code> <em>Any+</em><big> <strong>in</strong> </big>x <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Inclusion test.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-61--61-'></a>x <big><strong>==</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Equal:
x and y contain the same elements.
</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-33--61-'></a>x <big><strong>!=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Not equal:
x and y do not contain the same elements.
</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-60--61-'></a>x <big><strong><=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Subset, non-strict:
all elements in x are also in y.</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-60-'></a>x <big><strong><</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Subset, strict:
all elements in x are also in y,
and y contains some element not in x.
</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-62--61-'></a>x <big><strong>>=</strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Superset, non-strict:
all elements in y are also in x.
</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.op:-62-'></a>x <big><strong>></strong></big> <var>y</var><code>:</code> <em>NodeSet+</em> <strong>-></strong> <em>boolean</em>
<dl>
<dd>
Superset, strict:
all elements in y are also in x,
and x contains some element not in y.
</dd>
<dd>
<dl></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.fop:iter'><big><strong>iter</strong></big></a>(x) <strong>-></strong> <em>iterator</em>
<dl>
<dd> Iteration</dd>
<dd>
<dl>
<dt><strong>Returns </strong>an iterator yielding the elements of x.</dt>
<dd>(The order is implementation dependent.)</dd></dl></dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:equalset'>CommonSet.cond:equalset</a>(<em>returned value</em>, x)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='sets.NodeSet.fop:len'><big><strong>len</strong></big></a>(x) <strong>-></strong> <em>int</em>
<dl>
<dd> Length</dd>
<dd>
<dl>
<dt><strong>Returns </strong>
the number of elements in x.
</dt></dl></dd></dl></dd></dl><a name='kindnames.MutNodeSet'>
<h1>.tgt.kindnames.MutNodeSet</h1></a>
<dl>
<dt>
<h2>Name</h2></dt>
<dd>
<h2>MutNodeSet</h2></dd>
<dt>
<h2>Synopsis</h2></dt>
<dd>
<dl>
<dt><strong><big><a href='#sets.MutNodeSet.-60-1-62-'>Subkind of</a><code>:</code> <a href='#kindnames.NodeSet'>NodeSet</a></big></strong></dt>
<dt><big><strong>Constructor</strong></big></dt>
<dd>
<dl>
<dt><a href='#sets.module_sets'>module_sets</a><big><code>.</code><a href='#sets.module_sets.mutnodeset'>mutnodeset</a></big>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.MutNodeSet'>MutNodeSet</a></dt></dl></dd>
<dt>
<h3>For any object <var>S</var> of kind <a href='#kindnames.MutNodeSet'>MutNodeSet</a>:</h3></dt>
<dt><strong><big>Methods</big></strong></dt>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.add'>add</a></big>(<var>e</var><code>:</code> <em>Any+</em>)</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.append'>append</a></big>(<var>e</var><code>:</code> <em>Any+</em>)</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.clear'>clear</a></big>()</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.discard'>discard</a></big>(<var>e</var><code>:</code> <em>Any+</em>)</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.pop'>pop</a></big>()</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.remove'>remove</a></big>(<var>e</var><code>:</code> <em>Any+</em>)</dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.tas'>tas</a></big>(<var>e</var><code>:</code> <em>Any+</em>) <strong>-></strong> <em>boolean</em></dd>
<dd>S<big><code>.</code><a href='#kindnames.MutNodeSet.tac'>tac</a></big>(<var>e</var><code>:</code> <em>Any+</em>) <strong>-></strong> <em>boolean</em></dd></dl></dd>
<dt>
<h2>Description</h2></dt>
<dd> A mutable nodeset is a nodeset object that can be updated in place. </dd>
<dt>
<h2><a name='sets.MutNodeSet.-60-1-62-'>Subkind of</a><code>:</code> <a href='#kindnames.NodeSet'>NodeSet</a></h2></dt>
<dd> All operations from the NodeSet kind are inherited.</dd>
<dd>
The in-place operators (&=, |= etc) update the target set in place
and return the same object.</dd>
<dd>
It is unspecified what happens when trying to update a mutable nodeset
for which an iterator object (from the iter() function) is active.
</dd>
<dt>
<h2>Methods</h2></dt>
<dd><a name='kindnames.MutNodeSet.add'>S<code>.</code><strong><big>add</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>)
<dl>
<dd> Add e to S; no effect if e was already in S.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt>
<dt>not <a href='#sets.CommonSet.cond:empty'>CommonSet.cond:empty</a>(S)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.append'>S<code>.</code><strong><big>append</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>)
<dl>
<dd> Add e to S, or raise ValueError if e was already in S.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Precondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt></dl></dd></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt>
<dt>not <a href='#sets.CommonSet.cond:empty'>CommonSet.cond:empty</a>(S)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.clear'>S<code>.</code><strong><big>clear</big></strong></a>()
<dl>
<dd> Remove all elements from S, and compact its storage.</dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:empty'>CommonSet.cond:empty</a>(S)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.discard'>S<code>.</code><strong><big>discard</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>)
<dl>
<dd> Remove e from S; no effect if e was not in S.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.pop'>S<code>.</code><strong><big>pop</big></strong></a>()
<dl>
<dd> Remove and return some object from S, or raise ValueError if S was empty.</dd>
<dd>
<dl>
<dt><strong>Precondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:empty'>CommonSet.cond:empty</a>(S)</dt></dl></dd></dl></dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, <em>returned value</em>)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.remove'>S<code>.</code><strong><big>remove</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>)
<dl>
<dd> Remove e from S, or raise ValueError if e was not in S.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Precondition</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt></dl></dd></dl></dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.tas'>S<code>.</code><strong><big>tas</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>) <strong>-></strong> <em>boolean</em>
<dl>
<dd> Test and Set.</dd>
<dd> If e is in S return True,</dd>
<dd> else add e to S and return False.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postconditions</strong></dt>
<dd>
<dl>
<dt><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt>
<dt>not <a href='#sets.CommonSet.cond:empty'>CommonSet.cond:empty</a>(S)</dt></dl></dd></dl></dd>
<dd>
<dl>
<dt><strong>Equation</strong></dt>
<dd>
<dl>
<dt><strong><sup>pre:</sup></strong><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)<big> == </big><strong><sup>post:</sup></strong><a href='#sets.CommonSet.cond:istrue'>CommonSet.cond:istrue</a>(<em>returned value</em>)</dt></dl></dd></dl></dd></dl></dd>
<dd><a name='kindnames.MutNodeSet.tac'>S<code>.</code><strong><big>tac</big></strong></a>(<var>e</var><code>:</code> <em>Any+</em>) <strong>-></strong> <em>boolean</em>
<dl>
<dd> Test and Clear.</dd>
<dd> If e is in S, remove e from S and return True,</dd>
<dd> else return False.</dd>
<dd>
<dl></dl></dd>
<dd>
<dl>
<dt><strong>Postcondition</strong></dt>
<dd>
<dl>
<dt>not <a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)</dt></dl></dd></dl></dd>
<dd>
<dl>
<dt><strong>Equation</strong></dt>
<dd>
<dl>
<dt><strong><sup>pre:</sup></strong><a href='#sets.CommonSet.cond:contains'>CommonSet.cond:contains</a>(S, e)<big> == </big><strong><sup>post:</sup></strong><a href='#sets.CommonSet.cond:istrue'>CommonSet.cond:istrue</a>(<em>returned value</em>)</dt></dl></dd></dl></dd></dl></dd></dl><a name='kindnames.ImmNodeSet'>
<h1>.tgt.kindnames.ImmNodeSet</h1></a>
<dl>
<dt>
<h2>Name</h2></dt>
<dd>
<h2>ImmNodeSet</h2></dd>
<dt>
<h2>Synopsis</h2></dt>
<dd>
<dl>
<dt><strong><big><a href='#sets.ImmNodeSet.-60-1-62-'>Subkind of</a><code>:</code> <a href='#kindnames.NodeSet'>NodeSet</a></big></strong></dt>
<dt><big><strong>Constructor</strong></big></dt>
<dd>
<dl>
<dt><a href='#sets.module_sets'>module_sets</a><big><code>.</code><a href='#sets.module_sets.immnodeset'>immnodeset</a></big>( [<var>elements</var><code>:</code> <em>iterable+</em>]) <strong>-></strong> <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a></dt></dl></dd>
<dt>
<h3>For any object <var>x</var> of kind <a href='#kindnames.ImmNodeSet'>ImmNodeSet</a>:</h3></dt>
<dt><strong><big>Operator</big></strong></dt>
<dd><a href='#sets.ImmNodeSet.fop:hash'><big><strong>hash</strong></big></a>(x) <strong>-></strong> <em>int</em></dd></dl></dd>
<dt>
<h2>Description</h2></dt>
<dd>
An immutable nodeset is a nodeset object that is guaranteed to always
contain the same elements after it has been created.
</dd>
<dt>
<h2><a name='sets.ImmNodeSet.-60-1-62-'>Subkind of</a><code>:</code> <a href='#kindnames.NodeSet'>NodeSet</a></h2></dt>
<dd> An immutable nodeset inherits the operations defined for NodeSet.</dd>
<dd>
The in-place operations (&=, |= etc) will not really update the
target set in place, but will return an updated copy. It is yet formally
unspecified whether this returned copy is mutable or immutable.
</dd>
<dt>
<h2>Operator</h2></dt>
<dd><a name='sets.ImmNodeSet.fop:hash'><big><strong>hash</strong></big></a>(x) <strong>-></strong> <em>int</em>
<dl>
<dd> Hashing</dd>
<dd>
<dl>
<dt><strong>Returns </strong>
a hash value based on the addresses of the elements.
</dt></dl></dd></dl></dd></dl>
<hr>Generated by <a href="http://guppy-pe.sourceforge.net/gsl.html">GSL-HTML 0.1.5</a> on Tue Jun 23 16:15:54 2009</div></body></html>
|