org.owasp.esapi.codecs

Class HashTrie.Node<T>

java.lang.Object

org.owasp.esapi.codecs.HashTrie.Node<T>

Enclosing class:

HashTrie<T>

private static class HashTrie.Node<T>
extends java.lang.Object

Node inside the trie.

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.Map<java.lang.Character,HashTrie.Node<T>>	nextMap
private T	value

Constructor Summary

Constructors

Modifier	Constructor and Description
private	Node()

Method Summary

Modifier and Type	Method and Description
(package private) boolean	containsValue(java.lang.Object toFind) Recursively search for a value.
(package private) java.util.Set<java.util.Map.Entry<java.lang.CharSequence,T>>	entrySet(java.lang.StringBuilder key, java.util.Set<java.util.Map.Entry<java.lang.CharSequence,T>> entries) Recursively build a entry set.
(package private) T	get(java.lang.CharSequence key, int pos) Recursively lookup a key's value.
(package private) HashTrie.Entry<T>	getLongestMatch(java.lang.CharSequence key, int pos) Recursively lookup the longest key match.
(package private) HashTrie.Entry<T>	getLongestMatch(java.io.PushbackReader keyIn, java.lang.StringBuilder key) Recursively lookup the longest key match.
(package private) HashTrie.Node<T>	getNextNode(java.lang.Character ch) Get the node for the specified character.
(package private) java.util.Set<java.lang.CharSequence>	keySet(java.lang.StringBuilder key, java.util.Set<java.lang.CharSequence> keys) Recursively build a key set.
private static <T> java.util.Map<java.lang.Character,HashTrie.Node<T>>	newNodeMap() Create a new Map for a node level.
private static <T> java.util.Map<java.lang.Character,HashTrie.Node<T>>	newNodeMap(java.util.Map<java.lang.Character,HashTrie.Node<T>> prev) Create a new Map for a node level.
(package private) T	put(java.lang.CharSequence key, int pos, T addValue) Recursively add a key.
(package private) void	remap() Recursively rebuild the internal maps.
(package private) void	setValue(T value) Set the value for the key terminated at this node.
(package private) java.util.Collection<T>	values(java.util.Collection<T> values) Recursively build values.

Methods inherited from class java.lang.Object

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

Field Detail

value

private T value

nextMap

private java.util.Map<java.lang.Character,HashTrie.Node<T>> nextMap

Constructor Detail

Node

private Node()

Method Detail

newNodeMap

private static <T> java.util.Map<java.lang.Character,HashTrie.Node<T>> newNodeMap()

Create a new Map for a node level. This is here so that if the underlying * Map implmentation needs to be switched it is easily done.

Returns:

A new Map for use.

newNodeMap

private static <T> java.util.Map<java.lang.Character,HashTrie.Node<T>> newNodeMap(java.util.Map<java.lang.Character,HashTrie.Node<T>> prev)

Create a new Map for a node level. This is here so that if the underlying * Map implmentation needs to be switched it is easily done.

Parameters:

prev - Pervious map to use to populate the new map.

Returns:

A new Map for use.

setValue

void setValue(T value)

Set the value for the key terminated at this node.

Parameters:

value - The value for this key.

getNextNode

HashTrie.Node<T> getNextNode(java.lang.Character ch)

Get the node for the specified character.

Parameters:

ch - The next character to look for.

Returns:

The node requested or null if it is not present.

put

T put(java.lang.CharSequence key,
      int pos,
      T addValue)

Recursively add a key.

Parameters:

key - The key being added.

pos - The position in key that is being handled at this level.

get

T get(java.lang.CharSequence key,
      int pos)

Recursively lookup a key's value.

Parameters:

key - The key being looked up.

pos - The position in the key that is being looked up at this level.

Returns:

The value assocatied with the key or null if none exists.

getLongestMatch

HashTrie.Entry<T> getLongestMatch(java.lang.CharSequence key,
                                  int pos)

Recursively lookup the longest key match.

Parameters:

key - The key being looked up.

pos - The position in the key that is being looked up at this level.

Returns:

The Entry assocatied with the longest key match or null if none exists.

getLongestMatch

HashTrie.Entry<T> getLongestMatch(java.io.PushbackReader keyIn,
                                  java.lang.StringBuilder key)
                           throws java.io.IOException

Recursively lookup the longest key match.

Parameters:

keyIn - Where to read the key from

pos - The position in the key that is being looked up at this level.

Returns:

The Entry assocatied with the longest key match or null if none exists.

Throws:

java.io.IOException

remap

void remap()

Recursively rebuild the internal maps.

containsValue

boolean containsValue(java.lang.Object toFind)

Recursively search for a value.

Parameters:

toFind - The value to search for

Returns:

true if the value was found false otherwise

values

java.util.Collection<T> values(java.util.Collection<T> values)

Recursively build values.

Parameters:

values - List being built.

Returns:

true if the value was found false otherwise

keySet

java.util.Set<java.lang.CharSequence> keySet(java.lang.StringBuilder key,
                                             java.util.Set<java.lang.CharSequence> keys)

Recursively build a key set.

Parameters:

key - StringBuilder with our key.

keys - Set to add to

Returns:

keys with additions

entrySet

java.util.Set<java.util.Map.Entry<java.lang.CharSequence,T>> entrySet(java.lang.StringBuilder key,
                                                                      java.util.Set<java.util.Map.Entry<java.lang.CharSequence,T>> entries)

Recursively build a entry set.

Parameters:

key - StringBuilder with our key.

entries - Set to add to

Returns:

entries with additions