Results for “Std.LinkedMap.LinkedMap”

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

• Std.LinkedMap.LinkedMap

  A map that also remembers the order its keys were first put in.

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

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

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

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

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

  Whether a key has an entry.

  fn · Std.LinkedMap
• Std.LinkedMap.emptyStd.LinkedMap.LinkedMap[K, V]

  A map with no entries.

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

  Only the entries the predicate accepts, in the order they were put in.

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

  Every entry combined into one value, in insertion order.

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

  A map built from pairs, in the order they are given.

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

  The value stored under a key, or None.

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

  The value stored under a key, or a fallback.

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

  The map with an entry added or replaced.

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

  An entry added only when its key has none.

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

  Whether the map holds nothing.

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

  Every key, in insertion order.

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

  Every value transformed, keeping the keys and their order.

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

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

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

  The most recently added entry, or None.

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

  The first entry put in that is still here, or None.

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

  Every entry as a pair, in insertion order.

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

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

  fn · Std.LinkedMap
• Std.LinkedMap.removeOldest&Std.LinkedMap.LinkedMap[K, V] -> Std.LinkedMap.LinkedMap[K, V]

  The map without its oldest entry, unchanged when it is empty.

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

  The entries in the reverse of the order they were put in.

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

  How many entries the map holds.

  fn · Std.LinkedMap
• Std.LinkedMap.toMap&Std.LinkedMap.LinkedMap[K, V] -> Map[K, V]

  The map with its order forgotten, as an ordinary map.

  fn · Std.LinkedMap
• Std.LinkedMap.touch&Std.LinkedMap.LinkedMap[K, V] -> K -> V -> Std.LinkedMap.LinkedMap[K, V]

  The map with an entry moved to the end of the order, added if it is new.

  fn · Std.LinkedMap
• Std.LinkedMap.upsert&Std.LinkedMap.LinkedMap[K, V] -> K -> V -> fn(V) -> V -> Std.LinkedMap.LinkedMap[K, V]

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

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

  Every value, in the insertion order of its key.

  fn · Std.LinkedMap