Struct lsh_rs::SqlTableMem

pub struct SqlTableMem<N, K> where
    N: Numeric,
    K: Integer,  { /* fields omitted */ }

In memory Sqlite backend for LSH.

Implementations

impl<N, K> SqlTableMem<N, K> where
    N: Numeric,
    K: Integer, 

pub fn to_db<P: AsRef<Path>>(&mut self, db_path: P) -> Result<()>

Methods from Deref<Target = SqlTable<N, K>>

pub fn commit(&self) -> Result<()>

pub fn init_transaction(&self) -> Result<()>

pub fn to_mem(&mut self) -> Result<()>

pub fn index_hash(&self) -> Result<()>

Trait Implementations

impl<N, K> Deref for SqlTableMem<N, K> where
    N: Numeric,
    K: Integer, 

type Target = SqlTable<N, K>

The resulting type after dereferencing.

fn deref(&self) -> &SqlTable<N, K>

Dereferences the value.

impl<N, K> DerefMut for SqlTableMem<N, K> where
    N: Numeric,
    K: Integer, 

fn deref_mut(&mut self) -> &mut SqlTable<N, K>

Mutably dereferences the value.

impl<N, K> HashTables<N, K> for SqlTableMem<N, K> where
    N: Numeric,
    K: Integer, 

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

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

Arguments

• hash - hashed vector.
• d - Vector to store in the buckets.
• hash_table - Number of the hash_table to store the vector. Ranging from 0 to L.

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

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

Query the whole bucket

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

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

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

fn update_by_idx(
    &mut self,
    _old_hash: &[K],
    _new_hash: Vec<K>,
    _idx: u32,
    _hash_table: usize
) -> Result<()>

fn increase_storage(&mut self, _size: usize)

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>>