| /ndk/tests/device/test-gnustl-full/unit/ |
| bitset_header_test.cpp | 8 #include <bitset>
|
| bitset_test.cpp | 1 #include <bitset>
38 bitset<13U> b1(0xFFFF);
39 bitset<13U> b2(0x1111);
83 bitset<13U> b(0x1111);
87 bitset<13U> b1;
97 bitset<13U> b(0x1111);
101 bitset<13U> b1;
|
| /ndk/tests/device/test-stlport/unit/ |
| bitset_header_test.cpp | 8 #include <bitset>
|
| bitset_test.cpp | 1 #include <bitset>
38 bitset<13U> b1(0xFFFF);
39 bitset<13U> b2(0x1111);
83 bitset<13U> b(0x1111);
87 bitset<13U> b1;
97 bitset<13U> b(0x1111);
101 bitset<13U> b1;
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| MismatchedSetException.cs | 41 private readonly BitSet _expecting;
54 public MismatchedSetException(BitSet expecting, IIntStream input)
59 public MismatchedSetException(string message, BitSet expecting, IIntStream input)
64 public MismatchedSetException(string message, BitSet expecting, IIntStream input, Exception innerException)
74 this._expecting = (BitSet)info.GetValue("Expecting", typeof(BitSet));
77 public BitSet Expecting {
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| MismatchedSetException.cs | 43 private readonly BitSet _expecting;
59 public MismatchedSetException( BitSet expecting, IIntStream input )
65 public MismatchedSetException(string message, BitSet expecting, IIntStream input)
71 public MismatchedSetException(string message, BitSet expecting, IIntStream input, Exception innerException)
83 this._expecting = (BitSet)info.GetValue("Expecting", typeof(BitSet));
86 public BitSet Expecting
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
| SimpleCParser.java | [all...] |
| /external/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /external/stlport/test/unit/ |
| bitset_test.cpp | 1 #include <bitset>
38 bitset<13U> b1(0xFFFF);
39 bitset<13U> b2(0x1111);
83 bitset<13U> b(0x1111);
87 bitset<13U> b1;
97 bitset<13U> b(0x1111);
101 bitset<13U> b1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.members/ |
| index.pass.cpp | 10 // test bitset<N>::reference operator[](size_t pos);
12 #include <bitset>
19 std::bitset<N>
22 std::bitset<N> v;
31 std::bitset<N> v1 = make_bitset<N>();
35 typename std::bitset<N>::reference r = v1[N/2];
37 typename std::bitset<N>::reference r2 = v1[N/2];
|
| 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>();
|
| /ndk/sources/cxx-stl/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/ |
| bitset | 21 // This implementation of bitset<> has a second template parameter,
26 // A bitset of size N, using words of type _WordT, will have
29 // of class bitset<> that those unused bits are always zero.
31 // Most of the actual code isn't contained in bitset<> itself, but in the
34 // important special case where the bitset is only a single word.
55 # include_next <bitset>
57 # include _STLP_NATIVE_HEADER(bitset)
|
| /external/bison/lib/ |
| bitsetv.c | 0 /* Bitset vectors.
28 bitset *
34 bitset *bsetv;
41 if (BITSET_SIZE_MAX / (sizeof (bitset) + bytes) <= n_vecs)
44 /* Allocate vector table at head of bitset array. */
45 vector_bytes = (n_vecs + 1) * sizeof (bitset) + bytes - 1;
51 bsetv[i] = (bitset) (void *) ((char *) bsetv + vector_bytes + i * bytes);
64 bitset *
74 /* Free bitset vector BSETV. */
138 /* Dump the contents of a bitset vector BSETV with N_VECS elements t
[all...] |
| lbitset.c | 76 /* Obstack to allocate bitset elements from. */
79 static lbitset_elt *lbitset_free_list; /* Free list of bitset elements. */
81 extern void debug_lbitset (bitset);
164 /* Unlink element ELT from bitset BSET. */
166 lbitset_elt_unlink (bitset bset, lbitset_elt *elt)
208 /* Cut the chain of bitset BSET before element ELT and free the
211 lbitset_prune (bitset bset, lbitset_elt *elt)
255 /* Link the bitset element into the current bitset linked list. */
257 lbitset_elt_link (bitset bset, lbitset_elt *elt
[all...] |
| /external/chromium_org/third_party/sfntly/cpp/src/test/ |
| cmap_iterator_test.cc | 40 typedef std::vector<bool> BitSet;
67 BitSet* GenerateCMapEntries(int32_t start, int32_t count);
70 BitSet* bit_set);
89 BitSet* CMapIteratorTests::GenerateCMapEntries(int32_t start, int32_t count) {
90 BitSet* entries = new BitSet(count);
102 BitSet* bit_set) {
104 BitSet::iterator end = bit_set->end(),
124 fprintf(stderr, "%s %d: Differences between iterator and bitset: %d\n",
131 BitSet* bit_set = GenerateCMapEntries(0, 0x10ffff)
[all...] |
| /external/sfntly/cpp/src/test/ |
| cmap_iterator_test.cc | 40 typedef std::vector<bool> BitSet;
67 BitSet* GenerateCMapEntries(int32_t start, int32_t count);
70 BitSet* bit_set);
89 BitSet* CMapIteratorTests::GenerateCMapEntries(int32_t start, int32_t count) {
90 BitSet* entries = new BitSet(count);
102 BitSet* bit_set) {
104 BitSet::iterator end = bit_set->end(),
124 fprintf(stderr, "%s %d: Differences between iterator and bitset: %d\n",
131 BitSet* bit_set = GenerateCMapEntries(0, 0x10ffff)
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ |
| bitset | 0 // <bitset> -*- C++ -*-
40 /** @file include/bitset
70 * See documentation for bitset.
367 * See documentation for bitset.
509 * Base class, specialization for no storage (zero-length %bitset).
511 * See documentation for bitset.
545 // in the bitset class will prevent the user from getting this far,
600 // the sound of one zero-length bitset clapping?
678 * @brief The %bitset class represents a @e fixed-size sequence of bits.
682 * (Note that %bitset does @e not meet the formal requirements of
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ |
| bitset | 0 // <bitset> -*- C++ -*-
40 /** @file include/bitset
70 * See documentation for bitset.
367 * See documentation for bitset.
509 * Base class, specialization for no storage (zero-length %bitset).
511 * See documentation for bitset.
545 // in the bitset class will prevent the user from getting this far,
600 // the sound of one zero-length bitset clapping?
678 * @brief The %bitset class represents a @e fixed-size sequence of bits.
682 * (Note that %bitset does @e not meet the formal requirements of
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| bitset | 0 // <bitset> -*- C++ -*-
40 /** @file include/bitset
70 * See documentation for bitset.
367 * See documentation for bitset.
509 * Base class, specialization for no storage (zero-length %bitset).
511 * See documentation for bitset.
545 // in the bitset class will prevent the user from getting this far,
600 // the sound of one zero-length bitset clapping?
678 * @brief The %bitset class represents a @e fixed-size sequence of bits.
682 * (Note that %bitset does @e not meet the formal requirements of
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| bitset | 0 // <bitset> -*- C++ -*-
40 /** @file include/bitset
70 * See documentation for bitset.
371 * See documentation for bitset.
516 * Base class, specialization for no storage (zero-length %bitset).
518 * See documentation for bitset.
552 // in the bitset class will prevent the user from getting this far,
607 // the sound of one zero-length bitset clapping?
686 * The %bitset class represents a @e fixed-size sequence of bits.
690 * (Note that %bitset does @e not meet the formal requirements of
[all...] |
