Searched defs:alt (Results 1 - 25 of 73) sorted by relevance

123

/external/elfutils/libdw/
H A Ddwarf_setalt.c36 dwarf_setalt (Dwarf *main, Dwarf *alt) argument
38 main->alt_dwarf = alt;
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DRecursionOverflowMessage.java43 public int alt; field in class:RecursionOverflowMessage
49 int alt,
56 this.alt = alt;
72 st.add("alt", alt);
47 RecursionOverflowMessage(DecisionProbe probe, DFAState sampleBadState, int alt, Collection targetRules, Collection callSiteStates) argument
H A DGrammarSerializerFoo.java42 * alt ::= A<elems>;
122 public void alt(GrammarAST alt) { argument
H A DLeftRecursiveRuleAnalyzer.java61 public void setTokenPrec(GrammarAST t, int alt) { argument
63 tokenToPrec.put(ttype, alt);
77 if ( altAssociativity.get(alt)!=null && altAssociativity.get(alt)!=assoc ) {
78 ErrorManager.error(ErrorManager.MSG_ALL_OPS_NEED_SAME_ASSOC, alt);
80 altAssociativity.put(alt, assoc);
82 //System.out.println("op " + alt + ": " + t.getText()+", assoc="+assoc);
86 public void binaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) { argument
94 int nextPrec = nextPrecedence(alt);
102 altText += "{}"; // add empty alt t
113 ternaryAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
138 prefixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
164 suffixAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
180 otherAlt(GrammarAST altTree, GrammarAST rewriteTree, int alt) argument
310 precedence(int alt) argument
314 nextPrecedence(int alt) argument
[all...]
H A DNFAFactory.java84 public void optimizeAlternative(StateCluster alt) { argument
85 NFAState s = alt.left;
86 while ( s!=alt.right ) {
101 // point at the last node of the alt. Don't collapse action edges
134 * what an alt block looks like, must have extra state on left.
231 * TODO add to codegen: collapse alt blks that are sets into single matchSet
357 // single alt, no decision, just return only alt state cluster
375 * and every alt right side points at a block end NFAState. There is a
376 * new NFAState in the NFAState in the StateCluster for each alt plu
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DLL1DFA.java42 /** From list of lookahead sets (one per alt in decision), create
60 for (int alt=1; alt<altLook.length; alt++) {
63 setAcceptState(alt, acceptAltState);
65 acceptAltState.cachedUniquelyPredicatedAlt = alt;
66 Label e = getLabelForSet(altLook[alt].tokenTypeSet);
97 int alt = alts.get(0);
98 setAcceptState(alt, s);
99 s.cachedUniquelyPredicatedAlt = alt;
152 getSynPredForAlt(NFAState decisionStartState, int alt) argument
[all...]
H A DNFAConfiguration.java32 /** An NFA state, predicted alt, and syntactic/semantic context.
42 /** What alt is predicted by this configuration */
43 public int alt; field in class:NFAConfiguration
63 * other configuration associated with alt 3).
90 int alt,
95 this.alt = alt;
103 * the state|alt|ctx could be the same and have two different
113 this.alt==other.alt
89 NFAConfiguration(int state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DDFAState.java47 * NFA could be in. We need to track the alt predicted by each
70 * context trees for an alt.
108 /** If we detect recursion on more than one alt, decision is non-LL(*),
137 /** The set of NFA configurations (state,alt,context) for this DFA state */
145 * hence looping forever. Sensitive to the NFA state, the alt, and
205 * an NFA state/alt/syntactic&semantic context (chain of invoking state(s)
209 * state|alt|synCtx and different semantic contexts because the
228 // track min alt rather than compute later
229 if ( c.alt < minAltInConfigurations ) {
230 minAltInConfigurations = c.alt;
259 addNFAConfiguration(NFAState state, int alt, NFAContext context, SemanticContext semanticContext) argument
[all...]
H A DNFAToDFAConverter.java122 * Walk each alt in decision and compute closure from the start of that
124 * that same decision. The idea is to associate a specific alt number
125 * with the starting closure so we can trace the alt number for all states
126 * derived from this. At a stop state in the DFA, we can return this alt
127 * number, indicating which alt is predicted.
131 * this alternative one, let's make this alt n+1 where n is the number of
140 NFAState alt = dfa.decisionNFAStartState;
145 while ( alt!=null ) {
147 // any input symbols for each alt. Keep adding to same
149 // but track the alt numbe
591 closure(NFAState p, int alt, NFAContext context, SemanticContext semanticContext, DFAState d, boolean collectPredicates) argument
985 convertToAcceptState(DFAState d, int alt) argument
[all...]
/external/libedit/src/
H A Dmap.h51 el_action_t *alt; /* The current alternate key map */ member in struct:el_map_t
H A Dmap.c906 el->el_map.alt = el_malloc(sizeof(*el->el_map.alt) * N_KEYS);
907 if (el->el_map.alt == NULL)
943 el_free(el->el_map.alt);
944 el->el_map.alt = NULL;
982 el_action_t *alt = el->el_map.alt; local
988 for (i = 0; i <= 0377 && alt[i] != EM_META_NEXT; i++)
993 map = alt;
995 map = alt;
1022 el_action_t *alt = el->el_map.alt; local
1053 el_action_t *alt = el->el_map.alt; local
[all...]
/external/libgdx/gdx/src/com/badlogic/gdx/scenes/scene2d/utils/
H A DUIUtils.java59 static public boolean alt () { method in class:UIUtils
63 static public boolean alt (int keycode) { method in class:UIUtils
/external/libmpeg2/common/
H A Dideint_cac.c107 WORD32 alt; local
131 alt = 0;
212 alt += ABS_DIF(sum_1, sum_3);
213 alt += ABS_DIF(sum_2, sum_4);
298 alt += diff_sum << 2;
303 alt += (alt >> sad_bias_mult_shift) + (sad_bias_additive >> 1);
304 ca = (alt < adj);
/external/libmpeg2/common/x86/
H A Dideint_cac_ssse3.c101 WORD32 alt[2] = {0}; local
133 /* Compute row based alt and adj */
148 alt[0] += ABS_DIF(sum_1, sum_3);
149 alt[0] += ABS_DIF(sum_2, sum_4);
163 alt[1] += ABS_DIF(sum_1, sum_3);
164 alt[1] += ABS_DIF(sum_2, sum_4);
206 /* Compute column based alt */
222 alt[0] += diff_sum << 2;
225 alt[1] += diff_sum << 2;
228 alt[
[all...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/
H A DBlankDebugEventListener.cs59 public virtual void EnterAlt(int alt) { argument
H A DDebugEventHub.cs86 public virtual void EnterAlt(int alt) { argument
89 listener.EnterAlt(alt);
H A DDebugEventRepeater.cs62 public virtual void EnterAlt(int alt) { argument
63 _listener.EnterAlt(alt);
H A DIDebugEventListener.cs51 * which alt is predicted. This is fired AFTER init actions have been
61 * know which alt you are entering. This is 1..n for n alts.
64 void EnterAlt(int alt); argument
172 * If no viable alt occurs it is within an enter/exit decision, which
192 * The sequence for this rule (with no viable alt in the subrule) for
H A DDebugEventSocketProxy.cs157 public override void EnterAlt(int alt) { argument
158 Transmit("enterAlt\t" + alt);
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/
H A DBlankDebugEventListener.java40 public void enterAlt(int alt) {} argument
H A DDebugEventHub.java84 public void enterAlt(int alt) { argument
87 listener.enterAlt(alt);
H A DDebugEventListener.java51 * which alt is predicted. This is fired AFTER init actions have been
59 * know which alt you are entering. This is 1..n for n alts.
61 public void enterAlt(int alt); argument
146 * If no viable alt occurs it is within an enter/exit decision, which
166 * The sequence for this rule (with no viable alt in the subrule) for
H A DDebugEventRepeater.java51 public void enterAlt(int alt) { listener.enterAlt(alt); } argument
/external/icu/icu4c/source/i18n/
H A Dastro.h224 * @param alt The altitude, measured in radians above the horizon.
228 Horizon(double alt=0, double azim=0) argument
229 : altitude(alt), azimuth(azim) { }
233 * @param alt The altitude, measured in radians above the horizon.
237 void set(double alt, double azim) { argument
238 altitude = alt;
/external/chromium-trace/catapult/netlog_viewer/netlog_viewer/
H A Dlog_util_test.js176 'alt-svc': true,
205 'alt-svc': false,

Completed in 756 milliseconds

123