Lines Matching full:traverse
133 ANTLR3_UINT32 bucket; // Used to traverse the buckets
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */
289 /* Now, we traverse the entries in the bucket until
346 /* Now, we traverse the entries in the bucket until
538 /* Knowing the bucket, we can traverse the entries until we
609 /* Knowign the bucket, we can traverse the entries until we
667 /** \brief Creates an enumeration structure to traverse the hash table.
1140 // We must traverse every entry in the vector and if it has
1165 // We must traverse every entry in the vector and if it has
1948 /* Bit at the required index was 0, so we traverse to the left
1988 /* We want to be able to traverse the stored elements in the order that they were
2098 /* Bit at the required index was 1, so traverse the right node from here
2104 /* Bit at the required index was 0, so we traverse to the left
2549 // Now traverse the nodes as if we were just going left to right, but
2552 oldLimit = topo->limit; // Number of nodes to traverse linearly
2579 // we need to know how many we may have allocated and traverse them all.
2651 // Now we traverse the sorted array and moved the entries of
