Scala 3/scala.collection/SortedOps

SortedOps

trait SortedOps[A, +C]

Base trait for sorted collections

Source:
SortedOps.scala
class Object
trait Matchable
class Any
trait SortedMapOps[K, V, CC, C]
trait SortedMap[K, V]
trait SortedMap[K, V]
class WithDefault[K, V]
class TreeMap[K, V]
trait SortedMap[K, V]
class WithDefault[K, V]
class TreeMap[K, V]
trait SortedMapFactoryDefaults[K, V, CC, WithFilterCC, UnsortedCC]
trait StrictOptimizedSortedMapOps[K, V, CC, C]
trait StrictOptimizedSortedMapOps[K, V, CC, C]
trait SortedMapOps[K, V, CC, C]
trait SortedMapOps[K, V, CC, C]
trait SortedSetOps[A, CC, C]
trait BitSetOps[C]
trait BitSet
class BitSet
class BitSet1
class BitSet2
class BitSetN
class BitSet
trait SortedSet[A]
trait SortedSet[A]
class ValueSet
class TreeSet[A]
trait SortedSet[A]
class TreeSet[A]
trait SortedSetFactoryDefaults[A, CC, WithFilterCC]
trait SortedSetOps[A, CC, C]
trait SortedSetOps[A, CC, C]

Value members

Abstract methods

def firstKey: A

Returns the first key of the collection.

Returns the first key of the collection.

Source:
SortedOps.scala
def lastKey: A

Returns the last key of the collection.

Returns the last key of the collection.

Source:
SortedOps.scala
def rangeImpl(from: Option[A], until: Option[A]): C

Creates a ranged projection of this collection.

Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa.

Note: keys are not guaranteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.

Value 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.

Source:
SortedOps.scala
def rangeTo(to: A): C

Create a range projection of this collection with no lower-bound.

Create a range projection of this collection with no lower-bound.

Value parameters:
to

The upper-bound (inclusive) of the ranged projection.

Source:
SortedOps.scala

Concrete methods

def range(from: A, until: A): C

Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

Value parameters:
from

The lower-bound (inclusive) of the ranged projection.

until

The upper-bound (exclusive) of the ranged projection.

Source:
SortedOps.scala
def rangeFrom(from: A): C

Creates a ranged projection of this collection with no upper-bound.

Creates a ranged projection of this collection with no upper-bound.

Value parameters:
from

The lower-bound (inclusive) of the ranged projection.

Source:
SortedOps.scala
def rangeUntil(until: A): C

Creates a ranged projection of this collection with no lower-bound.

Creates a ranged projection of this collection with no lower-bound.

Value parameters:
until

The upper-bound (exclusive) of the ranged projection.

Source:
SortedOps.scala

Deprecated methods

def compare(k0: A, k1: A): Int

Comparison function that orders keys.

Comparison function that orders keys.

Deprecated
Source:
SortedOps.scala
final def from(from: A): C

Creates a ranged projection of this collection with no upper-bound.

Creates a ranged projection of this collection with no upper-bound.

Value parameters:
from

The lower-bound (inclusive) of the ranged projection.

Deprecated
Source:
SortedOps.scala
final def to(to: A): C

Create a range projection of this collection with no lower-bound.

Create a range projection of this collection with no lower-bound.

Value parameters:
to

The upper-bound (inclusive) of the ranged projection.

Deprecated
Source:
SortedOps.scala
final def until(until: A): C

Creates a ranged projection of this collection with no lower-bound.

Creates a ranged projection of this collection with no lower-bound.

Value parameters:
until

The upper-bound (exclusive) of the ranged projection.

Deprecated
Source:
SortedOps.scala