ISet<A>

mixin ISet<A> on RIterable<A>, RSet<A>

An immutable, unordered set with no duplicate elements.

ISet uses a small-set optimization for up to four elements, backed by IHashSet (a CHAMP trie) for larger collections.

Construct with iset, ISet.of, ISet.from, or ISet.empty. Use ISet.builder when building incrementally.

final s = iset([1, 2, 3]);
final s2 = s + 4;        // ISet(1, 2, 3, 4)
final s3 = s2 - 2;       // ISet(1, 3, 4)
s3.contains(1);           // true

Available Extensions

• ISetNestedOps<A>
• RibsIterableTuple2Ops<A, B>
• RIterableDoubleOps
• RIterableIntOps
• RIterableNested2Ops<A>
• RIterableTuple2Ops<A, B>

Superclass Constraints

• RIterable<A>
• RSet<A>

Properties

hashCode no setter override

int get hashCode

The hash code for this object.

A hash code is a single integer which represents the state of the object that affects operator == comparisons.

All objects have hash codes. The default hash code implemented by Object represents only the identity of the object, the same way as the default operator == implementation only considers objects equal if they are identical (see identityHashCode).

If operator == is overridden to use the object state instead, the hash code must also be changed to represent that state, otherwise the object cannot be used in hash based data structures like the default Set and Map implementations.

Hash codes must be the same for objects that are equal to each other according to operator ==. The hash code of an object should only change if the object changes in a way that affects equality. There are no further requirements for the hash codes. They need not be consistent between executions of the same program and there are no distribution guarantees.

Objects that are not equal are allowed to have the same hash code. It is even technically allowed that all instances have the same hash code, but if clashes happen too often, it may reduce the efficiency of hash-based data structures like HashSet or HashMap.

If a subclass overrides hashCode, it should override the operator == operator as well to maintain consistency.

Implementation

@override
int get hashCode => MurmurHash3.setHash(this);

head no setter inherited

A get head

Returns the first element of this collection, or throws if it is empty.

Inherited from RIterable.

Implementation

A get head => iterator.next();

headOption no setter inherited

Option<A> get headOption

Returns the first element of this collection as a Some if non-empty. If this collction is empty, None is returned.

Inherited from RIterable.

Implementation

Option<A> get headOption {
  final it = iterator;
  return Option.when(() => it.hasNext, () => it.next());
}

init no setter override

ISet<A> get init

Returns all elements from this collection except the last. If this collection is empty, an empty collection is returned.

Implementation

@override
ISet<A> get init => this - last;

inits no setter override

RIterator<ISet<A>> get inits

Returns an iterator of all potential tails of this collection, starting with the entire collection and ending with an empty one.

Implementation

@override
RIterator<ISet<A>> get inits => super.inits.map((a) => a.toISet());

isEmpty no setter inherited

bool get isEmpty

Whether this collection contains no elements.

Inherited from RIterableOnce.

Implementation

bool get isEmpty => switch (knownSize) {
  -1 => !iterator.hasNext,
  0 => true,
  _ => false,
};

isNotEmpty no setter inherited

bool get isNotEmpty

Whether this collection contains at least one element.

Inherited from RIterableOnce.

Implementation

bool get isNotEmpty => !isEmpty;

isTraversableAgain no setter inherited

bool get isTraversableAgain

Whether this collection can be traversed more than once.

Always false for a bare RIterableOnce; overridden to true by RIterable and its subtypes.

Inherited from RIterableOnce.

Implementation

bool get isTraversableAgain => false;

iterator no setter inherited

RIterator<A> get iterator

Returns an RIterator over the elements of this collection.

Inherited from RIterableOnce.

Implementation

RIterator<A> get iterator;

knownSize no setter inherited

int get knownSize

Returns the number of elements in this collection, if that number is already known. If not, -1 is returned.

Inherited from RIterableOnce.

Implementation

int get knownSize => -1;

last no setter inherited

A get last

Returns the last element of this collection, or throws if it is empty.

Inherited from RIterable.

Implementation

A get last {
  final it = iterator;
  var lst = it.next();

  while (it.hasNext) {
    lst = it.next();
  }

  return lst;
}

lastOption no setter inherited

Option<A> get lastOption

Returns the last element of this collection as a Some, or None if this collection is empty.

Inherited from RIterable.

Implementation

Option<A> get lastOption {
  if (isEmpty) {
    return none();
  } else {
    final it = iterator;
    var last = it.next();

    while (it.hasNext) {
      last = it.next();
    }

    return Some(last);
  }
}

nonEmpty no setter inherited

bool get nonEmpty

Whether this collection contains at least one element.

Inherited from RIterableOnce.

Implementation

bool get nonEmpty => !isEmpty;

runtimeType no setter inherited

Type get runtimeType

A representation of the runtime type of the object.

Inherited from Object.

Implementation

external Type get runtimeType;

size no setter inherited

int get size

Returns the number of elements in this collection.

Inherited from RIterableOnce.

Implementation

int get size {
  if (knownSize >= 0) {
    return knownSize;
  } else {
    final it = iterator;
    var len = 0;

    while (it.hasNext) {
      len += 1;
      it.next();
    }

    return len;
  }
}

tail no setter override

ISet<A> get tail

Returns a new collection with the first element removed. If this collection is empty, an empty collection is returned.

Implementation

@override
ISet<A> get tail => super.tail.toISet();

tails no setter override

RIterator<ISet<A>> get tails

Returns an iterator of all potential tails of this collection, starting with the entire collection and ending with an empty one.

Implementation

@override
RIterator<ISet<A>> get tails => super.tails.map((a) => a.toISet());

Methods

collect() override

ISet<B> collect<B>(Option<B> Function(A) f)

Returns a new collection by applying f to each element an only keeping results of type Some.

Implementation

@override
ISet<B> collect<B>(Function1<A, Option<B>> f) => super.collect(f).toISet();

collectFirst() inherited

Option<B> collectFirst<B>(Option<B> Function(A) f)

Applies f to each element of this collection, returning the first element that results in a Some, if any.

Inherited from RIterableOnce.

Implementation

Option<B> collectFirst<B>(Function1<A, Option<B>> f) {
  final it = iterator;

  while (it.hasNext) {
    final x = f(it.next());
    if (x.isDefined) return x;
  }

  return none();
}

concat() override

ISet<A> concat(RIterableOnce<A> suffix)

Returns a copy of this collection, with elems added to the end.

Implementation

@override
ISet<A> concat(RIterableOnce<A> suffix) {
  var result = this;
  final it = suffix.iterator;

  while (it.hasNext) {
    result = result + it.next();
  }

  return result;
}

contains() inherited

bool contains(A elem)

Returns true if elem is a member of this set.

Inherited from RSet.

Implementation

bool contains(A elem);

copyToArray() inherited

int copyToArray(Array<A> xs, [int start = 0, int? n])

Copies elements into xs starting at start, writing at most n elements (or all remaining capacity when n is omitted).

Returns the number of elements actually copied.

Inherited from RIterableOnce.

Implementation

int copyToArray(Array<A> xs, [int start = 0, int? n]) {
  final it = iterator;
  final end = start + min(n ?? Integer.maxValue, xs.length - start);
  var i = start;

  while (i < end && it.hasNext) {
    xs[i] = it.next();
    i += 1;
  }

  return i - start;
}

corresponds() inherited

bool corresponds<B>(RIterable<B> that, bool Function(A, B) p)

Returns true if this collection has the same size as that and each corresponding element from this and that satisfies the given predicate p.

Inherited from RIterableOnce.

Implementation

bool corresponds<B>(
  covariant RIterable<B> that,
  Function2<A, B, bool> p,
) {
  final a = iterator;
  final b = that.iterator;

  while (a.hasNext && b.hasNext) {
    if (!p(a.next(), b.next())) return false;
  }

  return !a.hasNext && !b.hasNext;
}

count() inherited

int count(bool Function(A) p)

Return the number of elements in this collection that satisfy the given predicate.

Inherited from RIterableOnce.

Implementation

int count(Function1<A, bool> p) {
  var res = 0;
  final it = iterator;

  while (it.hasNext) {
    if (p(it.next())) res += 1;
  }

  return res;
}

diff()

