Source: neartree Maintainer: Debian Science Maintainers Uploaders: Teemu Ikonen Section: libdevel Build-Depends: dpkg-dev (>= 1.22.5), debhelper-compat (= 14), libtool-bin, libcvector-dev Standards-Version: 4.7.4 Vcs-Browser: https://salsa.debian.org/science-team/neartree Vcs-Git: https://salsa.debian.org/science-team/neartree.git Homepage: https://neartree.sourceforge.net/ Package: libcneartree-dev Architecture: any Multi-Arch: same Depends: libcneartree7t64 (= ${binary:Version}), Conflicts: libcneartree3-dev Description: Library and headers for solving the Nearest Neighbor Problem Neartree is an API and a library for finding nearest neighbors among points in spaces of arbitrary dimensions. This package provides a C++ template, TNear.h, and C library and header files for compiling programs using Neartree. . The library uses the Nearest Neighbor algorithm after Kalantari and McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp. 631-634,1983) modified to use recursion instead of a double-linked tree and simplified so that it does less checking for things like is the distance to the right less than the distance to the left; it was found that these checks make little to no difference. Package: libcneartree7t64 Provides: ${t64:Provides} Replaces: libcneartree7 Breaks: libcneartree7 (<< ${source:Version}) Architecture: any Multi-Arch: same Section: libs Description: Library for solving the Nearest Neighbor Problem Neartree is an API and a library for finding nearest neighbors among points in spaces of arbitrary dimensions. . The library uses the Nearest Neighbor algorithm after Kalantari and McDonald, (IEEE Transactions on Software Engineering, v. SE-9, pp. 631-634,1983) modified to use recursion instead of a double-linked tree and simplified so that it does less checking for things like is the distance to the right less than the distance to the left; it was found that these checks make little to no difference.