Ubuntu
ann package

ann 1.1.2+doc-9 source package in Ubuntu

Changelog

ann (1.1.2+doc-9) unstable; urgency=medium

  * add an annself_exclude namespace for cctbx

 -- Picca Frédéric-Emmanuel <email address hidden>  Thu, 13 Oct 2022 16:29:12 +0200

Upload details

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

See full publishing history Publishing

Series Pocket Published Component Section
Mantic release universe libs
Lunar release universe libs

Downloads

File Size SHA-256 Checksum
ann_1.1.2+doc-9.dsc 2.4 KiB f9a242cdcb86e12e63369087adf0e8e145c4b5d916ec2622417657737fc125fd
ann_1.1.2+doc.orig.tar.gz 677.7 KiB 1a8053e4f1ee284430758a2d864e567d9b4b08c0f6562460c9913497fafc78c1
ann_1.1.2+doc-9.debian.tar.xz 169.0 KiB 0d202b67bc7f6802e6ef3d1fffacf08e84581655e662d59246e4ae35ffa0b7ff

No changes file available.

Binary packages built by this source

ann-tools: Approximate Nearest Neighbor Searching library (tools)

 ANN is a library written in C++, which supports data structures and
 algorithms for both exact and approximate nearest neighbor searching
 in arbitrarily high dimensions. ANN assumes that distances
 are measured using any class of distance functions called Minkowski
 metrics. These include the well known Euclidean distance, Manhattan
 distance, and max distance. ANN performs quite efficiently for point
 sets ranging in size from thousands to hundreds of thousands, and in
 dimensions as high as 20.
 .
 This package contains the ann2fig (display ANN output in fig format)
 and the ann_sample (a sample demonstration for ANN) programs.

ann-tools-dbgsym: debug symbols for ann-tools
libann-cctbx-dev: Approximate Nearest Neighbor Searching library (cctbx development files)

 ANN is a library written in C++, which supports data structures and
 algorithms for both exact and approximate nearest neighbor searching
 in arbitrarily high dimensions. ANN assumes that distances
 are measured using any class of distance functions called Minkowski
 metrics. These include the well known Euclidean distance, Manhattan
 distance, and max distance. ANN performs quite efficiently for point
 sets ranging in size from thousands to hundreds of thousands, and in
 dimensions as high as 20.
 .
 This package contains the header files for developing applications
 with the ANN library cctbx variant.

libann-cctbx0: Approximate Nearest Neighbor Searching library (cctbx variant)

 ANN is a library written in C++, which supports data structures and
 algorithms for both exact and approximate nearest neighbor searching
 in arbitrarily high dimensions. ANN assumes that distances
 are measured using any class of distance functions called Minkowski
 metrics. These include the well known Euclidean distance, Manhattan
 distance, and max distance. ANN performs quite efficiently for point
 sets ranging in size from thousands to hundreds of thousands, and in
 dimensions as high as 20.

libann-cctbx0-dbgsym: debug symbols for libann-cctbx0
libann-dev: Approximate Nearest Neighbor Searching library (development files)

 ANN is a library written in C++, which supports data structures and
 algorithms for both exact and approximate nearest neighbor searching
 in arbitrarily high dimensions. ANN assumes that distances
 are measured using any class of distance functions called Minkowski
 metrics. These include the well known Euclidean distance, Manhattan
 distance, and max distance. ANN performs quite efficiently for point
 sets ranging in size from thousands to hundreds of thousands, and in
 dimensions as high as 20.
 .
 This package contains the header files for developing applications
 with the ANN library.

libann0: Approximate Nearest Neighbor Searching library

 ANN is a library written in C++, which supports data structures and
 algorithms for both exact and approximate nearest neighbor searching
 in arbitrarily high dimensions. ANN assumes that distances
 are measured using any class of distance functions called Minkowski
 metrics. These include the well known Euclidean distance, Manhattan
 distance, and max distance. ANN performs quite efficiently for point
 sets ranging in size from thousands to hundreds of thousands, and in
 dimensions as high as 20.

libann0-dbgsym: debug symbols for libann0