Package algs52

Class TrieST<V>

java.lang.Object

algs52.TrieST<V>

public class TrieST<V>
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
private static class	TrieST.Node<V>

Field Summary

Fields

Modifier and Type	Field	Description
private static final int	R
private TrieST.Node<V>	root

Constructor Summary

Constructors

Constructor	Description
TrieST()

Method Summary

Modifier and Type	Method	Description
private void	collect(TrieST.Node<V> x, String key, Queue<String> queue)
private void	collect(TrieST.Node<V> x, String prefix, String pat, Queue<String> q)
boolean	contains(String key)
private TrieST.Node<V>	delete(TrieST.Node<V> x, String key, int d)
void	delete(String key)
private TrieST.Node<V>	get(TrieST.Node<V> x, String key, int d)
V	get(String key)
Iterable<String>	keys()
Iterable<String>	keysThatMatch(String pat)
Iterable<String>	keysWithPrefix(String prefix)
private int	longestPrefixOf(TrieST.Node<V> x, String query, int d, int length)
String	longestPrefixOf(String query)
static void	main(String[] args)
private TrieST.Node<V>	put(TrieST.Node<V> x, String key, V val, int d)
void	put(String key, V val)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

R

private static final int R

See Also:

• Constant Field Values

root

private TrieST.Node<V> root

Constructor Details

TrieST

public TrieST()

Method Details

contains

public boolean contains(String key)

get

public V get(String key)

get

private TrieST.Node<V> get(TrieST.Node<V> x,
 String key,
 int d)

put

public void put(String key,
 V val)

put

private TrieST.Node<V> put(TrieST.Node<V> x,
 String key,
 V val,
 int d)

longestPrefixOf

public String longestPrefixOf(String query)

longestPrefixOf

private int longestPrefixOf(TrieST.Node<V> x,
 String query,
 int d,
 int length)

keys

public Iterable<String> keys()

keysWithPrefix

public Iterable<String> keysWithPrefix(String prefix)

collect

private void collect(TrieST.Node<V> x,
 String key,
 Queue<String> queue)

keysThatMatch

public Iterable<String> keysThatMatch(String pat)

collect

private void collect(TrieST.Node<V> x,
 String prefix,
 String pat,
 Queue<String> q)

delete

public void delete(String key)

delete

private TrieST.Node<V> delete(TrieST.Node<V> x,
 String key,
 int d)

main

public static void main(String[] args)