Results for “Std.EnumMap.EnumMap”

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

• Std.EnumMap.EnumMap

  A map over a fixed set of keys, where every key has a value.

  type · Std.EnumMap
• Std.EnumMap.adjust&Std.EnumMap.EnumMap[K, V] -> K -> fn(V) -> V -> Std.EnumMap.EnumMap[K, V]

  A key's value transformed, unchanged when the key is outside the domain.

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

  Whether every entry satisfies the predicate. True over an empty domain.

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

  Whether any entry satisfies the predicate. False over an empty domain.

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

  Whether a key is in the domain.

  fn · Std.EnumMap
• Std.EnumMap.countValues&Std.EnumMap.EnumMap[K, V] -> fn(V) -> Bool -> Int

  How many values the predicate accepts.

  fn · Std.EnumMap
• Std.EnumMap.filled&Array[K] -> V -> Std.EnumMap.EnumMap[K, V]

  A map giving every key in the domain the same starting value.

  fn · Std.EnumMap
• Std.EnumMap.find&Std.EnumMap.EnumMap[K, V] -> K -> Option[V]

  The value stored under a key, or None when the key is outside the domain.

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

  Every entry combined into one value, in domain order.

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

  A map giving every key in the domain the value a function computes for it.

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

  The value stored under a key.

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

  The value stored under a key, or the given fallback when the key is not in

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

  Whether the domain names any key at all.

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

  Every key, in the order the domain named them.

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

  The keys whose values the predicate accepts.

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

  Every value transformed, keeping the domain and its order.

  fn · Std.EnumMap
• Std.EnumMap.mergeWith&Std.EnumMap.EnumMap[K, V] -> &Std.EnumMap.EnumMap[K, V] -> fn(V, V) -> V -> Std.EnumMap.EnumMap[K, V]

  Two maps over the same domain combined value by value.

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

  Every entry as a pair, in domain order.

  fn · Std.EnumMap
• Std.EnumMap.set&Std.EnumMap.EnumMap[K, V] -> K -> V -> Std.EnumMap.EnumMap[K, V]

  The map with a key's value replaced, unchanged when the key is outside the

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

  How many keys the domain holds.

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

  The map as an ordinary map, losing the promise that every key has a value.

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

  Every value, in the order of its key.

  fn · Std.EnumMap