This class implements a special purpose hashtable. It works like a normal java.util.Hashtable except that:

Keys to "get" are strings which are known to be interned, so that "==" is used instead of "String.equals". (Interning could be document-relative instead of global.)
It's not synchronized, since it's to be used only by one thread at a time.
The keys () enumerator allocates no memory, with live updates to the data disallowed.
It's got fewer bells and whistles: fixed threshold and load factor, no JDK 1.2 collection support, only keys can be enumerated, things can't be removed, simpler inheritance; more.

The overall result is that it's less expensive to use these in performance-critical locations, in terms both of CPU and memory, than java.util.Hashtable instances. In this package it makes a significant difference when normalizing attributes, which is done for each start-element construct.

Nested and Inner Type Summary

Modifier and Type	Class and Description
private static class	SimpleHashtable.Entry Hashtable collision list.

Field Summary

Modifier and Type	Field and Description
private int	count
private SimpleHashtable.Entry	current
private int	currentBucket
private static final float	loadFactor
private SimpleHashtable.Entry[]	table
private int	threshold

Constructor Summary

Access	Constructor and Description
public	SimpleHashtable(int the initial capacity of the hashtable. initialCapacity) Constructs a new, empty hashtable with the specified initial capacity.
public	SimpleHashtable() Constructs a new, empty hashtable with a default capacity.

Method Summary

Modifier and Type	Method and Description
public void	clear()
public Object	get(String key) Returns the value to which the specified key is mapped in this hashtable.
public Object	getNonInterned(String key) Returns the value to which the specified key is mapped in this hashtable ...
public boolean	hasMoreElements() Implements java.util.Enumeration.hasMoreElements. Used to view this as an enumeration; returns true if there are more keys to be enumerated.
public Enumeration<Object>	Returns: an enumeration of the keys in this hashtable. keys() Returns an enumeration of the keys in this hashtable.
public Object	nextElement() Implements java.util.Enumeration.nextElement. Used to view this as an enumeration; returns the next key in the enumeration.
public Object	put(Object key, Object value) Maps the specified `key` to the specified `value` in this hashtable.
private void	rehash() Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently.
public int	Returns: the number of keys in this hashtable. size() Returns the number of keys in this hashtable.

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

Field Detail

count	back to summary
private int count

current	back to summary
private SimpleHashtable.Entry current

currentBucket	back to summary
private int currentBucket

loadFactor	back to summary
private static final float loadFactor

table	back to summary
private SimpleHashtable.Entry[] table

threshold	back to summary
private int threshold

Constructor Detail

SimpleHashtable	back to summary
public SimpleHashtable(int initialCapacity) Constructs a new, empty hashtable with the specified initial capacity. Parameters initialCapacity:int the initial capacity of the hashtable.

SimpleHashtable

back to summary

public SimpleHashtable(int initialCapacity)

Constructs a new, empty hashtable with the specified initial capacity.

Parameters

initialCapacity:int: the initial capacity of the hashtable.

SimpleHashtable	back to summary
public SimpleHashtable() Constructs a new, empty hashtable with a default capacity.

Method Detail

clear	back to summary
public void clear()

get	back to summary
public Object get(String key) Returns the value to which the specified key is mapped in this hashtable.

getNonInterned	back to summary
public Object getNonInterned(String key) Returns the value to which the specified key is mapped in this hashtable ... the key isn't necessarily interned, though.

hasMoreElements back to summary

hasMoreElements	back to summary
public boolean hasMoreElements() Implements java.util.Enumeration.hasMoreElements. Used to view this as an enumeration; returns true if there are more keys to be enumerated. Returns:boolean Doc from java.util.Enumeration.hasMoreElements. `true` if and only if this enumeration object contains at least one more element to provide; `false` otherwise.

public boolean hasMoreElements()

Implements java.util.Enumeration.hasMoreElements.

Used to view this as an enumeration; returns true if there are more keys to be enumerated.

Returns:boolean

Doc from java.util.Enumeration.hasMoreElements.

true if and only if this enumeration object contains at least one more element to provide; false otherwise.

keys back to summary

keys	back to summary
public Enumeration<Object> keys() Returns an enumeration of the keys in this hashtable. Returns:Enumeration<Object> an enumeration of the keys in this hashtable. See Also `Enumeration`

public Enumeration<Object> keys()

Returns an enumeration of the keys in this hashtable.

Returns:Enumeration<Object>: an enumeration of the keys in this hashtable.
See Also: Enumeration

nextElement	back to summary
public Object nextElement() Implements java.util.Enumeration.nextElement. Used to view this as an enumeration; returns the next key in the enumeration. Returns:Object Doc from java.util.Enumeration.nextElement. the next element of this enumeration.

nextElement

back to summary

public Object nextElement()

Implements java.util.Enumeration.nextElement.

Used to view this as an enumeration; returns the next key in the enumeration.

Returns:Object

Doc from java.util.Enumeration.nextElement.

the next element of this enumeration.

put back to summary

put	back to summary
public Object put(Object key, Object value) Maps the specified `key` to the specified `value` in this hashtable. Neither the key nor the value can be `null`. The value can be retrieved by calling the `get` method with a key that is equal to the original key.

public Object put(Object key, Object value)

Maps the specified key to the specified value in this hashtable. Neither the key nor the value can be null.

The value can be retrieved by calling the get method with a key that is equal to the original key.

rehash	back to summary
private void rehash() Increases the capacity of and internally reorganizes this hashtable, in order to accommodate and access its entries more efficiently. This method is called automatically when the number of keys in the hashtable exceeds this hashtable's capacity and load factor.

size	back to summary
public int size() Returns the number of keys in this hashtable. Returns:int the number of keys in this hashtable.

size

back to summary

public int size()

Returns the number of keys in this hashtable.

Returns:int: the number of keys in this hashtable.

com.sun.msv.scanner.dtd back to summary

private Class SimpleHashtable.Entry

Class Inheritance

extends Object

java.lang.Object
com.sun.msv.scanner.dtd.SimpleHashtable.Entry

Hashtable collision list.

Field Summary

Modifier and Type	Field and Description
pack-priv int	hash
pack-priv Object	key
pack-priv SimpleHashtable.Entry	next
pack-priv Object	value

Constructor Summary

Access	Constructor and Description
protected	Entry(int hash, Object key, Object value, SimpleHashtable.Entry next)

Method Summary

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

Field Detail

hash	back to summary
pack-priv int hash

key	back to summary
pack-priv Object key

next	back to summary
pack-priv SimpleHashtable.Entry next

value	back to summary
pack-priv Object value

Constructor Detail

Entry	back to summary
protected Entry(int hash, Object key, Object value, SimpleHashtable.Entry next)

pack-priv final Class SimpleHashtable

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class SimpleHashtable.Entry

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail