neartree 5.1.1+dfsg1-2.1build1 source package in Ubuntu
Changelog
neartree (5.1.1+dfsg1-2.1build1) noble; urgency=medium * No-change rebuild for CVE-2024-3094 -- Steve Langasek <email address hidden> Sun, 31 Mar 2024 20:13:49 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Noble
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- libdevel
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Oracular | release | universe | libdevel | |
Noble | release | universe | libdevel |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
neartree_5.1.1+dfsg1.orig.tar.gz | 144.6 KiB | cdf957505cbd42f7bbe8065ad12f3b2bb8765c887b3ce71e96700877ed3b83a9 |
neartree_5.1.1+dfsg1-2.1build1.debian.tar.xz | 5.9 KiB | 9f8e4e0625e28ffbf61f7936185d1c4079f5ebff197e0c9c17067d84db8d4147 |
neartree_5.1.1+dfsg1-2.1build1.dsc | 2.2 KiB | 3f0c5b7b6d25a8c408845c84969ddc008789e190eb9903fee55d3bbba27eb48a |
Available diffs
Binary packages built by this source
- libcneartree-dev: 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.
- libcneartree7t64: 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.
- libcneartree7t64-dbgsym: debug symbols for libcneartree7t64