Struct UpperBoundedSet 

pub struct UpperBoundedSet<T> { /* private fields */ }

A set of ranges with a finite upper bound but no lower bound.

While an UpperBoundedSet can be constructed directly, it will most likely arise as a result of one or more range operations.

use rangetools::{UpperBoundedSet, Rangetools};

let s: UpperBoundedSet<_> = (10..20).union(..5);

Implementations

impl<T: Copy + Ord> UpperBoundedSet<T>

pub fn contains(&self, t: T) -> bool

Returns true if the set contains t.

Example

use rangetools::Rangetools;

let s = (10..20).union(..5);
assert!(s.contains(0));
assert!(!s.contains(42));

Trait Implementations

impl<T: Clone> Clone for UpperBoundedSet<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for UpperBoundedSet<T>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for UpperBoundedSet<T>

impl<T> From<UpperBoundedRange<T>> for UpperBoundedSet<T>

fn from(upper_bounded_range: UpperBoundedRange<T>) -> Self

Converts to this type from the input type.

impl<T: Hash> Hash for UpperBoundedSet<T>

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<T: PartialEq> PartialEq for UpperBoundedSet<T>

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

Equality operator ==.

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

Inequality operator !=.

impl<T> RangeComplement<LowerBoundedSet<T>> for UpperBoundedSet<T>

where T: Copy + Ord,

fn complement(self) -> LowerBoundedSet<T>

Returns a set of all the elements not in self.

impl<T> RangeComplement<UpperBoundedSet<T>> for LowerBoundedSet<T>

where T: Copy + Ord,

fn complement(self) -> UpperBoundedSet<T>

Returns a set of all the elements not in self.

impl<T, R> RangeIntersection<R, BoundedRange<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = BoundedRange<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, BoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = BoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, EmptyRange<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = EmptyRange<T>>, T: Copy + Ord,

type Output = EmptyRange<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, LowerBoundedRange<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = LowerBoundedRange<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, LowerBoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = LowerBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UnboundedRange> for UpperBoundedSet<T>

where R: Rangetools<Inner = UnboundedRange>,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, _: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UnboundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = UnboundedSet<T>> + Clone, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedRange<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = UpperBoundedRange<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for Range<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for RangeFrom<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for RangeFull

where R: Rangetools<Inner = UpperBoundedSet<T>>,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for RangeInclusive<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for RangeTo<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for RangeToInclusive<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for BoundedRange<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for LowerBoundedRange<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for UpperBoundedRange<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for BoundedSet<T>

where R: Rangetools<Inner = UpperBoundedSet<T>> + Clone, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for LowerBoundedSet<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = BoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for UnboundedSet<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeIntersection<R, UpperBoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Inner = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the intersection.

fn intersection(self, other: R) -> Self::Output

Returns the set intersection of self and other.

impl<T, R> RangeUnion<R, BoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Set = BoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, EmptyRange<T>> for UpperBoundedSet<T>

where R: Rangetools<Set = EmptyRange<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, LowerBoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Set = LowerBoundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UnboundedRange> for UpperBoundedSet<T>

where R: Rangetools<Set = UnboundedRange>, T: Copy + Ord,

type Output = UnboundedRange

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UnboundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Set = UnboundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for Range<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for RangeFrom<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for RangeFull

where R: Rangetools<Set = UpperBoundedSet<T>>,

type Output = UnboundedRange

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for RangeInclusive<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for RangeTo<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for RangeToInclusive<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for BoundedRange<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for LowerBoundedRange<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for UpperBoundedRange<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for BoundedSet<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for LowerBoundedSet<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for UnboundedSet<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UnboundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T, R> RangeUnion<R, UpperBoundedSet<T>> for UpperBoundedSet<T>

where R: Rangetools<Set = UpperBoundedSet<T>>, T: Copy + Ord,

type Output = UpperBoundedSet<T>

The output type of the union.

fn union(self, other: R) -> Self::Output

Returns the set union of self and other.

impl<T> Rangetools for UpperBoundedSet<T>

type Inner = UpperBoundedSet<T>

The generalized type of the range (for consolidating range types that only differ in whether their bounds are inclusive or exclusive).

type Set = UpperBoundedSet<T>

The set type of the range, for talking about non-contiguous collections of elements.

fn is_empty(&self) -> bool

Returns true if the range is empty.

fn to_inner(self) -> Self::Inner

Convert the range to its inner type.

fn to_set(self) -> Self::Set

Convert the range to its set type.

fn complement<Output>(self) -> Output

where Self: Sized + RangeComplement<Output>,

Returns the complement of self (ie, the set of all elements not in self).

fn intersection<R, Output>(self, other: R) -> Output

where R: Rangetools, Self: Sized + RangeIntersection<R, R::Inner, Output = Output>,

Performs set intersection on self and other.

fn disjoint<R, Output>(self, other: R) -> bool

where R: Rangetools, Output: Rangetools, Self: Sized + RangeIntersection<R, R::Inner, Output = Output>,

Returns true if two sets/ranges are disjoint (they have no elements in common).

fn intersects<R, Output>(self, other: R) -> bool

where R: Rangetools, Output: Rangetools, Self: Sized + RangeIntersection<R, R::Inner, Output = Output>,

Returns true if two sets/ranges intersect (they have at least one element in common).

fn union<R, Output>(self, other: R) -> Output

where R: Rangetools, Self: Sized + RangeUnion<R, R::Set, Output = Output>,

Performs set union on self and other.

impl<T: PartialEq> StructuralPartialEq for UpperBoundedSet<T>