in scala.collection.jcl
trait Sorted

`abstract trait` Sorted [K, A]
  `extends` java.lang.Object
  `with` scala.collection.jcl.Ranged[K, A]
  `with` scala.ScalaObject

  Any collection (including maps) whose keys (or elements) are ordered.

Author:
  Sean McDirmid

Direct Known Subclasses:
  SortedSet, SortedMap

Def Summary
`abstract` | `def` keySet : scala.collection.jcl.SortedSet[K] return as a projection the set of keys in this collection
`abstract` `override` | `def` rangeImpl (from: scala.Option[K], until: scala.Option[K]) : Sorted.this.SortedSelf Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Keys are garuanteed to be consistent between the collection and its projection.
`final` | `def` to (to: K) : Sorted.this.SortedSelf Create a range projection of this collection with no lower-bound. * @param to The upper-bound (inclusive) of the ranged projection.

Def inherited from scala.collection.jcl.Ranged[K, A]
compare , first, from, last, range, rangeImpl, until

Def Detail

`abstract def` keySet : scala.collection.jcl.SortedSet[K]

  return as a projection the set of keys in this collection

`abstract override def` rangeImpl (from: scala.Option[K], until: scala.Option[K]): Sorted.this.SortedSelf

  Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Keys are garuanteed to be consistent between the collection and its projection.

Parameters:
  `from -` The lower-bound (inclusive) of the ranged projection. `None` if there is no lower bound.
Parameters:
  `until -` The upper-bound (exclusive) of the ranged projection. `None` if there is no upper bound.

`final def` to (to: K): Sorted.this.SortedSelf

  Create a range projection of this collection with no lower-bound. * @param to The upper-bound (inclusive) of the ranged projection.