Results for “Std.SortedMap.SortedMap”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.SortedMap.SortedMap

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

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

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

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

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

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

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

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

  Whether a key has an entry.

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

  An empty map ordered by the given comparison.

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

  Only the entries the predicate accepts.

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

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

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

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

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

  Every entry combined into one value, in key order.

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

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

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

  The value stored under a key, or None.

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

  The value stored under a key, or a fallback.

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

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

  fn · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.insertIfAbsent&Std.SortedMap.SortedMap[K, V] -> K -> V -> Std.SortedMap.SortedMap[K, V]

  An entry added only when its key has none.

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

  Whether the map holds nothing.

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

  Every key, in order.

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

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

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

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

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

  Every value transformed, keeping the keys and their order.

  fn · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.pairs&Std.SortedMap.SortedMap[K, V] -> Array[(K, V)]

  Every entry as a pair, in key order.

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

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

  fn · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.reversed&Std.SortedMap.SortedMap[K, V] -> Std.SortedMap.SortedMap[K, V]

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

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

  How many entries the map holds.

  fn · Std.SortedMap
• Std.SortedMap.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 · Std.SortedMap
• Std.SortedMap.values&Std.SortedMap.SortedMap[K, V] -> Array[V]

  Every value, in the order of its key.

  fn · Std.SortedMap