Skip to content

module internal.types.collections.set

module `internal.types.collections.set`¶

Source: stdlib/internal/types/collections/set.codon

`Set[K]`¶

Fields¶

`K`: `type`¶

Magic methods¶

`init(self)`¶

`init(self, g: Generator[K])`¶

`sub(self, other: Set[K])`¶

`isub(self, other: Set[K])`¶

`and(self, other: Set[K])` @commutative Binary operator is commutative @associative Binary operator is associative ¶

`iand(self, other: Set[K])`¶

`or(self, other: Set[K])` @commutative Binary operator is commutative @associative Binary operator is associative ¶

`ior(self, other: Set[K])`¶

`xor(self, other: Set[K])` @commutative Binary operator is commutative @associative Binary operator is associative ¶

`ixor(self, other: Set[K])`¶

`contains(self, key: K)`¶

`eq(self, other: Set[K])`¶

`ne(self, other: Set[K])`¶

`le(self, other: Set[K])`¶

`ge(self, other: Set[K])`¶

`lt(self, other: Set[K])`¶

`gt(self, other: Set[K])`¶

`iter(self)`¶

`len(self)`¶

`bool(self)`¶

`copy(self)`¶

`deepcopy(self)`¶

`repr(self)`¶

Methods¶

`resize(self, new_n_buckets: int)`¶

`add(self, key: K)`¶

`update(self, other: Generator[K])`¶

`remove(self, key: K)`¶

`pop(self)`¶

`discard(self, key: K)`¶

`difference(self, other: Set[K])`¶

`difference_update(self, other: Set[K])`¶

`intersection(self, other: Set[K])`¶

`intersection_update(self, other: Set[K])`¶

`symmetric_difference(self, other: Set[K])`¶

`symmetric_difference_update(self, other: Set[K])`¶

`union(self, other: Set[K])`¶

`isdisjoint(self, other: Set[K])`¶

`issubset(self, other: Set[K])`¶

`issuperset(self, other: Set[K])`¶

`clear(self)`¶

`copy(self)`¶

`set` = `Set`¶