Struct LeftOf 

pub struct LeftOf<L>(pub L);

A Wrapper for other locators what will find the segment to the left of the previous locator. So, LeftOf(5..8) is equivalent to 0..5.

Tuple Fields

0: L

Trait Implementations

impl<L: Clone> Clone for LeftOf<L>

fn clone(&self) -> LeftOf<L>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<L: Debug> Debug for LeftOf<L>

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

Formats the value using the given formatter.

impl<L: Hash> Hash for LeftOf<L>

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<D: Data, L: Locator<D>> Locator<D> for LeftOf<L>

fn locate( &self, left: D::Summary, node: &D::Value, right: D::Summary, ) -> LocResult

Looks at a specific node’s value, and its context (the summaries to the right and left), and decides whether to go left, right, or accept the node.

impl<L: PartialEq> PartialEq for LeftOf<L>

fn eq(&self, other: &LeftOf<L>) -> 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<L: Copy> Copy for LeftOf<L>

impl<L: Eq> Eq for LeftOf<L>

impl<L> StructuralPartialEq for LeftOf<L>