scala.collection.SortedMapLike

class DefaultKeySortedSet

[source: scala/collection/SortedMapLike.scala]

protected class DefaultKeySortedSet
extends DefaultKeySet with SortedSet[A]
Method Summary
override def + (elem : A) : SortedSet[A]
Creates a new set with an additional element, unless the element is already present.
override def - (elem : A) : SortedSet[A]
Creates a new set with given element removed from this set, unless the element is not present.
implicit def ordering : Ordering[A]
override def rangeImpl (from : Option[A], until : Option[A]) : SortedSet[A]
Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Note: keys are not garuanteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.
Methods inherited from SortedSet
empty
Methods inherited from SortedSetLike
keySet, firstKey, lastKey, from, until, range, subsetOf
Methods inherited from Sorted
compare, to, hasAll
Methods inherited from DefaultKeySet
contains, iterator, size, foreach
Methods inherited from Set
companion
Methods inherited from SetLike
newBuilder, isEmpty, apply, intersect, &, **, union, |, diff, &~, stringPrefix, toString, hashCode, equals
Methods inherited from Subtractable
-, --, --
Methods inherited from Addable
+, ++, ++
Methods inherited from IterableLike
thisCollection, toCollection, elements, forall, exists, find, foldRight, reduceRight, toIterable, head, take, slice, takeWhile, takeRight, dropRight, copyToArray, zip, zipAll, zipWithIndex, sameElements, toStream, canEqual, view, view, first, firstOption, projection
Methods inherited from GenericTraversableTemplate
genericBuilder, unzip, flatten, transpose
Methods inherited from TraversableLike
repr, nonEmpty, hasDefiniteSize, ++, ++, map, flatMap, filter, filterNot, partialMap, remove, partition, groupBy, count, foldLeft, /:, :\, reduceLeft, reduceLeftOption, reduceRightOption, sum, product, min, max, headOption, tail, last, lastOption, init, drop, dropWhile, span, splitAt, copyToBuffer, copyToArray, toArray, toList, toSeq, toIndexedSeq, toSet, mkString, mkString, mkString, addString, addString, addString, withFilter
Methods inherited from Function1
compose, andThen
Methods inherited from AnyRef
getClass, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized
Methods inherited from Any
==, !=, isInstanceOf, asInstanceOf
Method Details
implicit def ordering : Ordering[A]

override def +(elem : A) : SortedSet[A]
Creates a new set with an additional element, unless the element is already present.
Parameters
elem - the element to be added
Overrides
DefaultKeySet.+

override def -(elem : A) : SortedSet[A]
Creates a new set with given element removed from this set, unless the element is not present.
Parameters
elem - the element to be removed
Overrides
DefaultKeySet.-

override def rangeImpl(from : Option[A], until : Option[A]) : SortedSet[A]
Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Note: keys are not garuanteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.
Parameters
from - The lower-bound (inclusive) of the ranged projection. None if there is no lower bound.
until - The upper-bound (exclusive) of the ranged projection. None if there is no upper bound.