Scala Library
scala.collection.generic.SortedMapTemplate

class DefaultKeySortedSet
[source: scala/collection/generic/SortedMapTemplate.scala]
protected class DefaultKeySortedSet
extends DefaultKeySet with SortedSet[A]
Method Summary
override def + (elem : A) : SortedSet[A]
We can't give an implementation of +/- here because we do not have a generic sorted set implementation
override def - (elem : A) : SortedSet[A]
Creates a new set with given element removed from this set, unless the element is not present.
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 SortedSetTemplate
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 SetTemplate
newBuilder, isEmpty, apply, intersect, &, **, union, |, diff, &~, equals, stringPrefix, toString
Methods inherited from Subtractable
-, --, --
Methods inherited from Addable
+, ++, ++
Methods inherited from IterableTemplate
elements, foldRight, reduceRight, toIterable, head, takeRight, dropRight, sameElements, toStream, view, view, first, firstOption, toSeq, projection
Methods inherited from TraversableClass
genericBuilder, unzip, flatten, transpose
Methods inherited from TraversableTemplate
thisCollection, nonEmpty, hasDefiniteSize, ++, ++, map, flatMap, filter, filterMap, filterNot, remove, partition, groupBy, forall, exists, count, find, foldLeft, /:, :\, reduceLeft, reduceLeftOption, reduceRightOption, headOption, tail, last, lastOption, init, take, drop, slice, takeWhile, dropWhile, span, splitAt, copyToBuffer, copyToArray, copyToArray, toArray, toList, toSequence, toSet, mkString, mkString, mkString, addString, addString, addString
Methods inherited from Function1
compose, andThen
Methods inherited from AnyRef
getClass, hashCode, clone, notify, notifyAll, wait, wait, wait, finalize, ==, !=, eq, ne, synchronized
Methods inherited from Any
==, !=, isInstanceOf, asInstanceOf
Method Details
def ordering : Ordering[A]
override def +(elem : A) : SortedSet[A]
We can't give an implementation of +/- here because we do not have a generic sorted set implementation
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.
Scala Library