#include <XalanDOMStringHashTable.hpp>
Collaboration diagram for XalanDOMStringHashTable:
|
|
|
|
|
|
|
|
|
Create a hash table.
|
|
|
|
Get the number of buckets in the table.
|
|
Clear the hash table.
|
|
Get the collision count. Release builds will always return 0.
|
|
Find a string. If the string is not found, return null. If theBucketIndex is not null, the variable pointed to will be updated with the bucket index that was calculated for the string. This index can be used in a later call to insert() to avoid recalculating the index.
|
|
Find a string. If the string is not found, return null.
|
|
Get the size of each of the buckets in the table.
|
|
|
|
|
|
Insert a pointer to a string into the table. If the string is already present, the string will still be added, but it will never be found, since it will be placed after the identical string. theBucketIndex _must_ be the index returned from a previous call to find. If not, then the behavior is undefined. This is meant as an optimization to avoid re-hashing the string. Note that this class only stores a _pointer_ to a XalanDOMString. It's expected that the string will be allocated and managed outside of the hash table.
|
|
Insert a pointer to a string into the table. If the string is already present, the string will still be added, but it will never be found, since it will be placed after the identical string. Note that this class only stores a _pointer_ to a XalanDOMString. It's expected that the string will be allocated and managed outside of the hash table.
|
|
Get the number of strings in the table.
|
The documentation for this class was generated from the following file:
Doxygen and GraphViz are used to generate this API documentation from the Xalan-C header files.
Xalan-C++ XSLT Processor Version 1.10 |
|