ISet<A> diff(ISet<A> that)

Returns the elements of this set that are not in that.

Implementation

ISet<A> diff(ISet<A> that) =>
    foldLeft(ISet.empty<A>(), (result, elem) => that.contains(elem) ? result : result + elem);

drop() override

ISet<A> drop(int n)

Returns a new collection with the first n elements removed.

Implementation

@override
ISet<A> drop(int n) => super.drop(n).toISet();

dropRight() override

ISet<A> dropRight(int n)

Return a new collection with the last n elements removed.

Implementation

@override
ISet<A> dropRight(int n) => super.dropRight(n).toISet();

dropWhile() override

ISet<A> dropWhile(bool Function(A) p)

Returns a new collection with leading elements satisfying p removed.

Implementation

@override
ISet<A> dropWhile(Function1<A, bool> p) => super.dropWhile(p).toISet();

excl()

ISet<A> excl(A elem)

Returns a new set with elem removed. Returns this set unchanged if elem is not a member.

Implementation

ISet<A> excl(A elem);

exists() inherited

bool exists(bool Function(A) p)

Returns true if any element of this collection satisfies the given predicate, false if no elements satisfy it.

Inherited from RIterableOnce.

Implementation

bool exists(Function1<A, bool> p) {
  var res = false;
  final it = iterator;

  while (!res && it.hasNext) {
    res = p(it.next());
  }

  return res;
}

filter() override

ISet<A> filter(bool Function(A) p)

Returns a new collection containing only elements that satisfy p.

Implementation

@override
ISet<A> filter(Function1<A, bool> p) => super.filter(p).toISet();

filterNot() override

ISet<A> filterNot(bool Function(A) p)

Returns a new collection containing only elements that do not satisfy p.

Implementation

@override
ISet<A> filterNot(Function1<A, bool> p) => super.filterNot(p).toISet();

find() inherited

Option<A> find(bool Function(A) p)

Returns the first element from this collection that satisfies the given predicate p. If no element satisfies p, None is returned.

Inherited from RIterableOnce.

Implementation

Option<A> find(Function1<A, bool> p) {
  final it = iterator;

  while (it.hasNext) {
    final a = it.next();
    if (p(a)) return Some(a);
  }

  return none();
}

flatMap() override

ISet<B> flatMap<B>(RIterableOnce<B> Function(A) f)

Returns a new collection by applying f to each element and concatenating the results.

Implementation

@override
ISet<B> flatMap<B>(Function1<A, RIterableOnce<B>> f) => views.FlatMap(this, f).toISet();

fold() inherited

A fold(A init, A Function(A, A) op)

Alias for foldLeft with a same-type accumulator.

Inherited from RIterable.

Implementation

A fold(A init, Function2<A, A, A> op) => foldLeft(init, op);

foldLeft() inherited

B foldLeft<B>(B z, B Function(B, A) op)

Returns a summary value by applying op to all elements of this collection, moving from left to right. The fold uses a seed value of z.

Inherited from RIterableOnce.

Implementation

B foldLeft<B>(B z, Function2<B, A, B> op) {
  var result = z;
  final it = iterator;

  while (it.hasNext) {
    result = op(result, it.next());
  }

  return result;
}

foldRight() inherited

B foldRight<B>(B z, B Function(A, B) op)

Returns a summary value by applying op to all elements of this collection, moving from right to left. The fold uses a seed value of z.

Inherited from RIterableOnce.

Implementation

B foldRight<B>(B z, Function2<A, B, B> op) => _reversed().foldLeft(z, (b, a) => op(a, b));

forall() inherited

bool forall(bool Function(A) p)

Returns true if all elements of this collection satisfy the given predicate, false if any elements do not.

Inherited from RIterableOnce.

Implementation

bool forall(Function1<A, bool> p) {
  var res = true;
  final it = iterator;

  while (res && it.hasNext) {
    res = p(it.next());
  }

  return res;
}

foreach() inherited

void foreach<U>(U Function(A) f)

Applies f to each element of this collection, discarding any resulting values.

Inherited from RIterableOnce.

Implementation

void foreach<U>(Function1<A, U> f) {
  final it = iterator;
  while (it.hasNext) {
    f(it.next());
  }
}

