neartree 3.0.1-1 source package in Ubuntu
Changelog
neartree (3.0.1-1) unstable; urgency=low
* New upstream version.
* Update binary package names to the new soname (5).
* control:
- Drop the soname version from the development package name
- Conflict with the old development package libcneartree3-dev
- Update to standards-version 3.9.1
- Update descriptions
* Use Debian source package format '3.0 (quilt)'.
* Add a DEP-3 patch header for Makefile fixes.
* Do not install *.la files (closes: #622473).
* copyright:
- Update format to the latest DEP-5
- Add copyright info from the new upstream version
-- Ubuntu Archive Auto-Sync <email address hidden> Sat, 30 Apr 2011 13:21:57 +0000
Upload details
- Uploaded by:
- Ubuntu Archive Auto-Sync
- Uploaded to:
- Oneiric
- Original maintainer:
- Debian Science Team
- Architectures:
- any
- Section:
- libdevel
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Precise | release | universe | libdevel |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| neartree_3.0.1.orig.tar.gz | 119.3 KiB | c31418d85702c3929a8d72dd9ec46e6942854ce8ac0ceca517975b75eadcd5b7 |
| neartree_3.0.1-1.debian.tar.gz | 3.0 KiB | d9ec3ec8c951951ca31df55ad20e13dd20fbd113243a7c6a4912ebaea6945a2a |
| neartree_3.0.1-1.dsc | 1.3 KiB | 9831020554b2066db8443b7b634e8038b9b187d140468c28c7b344d25dc894e5 |
Available diffs
- diff from 2.1.3-1 to 3.0.1-1 (108.5 KiB)
Binary packages built by this source
- libcneartree-dev: No summary available for libcneartree-dev in ubuntu quantal.
No description available for libcneartree-dev in ubuntu quantal.
- libcneartree5: 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.
