Results for “Std.PrefixTrie.PrefixTrie”

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

• Std.PrefixTrie.PrefixTrie

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

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

  Whether a key has a value.

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

  How many keys begin with the prefix.

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

  A trie with nothing in it.

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

  Only the entries the predicate accepts.

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

  Every entry combined into one value, in key order.

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

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

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

  The trie with every key of an array of pairs.

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

  The value stored under a key, or None.

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

  The value stored under a key, or a fallback.

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

  Whether any key begins with this prefix.

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

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

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

  Whether the trie holds no keys.

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

  Every key, in order.

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

  Every key beginning with the prefix, in order.

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

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

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

  Every value transformed, keeping the keys.

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

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

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

  Every key and value, in key order.

  fn · Std.PrefixTrie
• Std.PrefixTrie.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 · Std.PrefixTrie
• Std.PrefixTrie.size&Std.PrefixTrie.PrefixTrie[V] -> Int

  How many keys have values.

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

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

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

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

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

  Every value, in the order of its key.

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

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

  fn · Std.PrefixTrie