NearestNeighbours

Struct NearestNeighbours 

Source
pub struct NearestNeighbours { /* private fields */ }

Implementations§

Source§

impl NearestNeighbours

Source

pub fn new(metric: String) -> Result<NearestNeighbours>

Create a new, empty NearestNeighbours struct

use nn_rs::NearestNeighbours;

let metric = String::from("cosine");
let mut index = NearestNeighbours::new(metric);
§Parameters
  • metric: distance metric to use. One of “cosine”, “euclidean” or “manhattan”
§Return Values
  • NearestNeighbours struct
Source

pub fn from_json( metric: String, vectors_file: PathBuf, ) -> Result<NearestNeighbours>

Create a new NearestNeighbours struct from a json

This constructor should be useful for loading vectors from python matrix libraries such as torch, tensorflow, jax, numpy etc.

§Parameters
  • metric: distance metric. One of “cosine”, “euclidean” or “manhattan”
  • vector_file: a json of {“id_1”: [1.0, 2.0, … ], “id_2”: [1.0, 2.0, … ], … } format
§Return Values
  • NearestNeighbours struct

Example json format

{
    "id_1": [1.0, 2.0, ... ],
    "id_2": [1.0, 2.0, ... ],
    .
    .
    .
    "id_n": [1.0, 2.0, ... ],
}
Source

pub fn load(nn_file: PathBuf) -> Result<NearestNeighbours>

Load a NearestNeighbours struct from a .nn file

§Parameters
  • nn_file: .nn file to load
§Return Values
  • NearestNeighbours struct
Source

pub fn add_vector(&mut self, id: String, vector: DVector<f64>) -> Result<()>

Add a new vector to the NearestNeighbour struct

Note: the id should be unique. If it isn’t, only the vector associated with the id that was most recently added will be kept

§Parameters
  • id: the id of the vector, this can be any string but it must be unique
  • vector: the vector to add
§Return Values
  • nothing
Source

pub fn save(&mut self, output_path: PathBuf) -> Result<()>

Save the NearestNeighbour struct to a .nn file

§Parameters
  • output_path: path to save the struct to
§Return Values
  • nothing
Source

pub fn query_by_vector( &mut self, query_vector: DVector<f64>, no_neighbours: usize, ) -> Result<Vec<String>>

Find the nearest neighbour for a query vector

§Parameters
  • query_vector: vector to find the nearest neighbour to
  • no_neighbours: the number of nearest neighbours to find
§Return Values
  • ids of the nearest neighbours

Trait Implementations§

Source§

impl Clone for NearestNeighbours

Source§

fn clone(&self) -> NearestNeighbours

Returns a duplicate of the value. Read more
1.0.0 · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for NearestNeighbours

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for NearestNeighbours

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Serialize for NearestNeighbours

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,