module arch.system.state.resource_machine.primitive_interfaces.set;

Set primitive interface¶

A set is an unordered data structure that contains only distinct elements.

The interface¶

For a set parametrised over the element type T:

new() -> Set - creates an empty set.
new(List) -> Set - creates a set from the given list of elements. If the list contains duplicating elements, ignores them.
size(Set) -> Nat - returns the number of elements in the set.
insert(Set, T) -> Set - adds an element of type T to the set.
union(Set, Set) -> Set - computes the union of two sets.
intersection(Set, Set) -> Set - computes the intersection of two sets.
difference(Set, Set) -> Set - computes the difference of two sets. Note that this operation is not commutative.
disjointUnion(Set, Set) -> Set - computes the union of two sets. If the sets intersect, returns an error.
contains(Set, T) -> Bool - checks if an element is in the set.


classDiagram

    class ISet~T~ {
         <<Interface>>
         new() Set
         new(List) Set
         size(Set) Nat
         insert(Set, T) Set
         union(Set, Set) Set
         intersection(Set, Set) Set
         difference(Set, Set) Set
         disjointUnion(Set, Set) Set
         contains(Set, T) Bool
    }

    class IList~T~ {
         <<Interface>>
    }

    ISet <|-- IList

    ISet <-- Set

    IList <-- List

Used in¶

Transaction