sets

nimony/lib/std/sets.nim

• type HashSet = object
    t: Table[T,bool]

• func initHashSet(): HashSet[T]

  Constructs an empty HashSet.

• func incl(s: var HashSet[T]; x: sink T)

  Inserts x into s.

• func excl(s: var HashSet[T]; x: T)

  Removes x from s if present.

• func contains(s: HashSet[T]; x: T): bool

  True if x is in s.

• func containsOrIncl(s: var HashSet[T]; x: T): bool

  True if x was already present; otherwise inserts it and returns false.

• func missingOrExcl(s: var HashSet[T]; x: T): bool

  Returns true if x was not in s (the element was missing). Otherwise removes x from s and returns false.

• iterator items(s: HashSet[T]): lent T

  Yields each element currently stored in s.

• func len(s: HashSet[T]): int64

  Number of elements in the set.

• func intersection(a: HashSet[T]; b: HashSet[T]): HashSet[T]

  Elements present in both a and b.

• func incl(s: var HashSet[T]; other: HashSet[T])

  Union other into s.

• func excl(s: var HashSet[T]; other: HashSet[T])

  Remove every element of other from s.