Mercurial > hg > WSGraph
comparison tests/doctest.txt @ 38:df2a719a9b6e
stubbing deletion of nodes + edges
| author | Jeff Hammel <jhammel@mozilla.com> |
|---|---|
| date | Mon, 24 Dec 2012 22:57:02 -0800 |
| parents | 5ea58a6ea820 |
| children | d1e9602145fa |
comparison
equal
deleted
inserted
replaced
| 37:f17a6577cc0d | 38:df2a719a9b6e |
|---|---|
| 60 >>> values['d'] = 'adding a new key' | 60 >>> values['d'] = 'adding a new key' |
| 61 >>> graph['C']['c'] | 61 >>> graph['C']['c'] |
| 62 'easy as 1..2..3..' | 62 'easy as 1..2..3..' |
| 63 >>> 'd' in graph['C'] | 63 >>> 'd' in graph['C'] |
| 64 False | 64 False |
| 65 | |
| 66 Delete an edge: | |
| 67 | |
| 68 >>> graph = MemoryCache() | |
| 69 >>> graph[('a', 'b')] = {'key': 'value'} | |
| 70 >>> graph.edges() | |
| 71 [('a', 'b')] | |
| 72 |
