in scala.collection
trait Sorted

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

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

Author:
  Sean McDirmid

Direct Known Subclasses:
  Sorted, SortedSet, SortedMap

Def Summary
`override` | `def` from (from: K) : scala.collection.Sorted[K, A]
`protected` | `def` hasAll (j: scala.Iterator[K]) : scala.Boolean
`abstract` | `def` keySet : scala.collection.SortedSet[K] return as a projection the set of keys in this collection
`override` | `def` range (from: K, until: K) : scala.collection.Sorted[K, A]
`abstract` `override` | `def` rangeImpl (from: scala.Option[K], until: scala.Option[K]) : scala.collection.Sorted[K, A] 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.
| `def` to (to: K) : scala.collection.Sorted[K, A] Create a range projection of this collection with no lower-bound. * @param to The upper-bound (inclusive) of the ranged projection.
`override` | `def` until (until: K) : scala.collection.Sorted[K, A]

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

Def Detail

`override def` from (from: K): scala.collection.Sorted[K, A]

`protected def` hasAll (j: scala.Iterator[K]): scala.Boolean

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

  return as a projection the set of keys in this collection

`override def` range (from: K, until: K): scala.collection.Sorted[K, A]

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

  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.

`def` to (to: K): scala.collection.Sorted[K, A]

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

`override def` until (until: K): scala.collection.Sorted[K, A]