Results for “Std.IntMap.IntMap”

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

• Std.IntMap.IntMap

  A purely functional bitwise integer Patricia Trie mapping 64-bit integer keys to values.

  type · Std.IntMap
• Std.IntMap.adjust&Std.IntMap.IntMap[V] -> Int -> fn(V) -> V -> Std.IntMap.IntMap[V]

  Updates the value at key if present using function f.

  fn · Std.IntMap
• Std.IntMap.delete&Std.IntMap.IntMap[V] -> Int -> Std.IntMap.IntMap[V]

  Deletes the entry for key if present in the map.

  fn · Std.IntMap
• Std.IntMap.difference&Std.IntMap.IntMap[V] -> &Std.IntMap.IntMap[V] -> Std.IntMap.IntMap[V]

  Computes the difference of two maps (entries in left whose keys are not in right).

  fn · Std.IntMap
• Std.IntMap.emptyStd.IntMap.IntMap[V]

  Constructs an empty integer map.

  fn · Std.IntMap
• Std.IntMap.entries&Std.IntMap.IntMap[V] -> Array[Std.IntMap.IntMapEntry[V]]

  Returns an array of all key-value entries in key order.

  fn · Std.IntMap
• Std.IntMap.get&Std.IntMap.IntMap[V] -> Int -> Option[V]

  Looks up the value associated with key in the map.

  fn · Std.IntMap
• Std.IntMap.getOr&Std.IntMap.IntMap[V] -> Int -> V -> V

  Looks up the value associated with key, returning fallback if absent.

  fn · Std.IntMap
• Std.IntMap.insert&Std.IntMap.IntMap[V] -> Int -> V -> Std.IntMap.IntMap[V]

  Inserts or replaces a key-value pairing in the map.

  fn · Std.IntMap
• Std.IntMap.intersection&Std.IntMap.IntMap[V] -> &Std.IntMap.IntMap[V] -> Std.IntMap.IntMap[V]

  Computes the intersection of two maps, keeping values from the left map.

  fn · Std.IntMap
• Std.IntMap.isEmpty&Std.IntMap.IntMap[V] -> Bool

  Whether the map contains no entries.

  fn · Std.IntMap
• Std.IntMap.keys&Std.IntMap.IntMap[V] -> Array[Int]

  Returns an array of all keys in ascending order.

  fn · Std.IntMap
• Std.IntMap.mapValues&Std.IntMap.IntMap[A] -> fn(A) -> B -> Std.IntMap.IntMap[B]

  Transforms all values in the map using function f.

  fn · Std.IntMap
• Std.IntMap.maxKey&Std.IntMap.IntMap[V] -> Option[Int]

  Returns the largest key present in the map, or None if empty.

  fn · Std.IntMap
• Std.IntMap.member&Std.IntMap.IntMap[V] -> Int -> Bool

  Whether the map contains an entry for key.

  fn · Std.IntMap
• Std.IntMap.minKey&Std.IntMap.IntMap[V] -> Option[Int]

  Returns the smallest key present in the map, or None if empty.

  fn · Std.IntMap
• Std.IntMap.singletonInt -> V -> Std.IntMap.IntMap[V]

  Constructs an integer map with a single key-value pairing.

  fn · Std.IntMap
• Std.IntMap.size&Std.IntMap.IntMap[V] -> Int

  The number of entries contained in the map.

  fn · Std.IntMap
• Std.IntMap.union&Std.IntMap.IntMap[V] -> &Std.IntMap.IntMap[V] -> Std.IntMap.IntMap[V]

  Computes the union of two maps, preferring values in left on duplicate keys.

  fn · Std.IntMap
• Std.IntMap.values&Std.IntMap.IntMap[V] -> Array[V]

  Returns an array of all values in key order.

  fn · Std.IntMap