New Set methods

1Formal informations

2Set.prototype.union(iterable)

When the union method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let Ctr be ? SpeciesConstructor(set, %Set%).
  4. Let newSet be ? Construct(Ctr, set).
  5. Let adder be ? Get(newSet, "add").
  6. Return ? AddEntryFromIterable(newSet, iterable, adder).

3Set.prototype.intersection(iterable)

When the intersection method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let Ctr be ? SpeciesConstructor(set, %Set%).
  4. Let newSet be ? Construct(Ctr).
  5. Let hasCheck be ? Get(set, "has").
  6. If IsCallable(hasCheck) is false, throw a TypeError exception.
  7. Let adder be ? Get(newSet, "add").
  8. If IsCallable(adder) is false, throw a TypeError exception.
  9. Let iteratorRecord be ? GetIterator(iterable).
  10. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return newSet.
    3. Let nextValue be ? IteratorValue(next).
    4. Let has be Call(hasCheck, set, « nextValue »).
    5. If has is an abrupt completion, return ? IteratorClose(iteratorRecord, has).
    6. If has.[[Value]] is true,
      1. Let status be Call(adder, newSet, « nextValue »).
      2. If status is an abrupt completion, return ? IteratorClose(iteratorRecord, status).

4Set.prototype.difference(iterable)

When the difference method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let Ctr be ? SpeciesConstructor(set, %Set%).
  4. Let newSet be ? Construct(Ctr, set).
  5. Let remover be ? Get(newSet, "delete").
  6. If IsCallable(remover) is false, throw a TypeError exception.
  7. Let iteratorRecord be ? GetIterator(iterable).
  8. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return newSet.
    3. Let nextValue be ? IteratorValue(next).
    4. Let status be Call(remover, newSet, « nextValue »).
    5. If status is an abrupt completion, return ? IteratorClose(iteratorRecord, status).

5Set.prototype.symmetricDifference(iterable)

When the symmetricDifference method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let Ctr be ? SpeciesConstructor(set, %Set%).
  4. Let newSet be ? Construct(Ctr, set).
  5. Let remover be ? Get(newSet, "delete").
  6. If IsCallable(remover) is false, throw a TypeError exception.
  7. Let adder be ? Get(newSet, "add").
  8. If IsCallable(adder) is false, throw a TypeError exception.
  9. Let iteratorRecord be ? GetIterator(iterable).
  10. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return newSet.
    3. Let nextValue be ? IteratorValue(next).
    4. Let removed be Call(remover, newSet, « nextValue »).
    5. If removed is an abrupt completion, return ? IteratorClose(iteratorRecord, removed).
    6. If removed.[[Value]] is false,
      1. Let status be Call(adder, newSet, « nextValue »).
      2. If status is an abrupt completion, return ? IteratorClose(iteratorRecord, status).

6Set.prototype.isSubsetOf(iterable)

When the isSubsetOf method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. Let iteratorRecord be ? GetIterator(set).
  3. If Type(iterable) is not Object, throw a TypeError exception.
  4. Let otherSet be iterable.
  5. Let hasCheck be ? Get(otherSet, "has").
  6. If IsCallable(hasCheck) is false,
    1. Let otherSet be ? Construct(%Set%).
    2. Perform ? AddEntryFromIterable(otherSet, iterable, %SetProto_add%).
    3. Let hasCheck be %SetProto_has%.
  7. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return true.
    3. Let nextValue be ? IteratorValue(next).
    4. Let has be Call(hasCheck, otherSet, « nextValue »).
    5. If has is an abrupt completion, return ? IteratorClose(iteratorRecord, has).
    6. If has.[[Value]] is false, return false.

7Set.prototype.isSupersetOf(iterable)

When the isSupersetOf method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let hasCheck be ? Get(set, "has").
  4. If IsCallable(hasCheck) is false, throw a TypeError exception.
  5. Let iteratorRecord be ? GetIterator(iterable).
  6. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return true.
    3. Let nextValue be ? IteratorValue(next).
    4. Let has be Call(hasCheck, set, « nextValue »).
    5. If has is an abrupt completion, return ? IteratorClose(iteratorRecord, has).
    6. If has.[[Value]] is false, return false.

8Set.prototype.isDisjointFrom(iterable)

When the isDisjointFrom method is called with argument iterable, the following steps are taken:

  1. Let set be the this value.
  2. If Type(set) is not Object, throw a TypeError exception.
  3. Let hasCheck be ? Get(set, "has").
  4. If IsCallable(hasCheck) is false, throw a TypeError exception.
  5. Let iteratorRecord be ? GetIterator(iterable).
  6. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return true.
    3. Let nextValue be ? IteratorValue(next).
    4. Let has be Call(hasCheck, set, « nextValue »).
    5. If has is an abrupt completion, return ? IteratorClose(iteratorRecord, has).
    6. If has.[[Value]] is true, return false.

9 AddEntryFromIterable ( target, iterable, adder )

The abstract operation AddEntryFromIterable accepts a target object, an iterable of entries and an adder function to be invoked with target as the receiver.

  1. If IsCallable(adder) is false, throw a TypeError exception.
  2. Let iteratorRecord be ? GetIterator(iterable).
  3. Repeat,
    1. Let next be ? IteratorStep(iteratorRecord).
    2. If next is false, return target.
    3. Let nextValue be ? IteratorValue(next).
    4. Let status be Call(adder, target, « nextValue »).
    5. If status is an abrupt completion, return ? IteratorClose(iteratorRecord, status).

ACopyright & Software License

Copyright Notice

© 2019 Michał Wadas, Sathya Gunasekaran

Software License

All Software contained in this document ("Software") is protected by copyright and is being made available under the "BSD License", included below. This Software may be subject to third party rights (rights from parties other than Ecma International), including patent rights, and no licenses under such third party rights are granted under this license even if the third party concerned is a member of Ecma International. SEE THE ECMA CODE OF CONDUCT IN PATENT MATTERS AVAILABLE AT https://ecma-international.org/memento/codeofconduct.htm FOR INFORMATION REGARDING THE LICENSING OF PATENT CLAIMS THAT ARE REQUIRED TO IMPLEMENT ECMA INTERNATIONAL STANDARDS.

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

  1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
  2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
  3. Neither the name of the authors nor Ecma International may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE ECMA INTERNATIONAL "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ECMA INTERNATIONAL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.