Struct VecSortedSet 

pub struct VecSortedSet<T>(/* private fields */);

an array-set. very efficient for small sets.

for explanations about the methods, see BTreeSet and Vec.

Implementations

impl<T> VecSortedSet<T>

where T: Ord,

pub fn new() -> Self

pub fn with_capacity(n: usize) -> Self

pub fn capacity(&self) -> usize

pub fn reserve(&mut self, n: usize)

pub fn shrink_to_fit(&mut self)

pub fn clear(&mut self)

pub fn contains<Q>(&self, e: &Q) -> bool

where T: Borrow<Q>, Q: Ord + ?Sized,

O(log(len))

pub fn get<Q>(&self, e: &Q) -> Option<&T>

where T: Borrow<Q>, Q: Ord + ?Sized,

O(log(len))

pub fn get_mut<Q>(&mut self, e: &Q) -> Option<&mut T>

where T: Borrow<Q>, Q: Ord + ?Sized,

O(log(len))

pub fn insert(&mut self, e: T) -> Option<T>

O(log(len)) when e already exists. O(len) for inserting a new element, caused by shifting all elements after it, which can be avoided by always inserting in order.

pub fn remove<Q>(&mut self, e: &Q) -> Option<T>

where T: Borrow<Q>, Q: Ord + ?Sized,

O(log(len)) when e does not exist. O(len) for removing an element, because of the need for shifting all elements after it.

pub fn append(&mut self, other: &mut VecSortedSet<T>)

pub fn reserve_exact(&mut self, n: usize)

pub fn pop(&mut self) -> Option<T>

pub fn truncate(&mut self, n: usize)

pub fn retain<F>(&mut self, f: F)

where F: FnMut(&T) -> bool,

pub fn split_off(&mut self, at: usize) -> VecSortedSet<T>

pub fn is_disjoint(&self, other: &VecSortedSet<T>) -> bool

pub fn is_subset(&self, other: &VecSortedSet<T>) -> bool

pub fn is_superset(&self, other: &VecSortedSet<T>) -> bool

pub fn union<'a>(&'a self, other: &'a VecSortedSet<T>) -> Union<'a, T>

pub fn intersection<'a>( &'a self, other: &'a VecSortedSet<T>, ) -> Intersection<'a, T>

pub fn difference<'a>(&'a self, other: &'a VecSortedSet<T>) -> Difference<'a, T>

pub fn symmetric_difference<'a>( &'a self, other: &'a VecSortedSet<T>, ) -> SymmetricDifference<'a, T>

impl<T> VecSortedSet<T>

pub fn view_content<'a>(&'a self) -> &'a Vec<T>

a view for the underlying vec. &self methods for Vec such as get and split can be accessed through this.

pub fn iter(&self) -> Iter<'_, T>

iterate over the underlying vec.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

Trait Implementations

impl<'a, 'b, T> BitAnd<&'b VecSortedSet<T>> for &'a VecSortedSet<T>

where T: Ord + Clone,

fn bitand(self, other: &VecSortedSet<T>) -> VecSortedSet<T>

intersection with cloned members.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((&s1 & &s2).view_content(), &[2,3]);

type Output = VecSortedSet<T>

The resulting type after applying the & operator.

impl<T> BitAnd for VecSortedSet<T>

where T: Ord,

fn bitand(self, other: VecSortedSet<T>) -> VecSortedSet<T>

intersection.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((s1 & s2).view_content(), &[2,3]);

type Output = VecSortedSet<T>

The resulting type after applying the & operator.

impl<'a, 'b, T> BitOr<&'b VecSortedSet<T>> for &'a VecSortedSet<T>

where T: Ord + Clone,

fn bitor(self, other: &VecSortedSet<T>) -> VecSortedSet<T>

union with cloned members.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((&s1 | &s2).view_content(), &[1,2,3,4]);

type Output = VecSortedSet<T>

The resulting type after applying the | operator.

impl<T> BitOr for VecSortedSet<T>

where T: Ord,

fn bitor(self, other: VecSortedSet<T>) -> VecSortedSet<T>

union.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((s1 | s2).view_content(), &[1,2,3,4]);

