| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ |
| list | 61 #include <bits/stl_algobase.h>
62 #include <bits/allocator.h>
63 #include <bits/stl_list.h>
66 # include <bits/list.tcc>
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/ |
| bitset | 27 // N % (sizeof(_WordT) * CHAR_BIT) unused bits. (They are the high-
28 // order bits in the highest word.) It is a class invariant
29 // of class bitset<> that those unused bits are always zero.
33 // individual bits. This allows us to specialize _Base_bitset for the
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ |
| functional | 49 #include <bits/c++config.h>
50 #include <bits/stl_function.h>
60 # include <bits/stringfwd.h>
61 # include <bits/functional_hash.h>
|
| list | 61 #include <bits/stl_algobase.h>
62 #include <bits/allocator.h>
63 #include <bits/stl_list.h>
66 # include <bits/list.tcc>
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/ |
| bitset | 27 // N % (sizeof(_WordT) * CHAR_BIT) unused bits. (They are the high-
28 // order bits in the highest word.) It is a class invariant
29 // of class bitset<> that those unused bits are always zero.
33 // individual bits. This allows us to specialize _Base_bitset for the
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ |
| functional | 49 #include <bits/c++config.h>
50 #include <bits/stl_function.h>
60 # include <bits/stringfwd.h>
61 # include <bits/functional_hash.h>
|
| list | 61 #include <bits/stl_algobase.h>
62 #include <bits/allocator.h>
63 #include <bits/stl_list.h>
66 # include <bits/list.tcc>
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/ |
| bitset | 27 // N % (sizeof(_WordT) * CHAR_BIT) unused bits. (They are the high-
28 // order bits in the highest word.) It is a class invariant
29 // of class bitset<> that those unused bits are always zero.
33 // individual bits. This allows us to specialize _Base_bitset for the
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/ |
| bitset | 27 // N % (sizeof(_WordT) * CHAR_BIT) unused bits. (They are the high-
28 // order bits in the highest word.) It is a class invariant
29 // of class bitset<> that those unused bits are always zero.
33 // individual bits. This allows us to specialize _Base_bitset for the
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/ |
| map | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_map.h>
62 #include <bits/stl_multimap.h>
63 #include <bits/range_access.h>
|
| set | 60 #include <bits/stl_tree.h>
61 #include <bits/stl_set.h>
62 #include <bits/stl_multiset.h>
63 #include <bits/range_access.h>
|
| /external/jpeg/ |
| jchuff.c | 31 int put_bits; /* # of bits now in it */
212 i = (int) htbl->bits[l];
233 * it must still fit in si bits, since no code is allowed to be all ones.
292 /* Outputting bits to the file */
294 /* Only the right 24 bits of put_buffer are used; the valid bits are
295 * left-justified in this part. At most 16 bits can be passed to emit_bits
296 * in one call, and we never retain more than 7 bits in put_buffer
297 * between calls, so 24 bits are sufficient.
303 /* Emit some bits; return TRUE if successful, FALSE if must suspend *
708 UINT8 bits[MAX_CLEN+1]; \/* bits[k] = # of symbols with code length k *\/ local
[all...] |
| /external/pdfium/core/src/fxcodec/libjpeg/ |
| fpdfapi_jchuff.c | 35 int put_bits; /* # of bits now in it */
216 i = (int) htbl->bits[l];
237 * it must still fit in si bits, since no code is allowed to be all ones.
296 /* Outputting bits to the file */
298 /* Only the right 24 bits of put_buffer are used; the valid bits are
299 * left-justified in this part. At most 16 bits can be passed to emit_bits
300 * in one call, and we never retain more than 7 bits in put_buffer
301 * between calls, so 24 bits are sufficient.
307 /* Emit some bits; return TRUE if successful, FALSE if must suspend *
712 UINT8 bits[MAX_CLEN+1]; \/* bits[k] = # of symbols with code length k *\/ local
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMInstrInfo.td | 339 // sext_16_node predicate - True if the SDNode is sign-extended 16 or more bits.
350 // Returns true if all low 16-bits are 0.
743 /// imm24b - True if the 32-bit immediate is encodable in 24 bits.
[all...] |
| /external/aac/libFDK/include/ |
| FDK_bitstream.h | 150 * \param validBits Number of valid BitBuffer filled Bits.
199 * bits from the input bitstream.
202 * \param numberOfBits The number of bits to be retrieved.
203 * \return the requested bits, right aligned
215 UINT bits = hBitStream->CacheWord << missingBits; local
218 return ( bits | (hBitStream->CacheWord >> hBitStream->BitsInCache)) & BitMask[numberOfBits];
259 * bits from the input bitstream. It is the optimized version
260 of FDKreadBits() for readign 2 bits.
263 * \return the requested bits, right aligned
281 * \brief ReadBits Function (backward). This function returns a number of sequential bits
[all...] |
