partisan_interval_sets (partisan v5.0.2)
View SourceAn implementation of a set of bounded open intervals.
Summary
Functions
Return OrdSet with Element inserted in it. -----------------------------------------------------------------------------
Return OrdSet but with Element removed. -----------------------------------------------------------------------------
Filter OrdSet with Fun. -----------------------------------------------------------------------------
Return the number of points in the Ordset. -----------------------------------------------------------------------------
Fold function Fun over all elements in OrdSet and return Accumulator. -----------------------------------------------------------------------------
Build an ordered set from the elements in List. -----------------------------------------------------------------------------
Return the intersection of the list of interval sets. -----------------------------------------------------------------------------
Return the intersection of IntervalSet1 and IntervalSet2. -----------------------------------------------------------------------------
Check whether IntervalSet1 and IntervalSet2 are disjoint. -----------------------------------------------------------------------------
Return 'true' if Element is an element of Sets, else 'false'. -----------------------------------------------------------------------------
Return 'true' if OrdSet is an empty set, otherwise 'false'. -----------------------------------------------------------------------------
Return 'true' when every element of IntervalSet1 is also a member of IntervalSet2, else 'false'. -----------------------------------------------------------------------------
Return 'true' if Set is an ordered set of elements, else 'false'. -----------------------------------------------------------------------------
Returns the maximum integer value contained in the set. -----------------------------------------------------------------------------
Returns the minimum integer value contained in the set. -----------------------------------------------------------------------------
Return a new empty offset. -----------------------------------------------------------------------------
Return the number of elements in OrdSet. -----------------------------------------------------------------------------
Return all and only the elements of IntervalSet1 which are not also in IntervalSet2. -----------------------------------------------------------------------------
Return the points in OrdSet as a list. -----------------------------------------------------------------------------
Return the elements in OrdSet as a list. -----------------------------------------------------------------------------
Return the union of the list of interval sets. -----------------------------------------------------------------------------
Return the union of IntervalSet1 and IntervalSet2. -----------------------------------------------------------------------------
Types
Functions
Return OrdSet with Element inserted in it. -----------------------------------------------------------------------------
Return OrdSet but with Element removed. -----------------------------------------------------------------------------
-spec filter(Pred, Set1) -> Set2 when Pred :: fun((Element :: element()) -> boolean()), Set1 :: t(), Set2 :: t().
Filter OrdSet with Fun. -----------------------------------------------------------------------------
-spec flat_size(t()) -> non_neg_integer().
Return the number of points in the Ordset. -----------------------------------------------------------------------------
-spec fold(Function, Acc0, Sets) -> Acc1 when Function :: fun((Element :: element(), AccIn :: term()) -> AccOut :: term()), Sets :: t(), Acc0 :: term(), Acc1 :: term().
Fold function Fun over all elements in OrdSet and return Accumulator. -----------------------------------------------------------------------------
Build an ordered set from the elements in List. -----------------------------------------------------------------------------
Return the intersection of the list of interval sets. -----------------------------------------------------------------------------
Return the intersection of IntervalSet1 and IntervalSet2. -----------------------------------------------------------------------------
Check whether IntervalSet1 and IntervalSet2 are disjoint. -----------------------------------------------------------------------------
Return 'true' if Element is an element of Sets, else 'false'. -----------------------------------------------------------------------------
Return 'true' if OrdSet is an empty set, otherwise 'false'. -----------------------------------------------------------------------------
Return 'true' when every element of IntervalSet1 is also a member of IntervalSet2, else 'false'. -----------------------------------------------------------------------------
Return 'true' if Set is an ordered set of elements, else 'false'. -----------------------------------------------------------------------------
Returns the maximum integer value contained in the set. -----------------------------------------------------------------------------
Returns the minimum integer value contained in the set. -----------------------------------------------------------------------------
-spec new() -> [].
Return a new empty offset. -----------------------------------------------------------------------------
-spec size(t()) -> non_neg_integer().
Return the number of elements in OrdSet. -----------------------------------------------------------------------------
Return all and only the elements of IntervalSet1 which are not also in IntervalSet2. -----------------------------------------------------------------------------
Return the points in OrdSet as a list. -----------------------------------------------------------------------------
Return the elements in OrdSet as a list. -----------------------------------------------------------------------------
Return the union of the list of interval sets. -----------------------------------------------------------------------------
Return the union of IntervalSet1 and IntervalSet2. -----------------------------------------------------------------------------