Searched refs:rhs (Results 1 - 25 of 1313) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/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/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas988 /// Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels
/external/arduino/hardware/arduino/cores/arduino/
H A DWString.cpp120 const String & String::operator=( const String &rhs )
122 if ( this == &rhs )
125 if ( rhs._length > _length )
128 getBuffer( rhs._length );
132 _length = rhs._length;
133 strcpy( _buffer, rhs._buffer );
167 int String::operator==( const String &rhs ) const
169 return ( _length == rhs._length && strcmp( _buffer, rhs._buffer ) == 0 );
172 int String::operator!=( const String &rhs ) cons
[all...]
H A DWString.h43 const String & operator = ( const String &rhs );
44 const String & operator +=( const String &rhs );
46 int operator ==( const String &rhs ) const;
47 int operator !=( const String &rhs ) const;
48 int operator < ( const String &rhs ) const;
49 int operator > ( const String &rhs ) const;
50 int operator <=( const String &rhs ) const;
51 int operator >=( const String &rhs ) const;
85 friend String operator + ( String lhs, const String &rhs );
106 inline String operator+( String lhs, const String &rhs )
[all...]
/external/bison/data/
H A Dlalr1.java101 private ]b4_location_type[ yylloc (YYStack rhs, int n)
104 return new ]b4_location_type[ (rhs.locationAt (n-1).begin, rhs.locationAt (0).end);
106 return new ]b4_location_type[ (rhs.locationAt (0).end);
/external/bison/src/
H A DAnnotationList.c473 if (!item_number_is_rule_number (the_rule->rhs[0]))
H A DLR0.c107 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
H A Dclosure.c134 item_number sym = derives[i - ntokens][j]->rhs[0];
222 item_number itemno = rules[ruleno].rhs - ritem;
H A Dgram.c95 for (rhsp = r->rhs; *rhsp >= 0; ++rhsp)
103 if (*r->rhs >= 0)
106 for (rp = r->rhs; *rp >= 0; rp++)
119 if (*r->rhs >= 0)
122 xml_puts (out, level, "<rhs>");
123 for (rp = r->rhs; *rp >= 0; rp++)
126 xml_puts (out, level, "</rhs>");
130 xml_puts (out, level, "<rhs>");
132 xml_puts (out, level, "</rhs>");
271 unsigned int rhs_itemno = rule_i->rhs
[all...]
H A Dgram.h58 RULES[R].rhs -- the index in RITEM of the beginning of the portion
184 item_number *rhs; member in struct:__anon375
H A Dielr.c136 (*rulep)->rhs - ritem))
140 item_number_as_symbol_number (*(*rulep)->rhs));
1049 if (item_number_is_rule_number (*this_rule->rhs))
H A Dlalr.c241 for (rp = (*rulep)->rhs; ! item_number_is_rule_number (*rp); rp++)
256 /* Each rhs ends in a rule number, and there is a
257 sentinel (ritem[-1]=0) before the first rhs, so it is safe to
H A Dnullable.c81 if (rules_ruleno->rhs[0] >= 0)
86 for (rp = rules_ruleno->rhs; *rp >= 0; ++rp)
93 for (rp = rules_ruleno->rhs; *rp >= 0; ++rp)
105 aver (item_number_as_rule_number (rules_ruleno->rhs[0])
H A Doutput.c213 | Prepare the muscles related to the rules: rhs, prhs, r1, r2, |
222 item_number *rhs = xnmalloc (nritems, sizeof *rhs); local
236 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
237 rhs[i++] = *rhsp;
243 rhs[i++] = -1;
253 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems);
264 free (rhs);
H A Dparse-gram.c737 "rules_or_grammar_declaration", "rules", "$@3", "rhses.1", "rhs",
3156 lloc_default (YYLTYPE const *rhs, int n) argument
3161 /* SGI MIPSpro 7.4.1m miscompiles "loc.start = loc.end = rhs[n].end;".
3163 loc.start = rhs[n].end;
3164 loc.end = rhs[n].end;
3170 if (! equal_boundaries (rhs[i].start, rhs[i].end))
3172 loc.start = rhs[i].start;
H A Dparse-gram.y568 rhs { grammar_current_rule_end (@1); }
569 | rhses.1 "|" rhs { grammar_current_rule_end (@3); }
573 rhs: label
577 | rhs symbol named_ref.opt
579 | rhs "{...}" named_ref.opt
581 | rhs "%prec" symbol
583 | rhs "%dprec" INT
585 | rhs "%merge" TYPE
691 lloc_default (YYLTYPE const *rhs, int n)
696 /* SGI MIPSpro 7.4.1m miscompiles "loc.start = loc.end = rhs[
[all...]
H A Dprint-xml.c87 sp = rules[r].rhs;
H A Dprint.c107 for (sp = rules[r].rhs; sp < sp1; sp++)
426 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
450 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
488 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
H A Dprint_graph.c97 for (sp = rules[r].rhs; sp < sp1; sp++)
H A Dreduce.c75 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
182 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
260 item_number *rhsp = rules[r].rhs;
326 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DECPoint.java1682 ECFieldElement rhs = ZSq.square().multiply(this.getCurve().getB()).add(XSq.square());
1684 if (!lhs.equals(rhs))
/external/ceres-solver/internal/ceres/
H A Dblock_structure.cc36 bool CellLessThan(const Cell& lhs, const Cell& rhs) { argument
37 if (lhs.block_id == rhs.block_id) {
38 return (lhs.position < rhs.position);
40 return (lhs.block_id < rhs.block_id);
H A Dblock_structure.h70 bool CellLessThan(const Cell& lhs, const Cell& rhs);
H A Ddense_normal_cholesky_solver.cc87 // rhs = A'b
88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); local
110 VectorRef(x, num_cols) = llt.solve(rhs);
150 // rhs = A'b

Completed in 2507 milliseconds

1234567891011>>