Home | History | Annotate | Download | only in detail

Lines Matching full:bits

34 /// The notation [a, b] means the set of bits from bit-number a through bit-number 
77 /// result. The 32 least-significant bits are returned in lsb.
78 /// The 32 most-significant bits are returned in msb.
92 /// result. The 32 least-significant bits are returned in lsb.
93 /// The 32 most-significant bits are returned in msb.
106 /// Extracts bits [offset, offset + bits - 1] from value,
107 /// returning them in the least significant bits of the result.
108 /// For unsigned data types, the most significant bits of the
110 /// most significant bits will be set to the value of bit offset + base - 1.
112 /// If bits is zero, the result will be zero. The result will be
113 /// undefined if offset or bits is negative, or if the sum of
114 /// offset and bits is greater than the number of bits used
125 int const & Bits);
127 /// Returns the insertion the bits least-significant bits of insert into base.
129 /// The result will have bits [offset, offset + bits - 1] taken
130 /// from bits [0, bits - 1] of insert, and all other bits taken
131 /// directly from the corresponding bits of base. If bits is
133 /// undefined if offset or bits is negative, or if the sum of
134 /// offset and bits is greater than the number of bits used to
146 int const & Bits);
148 /// Returns the reversal of the bits of value.
149 /// The bit numbered n of the result will be taken from bit (bits - 1) - n of value,
150 /// where bits is the total number of bits used to represent value.
159 /// Returns the number of bits set to 1 in the binary representation of value.