Searched refs:bitNum (Results 1 - 4 of 4) sorted by relevance

/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c1801 trie->root->bitNum = depth;
1846 while (thisNode->bitNum > nextNode->bitNum)
1856 if (key & bitMask[nextNode->bitNum])
1926 depth = trie->root->bitNum;
1934 while (thisNode->bitNum > nextNode->bitNum)
1940 if (key & bitMask[nextNode->bitNum])
2090 while (thisNode->bitNum > entNode->bitNum
[all...]
/external/chromium_org/third_party/icu/source/test/intltest/
H A Ditspoof.cpp353 for (int bitNum=28; bitNum>=0; bitNum-=4) {
354 if (bitNum <= 12) {
357 int hexDigit = (c>>bitNum) & 0x0f;
/external/icu/icu4c/source/test/intltest/
H A Ditspoof.cpp353 for (int bitNum=28; bitNum>=0; bitNum-=4) {
354 if (bitNum <= 12) {
357 int hexDigit = (c>>bitNum) & 0x0f;
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h351 ANTLR3_UINT32 bitNum; /**< This is the left/right bit index for traversal along the nodes */ member in struct:ANTLR3_INT_TRIE_NODE_struct
354 struct ANTLR3_INT_TRIE_NODE_struct * leftN; /**< Pointer to the left node from here when sKey & bitNum = 0 */
355 struct ANTLR3_INT_TRIE_NODE_struct * rightN; /**< Pointer to the right node from here when sKey & bitNum, = 1 */

Completed in 309 milliseconds