Results for “Std.HashMap.HashMap”

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

• Std.HashMap.HashMap

  A map that finds a key by hashing it rather than by comparing it.

  type · Std.HashMap
• Std.HashMap.bucketCount&Std.HashMap.HashMap[K, V] -> Int where K: Eq + Hash

  How many buckets the map is currently spread across.

  fn · Std.HashMap
• Std.HashMap.containsKey&Std.HashMap.HashMap[K, V] -> &K -> Bool where K: Eq + Hash

  Whether a key is present.

  fn · Std.HashMap
• Std.HashMap.emptyStd.HashMap.HashMap[K, V] where K: Eq + Hash

  A map holding nothing.

  fn · Std.HashMap
• Std.HashMap.entries&Std.HashMap.HashMap[K, V] -> Array[(K, V)] where K: Eq + Hash

  Every pairing, in the order the keys were first put in.

  fn · Std.HashMap
• Std.HashMap.equals&Std.HashMap.HashMap[K, V] -> &Std.HashMap.HashMap[K, V] -> Bool where K: Eq + Hash, V: Eq

  Whether two maps hold the same pairings.

  fn · Std.HashMap
• Std.HashMap.filter&Std.HashMap.HashMap[K, V] -> fn(K, V) -> Bool -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map holding only the pairings a test accepts.

  fn · Std.HashMap
• Std.HashMap.fold&Std.HashMap.HashMap[K, V] -> A -> fn(A, K, V) -> A -> A where K: Eq + Hash

  Every pairing combined into one value, in insertion order.

  fn · Std.HashMap
• Std.HashMap.fromArray&Array[(K, V)] -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map built from pairings, later ones replacing earlier ones.

  fn · Std.HashMap
• Std.HashMap.get&Std.HashMap.HashMap[K, V] -> &K -> Option[V] where K: Eq + Hash

  The value under a key, or nothing when the map does not hold it.

  fn · Std.HashMap
• Std.HashMap.getOr&Std.HashMap.HashMap[K, V] -> &K -> V -> V where K: Eq + Hash

  The value under a key, or a fallback when the map does not hold it.

  fn · Std.HashMap
• Std.HashMap.insert&Std.HashMap.HashMap[K, V] -> K -> V -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map with a pairing added, replacing any value already under the key.

  fn · Std.HashMap
• Std.HashMap.insertWith&Std.HashMap.HashMap[K, V] -> K -> V -> fn(V, V) -> V -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map with a pairing added, combining with any value already there.

  fn · Std.HashMap
• Std.HashMap.isEmpty&Std.HashMap.HashMap[K, V] -> Bool where K: Eq + Hash

  Whether a map holds nothing.

  fn · Std.HashMap
• Std.HashMap.keys&Std.HashMap.HashMap[K, V] -> Array[K] where K: Eq + Hash

  Every key, in the order they were first put in.

  fn · Std.HashMap
• Std.HashMap.map&Std.HashMap.HashMap[K, V] -> fn(V) -> W -> Std.HashMap.HashMap[K, W] where K: Eq + Hash

  A map with every value transformed, keeping keys and their order.

  fn · Std.HashMap
• Std.HashMap.merge&Std.HashMap.HashMap[K, V] -> &Std.HashMap.HashMap[K, V] -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  Two maps joined, the second's value winning where both hold a key.

  fn · Std.HashMap
• Std.HashMap.mergeWith&Std.HashMap.HashMap[K, V] -> &Std.HashMap.HashMap[K, V] -> fn(V, V) -> V -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  Two maps joined, a rule deciding where both hold a key.

  fn · Std.HashMap
• Std.HashMap.remove&Std.HashMap.HashMap[K, V] -> &K -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map with a key removed, or the same map when it held none.

  fn · Std.HashMap
• Std.HashMap.singletonK -> V -> Std.HashMap.HashMap[K, V] where K: Eq + Hash

  A map holding one pairing.

  fn · Std.HashMap
• Std.HashMap.size&Std.HashMap.HashMap[K, V] -> Int where K: Eq + Hash

  How many pairings a map holds.

  fn · Std.HashMap
• Std.HashMap.values&Std.HashMap.HashMap[K, V] -> Array[V] where K: Eq + Hash

  Every value, in the order their keys were first put in.

  fn · Std.HashMap