[ Källkod: neartree ]
Paket: libcneartree7 (5.1.1+dfsg1-1 och andra)
Länkar för libcneartree7
Debianresurser:
Hämta källkodspaketet neartree:
- [neartree_5.1.1+dfsg1-1.dsc]
- [neartree_5.1.1+dfsg1.orig.tar.gz]
- [neartree_5.1.1+dfsg1-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 libcneartree7
|
|
|
|
-
- dep: libc6 (>= 2.17) [arm64, ppc64el]
- GNU C-bibliotek: Delade bibliotek
också ett virtuellt paket som tillhandahålls av libc6-udeb
- dep: libc6 (>= 2.4) [ej arm64, ppc64el]
-
- dep: libcvector2 (>= 1.0.3)
- ANSI C implementation of dynamic arrays
Hämta libcneartree7
| Arkitektur | Version | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|---|
| amd64 | 5.1.1+dfsg1-1+b1 | 27,0 kbyte | 90,0 kbyte | [filförteckning] |
| arm64 | 5.1.1+dfsg1-1+b1 | 24,0 kbyte | 78,0 kbyte | [filförteckning] |
| armel | 5.1.1+dfsg1-1+b1 | 26,2 kbyte | 86,0 kbyte | [filförteckning] |
| armhf | 5.1.1+dfsg1-1+b1 | 21,2 kbyte | 58,0 kbyte | [filförteckning] |
| i386 | 5.1.1+dfsg1-1+b1 | 27,7 kbyte | 94,0 kbyte | [filförteckning] |
| mips64el | 5.1.1+dfsg1-1+b1 | 24,2 kbyte | 85,0 kbyte | [filförteckning] |
| mipsel | 5.1.1+dfsg1-1+b1 | 24,5 kbyte | 84,0 kbyte | [filförteckning] |
| ppc64el | 5.1.1+dfsg1-1+b1 | 28,9 kbyte | 150,0 kbyte | [filförteckning] |
| s390x | 5.1.1+dfsg1-1+b1 | 23,9 kbyte | 86,0 kbyte | [filförteckning] |