|
Awkl
|
Namespaces | |
| namespace | set |
Functions | |
| auto | set::_setFromArr (A, R) |
| auto | set::new (x, R, sep) |
| Create a new set A set is an array with keys of unique values of the original array, and empty values A drawback of this approach is that original values are coerced into strings, so number values could be merged with strings. | |
| auto | set::add (R, x, sep) |
| Add elements to a set. | |
| auto | set::rm (R, x) |
| Remove element of a set. | |
| auto | set::union (S1, S2, R) |
| Union (∪) | |
| auto | set::inter (S1, S2, R) |
| Intersection (∩) | |
| auto | set::diff (S1, S2, R) |
| Difference (−) | |
| auto | set::symdiff (S1, S2, R) |
| Symmetric difference (⊕) | |
| auto | set::eq (S1, S2) |
| Equality (=) | |
| auto | set::ne (S1, S2) |
| Inequality (≠) | |
| auto | set::subset (S1, S2) |
| auto | set::ssubset (S1, S2) |
| auto | set::superset (S1, S2) |
| auto | set::ssuperset (S1, S2) |
| auto | set::disjoint (S1, S2) |
| Are disjoint (⊥) | |
| auto | set::inside (x, S) |
| Is element of (∈) | |
| auto | set::contains (S, x) |
| Contains (∋) | |
| auto | set::card (S) |
| Cardinality. | |
| auto | set::pop (x) |