Ubuntu
neartree package

neartree 5.1.1+dfsg1-2 source package in Ubuntu

Changelog

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

  * Team upload.
  * Point watch file to Github
  * Standards-Version: 4.6.2 (routine-update)
  * debhelper-compat 13 (routine-update)
  * Add salsa-ci file (routine-update)
  * Rules-Requires-Root: no (routine-update)
  * Use secure URI in Homepage field.
  * Set upstream metadata fields: Bug-Database, Bug-Submit, Repository-Browse.
  * Declare *.la files as not-installed

 -- Andreas Tille <email address hidden>  Thu, 19 Jan 2023 12:36:22 +0100

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
Mantic release universe libdevel
Lunar release universe libdevel

Downloads

File Size SHA-256 Checksum
neartree_5.1.1+dfsg1-2.dsc 2.0 KiB 904d21608d4265dde095188a43aa9230b798dbcdcc59b781263f6682de044e03
neartree_5.1.1+dfsg1.orig.tar.gz 144.6 KiB cdf957505cbd42f7bbe8065ad12f3b2bb8765c887b3ce71e96700877ed3b83a9
neartree_5.1.1+dfsg1-2.debian.tar.xz 5.6 KiB 9b65fa9b6625930a6e8a1e575a2814e9bc855df366cd270ab1c4b341fa9eced3

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.

libcneartree7: 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.

libcneartree7-dbgsym: No summary available for libcneartree7-dbgsym in ubuntu noble.

No description available for libcneartree7-dbgsym in ubuntu noble.