diff options
Diffstat (limited to 'examples/nested_sets')
| -rw-r--r-- | examples/nested_sets/__init__.py | 2 | ||||
| -rw-r--r-- | examples/nested_sets/nested_sets.py | 4 |
2 files changed, 4 insertions, 2 deletions
diff --git a/examples/nested_sets/__init__.py b/examples/nested_sets/__init__.py index 1a97b9aef..3e73bb13e 100644 --- a/examples/nested_sets/__init__.py +++ b/examples/nested_sets/__init__.py @@ -1,4 +1,6 @@ """ Illustrates a rudimentary way to implement the "nested sets" pattern for hierarchical data using the SQLAlchemy ORM. +.. autosource:: + """
\ No newline at end of file diff --git a/examples/nested_sets/nested_sets.py b/examples/nested_sets/nested_sets.py index 8225a09f2..c64b15b61 100644 --- a/examples/nested_sets/nested_sets.py +++ b/examples/nested_sets/nested_sets.py @@ -88,13 +88,13 @@ session.commit() print(session.query(Employee).all()) -# 1. Find an employee and all his/her supervisors, no matter how deep the tree. +# 1. Find an employee and all their supervisors, no matter how deep the tree. ealias = aliased(Employee) print(session.query(Employee).\ filter(ealias.left.between(Employee.left, Employee.right)).\ filter(ealias.emp == 'Eddie').all()) -#2. Find the employee and all his/her subordinates. +#2. Find the employee and all their subordinates. # (This query has a nice symmetry with the first query.) print(session.query(Employee).\ filter(Employee.left.between(ealias.left, ealias.right)).\ |