libkdtree++ 0.7.1+git20101123-4build2 source package in Ubuntu
Changelog
libkdtree++ (0.7.1+git20101123-4build2) wily; urgency=medium * No-change rebuild for python3.5 transition -- Steve Langasek <email address hidden> Wed, 22 Jul 2015 18:59:11 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Wily
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any all
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| libkdtree++_0.7.1+git20101123.orig.tar.xz | 88.7 KiB | d7d9859339ef129e43691f31b4573d389f3f6ec76c71c5d312361134b6cb56e9 |
| libkdtree++_0.7.1+git20101123-4build2.debian.tar.xz | 12.1 KiB | b0a25c38b7a0a35ddd591523c2ac55db58961a3300b9d6fd33252c19b2addb69 |
| libkdtree++_0.7.1+git20101123-4build2.dsc | 2.2 KiB | de6720303b2a486eae7275aab653edb67086ddf4edd0982cbcb3144e1fc74d43 |
Available diffs
Binary packages built by this source
- libkdtree++-dev: No summary available for libkdtree++-dev in ubuntu wily.
No description available for libkdtree++-dev in ubuntu wily.
- python-kdtree: container for kd-tree sorting for Python
A container implementing k-dimensional space sorting using a kd-tree. It:
.
- supports two- to six-dimensional spaces
- can store any data structure
- provides standard find as well as range queries
- has amortised O(lg n) time (O(n lg n) worst case) on most operations
(insert/erase/find optimised) and worst-case O(n) space
- provides means to rebalance and thus optimise the tree
.
This package contains the extension built for the Python interpreter.
- python-kdtree-dbg: No summary available for python-kdtree-dbg in ubuntu wily.
No description available for python-kdtree-dbg in ubuntu wily.
- python-kdtree-dbgsym: No summary available for python-kdtree-dbgsym in ubuntu wily.
No description available for python-
kdtree- dbgsym in ubuntu wily.
- python3-kdtree: container for kd-tree sorting for Python 3
A container implementing k-dimensional space sorting using a kd-tree. It:
.
- supports two- to six-dimensional spaces
- can store any data structure
- provides standard find as well as range queries
- has amortised O(lg n) time (O(n lg n) worst case) on most operations
(insert/erase/find optimised) and worst-case O(n) space
- provides means to rebalance and thus optimise the tree
.
This package contains the extension built for the Python 3 interpreter.
- python3-kdtree-dbg: No summary available for python3-kdtree-dbg in ubuntu wily.
No description available for python3-kdtree-dbg in ubuntu wily.
- python3-kdtree-dbgsym: No summary available for python3-kdtree-dbgsym in ubuntu wily.
No description available for python3-
kdtree- dbgsym in ubuntu wily.
