OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:kMaxBranchLinearSubNodeLength
(Results
1 - 10
of
10
) sorted by null
/external/icu4c/common/unicode/
stringtriebuilder.h
120
// max(BytesTrie::
kMaxBranchLinearSubNodeLength
, UCharsTrie::
kMaxBranchLinearSubNodeLength
).
122
static const int32_t
kMaxBranchLinearSubNodeLength
=5;
125
// log2(2^16/
kMaxBranchLinearSubNodeLength
) rounded up.
321
Node *equal[
kMaxBranchLinearSubNodeLength
]; // NULL means "has final value".
323
int32_t values[
kMaxBranchLinearSubNodeLength
];
324
UChar units[
kMaxBranchLinearSubNodeLength
];
bytestriebuilder.h
129
virtual int32_t getMaxBranchLinearSubNodeLength() const { return BytesTrie::
kMaxBranchLinearSubNodeLength
; }
ucharstriebuilder.h
136
virtual int32_t getMaxBranchLinearSubNodeLength() const { return UCharsTrie::
kMaxBranchLinearSubNodeLength
; }
bytestrie.h
443
// - If the length is at most
kMaxBranchLinearSubNodeLength
, then
449
// - If the length is greater than
kMaxBranchLinearSubNodeLength
, then
464
static const int32_t
kMaxBranchLinearSubNodeLength
=5;
ucharstrie.h
514
// - If the length is at most
kMaxBranchLinearSubNodeLength
, then
520
// - If the length is greater than
kMaxBranchLinearSubNodeLength
, then
535
static const int32_t
kMaxBranchLinearSubNodeLength
=5;
/external/icu4c/common/
bytestrie.cpp
87
while(length>
kMaxBranchLinearSubNodeLength
) {
97
// length>=2 because the loop body above sees length>
kMaxBranchLinearSubNodeLength
>=3
316
while(length>
kMaxBranchLinearSubNodeLength
) {
420
while(length>
kMaxBranchLinearSubNodeLength
) {
ucharstrie.cpp
49
while(length>
kMaxBranchLinearSubNodeLength
) {
59
// length>=2 because the loop body above sees length>
kMaxBranchLinearSubNodeLength
>=3
266
while(length>
kMaxBranchLinearSubNodeLength
) {
379
while(length>
kMaxBranchLinearSubNodeLength
) {
stringtriebuilder.cpp
149
int32_t starts[
kMaxBranchLinearSubNodeLength
];
150
UBool isFinal[
kMaxBranchLinearSubNodeLength
-1];
166
int32_t jumpTargets[
kMaxBranchLinearSubNodeLength
-1];
bytestrieiterator.cpp
181
while(length>
kMaxBranchLinearSubNodeLength
) {
ucharstrieiterator.cpp
185
while(length>
kMaxBranchLinearSubNodeLength
) {
Completed in 4126 milliseconds