Std.SortedMap

31 public declarations

• all&Std.SortedMap.SortedMap[K, V] -> fn(K, V) -> Bool -> Bool

  Whether every entry satisfies the predicate. True for an empty map.

  fn
• any&Std.SortedMap.SortedMap[K, V] -> fn(K, V) -> Bool -> Bool

  Whether any entry satisfies the predicate. False for an empty map.

  fn
• ceiling&Std.SortedMap.SortedMap[K, V] -> K -> Option[(K, V)]

  The smallest entry whose key is not less than the given one.

  fn
• containsKey&Std.SortedMap.SortedMap[K, V] -> K -> Bool

  Whether a key has an entry.

  fn
• emptyfn(K, K) -> Bool -> Std.SortedMap.SortedMap[K, V]

  An empty map ordered by the given comparison.

  fn
• filter&Std.SortedMap.SortedMap[K, V] -> fn(K, V) -> Bool -> Std.SortedMap.SortedMap[K, V]

  Only the entries the predicate accepts.

  fn
• first&Std.SortedMap.SortedMap[K, V] -> Option[(K, V)]

  The smallest key and its value, or `None` for an empty map.

  fn
• floor&Std.SortedMap.SortedMap[K, V] -> K -> Option[(K, V)]

  The largest entry whose key is not greater than the given one.

  fn
• fold&Std.SortedMap.SortedMap[K, V] -> fn(A, K, V) -> A -> A -> A

  Every entry combined into one value, in key order.

  fn
• fromPairs&Array[(K, V)] -> fn(K, K) -> Bool -> Std.SortedMap.SortedMap[K, V]

  A map built from pairs, ordered by the given comparison.

  fn
• get&Std.SortedMap.SortedMap[K, V] -> K -> Option[V]

  The value stored under a key, or `None`.

  fn
• getOr&Std.SortedMap.SortedMap[K, V] -> K -> V -> V

  The value stored under a key, or a fallback.

  fn
• higher&Std.SortedMap.SortedMap[K, V] -> K -> Option[(K, V)]

  The smallest entry whose key comes strictly after the given one.

  fn
• insert&Std.SortedMap.SortedMap[K, V] -> K -> V -> Std.SortedMap.SortedMap[K, V]

  The map with an entry added, replacing any entry under the same key.

  fn
• insertIfAbsent&Std.SortedMap.SortedMap[K, V] -> K -> V -> Std.SortedMap.SortedMap[K, V]

  An entry added only when its key has none.

  fn
• isEmpty&Std.SortedMap.SortedMap[K, V] -> Bool

  Whether the map holds nothing.

  fn
• keys&Std.SortedMap.SortedMap[K, V] -> Array[K]

  Every key, in order.

  fn
• last&Std.SortedMap.SortedMap[K, V] -> Option[(K, V)]

  The largest key and its value, or `None` for an empty map.

  fn
• lower&Std.SortedMap.SortedMap[K, V] -> K -> Option[(K, V)]

  The largest entry whose key comes strictly before the given one.

  fn
• mapValues&Std.SortedMap.SortedMap[K, A] -> fn(A) -> B -> Std.SortedMap.SortedMap[K, B]

  Every value transformed, keeping the keys and their order.

  fn
• merge&Std.SortedMap.SortedMap[K, V] -> &Std.SortedMap.SortedMap[K, V] -> Std.SortedMap.SortedMap[K, V]

  Two maps combined, with the second map's entries winning.

  fn
• nth&Std.SortedMap.SortedMap[K, V] -> Int -> Option[(K, V)]

  The entry at a position in key order, or `None` when there is none.

  fn
• pairs&Std.SortedMap.SortedMap[K, V] -> Array[(K, V)]

  Every entry as a pair, in key order.

  fn
• range&Std.SortedMap.SortedMap[K, V] -> K -> K -> Array[(K, V)]

  Every entry whose key is at least `from` and strictly before `until`.

  fn
• remove&Std.SortedMap.SortedMap[K, V] -> K -> Std.SortedMap.SortedMap[K, V]

  The map with a key's entry removed, or unchanged when there is none.

  fn
• restrictRange&Std.SortedMap.SortedMap[K, V] -> K -> K -> Std.SortedMap.SortedMap[K, V]

  The map with only the entries in the half-open range kept.

  fn
• reversed&Std.SortedMap.SortedMap[K, V] -> Std.SortedMap.SortedMap[K, V]

  The map with its entries in the reverse of its order.

  fn
• size&Std.SortedMap.SortedMap[K, V] -> Int

  How many entries the map holds.

  fn
• SortedMap

  A map whose keys are kept in an order the caller chose, and which can be

  type
• upsert&Std.SortedMap.SortedMap[K, V] -> K -> V -> fn(V) -> V -> Std.SortedMap.SortedMap[K, V]

  An entry's value transformed, inserting a starting value when it is absent.

  fn
• values&Std.SortedMap.SortedMap[K, V] -> Array[V]

  Every value, in the order of its key.

  fn