Enum FindOrInsert

pub enum FindOrInsert {
    Found(usize),
    Inserted(usize),
}

Value returned when find_or_insert is used.

Variants

Found(usize)

Contains a found index

Inserted(usize)

Contains an inserted index

Implementations

impl FindOrInsert

pub fn index(&self) -> usize

Get the index of the element that was either found or inserted.

pub fn found(&self) -> Option<usize>

If an equivalent element was found in the container, get the value of its index. Otherwise get None.

pub fn inserted(&self) -> Option<usize>

If the provided element was inserted into the container, get the value of its index. Otherwise get None.

pub fn is_found(&self) -> bool

Returns true if the element was found.

pub fn is_inserted(&self) -> bool

Returns true if the element was inserted.

Trait Implementations

impl Debug for FindOrInsert

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

Formats the value using the given formatter.

impl From<Result<usize, usize>> for FindOrInsert

Converts from the binary_search result type into the FindOrInsert type

fn from(result: Result<usize, usize>) -> Self

Converts to this type from the input type.

impl Hash for FindOrInsert

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for FindOrInsert

fn cmp(&self, other: &FindOrInsert) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for FindOrInsert

fn eq(&self, other: &FindOrInsert) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for FindOrInsert

fn partial_cmp(&self, other: &FindOrInsert) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for FindOrInsert

impl StructuralPartialEq for FindOrInsert