python-django-treebeard 4.7.1-1 source package in Ubuntu
Changelog
python-django-treebeard (4.7.1-1) unstable; urgency=low * New upstream version 4.7.1 * Refresh patches. * Use dh-sequence-python3. * Update year in d/copyright. -- Michael Fladischer <email address hidden> Fri, 23 Feb 2024 15:03:48 +0000
Upload details
- Uploaded by:
- Debian Python Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Team
- Architectures:
- all
- Section:
- python
- Urgency:
- Low Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | python | |
Noble | release | universe | python |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
python-django-treebeard_4.7.1-1.dsc | 2.1 KiB | 276188f01ee650f237ca5b766b55500f888f0c3606203f51a06873b03f18ae74 |
python-django-treebeard_4.7.1.orig.tar.gz | 287.2 KiB | 846e462904b437155f76e04907ba4e48480716855f88b898df4122bdcfbd6e98 |
python-django-treebeard_4.7.1-1.debian.tar.xz | 6.7 KiB | 74b9ec3d9169cc5cbd5bacd4b713b9f0fa2a893f3c2903216545fa0bcd4a7137 |
Available diffs
- diff from 4.7-1 to 4.7.1-1 (3.3 KiB)
No changes file available.
Binary packages built by this source
- python-django-treebeard-doc: Efficient implementations of tree data structures for Django (documentation)
Django Treebeard is a library that implements efficient data structures for
storing hierarchical data in a database using the Django web development
framework.
.
It currently includes 3 different tree implementations: adjacency list,
materialized path and nested sets. Each one has it's own strengths and
weaknesses but share the same API, so it’s easy to switch between them.
.
This package contains the documentation in searchable HTML format.
- python3-django-treebeard: Efficient implementations of tree data structures for Django (Python3 version)
Django Treebeard is a library that implements efficient data structures for
storing hierarchical data in a database using the Django web development
framework.
.
It currently includes 3 different tree implementations: adjacency list,
materialized path and nested sets. Each one has it's own strengths and
weaknesses but share the same API, so it’s easy to switch between them.
.
This package contains the Python 3 version of the library.