libkdtree++ 0.7.1+git20101123-6build4 source package in Ubuntu
Changelog
libkdtree++ (0.7.1+git20101123-6build4) noble; urgency=medium * No-change rebuild with Python 3.12 as supported version -- Graham Inggs <email address hidden> Tue, 31 Oct 2023 17:05:04 +0000
Upload details
- Uploaded by:
- Graham Inggs
- Uploaded to:
- Noble
- Original maintainer:
- Debian QA Group
- 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-6build4.debian.tar.xz | 11.9 KiB | cb2a746c9901919b7550db58571dec7c928ec1ac17fe7f40ce77243f5b90943d |
| libkdtree++_0.7.1+git20101123-6build4.dsc | 2.0 KiB | c5aeddcae6bb925c561984230036b81a2511f1d3e8cfa4bb32c373ddf9c6acc8 |
Available diffs
Binary packages built by this source
- libkdtree++-dev: C++ template container implementation of kd-tree sorting
libkdtree++ is a C++ template container implementation of k-dimensional space
sorting, using a kd-tree. It:
.
- supports an unlimited number of dimensions (in theory)
- can store any data structure, provided the data structure provides
operator[0 - k-1] to access the individual dimensional
components (arrays, std::vector already do) and a std::less
implementation for the type of dimensional components
- has support for custom allocators
- implements iterators
- 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 a means to rebalance and thus optimise the tree
- exists in its own namespace
- uses STL coding style, basing a lot of the code on stl_tree.h
.
libkdtree++ only exists as a -dev package as it's only a bunch of C++ header
files. Therefore, no static or shared library is necessary, allowing for
ultimate flexibility.
- 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-dbgsym: debug symbols for python3-kdtree
