pub struct OnIoDupSuber<C: ValueCodec = Utf8Codec> {
pub on_base: OnSuberBase<C>,
pub io_dup_suber: IoDupSuber<C>,
}Fields§
§on_base: OnSuberBase<C>§io_dup_suber: IoDupSuber<C>Implementations§
Source§impl<C: ValueCodec> OnIoDupSuber<C>
impl<C: ValueCodec> OnIoDupSuber<C>
pub fn new( db: Arc<LMDBer>, subkey: &str, sep: Option<u8>, verify: bool, ) -> Result<Self, SuberError>
Sourcepub fn add_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>(
&self,
keys: &[K],
on: u32,
val: &V,
) -> Result<bool, SuberError>
pub fn add_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>( &self, keys: &[K], on: u32, val: &V, ) -> Result<bool, SuberError>
Adds val idempotently at key made from keys in insertion order using hidden ordinal proem. Idempotently means do not add val that is already in dup vals at key. Does not overwrite.
Sourcepub fn append_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>(
&self,
keys: &[K],
val: &V,
) -> Result<u64, SuberError>
pub fn append_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>( &self, keys: &[K], val: &V, ) -> Result<u64, SuberError>
Appends a value and returns the ordinal number of the newly appended val
Sourcepub fn get_on<K: AsRef<[u8]>, R: TryFrom<Vec<u8>>>(
&self,
keys: &[K],
on: u32,
) -> Result<Vec<R>, SuberError>
pub fn get_on<K: AsRef<[u8]>, R: TryFrom<Vec<u8>>>( &self, keys: &[K], on: u32, ) -> Result<Vec<R>, SuberError>
Gets dup vals list at key made from keys
Sourcepub fn rem_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>(
&self,
keys: &[K],
on: u32,
val: Option<&V>,
) -> Result<bool, SuberError>
pub fn rem_on<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>( &self, keys: &[K], on: u32, val: Option<&V>, ) -> Result<bool, SuberError>
Removes entry at key made from keys and dup val that matches val if any, notwithstanding hidden ordinal proem. Otherwise deletes all dup values at key if any.
Sourcepub fn get_on_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
pub fn get_on_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
Returns an iterator that yields deserialized values from the database
Sourcepub fn get_on_item_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
pub fn get_on_item_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
Returns an iterator that yields triples of (keys, on, val)
Sourcepub fn get_on_last_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
pub fn get_on_last_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
Returns an iterator that yields the last duplicate value for each key
Sourcepub fn get_on_last_item_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
pub fn get_on_last_item_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
Returns an iterator that yields triples of (keys, on, val) for the last duplicate values
Sourcepub fn get_on_back_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
pub fn get_on_back_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<R, SuberError>> + '_>, SuberError>
Returns an iterator that yields deserialized values from the database in reverse order
Sourcepub fn get_on_item_back_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>(
&self,
keys: &[K],
on: u32,
) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
pub fn get_on_item_back_iter<K: AsRef<[u8]>, R: TryFrom<Vec<u8>> + 'static>( &self, keys: &[K], on: u32, ) -> Result<Box<dyn Iterator<Item = Result<(Vec<Vec<u8>>, u64, R), SuberError>> + '_>, SuberError>
Returns an iterator that yields triples of (keys, on, val) in reverse order
Sourcepub fn get_item_iter<K: AsRef<[u8]>>(
&self,
keys: &[K],
topive: bool,
) -> Result<Vec<(Vec<Vec<u8>>, Vec<u8>)>, SuberError>
pub fn get_item_iter<K: AsRef<[u8]>>( &self, keys: &[K], topive: bool, ) -> Result<Vec<(Vec<Vec<u8>>, Vec<u8>)>, SuberError>
Returns an iterator over all the items (keys, value) whose effective key starts with the prefix derived from keys.
§Arguments
keys- Slice of key parts, potentially a partial keytopive- If true, treat as partial key tuple ending with separator
§Returns
Result<Vec<(Vec<Vec<u8>>, Vec<u8>)>, SuberError>- Vector of key-value pairs
Sourcepub fn add<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>(
&self,
keys: &[K],
val: &V,
) -> Result<bool, SuberError>
pub fn add<K: AsRef<[u8]>, V: ?Sized + Clone + Into<Vec<u8>>>( &self, keys: &[K], val: &V, ) -> Result<bool, SuberError>
Add val idempotently at key made from keys in insertion order using hidden ordinal proem. Idempotently means do not add val that is already in dup vals at key. Does not overwrite.
§Arguments
keys- Slice of key parts to be combined to form the keyval- Value to be stored
§Returns
Result<bool, SuberError>- True means unique value added among duplications, False means duplicate of same value already exists.