type Output = VecSortedSet<T>

The resulting type after applying the | operator.

impl<'a, 'b, T> BitXor<&'b VecSortedSet<T>> for &'a VecSortedSet<T>

where T: Ord + Clone,

fn bitxor(self, other: &VecSortedSet<T>) -> VecSortedSet<T>

symmetric difference with cloned members.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((&s1 ^ &s2).view_content(), &[1,4]);

type Output = VecSortedSet<T>

The resulting type after applying the ^ operator.

impl<T> BitXor for VecSortedSet<T>

where T: Ord,

fn bitxor(self, other: VecSortedSet<T>) -> VecSortedSet<T>

symmetric difference.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((s1 ^ s2).view_content(), &[1,4]);

type Output = VecSortedSet<T>

The resulting type after applying the ^ operator.

impl<T: Clone> Clone for VecSortedSet<T>

fn clone(&self) -> VecSortedSet<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for VecSortedSet<T>

where T: Ord + Debug,

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

Formats the value using the given formatter.

impl<T: Default> Default for VecSortedSet<T>

fn default() -> VecSortedSet<T>

Returns the “default value” for a type.

impl<'a, T> Extend<&'a T> for VecSortedSet<T>

where T: Ord + Copy,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = &'a T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<T> for VecSortedSet<T>

where T: Ord,

fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = T>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

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

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

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

Reserves capacity in a collection for the given number of additional elements.

impl<T> FromIterator<T> for VecSortedSet<T>

where T: Ord,

fn from_iter<I>(iter: I) -> VecSortedSet<T>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T: Hash> Hash for VecSortedSet<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<'a, T, Q> Index<&'a Q> for VecSortedSet<T>

where T: Ord + Borrow<Q>, Q: Ord + ?Sized,

type Output = T

The returned type after indexing.

fn index(&self, k: &Q) -> &T

Performs the indexing (container[index]) operation.

impl<'a, T: 'a> IntoIterator for &'a VecSortedSet<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, T>

Creates an iterator from a value.

impl<T> IntoIterator for VecSortedSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<T>

Creates an iterator from a value.

impl<T: Ord> Ord for VecSortedSet<T>

fn cmp(&self, other: &VecSortedSet<T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq for VecSortedSet<T>

fn eq(&self, other: &VecSortedSet<T>) -> 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<T: PartialOrd> PartialOrd for VecSortedSet<T>

fn partial_cmp(&self, other: &VecSortedSet<T>) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T> Set<T> for VecSortedSet<T>

where T: Ord,

fn fun<'a, Q>(&'a self) -> Box<dyn Fn(&Q) -> Option<&'a T> + 'a>

where T: Borrow<Q>, Q: Ord + ?Sized,

a set maps from items to themselves.

fn inc(self, i: T) -> Self

adds item i.

fn dec<Q>(self, i: &Q) -> Self

where T: Borrow<Q>, Q: Ord + ?Sized,

removes item i.

fn zero(self) -> Self

clear.

fn shrink(self) -> Self

shrink_to_fit.

fn plus<I>(self, coll: I) -> Self

where I: IntoIterator<Item = T>,

pours another collection into this one.

impl<'a, 'b, T> Sub<&'b VecSortedSet<T>> for &'a VecSortedSet<T>

where T: Ord + Clone,

fn sub(self, other: &VecSortedSet<T>) -> VecSortedSet<T>

difference with cloned members.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((&s1 - &s2).view_content(), &[1]);

type Output = VecSortedSet<T>

The resulting type after applying the - operator.

impl<T> Sub for VecSortedSet<T>

where T: Ord,

fn sub(self, other: VecSortedSet<T>) -> VecSortedSet<T>

difference.

example

use protocoll::set::VecSortedSet;
let s1:VecSortedSet<_> = vec![1,2,3].into_iter().collect();
let s2:VecSortedSet<_> = vec![2,3,4].into_iter().collect();
assert_eq!((s1 - s2).view_content(), &[1]);

type Output = VecSortedSet<T>

The resulting type after applying the - operator.

impl<T: Eq> Eq for VecSortedSet<T>

impl<T> StructuralPartialEq for VecSortedSet<T>