Std.LinkedMap

27 public declarations

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

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

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

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

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

  Whether a key has an entry.

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

  A map with no entries.

  fn
• 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
• fold&Std.LinkedMap.LinkedMap[K, V] -> fn(A, K, V) -> A -> A -> A

  Every entry combined into one value, in insertion order.

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

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

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

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

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

  The value stored under a key, or a fallback.

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

  The map with an entry added or replaced.

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

  An entry added only when its key has none.

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

  Whether the map holds nothing.

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

  Every key, in insertion order.

  fn
• LinkedMap

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

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

  Every value transformed, keeping the keys and their order.

  fn
• 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
• newest&Std.LinkedMap.LinkedMap[K, V] -> Option[(K, V)]

  The most recently added entry, or `None`.

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

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

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

  Every entry as a pair, in insertion order.

  fn
• 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
• removeOldest&Std.LinkedMap.LinkedMap[K, V] -> Std.LinkedMap.LinkedMap[K, V]

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

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

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

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

  How many entries the map holds.

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

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

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

  Every value, in the insertion order of its key.

  fn