groupBy() override

IMap<K, ISet<A>> groupBy<K>(K Function(A) f)

Partitions all elements of this collection by applying f to each element and accumulating duplicate keys in the returned IMap.

Implementation

@override
IMap<K, ISet<A>> groupBy<K>(Function1<A, K> f) => super.groupBy(f).mapValues((a) => a.toISet());

grouped() override

RIterator<ISet<A>> grouped(int size)

Returns a new iterator where each element is a collection of size elements from the original collection. The last element may contain less than size elements.

Implementation

@override
RIterator<ISet<A>> grouped(int size) => super.grouped(size).map((a) => a.toISet());

groupMap() override

IMap<K, ISet<B>> groupMap<K, B>(K Function(A) key, B Function(A) f)

Creates a new map by generating a key-value pair for each elements of this collection using key and f. Any elements that generate the same key will have the resulting values accumulated in the returned map.

Implementation

@override
IMap<K, ISet<B>> groupMap<K, B>(
  Function1<A, K> key,
  Function1<A, B> f,
) => super.groupMap(key, f).mapValues((a) => a.toISet());

groupMapReduce() inherited

IMap<K, B> groupMapReduce<K, B>(
  K Function(A) key,
  B Function(A) f,
  B Function(B, B) reduce,
)

Partitions all elements of this collection by applying key to each element. Additionally f is applied to each element to generate a value. If multiple values are generating for the same key, those values will be combined using reduce.

Inherited from RIterable.

Implementation

IMap<K, B> groupMapReduce<K, B>(
  Function1<A, K> key,
  Function1<A, B> f,
  Function2<B, B, B> reduce,
) {
  final m = <K, B>{};

  foreach((elem) {
    m.update(key(elem), (b) => reduce(b, f(elem)), ifAbsent: () => f(elem));
  });

  return IMap.fromDart(m);
}

incl()

ISet<A> incl(A elem)

Returns a new set that contains elem in addition to all elements of this set. Returns this set unchanged if elem is already a member.

Implementation

ISet<A> incl(A elem);

intersect()

ISet<A> intersect(ISet<A> that)

Returns the elements that are present in both this set and that.

Implementation

ISet<A> intersect(ISet<A> that) => filter(that.contains).toISet();

map() override

ISet<B> map<B>(B Function(A) f)

Returns a new collection by applying f to each element.

Implementation

@override
ISet<B> map<B>(Function1<A, B> f) => views.Map(this, f).toISet();

maxByOption() inherited

Option<A> maxByOption<B>(B Function(A) f, Order<B> order)

Finds the largest element in this collection by applying f to each element and using the given Order to find the greatest.

If this collection is empty, None is returned.

Inherited from RIterableOnce.

Implementation

Option<A> maxByOption<B>(Function1<A, B> f, Order<B> order) => _minMaxByOption(f, order.max);

maxOption() inherited

Option<A> maxOption(Order<A> order)

Finds the largest element in this collection according to the given Order.

If this collection is empty, None is returned.

Inherited from RIterableOnce.

Implementation

Option<A> maxOption(Order<A> order) => switch (knownSize) {
  0 => none(),
  _ => _reduceOptionIterator(iterator, order.max),
};

minByOption() inherited

Option<A> minByOption<B>(B Function(A) f, Order<B> order)

Finds the smallest element in this collection by applying f to each element and using the given Order to find the greatest.

If this collection is empty, None is returned.

Inherited from RIterableOnce.

Implementation

Option<A> minByOption<B>(Function1<A, B> f, Order<B> order) => _minMaxByOption(f, order.min);

minOption() inherited

Option<A> minOption(Order<A> order)

Finds the largest element in this collection according to the given Order.

If this collection is empty, None is returned.

Inherited from RIterableOnce.

Implementation

Option<A> minOption(Order<A> order) => switch (knownSize) {
  0 => none(),
  _ => _reduceOptionIterator(iterator, order.min),
};

mkString() inherited

String mkString({String? start, String? sep, String? end})

Returns a String by using each elements toString(), adding sep between each element. If start is defined, it will be prepended to the resulting string. If end is defined, it will be appended to the resulting string.

