Enum treap_map::SearchResult

pub enum SearchResult<'a, C: TreapMapConfig, W: ConsoliableWeight> {
    Abort,
    LeftMost,
    Found {
        base_weight: W,
        node: &'a Node<C>,
    },
    RightMost(W),
}

Represents the possible outcomes of the accumulate_weight_search.

This enum encapsulates the results that can be returned by accumulate_weight_search, indicating the outcome of the search within a treap map.

Variants

Abort

Indicates that the search was aborted. This variant is used when no feasible result is found and the search position is neither at the extreme left nor the extreme right of the treap.

LeftMost

Indicates that the search reached the leftmost edge of the entire treap without finding a feasible result.

Found

Fields

base_weight: W

node: &'a Node<C>

Represents a successful search, indicating a feasible result has been found. Contains base_weight, which is the total weight from the leftmost edge up to but not including the current node, and a reference to the node itself.

RightMost(W)

Indicates that the search reached the rightmost edge of the entire treap without finding a feasible result. Also returns the total weight of the entire tree (RightMost(W)).

Implementations

impl<'a, C: TreapMapConfig, W: ConsoliableWeight> SearchResult<'a, C, W>

pub fn maybe_value(&self) -> Option<&'a C::Value>

Trait Implementations

impl<'a, C: TreapMapConfig, W> Debug for SearchResult<'a, C, W>

where W: Debug + ConsoliableWeight, Node<C>: Debug,

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

Formats the value using the given formatter.

impl<'a, C: TreapMapConfig, W: ConsoliableWeight> PartialEq for SearchResult<'a, C, W>

where C::Weight: PartialEq, Node<C>: PartialEq,

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

This method tests for self and other values to be equal, and is used by ==.

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

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