Interface SortedMap

moduleceylon.collection1.3.2

Index
Search
Filter

A Map that maintains its entries in sorted order.

By: Gavin King

no type hierarchy

SortedMap
- Map
  - Collection
    Iterable
    Category
  - Correspondence
- Ranged
  - Iterable
    Category

SortedMap
- TreeMap

Inherited Attributes
Attributes inherited from: `Object` `hash`, `string`
Attributes inherited from: `Collection<Element>` `empty`, `permutations`, `string`
Attributes inherited from: `Correspondence<Key,Item>` `keys`
Attributes inherited from: `Iterable<Element,Absent>` `coalesced`, `cycled`, `distinct`, `empty`, `exceptLast`, `first`, `indexed`, `last`, `paired`, `rest`, `size`, `string`
Attributes inherited from: `Map<Key,Item>` `coalescedMap`, `distinct`, `hash`, `items`, `keys`

Methods
`ascendingEntries`	Source Code `shared formal {<Key->Item>}Go to Iterable abbreviation {X+} or {X} means Iterable<X,Nothing> or Iterable<X,Null> Go to Entry abbreviation X->Y means Entry<X,Y> ascendingEntries(Key from, Key to)` The entries with keys larger than or equal to the first given value, and smaller than or equal to the second given value, sorted in ascending order. This is a lazy operation, returning a view of the underlying sorted map.
`descendingEntries`	Source Code `shared formal {<Key->Item>}Go to Iterable abbreviation {X+} or {X} means Iterable<X,Nothing> or Iterable<X,Null> Go to Entry abbreviation X->Y means Entry<X,Y> descendingEntries(Key from, Key to)` The entries with keys smaller than or equal to the first given value, and larger than or equal to the second given value, sorted in descending order. This is a lazy operation, returning a view of the underlying sorted map.
`higherEntries`	Source Code `shared formal {<Key->Item>}Go to Iterable abbreviation {X+} or {X} means Iterable<X,Nothing> or Iterable<X,Null> Go to Entry abbreviation X->Y means Entry<X,Y> higherEntries(Key key)` The entries with keys larger than or equal to the given `key`, sorted by key in ascending order. This is a lazy operation, returning a view of the underlying sorted map.
`lowerEntries`	Source Code `shared formal {<Key->Item>}Go to Iterable abbreviation {X+} or {X} means Iterable<X,Nothing> or Iterable<X,Null> Go to Entry abbreviation X->Y means Entry<X,Y> lowerEntries(Key key)` The entries with keys smaller than or equal to the given `key`, sorted by key in descending order. This is a lazy operation, returning a view of the underlying sorted map.

Inherited Methods
Methods inherited from: `Object` `equals()`
Methods inherited from: `Category<Element>` `contains()`, `containsAny()`, `containsEvery()`
Methods inherited from: `Collection<Element>` `clone()`, `combinations()`, `contains()`
Methods inherited from: `Correspondence<Key,Item>` `defines()`, `definesAny()`, `definesEvery()`, `get()`, `getAll()`
Methods inherited from: `Iterable<Element,Absent>` `any()`, `by()`, `chain()`, `collect()`, `contains()`, `count()`, `defaultNullElements()`, `each()`, `every()`, `filter()`, `find()`, `findLast()`, `flatMap()`, `fold()`, `follow()`, `frequencies()`, `getFromFirst()`, `group()`, `indexes()`, `interpose()`, `iterator()`, `locate()`, `locateLast()`, `locations()`, `longerThan()`, `map()`, `max()`, `narrow()`, `partition()`, `product()`, `reduce()`, `repeat()`, `scan()`, `select()`, `sequence()`, `shorterThan()`, `skip()`, `skipWhile()`, `sort()`, `spread()`, `summarize()`, `tabulate()`, `take()`, `takeWhile()`
Methods inherited from: `Map<Key,Item>` `clone()`, `contains()`, `defaultNullElements()`, `defaultNullItems()`, `defines()`, `equals()`, `filterKeys()`, `get()`, `getOrDefault()`, `inverse()`, `mapItems()`, `patch()`
Methods inherited from: `Ranged<Index,Element,Subrange>` `measure()`, `span()`, `spanFrom()`, `spanTo()`