Struct MemoryTable 

pub struct MemoryTable<N, K>
where
    N: Numeric,
    K: Integer,
{
    pub vec_store: VecStore<N>,
    /* private fields */
}

In memory backend for LSH.

Fields

vec_store: VecStore<N>

Trait Implementations

impl<N, K> Debug for MemoryTable<N, K>

where N: Numeric, K: Integer,

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

Formats the value using the given formatter.

impl<'de, N, K> Deserialize<'de> for MemoryTable<N, K>

where N: Numeric + Deserialize<'de>, K: Integer + Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N, K> HashTables<N, K> for MemoryTable<N, K>

where N: Numeric, K: Integer,

fn delete(&mut self, hash: &[K], d: &[N], hash_table: usize) -> Result<()>

Expensive operation we need to do a linear search over all datapoints

fn query_bucket(&self, hash: &[K], hash_table: usize) -> Result<FnvHashSet<u32>>

Query the whole bucket

fn new( n_hash_tables: usize, only_index_storage: bool, _: &str, ) -> Result<Box<Self>>

fn put(&mut self, hash: Vec<K>, d: &[N], hash_table: usize) -> Result<u32>

Arguments

fn update_by_idx( &mut self, old_hash: &[K], new_hash: Vec<K>, idx: u32, hash_table: usize, ) -> Result<()>

fn idx_to_datapoint(&self, idx: u32) -> Result<&Vec<N>>

fn increase_storage(&mut self, size: usize)

fn describe(&self) -> Result<String>

fn get_unique_hash_int(&self) -> FnvHashSet<i32>

fn store_hashers<H: VecHash<N, K> + Serialize>( &mut self, _hashers: &[H], ) -> Result<()>

fn load_hashers<H: VecHash<N, K> + DeserializeOwned>(&self) -> Result<Vec<H>>

impl<N, K> Serialize for MemoryTable<N, K>

where N: Numeric + Serialize, K: Integer + Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.