Results for “Std.BiMap.BiMap”

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

• Std.BiMap.BiMap

  A map that can be read from either side.

  type · Std.BiMap
• Std.BiMap.all&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Bool

  Whether every pair satisfies the predicate. True for an empty map.

  fn · Std.BiMap
• Std.BiMap.any&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Bool

  Whether any pair satisfies the predicate. False for an empty map.

  fn · Std.BiMap
• Std.BiMap.containsLeft&Std.BiMap.BiMap[L, R] -> L -> Bool

  Whether a left value is paired with anything.

  fn · Std.BiMap
• Std.BiMap.containsRight&Std.BiMap.BiMap[L, R] -> R -> Bool

  Whether a right value is paired with anything.

  fn · Std.BiMap
• Std.BiMap.emptyStd.BiMap.BiMap[L, R]

  A map with no pairs.

  fn · Std.BiMap
• Std.BiMap.filter&Std.BiMap.BiMap[L, R] -> fn(L, R) -> Bool -> Std.BiMap.BiMap[L, R]

  Only the pairs the predicate accepts.

  fn · Std.BiMap
• Std.BiMap.flipped&Std.BiMap.BiMap[L, R] -> Std.BiMap.BiMap[R, L]

  The map with its two sides exchanged.

  fn · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.fromPairs&Array[(L, R)] -> Std.BiMap.BiMap[L, R]

  A map built from pairs.

  fn · Std.BiMap
• Std.BiMap.fromPairsChecked&Array[(L, R)] -> Option[Std.BiMap.BiMap[L, R]]

  A map built from pairs, or None if any side repeats.

  fn · Std.BiMap
• Std.BiMap.getLeft&Std.BiMap.BiMap[L, R] -> R -> Option[L]

  The left value paired with a right one, or None.

  fn · Std.BiMap
• Std.BiMap.getRight&Std.BiMap.BiMap[L, R] -> L -> Option[R]

  The right value paired with a left one, or None.

  fn · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.isEmpty&Std.BiMap.BiMap[L, R] -> Bool

  Whether the map holds nothing.

  fn · Std.BiMap
• Std.BiMap.lefts&Std.BiMap.BiMap[L, R] -> Array[L]

  Every left value, in order.

  fn · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.pairs&Std.BiMap.BiMap[L, R] -> Array[(L, R)]

  Every pair, in the order of its left value.

  fn · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.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 · Std.BiMap
• Std.BiMap.rights&Std.BiMap.BiMap[L, R] -> Array[R]

  Every right value, in order.

  fn · Std.BiMap
• Std.BiMap.size&Std.BiMap.BiMap[L, R] -> Int

  How many pairs the map holds.

  fn · Std.BiMap
• Std.BiMap.toMap&Std.BiMap.BiMap[L, R] -> Map[L, R]

  The left-to-right direction as an ordinary map.

  fn · Std.BiMap