Struct segment_map::Segment

pub struct Segment<K> { /* fields omitted */ }

Implementations

impl<K> Segment<K> where
    K: PartialOrd, 

pub fn new(lower: K, upper: K) -> Segment<K>

pub fn closed_open(lower: K, upper: K) -> Segment<K>

pub fn contains(&self, value: &K) -> bool

pub fn encloses(&self, other: &Segment<K>) -> bool

pub fn is_connected(&self, other: &Segment<K>) -> bool

pub fn is_empty(&self) -> bool

pub fn lower(&self) -> &K

pub fn upper(&self) -> &K

impl<K> Segment<K> where
    K: Clone + PartialOrd, 

pub fn intersection(&self, other: &Segment<K>) -> Option<Segment<K>>

pub fn span(&self, other: &Segment<K>) -> Segment<K>

impl<K> Segment<K> where
    K: PartialOrd + Default, 

pub fn empty() -> Segment<K>

impl<K> Segment<K> where
    K: PartialOrd + Next, 

pub fn singleton(value: K) -> Segment<K>

pub fn open(lower: K, upper: K) -> Segment<K>

pub fn closed(lower: K, upper: K) -> Segment<K>

pub fn open_closed(lower: K, upper: K) -> Segment<K>

impl<K> Segment<K> where
    K: Bounded + PartialOrd + Next, 

pub fn at_most(value: K) -> Segment<K>

pub fn greater_than(value: K) -> Segment<K>

impl<K> Segment<K> where
    K: Bounded + PartialOrd, 

pub fn at_least(value: K) -> Segment<K>

pub fn less_than(value: K) -> Segment<K>

pub fn all() -> Segment<K>

Trait Implementations

impl<K: Clone> Clone for Segment<K>

fn clone(&self) -> Segment<K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Copy> Copy for Segment<K>

impl<K: Debug> Debug for Segment<K>

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

Formats the value using the given formatter.

impl<K: Eq> Eq for Segment<K>

impl<K: Hash> Hash for Segment<K>

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, 

Feeds a slice of this type into the given [Hasher].

impl<K: Ord> Ord for Segment<K>

fn cmp(&self, other: &Segment<K>) -> Ordering

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<K: PartialEq> PartialEq<Segment<K>> for Segment<K>

fn eq(&self, other: &Segment<K>) -> bool

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

fn ne(&self, other: &Segment<K>) -> bool

This method tests for !=.

impl<K: PartialOrd> PartialOrd<Segment<K>> for Segment<K>

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

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

fn lt(&self, other: &Segment<K>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Segment<K>) -> bool

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

fn gt(&self, other: &Segment<K>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Segment<K>) -> bool

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

impl<K> StructuralEq for Segment<K>

impl<K> StructuralPartialEq for Segment<K>