Struct judy::JudyL

pub struct JudyL { /* fields omitted */ }

Implementations

impl JudyL

pub fn new() -> JudyL

pub fn insert(&mut self, index: c_ulong, value: c_ulong) -> bool

pub fn insert_bulk_sorted(
    &mut self,
    count: c_ulong,
    keys: &[c_ulong],
    vals: &[c_ulong]
) -> bool

Warning: This function requires the keys to be sorted in relation to data already in the array. That means even if this set of keys is sorted, if it’s out of sequence with the keys in the array then the function will fail.

pub fn get(&self, index: c_ulong) -> Option<c_ulong>

pub fn free(&mut self) -> c_ulong

pub fn iter(&self) -> JudyLIterator<'_>

pub fn count(&self, index1: c_ulong, index2: c_ulong) -> c_ulong

pub fn remove(&mut self, index: &c_ulong) -> bool

pub fn clear(&mut self)

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl Default for JudyL

fn default() -> Self

Returns the “default value” for a type.

impl Drop for JudyL

fn drop(&mut self)

Executes the destructor for this type.