Ubuntu
libkdtree++ package

libkdtree++ 0.7.1+git20101123-5 source package in Ubuntu

Changelog

libkdtree++ (0.7.1+git20101123-5) unstable; urgency=medium

  * QA upload.
  * Stop building the Python 2 packages. Closes: #936884.
  * Fix installation of Python 3 extensions. Closes: #942672.
  * Bump standards version.

 -- Matthias Klose <email address hidden>  Sat, 26 Oct 2019 18:03:05 +0200

Upload details

Uploaded by:
Debian QA Group
Uploaded to:
Sid
Original maintainer:
Debian QA Group
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libkdtree++_0.7.1+git20101123-5.dsc 2.0 KiB fa3bb712dc11b9c33fed695f4d6884f5d525d23b1f5c917e18d727cff08b02ed
libkdtree++_0.7.1+git20101123.orig.tar.xz 88.7 KiB d7d9859339ef129e43691f31b4573d389f3f6ec76c71c5d312361134b6cb56e9
libkdtree++_0.7.1+git20101123-5.debian.tar.xz 11.9 KiB 73e8eb8b4d68304daa0d0bf36f640f8af8e7342a3cc6746cf68e393ae6ecbc1a

No changes file available.

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-dbg: container for kd-tree sorting for Python 3 (debug extension)

 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 debug interpreter.