| 1 |
Source: hnswlib |
| 2 |
Standards-Version: 4.7.4 |
| 3 |
Maintainer: Debian Med Packaging Team <[email protected]> |
| 4 |
Uploaders: |
| 5 |
Steffen Moeller <[email protected]>, |
| 6 |
Étienne Mollier <[email protected]>, |
| 7 |
Section: science |
| 8 |
Build-Depends: |
| 9 |
debhelper-compat (= 13), |
| 10 |
dh-sequence-python3, |
| 11 |
libpython3-all-dev, |
| 12 |
pybuild-plugin-pyproject, |
| 13 |
python3-all-dev:native, |
| 14 |
python3-setuptools, |
| 15 |
python3-pybind11, |
| 16 |
# Native numpy is required in cross compilation context to build the wheel, |
| 17 |
# so marking <!nocheck> is not appropriate here. See also [1] for rationale. |
| 18 |
# [1]: https://lists.debian.org/debian-cross/2023/01/msg00005.html |
| 19 |
python3-numpy:native, |
| 20 |
Vcs-Browser: https://salsa.debian.org/med-team/hnswlib |
| 21 |
Vcs-Git: https://salsa.debian.org/med-team/hnswlib.git |
| 22 |
Homepage: https://github.com/nmslib/hnswlib |
| 23 |
|
| 24 |
Package: python3-hnswlib |
| 25 |
Architecture: any |
| 26 |
Section: python |
| 27 |
Depends: |
| 28 |
${shlibs:Depends}, |
| 29 |
${misc:Depends}, |
| 30 |
${python3:Depends}, |
| 31 |
python3-pybind11, |
| 32 |
python3-numpy, |
| 33 |
Description: Python bindings for hnswlib: fast approximate nearest neighbor search |
| 34 |
A common task in data analysis but also in scientific computations |
| 35 |
is to find data that is very close (multi-dimensional space) or |
| 36 |
similar (same thing) to a given data point. Also as heuristics for |
| 37 |
physics engines, it is the objects closest to you that you are |
| 38 |
most likely to collide with. This library knows how to do this |
| 39 |
fast. |
| 40 |
. |
| 41 |
This package provides a module for Python3 to the C implementation. |
| 42 |
|
| 43 |
Package: libhnswlib-dev |
| 44 |
Architecture: all |
| 45 |
Multi-Arch: foreign |
| 46 |
Section: libdevel |
| 47 |
Depends: |
| 48 |
${misc:Depends}, |
| 49 |
Description: fast approximate nearest neighbor search |
| 50 |
Header-only C++ HNSW implementation with Python bindings. |
| 51 |
. |
| 52 |
A common task in data analysis but also in scientific computations |
| 53 |
is to find data that is very close (multi-dimensional space) or |
| 54 |
similar (same thing) to a given data point. Also as heuristics for |
| 55 |
physics engines, it is the objects closest to you that you are |
| 56 |
most likely to collide with. This library knows how to do this |
| 57 |
fast. |