1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
Source: libkdtree++
Section: libs
Priority: optional
Maintainer: Sebastian Ramacher <sramacher@debian.org>
Build-Depends:
debhelper (>= 9),
python-all-dev (>= 2.6.6-3~),
python-all-dbg,
python3-all-dev,
python3-all-dbg,
dh-python,
swig,
cmake
X-Python-Version: >= 2.6
X-Python3-Version: >= 3.0
Homepage: https://alioth.debian.org/projects/libkdtree/
Standards-Version: 3.9.6
Package: libkdtree++-dev
Section: libdevel
Architecture: all
Depends: ${misc:Depends}
Description: 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.
Package: python-kdtree
Section: python
Architecture: any
Provides:
${python:Provides}
Depends:
${misc:Depends},
${shlibs:Depends},
${python:Depends}
Description: 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.
Package: python-kdtree-dbg
Section: debug
Architecture: any
Priority: extra
Provides:
${python:Provides}
Depends:
${misc:Depends},
${shlibs:Depends},
${python:Depends},
python-kdtree (= ${binary:Version})
Description: 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.
Package: python3-kdtree
Section: python
Architecture: any
Provides:
${python3:Provides}
Depends:
${misc:Depends},
${shlibs:Depends},
${python3:Depends}
Description: 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.
Package: python3-kdtree-dbg
Section: debug
Architecture: any
Priority: extra
Provides:
${python3:Provides}
Depends:
${misc:Depends},
${shlibs:Depends},
${python3:Depends},
python3-kdtree (= ${binary:Version})
Description: 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.
|
