| 1 |
Source: ann |
| 2 |
Maintainer: Debian Science Maintainers <[email protected]> |
| 3 |
Uploaders: |
| 4 |
Picca Frédéric-Emmanuel <[email protected]>, |
| 5 |
Teemu Ikonen <[email protected]>, |
| 6 |
Section: libs |
| 7 |
Priority: optional |
| 8 |
Build-Depends: |
| 9 |
autoconf, |
| 10 |
autoconf-archive, |
| 11 |
automake, |
| 12 |
debhelper-compat (= 13), |
| 13 |
libtool, |
| 14 |
python3, |
| 15 |
Standards-Version: 4.1.3 |
| 16 |
Vcs-Browser: https://salsa.debian.org/science-team/ann |
| 17 |
Vcs-Git: https://salsa.debian.org/science-team/ann.git |
| 18 |
Homepage: https://www.cs.umd.edu/~mount/ANN/ |
| 19 |
|
| 20 |
Package: libann-dev |
| 21 |
Architecture: any |
| 22 |
Section: libdevel |
| 23 |
Depends: |
| 24 |
libann0 (= ${binary:Version}), |
| 25 |
${misc:Depends}, |
| 26 |
Description: Approximate Nearest Neighbor Searching library (development files) |
| 27 |
ANN is a library written in C++, which supports data structures and |
| 28 |
algorithms for both exact and approximate nearest neighbor searching |
| 29 |
in arbitrarily high dimensions. ANN assumes that distances |
| 30 |
are measured using any class of distance functions called Minkowski |
| 31 |
metrics. These include the well known Euclidean distance, Manhattan |
| 32 |
distance, and max distance. ANN performs quite efficiently for point |
| 33 |
sets ranging in size from thousands to hundreds of thousands, and in |
| 34 |
dimensions as high as 20. |
| 35 |
. |
| 36 |
This package contains the header files for developing applications |
| 37 |
with the ANN library. |
| 38 |
|
| 39 |
Package: libann0 |
| 40 |
Architecture: any |
| 41 |
Depends: |
| 42 |
${misc:Depends}, |
| 43 |
${shlibs:Depends}, |
| 44 |
Description: Approximate Nearest Neighbor Searching library |
| 45 |
ANN is a library written in C++, which supports data structures and |
| 46 |
algorithms for both exact and approximate nearest neighbor searching |
| 47 |
in arbitrarily high dimensions. ANN assumes that distances |
| 48 |
are measured using any class of distance functions called Minkowski |
| 49 |
metrics. These include the well known Euclidean distance, Manhattan |
| 50 |
distance, and max distance. ANN performs quite efficiently for point |
| 51 |
sets ranging in size from thousands to hundreds of thousands, and in |
| 52 |
dimensions as high as 20. |
| 53 |
|
| 54 |
Package: ann-tools |
| 55 |
Architecture: any |
| 56 |
Section: math |
| 57 |
Depends: |
| 58 |
${misc:Depends}, |
| 59 |
${shlibs:Depends}, |
| 60 |
Description: Approximate Nearest Neighbor Searching library (tools) |
| 61 |
ANN is a library written in C++, which supports data structures and |
| 62 |
algorithms for both exact and approximate nearest neighbor searching |
| 63 |
in arbitrarily high dimensions. ANN assumes that distances |
| 64 |
are measured using any class of distance functions called Minkowski |
| 65 |
metrics. These include the well known Euclidean distance, Manhattan |
| 66 |
distance, and max distance. ANN performs quite efficiently for point |
| 67 |
sets ranging in size from thousands to hundreds of thousands, and in |
| 68 |
dimensions as high as 20. |
| 69 |
. |
| 70 |
This package contains the ann2fig (display ANN output in fig format) |
| 71 |
and the ann_sample (a sample demonstration for ANN) programs. |
| 72 |
|
| 73 |
Package: libann-cctbx-dev |
| 74 |
Architecture: any |
| 75 |
Section: libdevel |
| 76 |
Depends: |
| 77 |
libann-cctbx0 (= ${binary:Version}), |
| 78 |
${misc:Depends}, |
| 79 |
Description: Approximate Nearest Neighbor Searching library (cctbx development files) |
| 80 |
ANN is a library written in C++, which supports data structures and |
| 81 |
algorithms for both exact and approximate nearest neighbor searching |
| 82 |
in arbitrarily high dimensions. ANN assumes that distances |
| 83 |
are measured using any class of distance functions called Minkowski |
| 84 |
metrics. These include the well known Euclidean distance, Manhattan |
| 85 |
distance, and max distance. ANN performs quite efficiently for point |
| 86 |
sets ranging in size from thousands to hundreds of thousands, and in |
| 87 |
dimensions as high as 20. |
| 88 |
. |
| 89 |
This package contains the header files for developing applications |
| 90 |
with the ANN library cctbx variant. |
| 91 |
|
| 92 |
Package: libann-cctbx0 |
| 93 |
Architecture: any |
| 94 |
Depends: |
| 95 |
${misc:Depends}, |
| 96 |
${shlibs:Depends}, |
| 97 |
Description: Approximate Nearest Neighbor Searching library (cctbx variant) |
| 98 |
ANN is a library written in C++, which supports data structures and |
| 99 |
algorithms for both exact and approximate nearest neighbor searching |
| 100 |
in arbitrarily high dimensions. ANN assumes that distances |
| 101 |
are measured using any class of distance functions called Minkowski |
| 102 |
metrics. These include the well known Euclidean distance, Manhattan |
| 103 |
distance, and max distance. ANN performs quite efficiently for point |
| 104 |
sets ranging in size from thousands to hundreds of thousands, and in |
| 105 |
dimensions as high as 20. |