Results for “Std.FlatMap.FlatMap”
10 matching declarations
Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.
- Std.FlatMap.FlatMap
A high-performance flat hash table specialized for 64-bit unsigned keys.
- Std.FlatMap.containsKey
&Std.FlatMap.FlatMap[V] -> UInt64 -> BoolWhether the table contains an entry for the specified 64-bit key.
- Std.FlatMap.empty
Int -> Std.FlatMap.FlatMap[V]Creates an empty flat hash table with the requested minimum capacity.
- Std.FlatMap.entries
&Std.FlatMap.FlatMap[V] -> Array[(UInt64, V)]Extracts all active key-value pairings as an array in slot order.
- Std.FlatMap.get
&Std.FlatMap.FlatMap[V] -> UInt64 -> Option[V]Looks up a value by its 64-bit unsigned key.
- Std.FlatMap.getOr
&Std.FlatMap.FlatMap[V] -> UInt64 -> V -> VLooks up a value by its key, returning
fallbackif the key is absent. - Std.FlatMap.insert
&Std.FlatMap.FlatMap[V] -> UInt64 -> V -> Std.FlatMap.FlatMap[V]Inserts or replaces a key-value pairing in the table.
- Std.FlatMap.isEmpty
&Std.FlatMap.FlatMap[V] -> BoolWhether the table contains zero entries.
- Std.FlatMap.remove
&Std.FlatMap.FlatMap[V] -> UInt64 -> Std.FlatMap.FlatMap[V]Removes a key-value pairing from the table.
- Std.FlatMap.size
&Std.FlatMap.FlatMap[V] -> IntThe number of live key-value pairings currently stored in the table.