Inherited from RIterableOnce.

Implementation

String mkString({String? start, String? sep, String? end}) {
  if (knownSize == 0) {
    return '${start ?? ""}${end ?? ""}';
  } else {
    return _mkStringImpl(StringBuffer(), start ?? '', sep ?? '', end ?? '');
  }
}

noSuchMethod() inherited

dynamic noSuchMethod(Invocation invocation)

Invoked when a nonexistent method or property is accessed.

A dynamic member invocation can attempt to call a member which doesn't exist on the receiving object. Example:

dynamic object = 1;
object.add(42); // Statically allowed, run-time error

This invalid code will invoke the noSuchMethod method of the integer 1 with an Invocation representing the .add(42) call and arguments (which then throws).

Classes can override noSuchMethod to provide custom behavior for such invalid dynamic invocations.

A class with a non-default noSuchMethod invocation can also omit implementations for members of its interface. Example:

class MockList<T> implements List<T> {
  noSuchMethod(Invocation invocation) {
    log(invocation);
    super.noSuchMethod(invocation); // Will throw.
  }
}
void main() {
  MockList().add(42);
}

This code has no compile-time warnings or errors even though the MockList class has no concrete implementation of any of the List interface methods. Calls to List methods are forwarded to noSuchMethod, so this code will log an invocation similar to Invocation.method(#add, [42]) and then throw.

If a value is returned from noSuchMethod, it becomes the result of the original invocation. If the value is not of a type that can be returned by the original invocation, a type error occurs at the invocation.

The default behavior is to throw a NoSuchMethodError.

Inherited from Object.

Implementation

@pragma("vm:entry-point")
@pragma("wasm:entry-point")
external dynamic noSuchMethod(Invocation invocation);

partition() override

Record partition(bool Function(A) p)

Returns 2 collections as a tuple where the first tuple element will be a collection of elements that satisfy the given predicate p. The second item of the returned tuple will be elements that do not satisfy p.

Implementation

@override
(ISet<A>, ISet<A>) partition(Function1<A, bool> p) {
  final (a, b) = super.partition(p);
  return (a.toISet(), b.toISet());
}

partitionMap() override

Record partitionMap<A1, A2>(Either<A1, A2> Function(A) f)

Applies f to each element of this collection and returns a separate collection for all applications resulting in a Left and Right respectively.

Implementation

@override
(ISet<A1>, ISet<A2>) partitionMap<A1, A2>(
  Function1<A, Either<A1, A2>> f,
) {
  final (a, b) = super.partitionMap(f);
  return (a.toISet(), b.toISet());
}

reduce() inherited

A reduce(A Function(A, A) op)

Reduces this collection to a single value by applying op left to right.

Throws if the collection is empty.

Inherited from RIterableOnce.

Implementation

A reduce(Function2<A, A, A> op) => reduceLeft(op);

reduceLeft() inherited

A reduceLeft(A Function(A, A) op)

Reduces from left to right. Throws if empty.

Inherited from RIterableOnce.

Implementation

A reduceLeft(Function2<A, A, A> op) => switch (this) {
  final IndexedSeq<A> seq when seq.length > 0 => _foldl(seq, 1, seq[0], op),
  _ when knownSize == 0 => throw UnsupportedError('empty.reduceLeft'),
  _ => _reduceLeftIterator(() => throw UnsupportedError('empty.reduceLeft'), op),
};

reduceLeftOption() inherited

Option<A> reduceLeftOption(A Function(A, A) op)

Returns a summary values of all elements of this collection by applying f to each element, moving left to right.

If this collection is empty, None will be returned.

Inherited from RIterableOnce.

Implementation

Option<A> reduceLeftOption(Function2<A, A, A> op) => switch (knownSize) {
  0 => none(),
  _ => _reduceOptionIterator(iterator, op),
};

reduceOption() inherited

Option<A> reduceOption(A Function(A, A) op)

Returns a summary values of all elements of this collection by applying f to each element, moving left to right.

If this collection is empty, None will be returned.

Inherited from RIterableOnce.

Implementation

Option<A> reduceOption(Function2<A, A, A> op) => reduceLeftOption(op);

reduceRight() inherited

A reduceRight(A Function(A, A) op)

Reduces from right to left. Throws if empty.

Inherited from RIterableOnce.

Implementation

A reduceRight(Function2<A, A, A> op) => switch (this) {
  final IndexedSeq<A> seq when seq.length > 0 => _foldr(seq, op),
  _ when knownSize == 0 => throw UnsupportedError('empty.reduceLeft'),
  _ => _reversed().reduceLeft((x, y) => op(y, x)),
};

reduceRightOption() inherited

Option<A> reduceRightOption(A Function(A, A) op)

Returns a summary values of all elements of this collection by applying f to each element, moving right to left.

If this collection is empty, None will be returned.

Inherited from RIterableOnce.

Implementation

Option<A> reduceRightOption(Function2<A, A, A> op) => switch (knownSize) {
  -1 => _reduceOptionIterator(_reversed().iterator, (x, y) => op(y, x)),
  0 => none(),
  _ => Some(reduceRight(op)),
};

removedAll()

ISet<A> removedAll(RIterableOnce<A> that)

Returns a new set with all elements in that removed.

Implementation

ISet<A> removedAll(RIterableOnce<A> that) =>
    that.iterator.foldLeft(this, (acc, elem) => acc - elem);

scan() override

ISet<B> scan<B>(B z, B Function(B, A) op)

Alias for scanLeft.

Implementation

@override
ISet<B> scan<B>(B z, Function2<B, A, B> op) => scanLeft(z, op);

scanLeft() override

ISet<B> scanLeft<B>(B z, B Function(B, A) op)

Returns a new collection of running totals starting with z.

The first element of the result is z; each subsequent element is the result of applying op to the previous total and the next element.

Implementation

@override
ISet<B> scanLeft<B>(B z, Function2<B, A, B> op) => super.scanLeft(z, op).toISet();

scanRight() override

ISet<B> scanRight<B>(B z, B Function(A, B) op)

Returns a new collection of running totals starting with z, traversing from right to left.

Implementation

@override
ISet<B> scanRight<B>(B z, Function2<A, B, B> op) => super.scanRight(z, op).toISet();

slice() override

ISet<A> slice(int from, int until)

Returns a new collection containing elements in the range [from, until).

Implementation

@override
ISet<A> slice(int from, int until) => super.slice(from, until).toISet();

sliding() override

RIterator<ISet<A>> sliding(int size, [int step = 1])

Returns an iterator where elements are fixed size chunks of size n of the original collection. Each chunk is calculated by sliding a 'window' of size n over the original collection, moving the window step elements at a time.

Implementation

@override
RIterator<ISet<A>> sliding(int size, [int step = 1]) =>
    super.sliding(size, step).map((a) => a.toISet());

span() override

Record span(bool Function(A) p)

Returns two collections: elements before and starting from the first element that does not satisfy p.

Implementation

@override
(ISet<A>, ISet<A>) span(Function1<A, bool> p) {
  final (a, b) = super.span(p);
  return (a.toISet(), b.toISet());
}

splitAt() override

Record splitAt(int n)

Returns two collections: the first n elements and the remainder.

Implementation

@override
(ISet<A>, ISet<A>) splitAt(int n) {
  final (a, b) = super.splitAt(n);
  return (a.toISet(), b.toISet());
}

subsetOf()

bool subsetOf(ISet<A> that)

Returns true if every element of this set is also contained in that.

Implementation

bool subsetOf(ISet<A> that) => forall(that.contains);

subsets()

RIterator<ISet<A>> subsets({int? length})

Returns an iterator over all subsets of this set.

If length is provided, only subsets of exactly that size are returned. When length is out of range [0, size], an empty iterator is returned.

Implementation

RIterator<ISet<A>> subsets({int? length}) {
  if (length != null) {
    if (0 <= length && length <= size) {
      return _SubsetsOfNItr(toIndexedSeq(), length);
    } else {
      return RIterator.empty();
    }
  } else {
    return _SubsetsItr(toIndexedSeq());
  }
}

take() override

ISet<A> take(int n)

Returns a new collection containing only the first n elements.

Implementation

@override
ISet<A> take(int n) => super.take(n).toISet();

takeRight() override

ISet<A> takeRight(int n)

Returns a new collection with the last n elements of this collection. If n is greater than the size of this collection, the original collection is returned.

Implementation

@override
ISet<A> takeRight(int n) => super.takeRight(n).toISet();

takeWhile() override

ISet<A> takeWhile(bool Function(A) p)

Returns a new collection of leading elements that satisfy p.

Implementation

@override
ISet<A> takeWhile(Function1<A, bool> p) => super.takeWhile(p).toISet();

tapEach() override

ISet<A> tapEach<U>(U Function(A) f)

Applies f to each element in this collection, discarding any results and returns this collection.

Implementation

@override
ISet<A> tapEach<U>(Function1<A, U> f) {
  foreach(f);
  return this;
}

toIList() inherited

IList<A> toIList()

Returns an IList with the same elements as this collection.

Inherited from RIterableOnce.

Implementation

IList<A> toIList() => IList.from(this);

toIndexedSeq() inherited

IndexedSeq<A> toIndexedSeq()

Returns an IndexedSeq with the same elements as this collection.

Inherited from RIterableOnce.

Implementation

IndexedSeq<A> toIndexedSeq() => IndexedSeq.from(this);

toISet() inherited

ISet<A> toISet()

Returns an ISet with the same elements as this collection, duplicates removed.

Inherited from RIterableOnce.

Implementation

ISet<A> toISet() => ISet.from(this);

toIVector() inherited

IVector<A> toIVector()

Returns an IVector with the same elements as this collection.

Inherited from RIterableOnce.

Implementation

IVector<A> toIVector() => IVector.from(this);

toList() inherited

List<A> toList({bool growable = true})

Returns a new List with the same elements as this collection.

Inherited from RIterableOnce.

Implementation

List<A> toList({bool growable = true}) {
  if (growable) {
    final it = iterator;
    final res = List<A>.empty(growable: true);

    while (it.hasNext) {
      res.add(it.next());
    }

    return res;
  } else {
    final it = iterator;
    return List.generate(size, (_) => it.next());
  }
}

toSeq() inherited

RSeq<A> toSeq()

Returns a RSeq with the same elements as this collection.

Inherited from RIterableOnce.

Implementation

RSeq<A> toSeq() => RSeq.from(this);

toString() inherited

String toString()

A string representation of this object.

Some classes have a default textual representation, often paired with a static parse function (like int.parse). These classes will provide the textual representation as their string representation.

Other classes have no meaningful textual representation that a program will care about. Such classes will typically override toString to provide useful information when inspecting the object, mainly for debugging or logging.

Inherited from RIterable.

Implementation

@override
String toString() => 'Iterable${mkString(start: '(', sep: ', ', end: ')')}';

union()

ISet<A> union(ISet<A> that)

Returns a new set containing all elements of both this set and that.

Implementation

ISet<A> union(ISet<A> that) => concat(that);

zip() override

ISet<Record> zip<B>(RIterableOnce<B> that)

Returns a new collection that combines corresponding elements from this collection and that as a tuple. The length of the returned collection will be the minimum of this collections size and the size of that.

Implementation

@override
ISet<(A, B)> zip<B>(RIterableOnce<B> that) => super.zip(that).toISet();

zipAll() override

ISet<Record> zipAll<B>(RIterableOnce<B> that, A thisElem, B thatElem)

Returns a new collection that combines corresponding elements from this collection and that as a tuple. The length of the returned collection will be the maximum of this collections size and thes size of that. If this collection is shorter than that, thisElem will be used to fill in the resulting collection. If that is shorter, thatElem will be used to will in the resulting collection.

Implementation

@override
ISet<(A, B)> zipAll<B>(RIterableOnce<B> that, A thisElem, B thatElem) =>
    super.zipAll(that, thisElem, thatElem).toISet();

zipWithIndex() override

ISet<Record> zipWithIndex()

Return a new collection with each element of this collection paired with it's respective index.

Implementation

@override
ISet<(A, int)> zipWithIndex() => super.zipWithIndex().toISet();

Extension Methods

flatten() extension

RIterable<A> flatten()

Concatenates all inner iterables into a single IList.

Available on RIterable<A>, provided by the RIterableNested2Ops<A> extension

Implementation

RIterable<A> flatten() {
  final it = iterator;
  final b = IList.builder<A>();

  while (it.hasNext) {
    b.addAll(it.next());
  }

  return b.toIList();
}

flatten() extension

ISet<A> flatten()

Combines all nested set into one set using concatenation.

Available on ISet<A>, provided by the ISetNestedOps<A> extension

Implementation

ISet<A> flatten() => fold(iset({}), (z, a) => z.concat(a.toIList()));

product() extension

double product()

Returns the product of all elements in this list

Available on RIterableOnce<A>, provided by the RIterableDoubleOps extension

Implementation

double product() {
  var p = 1.0;
  final it = iterator;

  while (it.hasNext) {
    p *= it.next();
  }

  return p;
}

product() extension

int product()

Returns the product of all elements in this list

Available on RIterableOnce<A>, provided by the RIterableIntOps extension

Implementation

int product() {
  var p = 1;
  final it = iterator;

  while (it.hasNext) {
    p *= it.next();
  }

  return p;
}

sum() extension

double sum()

Returns the sum of all elements in this list

Available on RIterableOnce<A>, provided by the RIterableDoubleOps extension

Implementation

double sum() {
  var s = 0.0;
  final it = iterator;

  while (it.hasNext) {
    s += it.next();
  }

  return s;
}

sum() extension

int sum()

Returns the sum of all elements in this list

Available on RIterableOnce<A>, provided by the RIterableIntOps extension

Implementation

int sum() {
  var s = 0;
  final it = iterator;

  while (it.hasNext) {
    s += it.next();
  }

  return s;
}

toIMap() extension

IMap<A, B> toIMap()

Creates a new IMap where element tuple element of this list is used to create a key and value respectively.

Available on RIterable<A>, provided by the RIterableTuple2Ops<A, B> extension

Implementation

IMap<A, B> toIMap() => IMap.from(this);

unzip() extension

Record unzip()

Splits a collection of pairs into two separate collections.

Available on RIterable<A>, provided by the RibsIterableTuple2Ops<A, B> extension

Implementation

(RIterable<A>, RIterable<B>) unzip() => (
  views.Map(this, (a) => a.$1),
  views.Map(this, (a) => a.$2),
);

Operators

operator +()

ISet<A> operator +(A a)

Creates a new set with an additonal element a.

Implementation

ISet<A> operator +(A a) => incl(a);

operator -()

ISet<A> operator -(A a)

Creates a new set with the item a removed.

Implementation

ISet<A> operator -(A a) => excl(a);

operator ==() override

bool operator ==(Object other)

Returns true if other is an ISet containing exactly the same elements as this set, regardless of insertion order.

Implementation

@override
bool operator ==(Object other) =>
    identical(this, other) ||
    switch (other) {
      final ISet<A> thatSet => thatSet.size == size && subsetOf(thatSet),
      _ => false,
    };

Static Methods

builder()

ISetBuilder<A> builder<A>()

Returns a mutable builder that accumulates elements into an ISet.

Implementation

static ISetBuilder<A> builder<A>() => ISetBuilder();

empty() override

ISet<A> empty<A>()

Returns an empty ISet.

Implementation

static ISet<A> empty<A>() => _EmptySet<A>();

from() override

ISet<A> from<A>(RIterableOnce<A> xs)

Creates an ISet from any RIterableOnce.

Returns xs directly when it is already an ISet, avoiding a copy.

Implementation

static ISet<A> from<A>(RIterableOnce<A> xs) => switch (xs) {
  final _EmptySet<A> s => s,
  final _Set1<A> s => s,
  final _Set2<A> s => s,
  final _Set3<A> s => s,
  final _Set4<A> s => s,
  final IHashSet<A> s => s,
  _ => ISetBuilder<A>().addAll(xs).result(),
};

of() override

ISet<A> of<A>(Iterable<A> xs)

Creates an ISet from a Dart Iterable.

Implementation

static ISet<A> of<A>(Iterable<A> xs) => from(RIterator.fromDart(xs.iterator));