Struct BLinkTree 

pub struct BLinkTree { /* private fields */ }

A simplified B-link tree index using DashMap Full B-link tree implementation will be added in Phase 2

Implementations

impl BLinkTree

pub fn new() -> Self

Create a new index

pub fn insert(&self, conn_id: u64, ptr: SegmentPtr)

Insert or update an entry

pub fn search(&self, conn_id: u64) -> Option<SegmentPtr>

Search for a connection

pub fn remove(&self, conn_id: u64) -> Option<SegmentPtr>

Remove a connection

pub fn len(&self) -> usize

Get the number of entries

pub fn is_empty(&self) -> bool

Check if empty

pub fn iter(&self) -> impl Iterator<Item = (u64, SegmentPtr)> + '_

Iterate over all entries

Trait Implementations

impl Default for BLinkTree

fn default() -> Self

Returns the “default value” for a type.