Lines Matching defs:bit
38 Now let's partition this bit representation of the hash into blocks of
46 those 5-bit blocks will encode a position on a single tree level.
126 2. A 32bit integer -- a bitmap field. If an N-th bit is set in the
158 set to the *right* of our bit.
165 * bitmap & ((1 << 11) - 1) == 0b10000 => 1 bit is set => index is 1.
412 /* While it's somewhat suboptimal to reduce Python's 64 bit hash to
419 structure to 64 bit hashes, but that would increase memory pressure
447 hamt_bitindex(uint32_t bitmap, uint32_t bit)
449 return (uint32_t)_Py_popcount32(bitmap & (bit - 1));
593 hamt_node_bitmap_clone_without(PyHamtNode_Bitmap *o, uint32_t bit)
595 assert(bit & o->b_bitmap);
604 uint32_t idx = hamt_bitindex(o->b_bitmap, bit);
620 new->b_bitmap = o->b_bitmap & ~bit;
700 uint32_t bit = hamt_bitpos(hash, shift);
701 uint32_t idx = hamt_bitindex(self->b_bitmap, bit);
717 if (self->b_bitmap & bit) {
948 new_node->b_bitmap = self->b_bitmap | bit;
960 uint32_t bit = hamt_bitpos(hash, shift);
961 if ((self->b_bitmap & bit) == 0) {
965 uint32_t idx = hamt_bitindex(self->b_bitmap, bit);
1085 hamt_node_bitmap_clone_without(self, bit);
1101 uint32_t bit = hamt_bitpos(hash, shift);
1109 if ((self->b_bitmap & bit) == 0) {
1113 idx = hamt_bitindex(self->b_bitmap, bit);