[−][src]Struct pergola::BTreeSetWithIntersection

pub struct BTreeSetWithIntersection<U: Clone + Ord> { /* fields omitted */ }

This is the same semantics as the BitSetWithIntersection lattice, but covering sets of arbitrary ordered values.

Trait Implementations

impl<U: Debug + Clone + Ord> Debug for BTreeSetWithIntersection<U>[src]

impl<U: Clone + Ord> LatticeDef for BTreeSetWithIntersection<U>[src]

type T = Option<BTreeSet<U>>

Auto Trait Implementations

impl<U> RefUnwindSafe for BTreeSetWithIntersection<U> where
    U: RefUnwindSafe, 

impl<U> Send for BTreeSetWithIntersection<U> where
    U: Send, 

impl<U> Sync for BTreeSetWithIntersection<U> where
    U: Sync, 

impl<U> Unpin for BTreeSetWithIntersection<U> where
    U: Unpin, 

impl<U> UnwindSafe for BTreeSetWithIntersection<U> where
    U: UnwindSafe, 

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.