r-cran-rann binary package in Ubuntu Kinetic riscv64

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2022-04-26 10:05:31 UTC Published Ubuntu Kinetic riscv64 release universe gnu-r Optional 2.6.1-1build2
  • Published
  • Copied from ubuntu groovy-proposed riscv64 in Primary Archive for Ubuntu