Class SegmentConstantPoolArrayCache
java.lang.Object
org.apache.commons.compress.harmony.unpack200.SegmentConstantPoolArrayCache
The SegmentConstantPool spends a lot of time searching through large arrays of Strings looking for matches. This can be sped up by caching the arrays in
HashMaps so the String keys are looked up and resolve to positions in the array rather than iterating through the arrays each time.
Because the arrays only grow (never shrink or change) we can use the last known size as a way to determine if the array has changed.
Note that this cache must be synchronized externally if it is shared.
-
Nested Class Summary
Modifier and TypeClassDescriptionprotected class
Keeps track of the last known size of an array as well as a HashMap that knows the mapping from element values to the indices of the array which contain that value. -
Field Summary
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionprotected boolean
arrayIsCached
(String[] array) Tests whether a String array is correctly cached.protected void
cacheArray
(String[] array) Caches the array passed in as the argumentindexesForArrayKey
(String[] array, String key) Gets the indices for the given key in the given array.
-
Field Details
-
knownArrays
-
lastIndexes
-
lastArray
-
lastKey
-
-
Constructor Details
-
SegmentConstantPoolArrayCache
public SegmentConstantPoolArrayCache()
-
-
Method Details
-
arrayIsCached
Tests whether a String array is correctly cached. Return false if the array is not cached, or if the array cache is outdated.- Parameters:
array
- of String- Returns:
- boolean true if up-to-date cache, otherwise false.
-
cacheArray
Caches the array passed in as the argument- Parameters:
array
- String[] to cache
-
indexesForArrayKey
Gets the indices for the given key in the given array. If no such key exists in the cached array, answer -1.- Parameters:
array
- String[] array to search for the valuekey
- String value for which to search- Returns:
- List collection of index positions in the array
-