File: control

package info (click to toggle)
r-cran-rann 2.6.1-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye, sid
  • size: 384 kB
  • sloc: cpp: 2,638; sh: 13; ansic: 12; makefile: 2
file content (28 lines) | stat: -rw-r--r-- 1,127 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
Source: r-cran-rann
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders: Steffen Moeller <moeller@debian.org>
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Priority: optional
Build-Depends: debhelper-compat (= 12),
               dh-r,
               r-base-dev
Standards-Version: 4.4.0
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-rann
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-rann.git
Homepage: https://cran.r-project.org/package=RANN

Package: r-cran-rann
Architecture: any
Depends: ${R:Depends},
         ${shlibs:Depends},
         ${misc:Depends}
Recommends: ${R:Recommends}
Suggests: ${R:Suggests}
Description: Fast Nearest Neighbour Search Using L2 Metric
 Finds the k nearest neighbours for every point in a given dataset
 in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is
 support for approximate as well as exact searches, fixed radius searches
 and 'bd' as well as 'kd' trees. The distance is computed using the L2
 (Euclidean) metric. Please see package 'RANN.L1' for the same
 functionality using the L1 (Manhattan, taxicab) metric.