Searched defs:set (Results 1 - 25 of 843) sorted by path

1234567891011>>

/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DLayoutMetric.java31 set(value, layoutType);
44 public void set(float value, LayoutType layoutType) { method in class:LayoutMetric
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/
H A DMockPointF.java17 set(x, y);
21 public void set(float x, float y) { method in class:MockPointF
/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jar ... .Set danglingStates protected void stripWildCardAlts (java.util.Set) java.util.Set disabledAlts java.util. ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h272 ANTLR3_UINT32 (*set) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting); member in struct:ANTLR3_VECTOR_struct
392 * A topological sort system that given a set of dependencies of a node m on node n,
394 * that does not care what the things are it is sorting. Generally the set
399 * some set of your own device.
411 * contains a bitset, which has a bit index set for each node upon which the
437 * If this flag is set after you have called one of the sort routines
457 * The set of visited nodes as determined by a set entry in
H A Dantlr3string.h88 pANTLR3_UINT8 (*set) (struct ANTLR3_STRING_struct * string, const char * chars); member in struct:ANTLR3_STRING_struct
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3baserecognizer.c68 static void consumeUntilSet (pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_BITSET set);
206 // Free any rule memoization we set up
411 /// rule. Rule would recover by resynchronizing to the set of
464 // we just set the failed flag and return.
562 // follow set and does not indicate a missing token. We will just consume this
595 // and make them part of the follow set.
601 /// if current token is consistent with what could come after set
606 /// in follow set to indicate that the fall of the start symbol is
607 /// in the set (EOF can follow).
714 /// 3. consume until token found in resynch set
1766 consumeUntilSet(pANTLR3_BASE_RECOGNIZER recognizer, pANTLR3_BITSET set) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
H A DBaseRecognizer.cs91 set;
128 * to the set of symbols that can follow rule ref.
173 // if current token is consistent with what could come after set
181 // in follow set to indicate that the fall of the start symbol is
182 // in the set (EOF can follow).
200 * 3. consume until token found in resynch set
306 " expecting set " + mse.Expecting;
310 " expecting set " + mse.Expecting;
381 // where LT(1) is in the recovery token set so nothing is
404 /* Compute the error recovery set fo
714 ConsumeUntil(IIntStream input, BitSet set) argument
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DListExtensions.cs156 public static void set( this IList list, int index, object value ) method in class:Antlr.Runtime.JavaExtensions.ListExtensions
162 public static void set<T>( this IList<T> list, int index, T value ) method in class:Antlr.Runtime.JavaExtensions.ListExtensions
168 public static void set<T>( this List<T> list, int index, T value ) method in class:Antlr.Runtime.JavaExtensions.ListExtensions
H A DSetExtensions.cs45 public static bool add<T>( this HashSet<T> set, T item ) argument
47 return set.Add( item );
51 public static void addAll<T>( this HashSet<T> set, IEnumerable<T> items ) argument
54 set.Add( item );
59 public static void clear<T>( this HashSet<T> set )
61 set.Clear();
65 public static bool contains<T>( this HashSet<T> set, T value ) argument
67 return set.Contains( value );
71 public static bool remove<T>( this HashSet<T> set, T item ) argument
73 return set
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
H A DBaseRecognizer.java98 * to the set of symbols that can follow rule ref.
144 // if current token is consistent with what could come after set
152 // in follow set to indicate that the fall of the start symbol is
153 // in the set (EOF can follow).
170 * 3. consume until token found in resynch set
284 " expecting set "+mse.expecting;
289 " expecting set "+mse.expecting;
356 // where LT(1) is in the recovery token set so nothing is
377 /* Compute the error recovery set for the current rule. During
378 * rule invocation, the parser pushes the set o
685 consumeUntil(IntStream input, BitSet set) argument
[all...]
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dcompat.py34 set = set variable
37 from sets import Set as set, ImmutableSet as frozenset namespace
H A Drecognizers.py45 from antlr3.compat import set, frozenset, reversed namespace
50 The set of fields needed by an abstract recognizer to recognize input
59 # Track the set of token types that can follow any rule invocation.
99 # emissions, then set this to the last token to be matched or
121 ## You can set the text for the current token to override what is in
122 # the input char buffer. Use setText() or can set this instance var.
208 to the set of symbols that can follow rule ref.
249 follow = follow - set([EOR_TOKEN_TYPE])
251 # if current token is consistent with what could come after set
270 3. consume until token found in resynch set
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DLabel.java35 * label such as a token or character. A label can be a set of char or
52 /** label is a set of tokens or char */
120 /** A set of token types or character codes if label==SET */
128 /** Make a set label */
219 // convert single element to a set if they ask for it.
225 public void setSet(IntSet set) { argument
227 labelSet = set;
244 public boolean matches(IntSet set) { argument
246 return set.member(getAtom());
250 return !getSet().and(set)
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
H A DCodeGenerator.java338 // if filtering, we need to set actions to execute at backtracking
442 // Now that we know what synpreds are used, we can set into template
713 // must rewind input first, set flag.
755 IntSet set,
759 if ( !(set instanceof IntervalSet) ) {
762 IntervalSet iset = (IntervalSet)set;
765 emptyST.impl.name = "empty-set-expr";
754 genSetExpr(STGroup templates, IntSet set, int k, boolean partOfDFA) argument
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DBitSet.java40 * Primary differences are that most set operators return new sets
45 * Consider defining set degree. Without access to the bits, I must
48 * Also seems like or() from util is wrong when size of incoming set is bigger
84 /** or this element into this set (grow as necessary to accommodate) */
96 public void addAll(IntSet set) { argument
97 if ( set instanceof BitSet ) {
98 this.orInPlace((BitSet)set);
100 else if ( set instanceof IntervalSet ) {
101 IntervalSet other = (IntervalSet)set;
102 // walk set an
293 complement(IntSet set) argument
341 of(IntSet set) argument
[all...]
H A DIntArrayList.java50 public int set(int i, int newValue) { method in class:IntArrayList
52 setSize(i); // unlike definition of set in ArrayList, set size
H A DIntSet.java34 /** A generic set of ints that has an efficient implementation, BitSet,
44 /** Add an element to the set */
47 /** Add all elements from incoming set to this set. Can limit
48 * to set of its own type.
50 void addAll(IntSet set); argument
52 /** Return the intersection of this set with the argument, creating
53 * a new set.
63 /** Return the size of this set (not the underlying implementation's
76 /** remove this element from this set */
[all...]
H A DIntervalSet.java38 /** A set of integers that relies on ranges being common to do
58 /** Create a set with no elements */
67 /** Create a set with a single element, el. */
74 /** Create a set with all ints within range [a..b] (inclusive) */
81 /** Add a single element to the set. An isolated element is stored
88 /** Add interval; i.e., add all integers from a to b to set.
115 iter.set(bigger);
123 iter.previous(); // move backwards to what we just set
124 iter.set(bigger.union(next)); // set t
187 addAll(IntSet set) argument
[all...]
H A DOrderedHashSet.java36 * You can alter the ith element with set(i,value) too :) Unique list.
37 * I need the replace/set-element-i functionality so I'm subclassing
41 /** Track the elements as they are added to the set */
51 public T set(int i, T value) { method in class:OrderedHashSet
53 elements.set(i,value); // update list
54 super.remove(oldElement); // now update the set: remove/add
65 if ( result ) { // only track if new element not in set
102 ErrorManager.internalError("OrderedHashSet: elements and set size differs; "+
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DGrammar.java78 * value set of escape chars.
125 * another tree parser. Maps delegate to set of delegator grammar types.
167 * Currently only set for rule labels.
278 /** Is there a global fixed lookahead set for this grammar?
280 * the options table yet to set k.
325 /** The unique set of all rule references in any rule; set of tree node
332 /** The unique set of all token ID references in any rule */
474 * This is the a set of BLOCK type AST nodes.
492 * This is the a set o
2982 complement(IntSet set) argument
[all...]
H A DNFAFactory.java133 /** From set build single edge graph o->o-set->o. To conform to
136 public StateCluster build_Set(IntSet set, GrammarAST associatedAST) { argument
141 Label label = new Label(set);
149 * result, that is. Get set and complement, replace old with complement.
152 IntSet set = getCollapsedBlockAsSet(s0);
153 if ( set!=null ) {
154 // if set is available, then structure known and blk is a set
155 set
352 build_AlternativeBlockFromSet(StateCluster set) argument
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
H A DAbstractRealVector.java756 public void set(double value) { method in class:AbstractRealVector
H A DArrayFieldVector.java119 * set to <code>false</code. This will prevent the copying and improve
150 * set to <code>false</code. This will prevent the copying and improve
719 set(index, (ArrayFieldVector<T>) v);
742 * Set a set of consecutive elements.
744 * @param index index of first element to be set.
745 * @param v vector containing the values to set.
749 public void set(int index, ArrayFieldVector<T> v) method in class:ArrayFieldVector
755 public void set(T value) { method in class:ArrayFieldVector
H A DArrayRealVector.java89 * set to <code>false</code. This will prevent the copying and improve
1049 set(index, (ArrayRealVector) v);
1073 * Set a set of consecutive elements.
1075 * @param index index of first element to be set.
1076 * @param v vector containing the values to set.
1080 public void set(int index, ArrayRealVector v) method in class:ArrayRealVector
1087 public void set(double value) { method in class:ArrayRealVector

Completed in 1098 milliseconds

1234567891011>>