| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _bitset.c | 83 __stl_throw_overflow_error("bitset");
179 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) {
220 const bitset<_Nb>& __x) {
233 #undef bitset macro
|
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _bitset.c | 83 __stl_throw_overflow_error("bitset");
179 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x) {
220 const bitset<_Nb>& __x) {
233 #undef bitset macro
|
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| BitSet.pm | 1 package ANTLR::Runtime::BitSet;
48 # Construct a bitset of size one word (64 bits)
75 # Construct a bitset given the size
89 my $bs = ANTLR::Runtime::BitSet->new({ size => $el + 1 });
146 return ANTLR::Runtime::BitSet->new(bits => $self->bits);
252 ANTLR::Runtime::BitSet - A bit set
266 A stripped-down version of org.antlr.misc.BitSet that is just good enough to
|
| /external/chromium_org/v8/src/ |
| types.h | 92 // Note that the bitset representation is closed under both Union and Intersect.
222 // - at most one field is a bitset, and it must go into index 0
255 static Type* from_bitset(int bitset) {
256 return static_cast<Type*>(i::Object::cast(i::Smi::FromInt(bitset)));
268 int LubBitset(); // least upper bound that's a bitset
269 int GlbBitset(); // greatest lower bound that's a bitset
279 static const char* bitset_name(int bitset);
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| BaseRecognizer.as | 64 public function matchStream(input:IntStream, ttype:int, follow:BitSet):Object {
92 public function mismatchIsMissingToken(input:IntStream, follow:BitSet):Boolean {
100 var viableTokensFollowingThisRule:BitSet = computeContextSensitiveRuleFOLLOW();
112 // BitSet cannot handle negative numbers like -1 (EOF) so I leave EOR
128 protected function mismatch(input:IntStream, ttype:int, follow:BitSet):void
338 var followSet:BitSet = computeErrorRecoverySet();
444 protected function computeErrorRecoverySet():BitSet {
500 protected function computeContextSensitiveRuleFOLLOW():BitSet {
504 protected function combineFollows(exact:Boolean):BitSet {
506 var followSet:BitSet = new BitSet()
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| BaseRecognizer.java | 100 public Object match(IntStream input, int ttype, BitSet follow)
130 public boolean mismatchIsMissingToken(IntStream input, BitSet follow) {
138 BitSet viableTokensFollowingThisRule = computeContextSensitiveRuleFOLLOW();
151 // BitSet cannot handle negative numbers like -1 (EOF) so I leave EOR
362 BitSet followSet = computeErrorRecoverySet();
468 protected BitSet computeErrorRecoverySet() {
524 protected BitSet computeContextSensitiveRuleFOLLOW() {
532 protected BitSet combineFollows(boolean exact) {
534 BitSet followSet = new BitSet();
[all...] |
| MismatchedNotSetException.java | 34 public MismatchedNotSetException(BitSet expecting, IntStream input) {
|
| /cts/tools/signature-tools/lib/ |
| antlr-2.7.7.jar | |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| RegisterSpecList.java | 22 import java.util.BitSet;
296 * specified by the given BitSet. Indexes in the BitSet with a zero
303 public RegisterSpecList subset(BitSet exclusionSet) {
363 * a null BitSet is given, it indicates all registers are compatible.
374 BitSet compatRegs) {
|
| /external/apache-http/src/org/apache/commons/codec/net/ |
| URLCodec.java | 21 import java.util.BitSet;
59 * BitSet of www-form-url safe characters.
61 protected static final BitSet WWW_FORM_URL = new BitSet(256);
107 * @param urlsafe bitset of characters deemed URL safe
111 public static final byte[] encodeUrl(BitSet urlsafe, byte[] bytes)
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| RegisterSpecList.java | 23 import java.util.BitSet;
297 * specified by the given BitSet. Indexes in the BitSet with a zero
304 public RegisterSpecList subset(BitSet exclusionSet) {
364 * a null BitSet is given, it indicates all registers are compatible.
375 BitSet compatRegs) {
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaMethod.java | 31 import java.util.BitSet;
128 * Builds a BitSet of block indices from a basic block list and a list
133 * @return BitSet of block indices
135 static BitSet bitSetFromLabelList(BasicBlockList blocks,
137 BitSet result = new BitSet(blocks.size());
378 BitSet succs = block.getSuccessors();
755 BitSet visited = new BitSet(blocks.size());
775 BitSet childre
[all...] |
| Dominators.java | 20 import java.util.BitSet;
94 private BitSet getSuccs(SsaBasicBlock block) {
102 private BitSet getPreds(SsaBasicBlock block) {
195 BitSet preds = getPreds(w);
|
| SsaBasicBlock.java | 34 import java.util.BitSet;
54 private BitSet predecessors;
57 private BitSet successors;
127 this.predecessors = new BitSet(parent.getBlocks().size());
128 this.successors = new BitSet(parent.getBlocks().size());
342 public BitSet getPredecessors() {
349 public BitSet getSuccessors() {
426 predecessors = new BitSet(parent.getBlocks().size());
647 * Sets the register as used in a bitset, taking into account its
653 private static void setRegsUsed (BitSet regsUsed, RegisterSpec rs)
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaMethod.java | 32 import java.util.BitSet;
129 * Builds a BitSet of block indices from a basic block list and a list
134 * @return BitSet of block indices
136 static BitSet bitSetFromLabelList(BasicBlockList blocks,
138 BitSet result = new BitSet(blocks.size());
379 BitSet succs = block.getSuccessors();
756 BitSet visited = new BitSet(blocks.size());
776 BitSet childre
[all...] |
| /art/runtime/ |
| thread_list.h | 23 #include <bitset>
126 std::bitset<kMaxThreadId> allocated_ids_ GUARDED_BY(allocated_ids_lock_);
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| DalvInsn.java | 25 import java.util.BitSet;
209 * Uses the given BitSet to determine which registers require
219 public final int getMinimumRegisterRequirement(BitSet compatRegs) {
254 * marked compatible to the format by the given BitSet.
261 public DalvInsn expandedPrefix(BitSet compatRegs) {
279 * marked compatible to the format by the given BitSet.
286 public DalvInsn expandedSuffix(BitSet compatRegs) {
309 public DalvInsn expandedVersion(BitSet compatRegs) {
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LookaheadSet.java | 36 * cannot be stored in my BitSet, I set a condition here. There may be other
37 * reasons in the future to abstract a LookaheadSet over a raw BitSet.
|
| /external/arduino/hardware/arduino/cores/arduino/ |
| wiring.h | 97 #define bitSet(value, bit) ((value) |= (1UL << (bit)))
99 #define bitWrite(value, bit, bitvalue) (bitvalue ? bitSet(value, bit) : bitClear(value, bit))
|
| /external/chromium_org/cc/resources/ |
| picture_pile_base.h | 8 #include <bitset>
80 std::bitset<INVALIDATION_FRAMES_TRACKED> invalidation_history_;
|
| /external/chromium_org/chrome/browser/chromeos/policy/ |
| device_cloud_policy_manager_chromeos.h | 8 #include <bitset>
45 typedef std::bitset<32> AllowedDeviceModes;
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| DalvInsn.java | 26 import java.util.BitSet;
210 * Uses the given BitSet to determine which registers require
220 public final int getMinimumRegisterRequirement(BitSet compatRegs) {
255 * marked compatible to the format by the given BitSet.
262 public DalvInsn expandedPrefix(BitSet compatRegs) {
280 * marked compatible to the format by the given BitSet.
287 public DalvInsn expandedSuffix(BitSet compatRegs) {
310 public DalvInsn expandedVersion(BitSet compatRegs) {
|
| /external/guava/guava/src/com/google/common/primitives/ |
| Booleans.java | 29 import java.util.BitSet;
77 * BitSet} instead, replacing {@code Booleans.contains(array, true)}
78 * with {@code !bitSet.isEmpty()} and {@code Booleans.contains(array, false)}
79 * with {@code bitSet.nextClearBit(0) == sizeOfBitSet}.
99 * <p><b>Note:</b> consider representing the array as a {@link BitSet}
100 * instead, and using {@link BitSet#nextSetBit(int)} or {@link
101 * BitSet#nextClearBit(int)}.
301 * BitSet} instead.
|
| /cts/tests/tests/security/src/android/security/cts/ |
| ClonedSecureRandomTest.java | 34 import java.util.BitSet;
99 * Using a byte[][] and BitSet gives us a fixed upper bound for the
106 BitSet seenPids = new BitSet(MAX_PID);
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| FirstFitLocalCombiningAllocator.java | 37 import java.util.BitSet;
63 private final BitSet ssaRegsMapped;
72 private final BitSet reservedRopRegs;
75 private final BitSet usedRopRegs;
93 ssaRegsMapped = new BitSet(ssaMeth.getRegCount());
108 reservedRopRegs = new BitSet(paramRangeEnd * 2);
110 usedRopRegs = new BitSet(paramRangeEnd * 2);
464 BitSet predBlocks = insn.getBlock().getPredecessors();
800 BitSet resultMovesRequired = null;
824 BitSet curMovesRequired = new BitSet(szSources)
[all...] |
