Ubuntu
libkdtree++ package

libkdtree++ 0.7.1+git20101123-3build1 source package in Ubuntu

Changelog

libkdtree++ (0.7.1+git20101123-3build1) trusty; urgency=medium

  * No-change rebuild to drop Python 3.3 support.
 -- Matthias Klose <email address hidden>   Sun, 23 Mar 2014 15:29:01 +0000

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Trusty
Original maintainer:
Sebastian Ramacher
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe libs

Downloads

File Size SHA-256 Checksum
libkdtree++_0.7.1+git20101123.orig.tar.xz 88.7 KiB d7d9859339ef129e43691f31b4573d389f3f6ec76c71c5d312361134b6cb56e9
libkdtree++_0.7.1+git20101123-3build1.debian.tar.gz 13.1 KiB 651e07d4324da0e47ca27adf5cce13aa5e5b46658f31a4ef7a7f2501d8859e1e
libkdtree++_0.7.1+git20101123-3build1.dsc 1.5 KiB ed8230a485f36a0170674894b062317cdccda2b7c8be0803da162bf2268364e2

View changes file

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.

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: container for kd-tree sorting for Python (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 debug interpreter.

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.