Ubuntu
neartree package

neartree 5.1.1+dfsg1-2.1 source package in Ubuntu

Changelog

neartree (5.1.1+dfsg1-2.1) unstable; urgency=medium

  * Non-maintainer upload.
  * Rename libraries for 64-bit time_t transition.  Closes: #1063167

 -- Benjamin Drung <email address hidden>  Wed, 28 Feb 2024 22:38:53 +0000

Upload details

Uploaded by:
Debian Science Team
Uploaded to:
Sid
Original maintainer:
Debian Science Team
Architectures:
any
Section:
libdevel
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
neartree_5.1.1+dfsg1-2.1.dsc 2.1 KiB 4426b81ada6d9a56610d79cd333c37c23aeadaf664aac0810d880cf0268dd5c8
neartree_5.1.1+dfsg1.orig.tar.gz 144.6 KiB cdf957505cbd42f7bbe8065ad12f3b2bb8765c887b3ce71e96700877ed3b83a9
neartree_5.1.1+dfsg1-2.1.debian.tar.xz 5.8 KiB 80c53bd06ef12fedc64e8afdea7f761d21ecba115681968c937a9979905b2441

Available diffs

No changes file available.

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