Modifier and Type	Class and Description
protected static class	SymbolHash.Entry This class is a key table entry.

Field Summary

Modifier and Type	Field and Description
protected SymbolHash.Entry[]	fBuckets Buckets.
protected int[]	fHashMultipliers Array of randomly selected hash function multipliers or `null` if the default String.hashCode() function should be used.
protected int	fNum Number of elements.
protected int	fTableSize Actual table size
protected static final int	MAX_HASH_COLLISIONS Maximum hash collisions per bucket.
protected static final int	MULTIPLIERS_MASK
protected static final int	MULTIPLIERS_SIZE
protected static final int	TABLE_SIZE Default table size.

Constructor Summary

Access	Constructor and Description
public	SymbolHash() Constructs a key table with the default size.
public	SymbolHash(int the size of the key table. size) Constructs a key table with a given size.

Method Summary

Modifier and Type	Method and Description
public void	clear() Remove all key/value association.
public Object	Returns: the value associated with the given key. get(Object key) Get the value associated with the given key.
public Object[]	getEntries() Return key/value pairs of all entries in the map
public int	Returns: the number of key/value pairs stored in this table. getLength() Get the number of key/value pairs stored in this table.
public int	Returns: number of elements copied to the array getValues(Object[] the array to store the elements elements, int where to start store element in the array from) Add all values to the given array.
protected int	hash(Object The key to hash. key) Returns a hashcode value for the specified key.
private int	hash0(String symbol)
public SymbolHash	makeClone() Make a clone of this object.
public void	put(Object key, Object value) Adds the key/value mapping to the key table.
protected void	rebalance() Randomly selects a new hash function and reorganizes this SymbolHash in order to more evenly distribute its entries across the table.
protected void	rehash() Increases the capacity of and internally reorganizes this SymbolHash, in order to accommodate and access its entries more efficiently.
private void	rehashCommon(final int newCapacity)
protected SymbolHash.Entry	search(Object key, int bucket)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

fBuckets	back to summary
protected SymbolHash.Entry[] fBuckets Buckets.

fHashMultipliers	back to summary
protected int[] fHashMultipliers Array of randomly selected hash function multipliers or `null` if the default String.hashCode() function should be used.

fNum	back to summary
protected int fNum Number of elements.

fTableSize	back to summary
protected int fTableSize Actual table size

MAX_HASH_COLLISIONS	back to summary
protected static final int MAX_HASH_COLLISIONS Maximum hash collisions per bucket.

MULTIPLIERS_MASK	back to summary
protected static final int MULTIPLIERS_MASK

MULTIPLIERS_SIZE	back to summary
protected static final int MULTIPLIERS_SIZE

TABLE_SIZE	back to summary
protected static final int TABLE_SIZE Default table size.

Constructor Detail

SymbolHash	back to summary
public SymbolHash() Constructs a key table with the default size.

SymbolHash	back to summary
public SymbolHash(int size) Constructs a key table with a given size. Parameters size:int the size of the key table.

SymbolHash

back to summary

public SymbolHash(int size)

Constructs a key table with a given size.

Parameters

size:int: the size of the key table.

Method Detail

clear	back to summary
public void clear() Remove all key/value association. This tries to save a bit of GC'ing by at least keeping the fBuckets array around.

get	back to summary
public Object get(Object key) Get the value associated with the given key. Returns:Object the value associated with the given key.

get

back to summary

public Object get(Object key)

Get the value associated with the given key.

Returns:Object: the value associated with the given key.

getEntries	back to summary
public Object[] getEntries() Return key/value pairs of all entries in the map

getLength	back to summary
public int getLength() Get the number of key/value pairs stored in this table. Returns:int the number of key/value pairs stored in this table.

getLength

back to summary

public int getLength()

Get the number of key/value pairs stored in this table.

Returns:int: the number of key/value pairs stored in this table.

getValues	back to summary
public int getValues(Object[] elements, int from) Add all values to the given array. The array must have enough entry. Parameters elements:Object[] the array to store the elements from:int where to start store element in the array Returns:int number of elements copied to the array

getValues

back to summary

public int getValues(Object[] elements, int from)

Add all values to the given array. The array must have enough entry.

Parameters

elements:Object[]: the array to store the elements
from:int: where to start store element in the array

Returns:int

number of elements copied to the array

hash	back to summary
protected int hash(Object key) Returns a hashcode value for the specified key. Parameters key:Object The key to hash.

hash

back to summary

protected int hash(Object key)

Returns a hashcode value for the specified key.

Parameters

key:Object: The key to hash.

hash0	back to summary
private int hash0(String symbol)

makeClone	back to summary
public SymbolHash makeClone() Make a clone of this object.

put	back to summary
public void put(Object key, Object value) Adds the key/value mapping to the key table. If the key already exists, the previous value associated with this key is overwritten by the new value.

rebalance	back to summary
protected void rebalance() Randomly selects a new hash function and reorganizes this SymbolHash in order to more evenly distribute its entries across the table. This method is called automatically when the number keys in one of the SymbolHash's buckets exceeds MAX_HASH_COLLISIONS.

rehash	back to summary
protected void rehash() Increases the capacity of and internally reorganizes this SymbolHash, in order to accommodate and access its entries more efficiently. This method is called automatically when the number of keys in the SymbolHash exceeds its number of buckets.

rehashCommon	back to summary
private void rehashCommon(final int newCapacity)

search	back to summary
protected SymbolHash.Entry search(Object key, int bucket)

org.apache.xerces.util back to summary

protected final Class SymbolHash.Entry

Class Inheritance

extends Object

java.lang.Object
org.apache.xerces.util.SymbolHash.Entry

This class is a key table entry. Each entry acts as a node in a linked list.

Field Summary

Modifier and Type	Field and Description
public Object	key
public SymbolHash.Entry	next The next entry.
public Object	value

Constructor Summary

Access	Constructor and Description
public	Entry()
public	Entry(Object key, Object value, SymbolHash.Entry next)

Method Summary

Modifier and Type	Method and Description
public SymbolHash.Entry	makeClone()

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

key	back to summary
public Object key

next	back to summary
public SymbolHash.Entry next The next entry.

value	back to summary
public Object value

Constructor Detail

Entry	back to summary
public Entry()

Entry	back to summary
public Entry(Object key, Object value, SymbolHash.Entry next)

Method Detail

makeClone	back to summary
public SymbolHash.Entry makeClone()

public Class SymbolHash

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

protected final Class SymbolHash.Entry

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail