domtree 0.2.0

dominance relation calculation
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

/// Association set. This trait provides a mapping relation between X and Y.
pub trait AssocSet<X, Y: Clone + Default> {
    /// Given target key, return the associated attribute.
    fn get(&self, target: X) -> Y;
    /// Update the associated attribute of a given key.
    fn set(&mut self, key: X, val: Y);
}

/// Membership set. This is used to maintain the dominance frontiers.
pub trait MemberSet<T> {
    type MemberIter<'a>: Iterator<Item = T>
    where
        Self: 'a;
    /// Check if the set contains a target.
    fn contains(&self, target: T) -> bool;

    /// Iterate all members
    fn iter(&self) -> Self::MemberIter<'_>;

    /// Insert a new element to the set. The data structure is expected to maintain the
    /// uniqueness of its member on itself.
    fn insert(&mut self, target: T);
}

#[cfg(feature = "materialized_idf")]
/// Similar to [`MemberSet`] but also provides merge operations
pub trait MergeSet<T>: MemberSet<T> {
    /// Check subset relation.
    fn subset(&self, other: &Self) -> bool;
    /// Collect all elements from the other set into current set.
    fn union(&mut self, other: &Self);
}