HashSet[A: Any #share, H: HashFunction[A] val]

[Source]

A set, built on top of persistent Map. This is implemented as map of an alias of a type to itself.

class val HashSet[A: Any #share, H: HashFunction[A] val] is
  Comparable[HashSet[A, H] box] ref

Implements

• Comparable[HashSet[A, H] box] ref

Constructors

create

[Source]

new val create()
: HashSet[A, H] val^

Returns

• HashSet[A, H] val^

_create

[Source]

new val _create(
  map': HashMap[A, A, H] val)
: HashSet[A, H] val^

Parameters

• map': HashMap[A, A, H] val

Returns

• HashSet[A, H] val^

Public Functions

size

[Source]

Return the number of elements in the set.

fun box size()
: USize val

Returns

• USize val

apply

[Source]

Return the value if it is in the set, otherwise raise an error.

fun box apply(
  value: val->A)
: val->A ?

Parameters

• value: val->A

Returns

• val->A ?

contains

[Source]

Check whether the set contains the value.

fun box contains(
  value: val->A)
: Bool val

Parameters

• value: val->A

Returns

• Bool val

add

[Source]

Return a set with the value added.

fun val add(
  value: val->A)
: HashSet[A, H] val

Parameters

• value: val->A

Returns

• HashSet[A, H] val

sub

[Source]

Return a set with the value removed.

fun val sub(
  value: val->A)
: HashSet[A, H] val

Parameters

• value: val->A

Returns

• HashSet[A, H] val

op_or

[Source]

Return a set with the elements of both this and that.

fun val op_or(
  that: (HashSet[A, H] val | Iterator[A] ref))
: HashSet[A, H] val

Parameters

• that: (HashSet[A, H] val | Iterator[A] ref)

Returns

• HashSet[A, H] val

op_and

[Source]

Return a set with the elements that are in both this and that.

fun val op_and(
  that: (HashSet[A, H] val | Iterator[A] ref))
: HashSet[A, H] val

Parameters

• that: (HashSet[A, H] val | Iterator[A] ref)

Returns

• HashSet[A, H] val

op_xor

[Source]

Return a set with elements that are in either this or that, but not both.

fun val op_xor(
  that: (HashSet[A, H] val | Iterator[A] ref))
: HashSet[A, H] val

Parameters

• that: (HashSet[A, H] val | Iterator[A] ref)

Returns

• HashSet[A, H] val

without

[Source]

Return a set with the elements of this that are not in that.

fun val without(
  that: (HashSet[A, H] val | Iterator[A] ref))
: HashSet[A, H] val

Parameters

• that: (HashSet[A, H] val | Iterator[A] ref)

Returns

• HashSet[A, H] val

eq

[Source]

Return true if this and that contain the same elements.

fun box eq(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val

lt

[Source]

Return true if every element in this is also in that, and this has fewer elements than that.

fun box lt(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val

le

[Source]

Return true if every element in this is also in that.

fun box le(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val

gt

[Source]

Return true if every element in that is also in this, and this has more elements than that.

fun box gt(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val

ge

[Source]

Return true if every element in that is also in this.

fun box ge(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val

values

[Source]

Return an iterator over the values in the set.

fun box values()
: Iterator[A] ref^

Returns

• Iterator[A] ref^

compare

[Source]

fun box compare(
  that: HashSet[A, H] box)
: (Less val | Equal val | Greater val)

Parameters

• that: HashSet[A, H] box

Returns

• (Less val | Equal val | Greater val)

ne

[Source]

fun box ne(
  that: HashSet[A, H] box)
: Bool val

Parameters

• that: HashSet[A, H] box

Returns

• Bool val