diff options
| author | Mike Bayer <mike_mp@zzzcomputing.com> | 2013-02-02 18:54:54 -0500 |
|---|---|---|
| committer | Mike Bayer <mike_mp@zzzcomputing.com> | 2013-02-02 18:54:54 -0500 |
| commit | d7e4a8529000ce2527861e13ed3f6e8660f35b8f (patch) | |
| tree | 03ca1fbe09b55106f7c34ae751dfb66de23dfcd4 /examples/elementtree | |
| parent | db756a59112e3fb84721cce6bf03f9e386f3e103 (diff) | |
| download | sqlalchemy-d7e4a8529000ce2527861e13ed3f6e8660f35b8f.tar.gz | |
whack more long lines in very old docstrings
Diffstat (limited to 'examples/elementtree')
| -rw-r--r-- | examples/elementtree/__init__.py | 27 |
1 files changed, 17 insertions, 10 deletions
diff --git a/examples/elementtree/__init__.py b/examples/elementtree/__init__.py index ee1e9e193..6462dd562 100644 --- a/examples/elementtree/__init__.py +++ b/examples/elementtree/__init__.py @@ -9,16 +9,23 @@ xpath-like strings is illustrated as well. In order of complexity: -* ``pickle.py`` - Quick and dirty, serialize the whole DOM into a BLOB column. While the example - is very brief, it has very limited functionality. -* ``adjacency_list.py`` - Each DOM node is stored in an individual table row, with attributes - represented in a separate table. The nodes are associated in a hierarchy using an adjacency list - structure. A query function is introduced which can search for nodes along any path with a given - structure of attributes, basically a (very narrow) subset of xpath. -* ``optimized_al.py`` - Uses the same strategy as ``adjacency_list.py``, but associates each - DOM row with its owning document row, so that a full document of DOM nodes can be - loaded using O(1) queries - the construction of the "hierarchy" is performed after - the load in a non-recursive fashion and is much more efficient. +* ``pickle.py`` - Quick and dirty, serialize the whole DOM into a BLOB + column. While the example is very brief, it has very limited + functionality. + +* ``adjacency_list.py`` - Each DOM node is stored in an individual + table row, with attributes represented in a separate table. The + nodes are associated in a hierarchy using an adjacency list + structure. A query function is introduced which can search for nodes + along any path with a given structure of attributes, basically a + (very narrow) subset of xpath. + +* ``optimized_al.py`` - Uses the same strategy as + ``adjacency_list.py``, but associates each DOM row with its owning + document row, so that a full document of DOM nodes can be loaded + using O(1) queries - the construction of the "hierarchy" is performed + after the load in a non-recursive fashion and is much more + efficient. E.g.:: |