python-django-tree-queries 0.16.1-1 source package in Ubuntu
Changelog
python-django-tree-queries (0.16.1-1) unstable; urgency=low * New upstream version 0.16.1 * Refresh patches. -- Michael Fladischer <email address hidden> Sun, 03 Dec 2023 08:24:12 +0000
Upload details
- Uploaded by:
- Debian Python Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Team
- Architectures:
- all
- Section:
- misc
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-django-tree-queries_0.16.1-1.dsc | 2.1 KiB | e3275dd8a2740dd4051473d239d9d526d627d5b3e543759a0591ec4eee4b4be1 |
| python-django-tree-queries_0.16.1.orig.tar.gz | 20.7 KiB | 427daa646b9b6b4bbfd27ab3bb367c1433965a128e9c0870b1bb0822f0df883a |
| python-django-tree-queries_0.16.1-1.debian.tar.xz | 4.8 KiB | 49cc51b4fdc177f54a778f1c30fb84d16805407d2565f7add095e9e4630998f5 |
Available diffs
- diff from 0.15-2 to 0.16.1-1 (3.3 KiB)
No changes file available.
Binary packages built by this source
- python-django-tree-queries-doc: Adjacency-list trees for Django (Documentation)
Query Django model trees using adjacency lists and recursive common table
expressions. Supports PostgreSQL, sqlite3 and MariaDB and MySQL.
.
Features and limitations:
* Supports only integer and UUID primary keys (for now).
* Allows specifying ordering among siblings.
* Uses the correct definition of depth, where root nodes have a depth of
zero.
* The parent foreign key must be named "parent" at the moment.
* The fields added by the common table expression always are tree_depth,
tree_path and tree_ordering. The names cannot be changed. tree_depth is an
integer, tree_path an array of primary keys and tree_ordering an array of
values used for ordering nodes within their siblings.
* Besides adding the fields mentioned above the package only adds queryset
methods for ordering siblings and filtering ancestors and descendants.
* Little code, and relatively simple when compared to other tree management
solutions for Django. No redundant values so the only way to end up with
corrupt data is by introducing a loop in the tree structure (making it a
graph). The TreeNode abstract model class has some protection against this.
* Supports only trees with max. 50 levels on MySQL/MariaDB, since those
databases do not support arrays and require a maximum length for the
tree_path and tree_ordering upfront.
.
This package contains the documentation.
- python3-django-tree-queries: Adjacency-list trees for Django (Python3 version)
Query Django model trees using adjacency lists and recursive common table
expressions. Supports PostgreSQL, sqlite3 and MariaDB and MySQL.
.
Features and limitations:
* Supports only integer and UUID primary keys (for now).
* Allows specifying ordering among siblings.
* Uses the correct definition of depth, where root nodes have a depth of
zero.
* The parent foreign key must be named "parent" at the moment.
* The fields added by the common table expression always are tree_depth,
tree_path and tree_ordering. The names cannot be changed. tree_depth is an
integer, tree_path an array of primary keys and tree_ordering an array of
values used for ordering nodes within their siblings.
* Besides adding the fields mentioned above the package only adds queryset
methods for ordering siblings and filtering ancestors and descendants.
* Little code, and relatively simple when compared to other tree management
solutions for Django. No redundant values so the only way to end up with
corrupt data is by introducing a loop in the tree structure (making it a
graph). The TreeNode abstract model class has some protection against this.
* Supports only trees with max. 50 levels on MySQL/MariaDB, since those
databases do not support arrays and require a maximum length for the
tree_path and tree_ordering upfront.
.
This package contains the Python 3 version of the library.
