(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) ++
creates a new set. Use ++=
to add elements to this set and return that set itself.
(Changed in version 2.8.0) -
creates a new set. Use -=
to remove an element from this set and return that set itself.
(Changed in version 2.8.0) -
creates a new set. Use -=
to remove an element from this set and return that set itself.
(Changed in version 2.8.0) --
creates a new set. Use --=
to remove elements from this set and return that set itself.
Tests whether this object has the specified property as a direct property.
Tests whether this object has the specified property as a direct property.
Unlike js.Object.hasProperty, this method does not check down the object's prototype chain.
MDN
Tests whether this object is in the prototype chain of another object.
Tests whether this object is in the prototype chain of another object.
JavaScript Iterator for this Iterable.
JavaScript Iterator for this Iterable.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
Tests whether the specified property in an object can be enumerated by a call to js.Object.properties, with the exception of properties inherited through the prototype chain.
Tests whether the specified property in an object can be enumerated by a call to js.Object.properties, with the exception of properties inherited through the prototype chain.
If the object does not have the specified property, this method returns false.
MDN
(set: WrappedSet[T])./:(z)(op)
(set: IterableOps[T])./:(z)(op)
(set: WrappedSet[T]).:\(z)(op)
(set: IterableOps[T]).:\(z)(op)
(set: WrappedSet[T]).addString(b)
(set: WrappedSet[T]).addString(b, sep)
(set: WrappedSet[T]).addString(b, start, sep, end)
(set: IterableOps[T]).addString(b)
(set: IterableOps[T]).addString(b, sep)
(set: IterableOps[T]).addString(b, start, sep, end)
(set: WrappedSet[T]).aggregate(z)(seqop, combop)
(set: IterableOps[T]).aggregate(z)(seqop, combop)
(set: WrappedSet[T]).canEqual(that)
(set: IterableOps[T]).canEqual(that)
(set: WrappedSet[T]).clear()
(set: WrappedSet[T]).clone()
(set: WrappedSet[T]).collect(pf)(bf)
(set: IterableOps[T]).collect(pf)(bf)
(set: WrappedSet[T]).collectFirst(pf)
(set: IterableOps[T]).collectFirst(pf)
(set: WrappedSet[T]).companion
(set: IterableOps[T]).companion
(set: WrappedSet[T]).count(p)
(set: IterableOps[T]).count(p)
(set: WrappedSet[T]).drop(n)
(set: IterableOps[T]).drop(n)
(set: WrappedSet[T]).dropRight(n)
(set: IterableOps[T]).dropRight(n)
(set: WrappedSet[T]).dropWhile(p)
(set: IterableOps[T]).dropWhile(p)
(set: WrappedSet[T]).equals(that)
(set: WrappedSet[T]).exists(p)
(set: IterableOps[T]).exists(p)
(set: WrappedSet[T]).filter(p)
(set: IterableOps[T]).filter(p)
(set: WrappedSet[T]).filterNot(p)
(set: IterableOps[T]).filterNot(p)
(set: WrappedSet[T]).find(p)
(set: IterableOps[T]).find(p)
(set: WrappedSet[T]).flatMap(f)(bf)
(set: IterableOps[T]).flatMap(f)(bf)
(set: WrappedSet[T]).flatten(asTraversable)
(set: IterableOps[T]).flatten(asTraversable)
(set: WrappedSet[T]).foldLeft(z)(op)
(set: IterableOps[T]).foldLeft(z)(op)
(set: WrappedSet[T]).foldRight(z)(op)
(set: IterableOps[T]).foldRight(z)(op)
(set: WrappedSet[T]).forall(p)
(set: IterableOps[T]).forall(p)
(set: WrappedSet[T]).foreach(f)
(set: IterableOps[T]).foreach(f)
(set: WrappedSet[T]).genericBuilder
(set: IterableOps[T]).genericBuilder
(set: WrappedSet[T]).groupBy(f)
(set: IterableOps[T]).groupBy(f)
(set: WrappedSet[T]).grouped(size)
(set: IterableOps[T]).grouped(size)
(set: WrappedSet[T]).hasDefiniteSize
(set: IterableOps[T]).hasDefiniteSize
(set: WrappedSet[T]).hashCode()
(set: WrappedSet[T]).head
(set: IterableOps[T]).head
(set: WrappedSet[T]).headOption
(set: IterableOps[T]).headOption
(set: WrappedSet[T]).init
(set: IterableOps[T]).init
(set: WrappedSet[T]).inits
(set: IterableOps[T]).inits
(set: WrappedSet[T]).isEmpty
(set: IterableOps[T]).isEmpty
(set: WrappedSet[T]).isTraversableAgain
(set: IterableOps[T]).isTraversableAgain
(set: WrappedSet[T]).iterator
(set: IterableOps[T]).iterator
(set: WrappedSet[T]).last
(set: IterableOps[T]).last
(set: WrappedSet[T]).lastOption
(set: IterableOps[T]).lastOption
(set: WrappedSet[T]).maxBy(f)(cmp)
(set: IterableOps[T]).maxBy(f)(cmp)
(set: WrappedSet[T]).minBy(f)(cmp)
(set: IterableOps[T]).minBy(f)(cmp)
(set: WrappedSet[T]).mkString
(set: WrappedSet[T]).mkString(sep)
(set: WrappedSet[T]).mkString(start, sep, end)
(set: IterableOps[T]).mkString
(set: IterableOps[T]).mkString(sep)
(set: IterableOps[T]).mkString(start, sep, end)
(set: WrappedSet[T]).nonEmpty
(set: IterableOps[T]).nonEmpty
(set: WrappedSet[T]).par
(set: IterableOps[T]).par
(set: WrappedSet[T]).partition(p)
(set: IterableOps[T]).partition(p)
(set: WrappedSet[T]).repr
(set: IterableOps[T]).repr
(set: WrappedSet[T]).scanLeft(z)(op)(bf)
(set: IterableOps[T]).scanLeft(z)(op)(bf)
(set: WrappedSet[T]).scanRight(z)(op)(bf)
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(set: IterableOps[T]).scanRight(z)(op)(bf)
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(set: WrappedSet[T]).seq
(set: IterableOps[T]).seq
(set: WrappedSet[T]).size()
(set: IterableOps[T]).size
(set: WrappedSet[T]).slice(from, until)
(set: IterableOps[T]).slice(from, until)
(set: WrappedSet[T]).sliding(size, step)
(set: WrappedSet[T]).sliding(size)
(set: IterableOps[T]).sliding(size, step)
(set: IterableOps[T]).sliding(size)
(set: WrappedSet[T]).span(p)
(set: IterableOps[T]).span(p)
(set: WrappedSet[T]).splitAt(n)
(set: IterableOps[T]).splitAt(n)
(set: WrappedSet[T]).stringPrefix
(set: IterableOps[T]).stringPrefix
(set: WrappedSet[T]).tail
(set: IterableOps[T]).tail
(set: WrappedSet[T]).tails
(set: IterableOps[T]).tails
(set: WrappedSet[T]).take(n)
(set: IterableOps[T]).take(n)
(set: WrappedSet[T]).takeRight(n)
(set: IterableOps[T]).takeRight(n)
(set: WrappedSet[T]).takeWhile(p)
(set: IterableOps[T]).takeWhile(p)
(set: WrappedSet[T]).to(cbf)
(set: IterableOps[T]).to(cbf)
(set: WrappedSet[T]).toBuffer
(set: IterableOps[T]).toBuffer
(set: WrappedSet[T]).toIndexedSeq
(set: IterableOps[T]).toIndexedSeq
(set: WrappedSet[T]).toIterable
(set: IterableOps[T]).toIterable
(set: WrappedSet[T]).toIterator
(set: IterableOps[T]).toIterator
(set: WrappedSet[T]).toList
(set: IterableOps[T]).toList
(set: WrappedSet[T]).toMap(ev)
(set: IterableOps[T]).toMap(ev)
(set: WrappedSet[T]).toSeq
(set: IterableOps[T]).toSeq
(set: WrappedSet[T]).toSet
(set: IterableOps[T]).toSet
(set: WrappedSet[T]).toStream
(set: IterableOps[T]).toStream
(set: WrappedSet[T]).toString()
(set: IterableOps[T]).toString()
(set: WrappedSet[T]).toTraversable
(set: IterableOps[T]).toTraversable
(set: WrappedSet[T]).toVector
(set: IterableOps[T]).toVector
(set: WrappedSet[T]).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(set: IterableOps[T]).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(set: WrappedSet[T]).unzip(asPair)
(set: IterableOps[T]).unzip(asPair)
(set: WrappedSet[T]).unzip3(asTriple)
(set: IterableOps[T]).unzip3(asTriple)
(set: WrappedSet[T]).view(from, until)
(set: WrappedSet[T]).view
(set: IterableOps[T]).view(from, until)
(set: IterableOps[T]).view
(set: WrappedSet[T]).withFilter(p)
(set: IterableOps[T]).withFilter(p)
(Since version 2.11.0) Scripting is deprecated.
ECMAScript 2015
The Set object lets you store unique values of any type, whether primitive values or object references.
A type of element.
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set