Lines Matching defs:Number

70   typedef uintptr_t Number;
79 bool Ensure(Number x, size_t n) {
91 void* get(Number k) const {
102 void set(Number k, void* v) {
108 void* Next(Number k) const {
137 typedef uintptr_t Number;
144 void* get(Number k) const {
145 const Number i1 = k >> LEAF_BITS;
146 const Number i2 = k & (LEAF_LENGTH-1);
153 void set(Number k, void* v) {
155 const Number i1 = k >> LEAF_BITS;
156 const Number i2 = k & (LEAF_LENGTH-1);
160 bool Ensure(Number start, size_t n) {
161 for (Number key = start; key <= start + n - 1; ) {
162 const Number i1 = key >> LEAF_BITS;
187 void* Next(Number k) const {
189 const Number i1 = k >> LEAF_BITS;
193 for (Number i2 = k & (LEAF_LENGTH - 1); i2 < LEAF_LENGTH; i2++) {
240 typedef uintptr_t Number;
247 void* get(Number k) const {
248 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
249 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1);
250 const Number i3 = k & (LEAF_LENGTH-1);
258 void set(Number k, void* v) {
260 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
261 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1);
262 const Number i3 = k & (LEAF_LENGTH-1);
266 bool Ensure(Number start, size_t n) {
267 for (Number key = start; key <= start + n - 1; ) {
268 const Number i1 = key >> (LEAF_BITS + INTERIOR_BITS);
269 const Number i2 = (key >> LEAF_BITS) & (INTERIOR_LENGTH-1);
299 void* Next(Number k) const {
300 while (k < (Number(1) << BITS)) {
301 const Number i1 = k >> (LEAF_BITS + INTERIOR_BITS);
302 const Number i2 = (k >> LEAF_BITS) & (INTERIOR_LENGTH-1);
309 for (Number i3 = (k & (LEAF_LENGTH-1)); i3 < LEAF_LENGTH; i3++) {