[ trixie ]
[ sid ]
[ Källkod: neartree ]
Paket: libcneartree7t64 (5.1.1+dfsg1-2.1)
Länkar för libcneartree7t64
Debianresurser:
Hämta källkodspaketet neartree:
- [neartree_5.1.1+dfsg1-2.1.dsc]
- [neartree_5.1.1+dfsg1.orig.tar.gz]
- [neartree_5.1.1+dfsg1-2.1.debian.tar.xz]
Ansvariga:
Externa resurser:
- Hemsida [neartree.sourceforge.net]
Liknande paket:
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.
Andra paket besläktade med libcneartree7t64
|
|
|
|
-
- dep: libc6 (>= 2.27) [riscv64]
- GNU C-bibliotek: Delade bibliotek
också ett virtuellt paket som tillhandahålls av libc6-udeb
- dep: libc6 (>= 2.29) [ej riscv64]
-
- dep: libcvector2 (>= 1.0.3)
- ANSI C implementation of dynamic arrays
Hämta libcneartree7t64
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| amd64 | 28,9 kbyte | 96,0 kbyte | [filförteckning] |
| arm64 | 24,8 kbyte | 88,0 kbyte | [filförteckning] |
| armel | 27,4 kbyte | 92,0 kbyte | [filförteckning] |
| armhf | 21,9 kbyte | 64,0 kbyte | [filförteckning] |
| i386 | 29,6 kbyte | 96,0 kbyte | [filförteckning] |
| mips64el | 24,6 kbyte | 91,0 kbyte | [filförteckning] |
| ppc64el | 30,9 kbyte | 152,0 kbyte | [filförteckning] |
| riscv64 | 28,0 kbyte | 76,0 kbyte | [filförteckning] |
| s390x | 30,3 kbyte | 100,0 kbyte | [filförteckning] |