public final class CharsToNameCanonicalizer extends Object
For optimal performance, usage pattern should be one where matches
should be very common (especially after "warm-up"), and as with most hash-based
maps/sets, that hash codes are uniformly distributed. Also, collisions
are slightly more expensive than with HashMap or HashSet, since hash codes
are not used in resolving collisions; that is, equals() comparison is
done with all symbols in same bucket index.
Finally, rehashing is also more expensive, as hash codes are not
stored; rehashing requires all entries' hash codes to be recalculated.
Reason for not storing hash codes is reduced memory usage, hoping
for better memory locality.
Usual usage pattern is to create a single "master" instance, and either use that instance in sequential fashion, or to create derived "child" instances, which after use, are asked to return possible symbol additions to master instance. In either case benefit is that symbol table gets initialized so that further uses are more efficient, as eventually all symbols needed will already be in symbol table. At that point no more Symbol String allocations are needed, nor changes to symbol table itself.
Note that while individual SymbolTable instances are NOT thread-safe (much like generic collection classes), concurrently used "child" instances can be freely used without synchronization. However, using master table concurrently with child instances can only be done if access to master instance is read-only (i.e. no modifications done).
Modifier and Type | Field and Description |
---|---|
protected com.fasterxml.jackson.core.sym.CharsToNameCanonicalizer.Bucket[] |
_buckets
Overflow buckets; if primary doesn't match, lookup is done
from here.
|
protected boolean |
_canonicalize
Whether any canonicalization should be attempted (whether using
intern or not.
|
protected int |
_flags |
protected boolean |
_hashShared
Flag that indicates whether underlying data structures for
the main hash area are shared or not.
|
protected int |
_indexMask
Mask used to get index from hash values; equal to
_buckets.length - 1 , when _buckets.length is
a power of two. |
protected int |
_longestCollisionList
We need to keep track of the longest collision list; this is needed
both to indicate problems with attacks and to allow flushing for
other cases.
|
protected BitSet |
_overflows
Lazily constructed structure that is used to keep track of
collision buckets that have overflowed once: this is used
to detect likely attempts at denial-of-service attacks that
uses hash collisions.
|
protected CharsToNameCanonicalizer |
_parent
Sharing of learnt symbols is done by optional linking of symbol
table instances with their parents.
|
protected int |
_seed
Seed value we use as the base to make hash codes non-static between
different runs, but still stable for lifetime of a single symbol table
instance.
|
protected int |
_size
Current size (number of entries); needed to know if and when
rehash.
|
protected int |
_sizeThreshold
Limit that indicates maximum size this instance can hold before
it needs to be expanded and rehashed.
|
protected String[] |
_symbols
Primary matching symbols; it's expected most match occur from
here.
|
protected AtomicReference<com.fasterxml.jackson.core.sym.CharsToNameCanonicalizer.TableInfo> |
_tableInfo
Member that is only used by the root table instance: root
passes immutable state info child instances, and children
may return new state if they add entries to the table.
|
static int |
HASH_MULT |
Modifier and Type | Method and Description |
---|---|
int |
_hashToIndex(int rawHash)
Helper method that takes in a "raw" hash value, shuffles it as necessary,
and truncates to be used as the index.
|
protected void |
_reportTooManyCollisions(int maxLen) |
int |
bucketCount()
Method for checking number of primary hash buckets this symbol
table uses.
|
int |
calcHash(char[] buffer,
int start,
int len)
Implementation of a hashing method for variable length
Strings.
|
int |
calcHash(String key) |
int |
collisionCount()
Method mostly needed by unit tests; calculates number of
entries that are in collision list.
|
static CharsToNameCanonicalizer |
createRoot()
Method called to create root canonicalizer for a
JsonFactory
instance. |
protected static CharsToNameCanonicalizer |
createRoot(int seed) |
String |
findSymbol(char[] buffer,
int start,
int len,
int h) |
int |
hashSeed() |
CharsToNameCanonicalizer |
makeChild(int flags)
"Factory" method; will create a new child instance of this symbol
table.
|
int |
maxCollisionLength()
Method mostly needed by unit tests; calculates length of the
longest collision chain.
|
boolean |
maybeDirty() |
void |
release()
Method called by the using code to indicate it is done with this instance.
|
int |
size() |
protected void |
verifyInternalConsistency()
Diagnostics method that will verify that internal data structures are consistent;
not meant as user-facing method but only for test suites and possible troubleshooting.
|
public static final int HASH_MULT
protected final CharsToNameCanonicalizer _parent
release
),
parent's shared tables may be updated from the child instance.protected final AtomicReference<com.fasterxml.jackson.core.sym.CharsToNameCanonicalizer.TableInfo> _tableInfo
protected final int _seed
protected final int _flags
protected boolean _canonicalize
NOTE: non-final since we may need to disable this with overflow.
protected String[] _symbols
protected com.fasterxml.jackson.core.sym.CharsToNameCanonicalizer.Bucket[] _buckets
Note: Number of buckets is half of number of symbol entries, on assumption there's less need for buckets.
protected int _size
protected int _sizeThreshold
protected int _indexMask
_buckets.length - 1
, when _buckets.length is
a power of two.protected int _longestCollisionList
protected boolean _hashShared
This flag needs to be checked both when adding new main entries, and when adding new collision list queues (i.e. creating a new collision list head entry)
protected BitSet _overflows
public static CharsToNameCanonicalizer createRoot()
JsonFactory
instance. Root instance is never used directly; its main use is for
storing and sharing underlying symbol arrays as needed.protected static CharsToNameCanonicalizer createRoot(int seed)
public CharsToNameCanonicalizer makeChild(int flags)
Note: while this method is synchronized, it is generally not safe to both use makeChild/mergeChild, AND to use instance actively. Instead, a separate 'root' instance should be used on which only makeChild/mergeChild are called, but instance itself is not used as a symbol table.
flags
- Bit flags of active JsonFactory.Feature
s enabled.public void release()
public int size()
public int bucketCount()
public boolean maybeDirty()
public int hashSeed()
public int collisionCount()
size()
- 1), but should usually be much lower, ideally 0.public int maxCollisionLength()
size()
- 1 in the pathological casepublic String findSymbol(char[] buffer, int start, int len, int h) throws IOException
IOException
public int _hashToIndex(int rawHash)
rawHash
- Raw hash value to use for calculating indexpublic int calcHash(char[] buffer, int start, int len)
buffer
- Input buffer that contains name to decodestart
- Pointer to the first character of the namelen
- Length of String; has to be at least 1 (caller guarantees)public int calcHash(String key)
protected void _reportTooManyCollisions(int maxLen) throws StreamConstraintsException
maxLen
- Maximum allowed length of collision chainStreamConstraintsException
- if there are too many collisions (was an IllegalStateException before v2.15)protected void verifyInternalConsistency()
Copyright © 2008–2024 FasterXML. All rights reserved.