Package com.ibm.icu.util
Class MutableCodePointTrie.MixedBlocks
- java.lang.Object
-
- com.ibm.icu.util.MutableCodePointTrie.MixedBlocks
-
- Enclosing class:
- MutableCodePointTrie
private static final class MutableCodePointTrie.MixedBlocks extends java.lang.Object
-
-
Field Summary
Fields Modifier and Type Field Description private int
blockLength
private int
length
private int
mask
private int
shift
private int[]
table
-
Constructor Summary
Constructors Modifier Constructor Description private
MixedBlocks()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private void
addEntry(int[] data32, char[] data16, int blockStart, int hashCode, int dataIndex)
(package private) void
extend(char[] data, int minStart, int prevDataLength, int newDataLength)
(package private) void
extend(int[] data, int minStart, int prevDataLength, int newDataLength)
(package private) int
findAllSameBlock(int[] data, int blockValue)
(package private) int
findBlock(char[] data, char[] blockData, int blockStart)
(package private) int
findBlock(char[] data, int[] blockData, int blockStart)
(package private) int
findBlock(int[] data, int[] blockData, int blockStart)
private int
findEntry(int[] data32, char[] data16, int[] blockData32, char[] blockData16, int blockStart, int hashCode)
private int
findEntry(int[] data, int blockValue, int hashCode)
(package private) void
init(int maxLength, int newBlockLength)
private int
makeHashCode(char[] blockData, int blockStart)
private int
makeHashCode(int blockValue)
private int
makeHashCode(int[] blockData, int blockStart)
private int
modulo(int n, int m)
Ensures non-negative n % m (that is 0..m-1).private int
nextIndex(int initialEntryIndex, int entryIndex)
-
-
-
Method Detail
-
init
void init(int maxLength, int newBlockLength)
-
extend
void extend(int[] data, int minStart, int prevDataLength, int newDataLength)
-
extend
void extend(char[] data, int minStart, int prevDataLength, int newDataLength)
-
findBlock
int findBlock(int[] data, int[] blockData, int blockStart)
-
findBlock
int findBlock(char[] data, int[] blockData, int blockStart)
-
findBlock
int findBlock(char[] data, char[] blockData, int blockStart)
-
findAllSameBlock
int findAllSameBlock(int[] data, int blockValue)
-
makeHashCode
private int makeHashCode(int[] blockData, int blockStart)
-
makeHashCode
private int makeHashCode(char[] blockData, int blockStart)
-
makeHashCode
private int makeHashCode(int blockValue)
-
addEntry
private void addEntry(int[] data32, char[] data16, int blockStart, int hashCode, int dataIndex)
-
findEntry
private int findEntry(int[] data32, char[] data16, int[] blockData32, char[] blockData16, int blockStart, int hashCode)
-
findEntry
private int findEntry(int[] data, int blockValue, int hashCode)
-
nextIndex
private int nextIndex(int initialEntryIndex, int entryIndex)
-
modulo
private int modulo(int n, int m)
Ensures non-negative n % m (that is 0..m-1).
-
-