Searched refs:IntSet (Results 1 - 25 of 41) sorted by relevance

12

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DIntSet.java43 public interface IntSet { interface
50 void addAll(IntSet set);
55 IntSet and(IntSet a);
57 IntSet complement(IntSet elements);
59 IntSet or(IntSet a);
61 IntSet subtract(IntSet
[all...]
H A DBitSet.java53 public class BitSet implements IntSet, Cloneable {
96 public void addAll(IntSet set) {
151 public IntSet and(IntSet a) {
287 public IntSet complement() {
293 public IntSet complement(IntSet set) {
341 public static BitSet of(IntSet set) {
371 public IntSet or(IntSet
[all...]
H A DIntervalSet.java39 * "run-length-encoded" like compression (if you view an IntSet like
52 public class IntervalSet implements IntSet {
187 public void addAll(IntSet set) {
192 throw new IllegalArgumentException("can't add non IntSet ("+
205 public IntSet complement(int minElement, int maxElement) {
215 public IntSet complement(IntSet vocabulary) {
260 public IntSet subtract(IntSet other) {
278 public IntSet subtrac
[all...]
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DIntSet.java22 public interface IntSet { interface
52 void merge(IntSet other);
H A DListIntSet.java24 public class ListIntSet implements IntSet {
61 public void merge(IntSet other) {
H A DBitIntSet.java24 public class BitIntSet implements IntSet {
71 public void merge(IntSet other) {
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DSetFactory.java20 import com.android.dx.util.IntSet;
60 * Make IntSet for the dominance-frontier sets.
65 /*package*/ static IntSet makeDomFrontSet(int szBlocks) {
72 * Make IntSet for the interference graph sets. Public because
78 public static IntSet makeInterferenceSet(int countRegs) {
85 * Make IntSet for register live in/out sets.
90 /*package*/ static IntSet makeLivenessSet(int countRegs) {
H A DInterferenceRegisterMapper.java22 import com.android.dx.util.IntSet;
88 IntSet existing = newRegInterference.get(newReg);
H A DDomFront.java19 import com.android.dx.util.IntSet;
51 public IntSet dominanceFrontiers;
/external/ceres-solver/internal/ceres/
H A Dcanonical_views_clustering.cc49 typedef HashSet<int> IntSet; typedef in namespace:ceres::internal
69 void FindValidViews(IntSet* valid_views) const;
109 IntSet valid_views;
117 for (IntSet::const_iterator view = valid_views.begin();
148 IntSet* valid_views) const {
149 const IntSet& views = graph_->vertices();
150 for (IntSet::const_iterator view = views.begin();
171 const IntSet& neighbors = graph_->Neighbors(candidate);
172 for (IntSet::const_iterator neighbor = neighbors.begin();
198 const IntSet
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DMachineProbe.java31 import org.antlr.misc.IntSet;
79 public List<IntSet> getEdgeLabels(DFAState targetState) {
81 List<IntSet> labels = new ArrayList<IntSet>();
97 * Given List<IntSet>, return a String with a useful representation of the
101 public String getInputSequenceDisplay(Grammar g, List<IntSet> labels) {
103 for (IntSet label : labels)
116 List<Set<NFAState>> nfaStates, List<IntSet> labels) {
121 IntSet label = labels.get(i);
H A DLookaheadSet.java30 import org.antlr.misc.IntSet;
46 public LookaheadSet(IntSet s) {
77 IntSet i = this.tokenTypeSet.and(s.tokenTypeSet);
H A DLabel.java30 import org.antlr.misc.IntSet;
115 //public static final IntSet ALLCHAR = IntervalSet.of(MIN_CHAR_VALUE,MAX_CHAR_VALUE);
122 protected IntSet labelSet;
129 public Label(IntSet labelSet) {
217 public IntSet getSet() {
225 public void setSet(IntSet set) {
244 public boolean matches(IntSet set) {
H A DDFAState.java30 import org.antlr.misc.IntSet;
317 IntSet t = label.getSet();
318 IntSet remainder = t; // remainder starts out as whole set to add
338 IntSet s_i = rl.getSet();
339 IntSet intersection = s_i.and(t);
343 IntSet existingMinusNewElements = s_i.subtract(t);
/external/dexmaker/src/dx/java/com/android/dx/ssa/back/
H A DInterferenceGraph.java25 import com.android.dx.util.IntSet;
41 private final ArrayList<IntSet> interference;
50 interference = new ArrayList<IntSet>(countRegs);
93 public void mergeInterferenceSet(int reg, IntSet set) {
H A DFirstFitAllocator.java25 import com.android.dx.util.IntSet;
87 IntSet current = new BitIntSet(oldRegCount);
H A DRegisterAllocator.java30 import com.android.dx.util.IntSet;
178 IntSet liveOut = block.getLiveOutRegs();
/external/emma/core/java12/com/vladium/util/
H A DIntSet.java7 * $Id: IntSet.java,v 1.1.1.1 2004/05/09 16:57:53 vlad_r Exp $
23 final class IntSet class
28 * Equivalent to <CODE>IntSet(11, 0.75F)</CODE>.
30 public IntSet () method in class:IntSet
36 * Equivalent to <CODE>IntSet(capacity, 0.75F)</CODE>.
38 public IntSet (final int initialCapacity) method in class:IntSet
44 * Constructs an IntSet with specified initial capacity and load factor.
49 public IntSet (int initialCapacity, final float loadFactor) method in class:IntSet
/external/emma/core/java12/com/vladium/emma/data/
H A DMethodDescriptor.java18 import com.vladium.util.IntSet;
145 IntSet blockIDs = (IntSet) lineMap.get (line);
149 blockIDs = new IntSet ();
162 final int [] blockIDs = ((IntSet) lineMap.get (line)).values ();
165 lineMap.put (line, blockIDs); // overwrite IntSet as the value
/external/chromium_org/v8/test/cctest/
H A Dtest-hashmap.cc45 class IntSet { class
47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} function in class:IntSet
95 IntSet set(hash);
/external/chromium_org/testing/gtest/test/
H A Dgtest-typed-test_test.cc64 typedef std::set<int> IntSet; typedef in class:CommonTest
108 typename TestFixture::IntSet empty2;
/external/gtest/test/
H A Dgtest-typed-test_test.cc63 typedef std::set<int> IntSet; typedef in class:CommonTest
107 typename TestFixture::IntSet empty2;
/external/protobuf/gtest/test/
H A Dgtest-typed-test_test.cc63 typedef std::set<int> IntSet; typedef in class:CommonTest
107 typename TestFixture::IntSet empty2;
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
H A DTreeToNFAConverter.g76 public final IntSet setRule(GrammarAST t) throws RecognitionException {
498 IntSet notAtom = grammar.complement(ttype);
512 IntSet notAtom = null;
547 //IntSet notSet = grammar.complement(stNode.getSetValue());
549 IntSet s = stNode.getSetValue();
658 IntSet elements=new IntervalSet();
674 setRule returns [IntSet elements=new IntervalSet()]
677 IntSet s=null;
691 setElement[IntSet elements]
695 IntSet n
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dheap-checker_unittest.cc720 typedef set<int> IntSet; typedef
725 IntSet* x = new(initialized) IntSet[1];
726 *x = IntSet(some_ints, some_ints + 6);
743 static void DoTestSTLAllocInverse(IntSet** setx) {
744 IntSet* x = new(initialized) IntSet[1];
745 *x = IntSet(some_ints, some_ints + 3);
753 static void FreeTestSTLAllocInverse(IntSet** setx) {
754 IntSet*
[all...]

Completed in 4394 milliseconds

12