module

Std.BiMap

24 public declarations

all&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Bool
Whether every pair satisfies the predicate. True for an empty map.
fn
any&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Bool
Whether any pair satisfies the predicate. False for an empty map.
fn
BiMap
A map that can be read from either side.
type
containsLeft&Std.BiMap.BiMap[L, R] -> L -> Bool
Whether a left value is paired with anything.
fn
containsRight&Std.BiMap.BiMap[L, R] -> R -> Bool
Whether a right value is paired with anything.
fn
emptyStd.BiMap.BiMap[L, R]
A map with no pairs.
fn
filter&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Std.BiMap.BiMap[L, R]
Only the pairs the predicate accepts.
fn
flipped&Std.BiMap.BiMap[L, R] -> Std.BiMap.BiMap[R, L]
The map with its two sides exchanged.
fn
fold&Std.BiMap.BiMap[L, R] -> fn(A, L, R) -> A -> A -> A
Every pair combined into one value, in the order of the left values.
fn
fromPairs&Array[(L, R)] -> Std.BiMap.BiMap[L, R]
A map built from pairs.
fn
fromPairsChecked&Array[(L, R)] -> Option[Std.BiMap.BiMap[L, R]]
A map built from pairs, or `None` if any side repeats.
fn
getLeft&Std.BiMap.BiMap[L, R] -> R -> Option[L]
The left value paired with a right one, or `None`.
fn
getRight&Std.BiMap.BiMap[L, R] -> L -> Option[R]
The right value paired with a left one, or `None`.
fn
insert&Std.BiMap.BiMap[L, R] -> L -> R -> Std.BiMap.BiMap[L, R]
The map with a pair added, displacing whatever either side was paired with.
fn
insertChecked&Std.BiMap.BiMap[L, R] -> L -> R -> Option[Std.BiMap.BiMap[L, R]]
The map with a pair added, or `None` when either side is already paired.
fn
isEmpty&Std.BiMap.BiMap[L, R] -> Bool
Whether the map holds nothing.
fn
lefts&Std.BiMap.BiMap[L, R] -> Array[L]
Every left value, in order.
fn
merge&Std.BiMap.BiMap[L, R] -> &Std.BiMap.BiMap[L, R] -> Std.BiMap.BiMap[L, R]
Two maps combined, with the second map's pairs displacing the first's.
fn
pairs&Std.BiMap.BiMap[L, R] -> Array[(L, R)]
Every pair, in the order of its left value.
fn
removeLeft&Std.BiMap.BiMap[L, R] -> L -> Std.BiMap.BiMap[L, R]
The map with a left value's pair removed, or unchanged when it has none.
fn
removeRight&Std.BiMap.BiMap[L, R] -> R -> Std.BiMap.BiMap[L, R]
The map with a right value's pair removed, or unchanged when it has none.
fn
rights&Std.BiMap.BiMap[L, R] -> Array[R]
Every right value, in order.
fn
size&Std.BiMap.BiMap[L, R] -> Int
How many pairs the map holds.
fn
toMap&Std.BiMap.BiMap[L, R] -> Map[L, R]
The left-to-right direction as an ordinary map.
fn