Lines Matching defs:i1
145 const Number i1 = k >> LEAF_BITS;
147 if ((k >> BITS) > 0 || root_[i1] == NULL) {
150 return root_[i1]->values[i2];
155 const Number i1 = k >> LEAF_BITS;
157 root_[i1]->values[i2] = v;
162 const Number i1 = key >> LEAF_BITS;
165 if (i1 >= ROOT_LENGTH)
169 if (root_[i1] == NULL) {
173 root_[i1] = leaf;
189 const Number i1 = k >> LEAF_BITS;
190 Leaf* leaf = root_[i1];
200 k = (i1 + 1) << LEAF_BITS;
248 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
252 root_->ptrs[i1] == NULL || root_->ptrs[i1]->ptrs[i2] == NULL) {
255 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
260 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
263 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
268 const Number i1 = key >> (LEAF_BITS + INTERIOR_BITS);
272 if (i1 >= INTERIOR_LENGTH || i2 >= INTERIOR_LENGTH)
276 if (root_->ptrs[i1] == NULL) {
279 root_->ptrs[i1] = n;
283 if (root_->ptrs[i1]->ptrs[i2] == NULL) {
287 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
301 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
303 if (root_->ptrs[i1] == NULL) {
305 k = (i1 + 1) << (LEAF_BITS + INTERIOR_BITS);
307 Leaf* leaf = reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2]);