Std.PrefixTrie

25 public declarations

• containsKey&Std.PrefixTrie.PrefixTrie[V] -> Str -> Bool

  Whether a key has a value.

  fn
• countWithPrefix&Std.PrefixTrie.PrefixTrie[V] -> Str -> Int

  How many keys begin with the prefix.

  fn
• emptyStd.PrefixTrie.PrefixTrie[V]

  A trie with nothing in it.

  fn
• filter&Std.PrefixTrie.PrefixTrie[V] -> fn(Str, V) -> Bool -> Std.PrefixTrie.PrefixTrie[V]

  Only the entries the predicate accepts.

  fn
• fold&Std.PrefixTrie.PrefixTrie[V] -> fn(A, Str, V) -> A -> A -> A

  Every entry combined into one value, in key order.

  fn
• fromKeys&Array[Str] -> V -> Std.PrefixTrie.PrefixTrie[V]

  A trie of every key in an array, each holding the same value.

  fn
• fromPairs&Array[(Str, V)] -> Std.PrefixTrie.PrefixTrie[V]

  The trie with every key of an array of pairs.

  fn
• get&Std.PrefixTrie.PrefixTrie[V] -> Str -> Option[V]

  The value stored under a key, or `None`.

  fn
• getOr&Std.PrefixTrie.PrefixTrie[V] -> Str -> V -> V

  The value stored under a key, or a fallback.

  fn
• hasPrefix&Std.PrefixTrie.PrefixTrie[V] -> Str -> Bool

  Whether any key begins with this prefix.

  fn
• insert&Std.PrefixTrie.PrefixTrie[V] -> Str -> V -> Std.PrefixTrie.PrefixTrie[V]

  The trie with a key's value added or replaced.

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

  Whether the trie holds no keys.

  fn
• keys&Std.PrefixTrie.PrefixTrie[V] -> Array[Str]

  Every key, in order.

  fn
• keysWithPrefix&Std.PrefixTrie.PrefixTrie[V] -> Str -> Array[Str]

  Every key beginning with the prefix, in order.

  fn
• longestPrefixOf&Std.PrefixTrie.PrefixTrie[V] -> Str -> Option[(Str, V)]

  The longest key that is a prefix of the given text, and its value.

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

  Every value transformed, keeping the keys.

  fn
• merge&Std.PrefixTrie.PrefixTrie[V] -> &Std.PrefixTrie.PrefixTrie[V] -> Std.PrefixTrie.PrefixTrie[V]

  Two tries combined, with the second's values winning.

  fn
• pairs&Std.PrefixTrie.PrefixTrie[V] -> Array[(Str, V)]

  Every key and value, in key order.

  fn
• PrefixTrie

  Text keys held by their characters, so a prefix can be asked about.

  type
• remove&Std.PrefixTrie.PrefixTrie[V] -> Str -> Std.PrefixTrie.PrefixTrie[V]

  The trie with a key's value removed, or unchanged when it has none.

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

  How many keys have values.

  fn
• toMap&Std.PrefixTrie.PrefixTrie[V] -> Map[Str, V]

  The entries as an ordinary map, losing the ability to ask about prefixes.

  fn
• under&Std.PrefixTrie.PrefixTrie[V] -> Str -> Std.PrefixTrie.PrefixTrie[V]

  The trie of everything under a prefix, with the prefix stripped from the

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

  Every value, in the order of its key.

  fn
• withPrefix&Std.PrefixTrie.PrefixTrie[V] -> Str -> Array[(Str, V)]

  Every entry whose key begins with the prefix, in key order.

  fn