Struct timely::progress::frontier::Antichain [] [src]

pub struct Antichain<T> { /* fields omitted */ }

A set of mutually incomparable elements.

An antichain is a set of partially ordered elements, each of which is incomparable to the others. This antichain implementation allows you to repeatedly introduce elements to the antichain, and which will evict larger elements to maintain the minimal antichain, those incomparable elements no greater than any other element.

Methods

impl<T: PartialOrder> Antichain<T>
[src]

[src]

Updates the Antichain if the element is not greater than or equal to some present element.

Returns true if element is added to the set

[src]

Creates a new empty Antichain.

[src]

Creates a new singleton Antichain.

[src]

Clears the contents of the antichain.

[src]

Sorts the elements so that comparisons between antichains can be made.

[src]

Returns true if any item in the antichain is strictly less than the argument.

[src]

Returns true if any item in the antichain is less than or equal to the argument.

[src]

Returns true if every element of other is greater or equal to some element of self.

Important traits for &'a [u8]
[src]

Reveals the elements in the antichain.

Trait Implementations

impl<T: Default> Default for Antichain<T>
[src]

[src]

Returns the "default value" for a type. Read more

impl<T: Clone> Clone for Antichain<T>
[src]

[src]

Returns a copy of the value. Read more

1.0.0
[src]

Performs copy-assignment from source. Read more

impl<T: Eq> Eq for Antichain<T>
[src]

impl<T: PartialEq> PartialEq for Antichain<T>
[src]

[src]

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

[src]

This method tests for !=.

impl<T: Debug> Debug for Antichain<T>
[src]

[src]

Formats the value using the given formatter. Read more