HomeSort by relevance Sort by last modified time
    Searched refs:bitset (Results 76 - 100 of 479) sorted by null

1 2 34 5 6 7 8 91011>>

  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/utilities/template.bitset/bitset.members/
right_shift_eq.pass.cpp 10 // test bitset<N>& operator<<=(size_t pos);
12 #include <bitset>
21 std::bitset<N>
24 std::bitset<N> v;
35 std::bitset<N> v1 = make_bitset<N>();
36 std::bitset<N> v2 = v1;
count.pass.cpp 12 #include <bitset>
21 std::bitset<N>
24 std::bitset<N> v;
33 const std::bitset<N> v = make_bitset<N>();
flip_one.pass.cpp 11 // test bitset<N>& flip(size_t pos);
13 #include <bitset>
22 std::bitset<N>
25 std::bitset<N> v;
34 std::bitset<N> v = make_bitset<N>();
index_const.pass.cpp 12 #include <bitset>
21 std::bitset<N>
24 std::bitset<N> v;
33 const std::bitset<N> v1 = make_bitset<N>();
test.pass.cpp 13 #include <bitset>
22 std::bitset<N>
25 std::bitset<N> v;
34 const std::bitset<N> v1 = make_bitset<N>();
  /external/bison/lib/
bitset_stats.c 0 /* Bitset statistics.
20 /* This file is a wrapper bitset implementation for the other bitset
21 implementations. It provides bitset compatibility checking and
22 statistics gathering without having to instrument the bitset
23 implementations. When statistics gathering is enabled, the bitset
44 #define BITSET_STATS_FILE "bitset.dat"
168 /* Print bitset statistics to FILE. */
203 /* Print all bitset statistics to FILE. */
212 fprintf (file, _("Bitset statistics:\n\n"))
    [all...]
abitset.c 36 abitset_resize (bitset src, bitset_bindex size)
49 abitset_small_list (bitset src, bitset_bindex *list,
104 /* Set bit BITNO in bitset DST. */
106 abitset_set (bitset dst ATTRIBUTE_UNUSED, bitset_bindex bitno ATTRIBUTE_UNUSED)
110 bounds of the bitset. */
115 /* Reset bit BITNO in bitset DST. */
117 abitset_reset (bitset dst ATTRIBUTE_UNUSED,
122 bounds of the bitset. Since the bit is zero anyway, let it pass. */
126 /* Test bit BITNO in bitset SRC. */
128 abitset_test (bitset src ATTRIBUTE_UNUSED
    [all...]
  /toolchain/binutils/binutils-2.25/gas/testsuite/gas/score/
bit_32.d 25 24: 5200 bitset! r0, 0x0
26 26: 521f bitset! r0, 0x1f
27 28: 53e0 bitset! r15, 0x0
28 2a: 53ff bitset! r15, 0x1f
29 2c: 5200 bitset! r0, 0x0
30 2e: 5200 bitset! r0, 0x0
31 30: 5200 bitset! r0, 0x0
32 32: 5200 bitset! r0, 0x0
33 34: 5200 bitset! r0, 0x0
34 36: 5200 bitset! r0, 0x
    [all...]
  /external/libcxx/test/std/utilities/template.bitset/bitset.cons/
default.pass.cpp 12 #include <bitset>
21 TEST_CONSTEXPR std::bitset<N> v1;
28 constexpr std::bitset<N> v1;
  /external/libcxx/test/std/utilities/template.bitset/bitset.members/
count.pass.cpp 12 #include <bitset>
21 std::bitset<N>
24 std::bitset<N> v;
33 const std::bitset<N> v = make_bitset<N>();
flip_one.pass.cpp 10 // test bitset<N>& flip(size_t pos);
12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 std::bitset<N> v = make_bitset<N>();
index_const.pass.cpp 12 #include <bitset>
22 std::bitset<N>
25 std::bitset<N> v;
34 const std::bitset<N> v1 = make_bitset<N>();
test.pass.cpp 12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 const std::bitset<N> v1 = make_bitset<N>();
reset_all.pass.cpp 10 // test bitset<N>& reset();
12 #include <bitset>
22 std::bitset<N> v;
set_all.pass.cpp 10 // test bitset<N>& set();
12 #include <bitset>
22 std::bitset<N> v;
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.members/
count.pass.cpp 12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 const std::bitset<N> v = make_bitset<N>();
flip_one.pass.cpp 10 // test bitset<N>& flip(size_t pos);
12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 std::bitset<N> v = make_bitset<N>();
test.pass.cpp 12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 const std::bitset<N> v1 = make_bitset<N>();
all.pass.cpp 12 #include <bitset>
18 std::bitset<N> v;
reset_all.pass.cpp 10 // test bitset<N>& reset();
12 #include <bitset>
20 std::bitset<N> v;
set_all.pass.cpp 10 // test bitset<N>& set();
12 #include <bitset>
20 std::bitset<N> v;
  /device/google/contexthub/firmware/os/core/
slab.c 26 struct AtomicBitset bitset[0]; member in struct:SlabAllocator
45 allocator->dataChunks = ((uint8_t*)allocator->bitset) + bitsetSz;
46 atomicBitsetInit(allocator->bitset, numItems);
59 int32_t itemIdx = atomicBitsetFindClearAndSet(allocator->bitset);
74 if ((itemOffset % allocator->itemSz) || (itemIdx >= atomicBitsetGetNumBits(allocator->bitset)) || !atomicBitsetGetBit(allocator->bitset, itemIdx))
77 atomicBitsetClearBit(allocator->bitset, itemIdx);
82 if (!atomicBitsetGetBit(allocator->bitset, idx))
94 if ((itemOffset % allocator->itemSz) || (itemIdx >= atomicBitsetGetNumBits(allocator->bitset)) || !atomicBitsetGetBit(allocator->bitset, itemIdx)
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/
bloom_filter.h 20 #include <bitset>
63 // This is assigned here because it is used for bitset size.
66 std::bitset<BIGRAM_FILTER_MODULO> mFilter;
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.cons/
default.pass.cpp 12 #include <bitset>
21 _LIBCPP_CONSTEXPR std::bitset<N> v1;
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.hash/
bitset.pass.cpp 21 #include <bitset>
29 typedef std::bitset<N> T;

Completed in 248 milliseconds

1 2 34 5 6 7 8 91011>>