Struct ApproxPos 

pub struct ApproxPos {
    pub pos: usize,
    pub lo: usize,
    pub hi: usize,
}

Approximate position returned by index search.

When searching for a key, the index returns an approximate position along with guaranteed bounds where the key must exist (if present).

The actual key position (if it exists) is guaranteed to be in [lo, hi).

Fields

pos: usize

The predicted position of the key.

lo: usize

The lowest index guaranteed to contain the key if it exists.

hi: usize

One past the highest index guaranteed to contain the key if it exists.

Implementations

impl ApproxPos

pub fn new(pos: usize, lo: usize, hi: usize) -> Self

Trait Implementations

impl Clone for ApproxPos

fn clone(&self) -> ApproxPos

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ApproxPos

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for ApproxPos

fn default() -> ApproxPos

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for ApproxPos

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for ApproxPos

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for ApproxPos