Lines Matching defs:depth
1763 /* INT TRIE Implementation of depth 64 bits, being the number of bits
1768 antlr3IntTrieNew(ANTLR3_UINT32 depth)
1798 * keys in the trie. This is the trie 'depth'. The limit for
1801 trie->root->bitNum = depth;
1918 ANTLR3_UINT32 depth;
1923 /* Cache the bit depth of this trie, which is always the highest index,
1926 depth = trie->root->bitNum;
2028 depth = 56 + bitIndex[((xorKey & 0xFF00000000000000)>>56)];
2032 depth = 48 + bitIndex[((xorKey & 0x00FF000000000000)>>48)];
2039 depth = 40 + bitIndex[((xorKey & 0x0000FF0000000000)>>40)];
2043 depth = 32 + bitIndex[((xorKey & 0x000000FF00000000)>>32)];
2054 depth = 24 + bitIndex[((xorKey & 0x00000000FF000000)>>24)];
2058 depth = 16 + bitIndex[((xorKey & 0x0000000000FF0000)>>16)];
2065 depth = 8 + bitIndex[((xorKey & 0x0000000000000FF00)>>8)];
2069 depth = bitIndex[xorKey & 0x00000000000000FF];
2074 /* We have located the leftmost differing bit, indicated by the depth variable. So, we know what
2090 while (thisNode->bitNum > entNode->bitNum && entNode->bitNum > depth)
2148 nextNode->bitNum = depth;
2154 if (key & bitMask[depth])
2186 * Basic algorithm is that we do a depth first left descent and free
2411 * discovered the bottom of a depth first search, which we can then ascend, adding
2543 // dropping through the nodes in depth first order and when we get to a node that
