summaryrefslogtreecommitdiff
path: root/docs/narr/muchadoabouttraversal.rst
diff options
context:
space:
mode:
authorChris McDonough <chrism@plope.com>2011-01-27 22:32:47 -0500
committerChris McDonough <chrism@plope.com>2011-01-27 22:32:47 -0500
commit45c45f3ba6b688c988957056cb2c49883329dfe5 (patch)
treebc1d1cd012cb6cbc3cf6d03bc9b66aac9e945758 /docs/narr/muchadoabouttraversal.rst
parentedceab4f51d334c3c159a69ae9dd20c3a36be500 (diff)
downloadpyramid-45c45f3ba6b688c988957056cb2c49883329dfe5.tar.gz
pyramid-45c45f3ba6b688c988957056cb2c49883329dfe5.tar.bz2
pyramid-45c45f3ba6b688c988957056cb2c49883329dfe5.zip
spell out 20
Diffstat (limited to 'docs/narr/muchadoabouttraversal.rst')
-rw-r--r--docs/narr/muchadoabouttraversal.rst16
1 files changed, 8 insertions, 8 deletions
diff --git a/docs/narr/muchadoabouttraversal.rst b/docs/narr/muchadoabouttraversal.rst
index c57e58cd0..2dbfba779 100644
--- a/docs/narr/muchadoabouttraversal.rst
+++ b/docs/narr/muchadoabouttraversal.rst
@@ -269,14 +269,14 @@ It might be possible, but it certainly won't be easy. The matching
patterns are going to become complex quickly as you try to handle all
of the edge cases.
-With traversal, however, it's straightforward. 20 layers of nesting would be
-no problem. :app:`Pyramid` will happily call ``__getitem__`` as many times
-as it needs to, until it runs out of path segments or until a resource raises
-a :exc:`KeyError`. Each resource only needs to know how to fetch its
-immediate children, the traversal algorithm takes care of the rest. Also,
-since the structure of the resource tree can live in the database and not in
-the code, it's simple to let users modify the tree at runtime to set up their
-own personalized "directory" structures.
+With traversal, however, it's straightforward. Twenty layers of nesting
+would be no problem. :app:`Pyramid` will happily call ``__getitem__`` as
+many times as it needs to, until it runs out of path segments or until a
+resource raises a :exc:`KeyError`. Each resource only needs to know how to
+fetch its immediate children, the traversal algorithm takes care of the rest.
+Also, since the structure of the resource tree can live in the database and
+not in the code, it's simple to let users modify the tree at runtime to set
+up their own personalized "directory" structures.
Another use case in which traversal shines is when there is a need to support
a context-dependent security policy. One example might be a document