in scala.collection.jcl
trait Sorted

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

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

Author:
  Sean McDirmid

Direct Known Subclasses:
  SortedSet, SortedMap, Buffer

Class Summary
`protected` | `class` Comparator [K] A wrapper around Java comparators.

Def Summary
`abstract` | `def` compare (k0: K, k1: K) : scala.Int Comparison function that orders keys.
`abstract` | `def` first : K Returns the first key of the collection.
`final` | `def` from (from: K) : Sorted.this.SortedSelf Creates a ranged projection of this collection with no upper-bound. * @param from The lower-bound (inclusive) of the ranged projection.
`abstract` | `def` last : K Returns the last key of the collection.
`final` | `def` range (from: K, until: K) : Sorted.this.SortedSelf Creates a ranged projection of this collection with both a lower-bound and an upper-bound. * @param from The upper-bound (exclusive) of the ranged projection.
`abstract` | `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.
`final` | `def` until (until: K) : Sorted.this.SortedSelf Creates a ranged projection of this collection with no lower-bound. * @param from The upper-bound (exclusive) of the ranged projection.

Def inherited from scala.collection.jcl.MutableIterable[A]
- , --, clear, elements, has, isEmpty, pmap, remove, removeAll, retain, retainAll, size

Def Detail

`abstract def` compare (k0: K, k1: K): scala.Int

  Comparison function that orders keys.

`abstract def` first : K

  Returns the first key of the collection.

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

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

`abstract def` last : K

  Returns the last key of the collection.

`final def` range (from: K, until: K): Sorted.this.SortedSelf

  Creates a ranged projection of this collection with both a lower-bound and an upper-bound. * @param from The upper-bound (exclusive) of the ranged projection.

`abstract 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.

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` until (until: K): Sorted.this.SortedSelf

  Creates a ranged projection of this collection with no lower-bound. * @param from The upper-bound (exclusive) of the ranged projection.