Struct lsh_rs::SqlTable

pub struct SqlTable<N, K> where
    N: Numeric,
    K: Integer,  {
    pub conn: Connection,
    pub committed: Cell<bool>,
    // some fields omitted
}

Sqlite backend for LSH.

State will be save during sessions. The database is automatically loaded if LSH can find the database file (defaults to ./lsh.db3.

Fields

conn: Connection

committed: Cell<bool>

Implementations

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

pub fn init_from_conn(
    n_hash_tables: usize,
    only_index_storage: bool,
    conn: Connection
) -> Result<Self>

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> HashTables<N, K> for SqlTable<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

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

Query the whole bucket

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

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

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

fn delete(&mut self, _hash: &[K], _d: &[N], _hash_table: usize) -> Result<()>

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)