Struct BucketApi

pub struct BucketApi<T: Clone + Copy + PartialEq + 'static> {
    pub stats: Arc<BucketMapStats>,
    /* private fields */
}

Fields

stats: Arc<BucketMapStats>

Implementations

impl<T: Clone + Copy + PartialEq + Debug> BucketApi<T>

pub fn items_in_range<R>(&self, range: &Option<&R>) -> Vec<BucketItem<T>>

where R: RangeBounds<Pubkey>,

Get the items for bucket

pub fn keys(&self) -> Vec<Pubkey>

Get the Pubkeys

pub fn read_value(&self, key: &Pubkey) -> Option<(Vec<T>, RefCount)>

Get the values for Pubkey key

pub fn bucket_len(&self) -> u64

pub fn delete_key(&self, key: &Pubkey)

pub fn insert(&self, pubkey: &Pubkey, value: (&[T], RefCount))

pub fn grow(&self, err: BucketMapError)

pub fn set_anticipated_count(&self, count: u64)

caller can specify that the index needs to hold approximately count entries soon. This gives a hint to the resizing algorithm and prevents repeated incremental resizes.

pub fn batch_insert_non_duplicates( &self, items: &[(Pubkey, T)], ) -> Vec<(usize, T)>

batch insert of items. Assumption is a single slot list element and ref_count == 1. For any pubkeys that already exist, the index in items of the failed insertion and the existing data (previously put in the index) are returned.

pub fn update<F>(&self, key: &Pubkey, updatefn: F)

where F: FnMut(Option<(&[T], RefCount)>) -> Option<(Vec<T>, RefCount)>,

pub fn try_write( &self, pubkey: &Pubkey, value: (&[T], RefCount), ) -> Result<(), BucketMapError>