Debian Codegraph @

debian/control

raw
1 Source: libkdtree++
2 Section: libs
3 Maintainer: FreeCAD Packaging Team <[email protected]>
4 Uploaders: Tobias Frost <[email protected]>
5 Build-Depends:
6 debhelper-compat (= 13),
7 python3-all-dev,
8 python3-setuptools,
9 dh-sequence-python3,
10 swig,
11 cmake,
12 Homepage: https://github.com/nvmd/libkdtree
13 Standards-Version: 4.7.3
14 Vcs-Git: https://salsa.debian.org/debian/libkdtreepp.git
15 Vcs-Browser: https://salsa.debian.org/debian/libkdtreepp
16
17 Package: libkdtree++-dev
18 Section: libdevel
19 Architecture: all
20 Multi-Arch: foreign
21 Depends: ${misc:Depends}
22 Description: C++ template container implementation of kd-tree sorting
23 libkdtree++ is a C++ template container implementation of k-dimensional space
24 sorting, using a kd-tree. It:
25 .
26 - supports an unlimited number of dimensions (in theory)
27 - can store any data structure, provided the data structure provides
28 operator[0 - k-1] to access the individual dimensional
29 components (arrays, std::vector already do) and a std::less
30 implementation for the type of dimensional components
31 - has support for custom allocators
32 - implements iterators
33 - provides standard find as well as range queries
34 - has amortised O(lg n) time (O(n lg n) worst case) on most
35 operations (insert/erase/find optimised) and worst-case O(n) space
36 - provides a means to rebalance and thus optimise the tree
37 - exists in its own namespace
38 - uses STL coding style, basing a lot of the code on stl_tree.h
39 .
40 libkdtree++ only exists as a -dev package as it's only a bunch of C++ header
41 files. Therefore, no static or shared library is necessary, allowing for
42 ultimate flexibility.
43
44 Package: python3-kdtree
45 Section: python
46 Architecture: any
47 Provides:
48 ${python3:Provides}
49 Depends:
50 ${misc:Depends},
51 ${shlibs:Depends},
52 ${python3:Depends}
53 Description: container for kd-tree sorting for Python 3
54 A container implementing k-dimensional space sorting using a kd-tree. It:
55 .
56 - supports two- to six-dimensional spaces
57 - can store any data structure
58 - provides standard find as well as range queries
59 - has amortised O(lg n) time (O(n lg n) worst case) on most operations
60 (insert/erase/find optimised) and worst-case O(n) space
61 - provides means to rebalance and thus optimise the tree
62 .
63 This package contains the extension built for the Python 3 interpreter.