/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
TreeWizard.cs | 70 void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels); 74 public virtual void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { 259 public void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { 302 * version of the general visit(t, pattern) method. The labels arg 336 public VisitTreeWizardContextVisitor(TreeWizard outer, IContextVisitor visitor, IDictionary<string, object> labels, TreePattern tpattern) { 339 _labels = labels; 371 IDictionary<string, object> labels = new Dictionary<string, object>(); // reused for each _parse 373 Visit(t, rootTokenType, new VisitTreeWizardContextVisitor(this, visitor, labels, tpattern)); 377 * Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels 379 * return true if the pattern matches and fill the labels Map wit [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
TreeWizard.cs | 73 void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ); 78 public virtual void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ) 296 public void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ) 346 * version of the general visit(t, pattern) method. The labels arg 387 public VisitTreeWizardContextVisitor( TreeWizard outer, IContextVisitor visitor, IDictionary<string, object> labels, TreePattern tpattern ) 391 _labels = labels; 427 IDictionary<string, object> labels = new Dictionary<string, object>(); // reused for each _parse 429 Visit( t, rootTokenType, new VisitTreeWizardContextVisitor( this, visitor, labels, tpattern ) ); 433 * Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels 435 * return true if the pattern matches and fill the labels Map wit [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
TreeWizard.java | 59 public void visit(Object t, Object parent, int childIndex, Map labels); 63 public void visit(Object t, Object parent, int childIndex, Map labels) { 227 public void visit(Object t, Object parent, int childIndex, Map labels) { 245 * version of the general visit(t, pattern) method. The labels arg 286 final Map labels = new HashMap(); // reused for each _parse local 291 labels.clear(); 292 if ( _parse(t, tpattern, labels) ) { 293 visitor.visit(t, parent, childIndex, labels); 299 /** Given a pattern like (ASSIGN %lhs:ID %rhs:.) with optional labels 301 * return true if the pattern matches and fill the labels Map wit [all...] |
/external/openfst/src/include/fst/ |
label-reachable.h | 102 bool reach_input_; // Input or output labels considered? 114 // Tests reachability of labels from a given state. If reach_input = 115 // true, then input labels are considered, o.w. output labels are 120 // labels. 124 // labels of the transformed FST f. The relabeled FST will also be 130 // Reachability can also be tested on the set of labels specified by 132 // Reach(aiter, ...) is true if labels on the input (output) side of 134 // (false), can be reached from the state s. The iterator labels must 199 // Relabels w.r.t labels that give compact label sets [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/ |
wizard.rb | 94 # iterate through the tree and extract nodes with pattern labels 95 wizard.visit(deep_node, '(MULT %n:NUMBER %v:.)') do |node, parent, local_index, labels| 96 printf "n = %p\n, v = %p\n", labels['n'], labels['v'] 410 visit( tree, pattern.type ) do | tree, parent, child_index, labels | 411 labels = match!( tree, pattern ) and 412 yield( tree, parent, child_index, labels ) 422 def match!( tree, pattern, labels = {} ) 429 labels[ pattern.label ] = tree if labels && pattern.labe [all...] |
/external/chromium_org/android_webview/native/ |
aw_autofill_manager_delegate.h | 78 const std::vector<string16>& labels, 84 const std::vector<base::string16>& labels) OVERRIDE; 99 const std::vector<string16>& labels,
|
/external/chromium_org/chrome/common/metrics/variations/ |
experiment_labels.cc | 24 // after the label key to differentiate the labels. 68 base::string16 ExtractNonVariationLabels(const base::string16& labels) { 75 base::SplitStringUsingSubstr(labels, separator, &entries);
|
/external/chromium_org/components/autofill/core/browser/ |
autofill_manager_delegate.h | 75 // Shows an Autofill popup with the given |values|, |labels|, |icons|, and 82 const std::vector<base::string16>& labels, 90 const std::vector<base::string16>& labels) = 0;
|
autofill_manager.cc | 72 std::vector<base::string16>* labels, 75 DCHECK_EQ(values->size(), labels->size()); 87 (*values)[i], (*labels)[i]); 90 labels_copy.push_back((*labels)[i]); 97 labels->swap(labels_copy); 359 std::vector<base::string16> labels; local 379 field, type, &values, &labels, &icons, &unique_ids); 382 form_structure, field, type, &values, &labels, &icons, &unique_ids); 385 DCHECK_EQ(values.size(), labels.size()); 400 labels.assign(1, base::string16()) [all...] |
/external/openfst/src/bin/ |
fstrelabel.cc | 41 "Allow negative labels (not recommended; may cause conflicts)"); 50 string usage = "Relabels the input and/or the output labels of the FST.\n\n" 57 usage += " Using numeric labels flags:\n";
|
/packages/inputmethods/PinyinIME/res/xml/ |
skb_qwerty.xml | 28 <keys splitter="|" labels="Q|W|E|R|T|Y|U|I|O|P" 33 <keys splitter="|" labels="A|S|D|F|G|H|J|K|L" 52 <keys splitter="|" labels="Z|X|C|V|B|N|M"
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
GrammarDanglingStateMessage.java | 61 List labels = probe.getSampleNonDeterministicInputSequence(problemState); local 62 String input = probe.getInputSequenceDisplay(labels);
|
RecursionOverflowMessage.java | 75 List labels = local 77 String input = probe.getInputSequenceDisplay(labels);
|
/external/chromium/chrome/browser/resources/options/ |
subpages_tab_controls.css | 21 /* To avoid tabs changing size when they are clicked and their labels become 22 * bold, we actually put two labels inside each tab: an inactive label and an
|
/external/chromium/chrome/browser/sync/ |
sync_ui_util.h | 35 // Create status and link labels for the current status labels and link text
|
/external/chromium-trace/trace-viewer/src/tracing/trace_model/ |
process_test.js | 78 p1.labels = ['a']; 82 p2.labels = ['b'];
|
/external/chromium_org/chrome/browser/resources/options/ |
subpages_tab_controls.css | 20 /* To avoid tabs changing size when they are clicked and their labels become 21 * bold, we actually put two labels inside each tab: an inactive label and an
|
/external/chromium_org/chrome/browser/ui/autofill/ |
tab_autofill_manager_delegate.h | 57 const std::vector<base::string16>& labels, 63 const std::vector<base::string16>& labels) OVERRIDE;
|
/external/chromium_org/third_party/WebKit/Source/web/ |
AutofillPopupMenuClient.cpp | 246 const WebVector<WebString>& labels, 251 ASSERT(names.size() == labels.size()); 261 setSuggestions(names, labels, icons, itemIDs); 265 WebVector<WebString> labelsWithSeparator(labels.size() + 1); 271 labelsWithSeparator[j] = labels[i]; 306 const WebVector<WebString>& labels, 310 ASSERT(names.size() == labels.size()); 320 m_labels.append(labels[i]);
|
/external/openfst/src/extensions/pdt/ |
pdtreplace.cc | 18 // Converts an RTN represented by FSTs and non-terminal labels into a PDT . 34 usage += " and non-terminal labels into PDT";
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
invert.h | 42 // FST's input and output labels. This version modifies its input. 53 // FST's input and output labels. This version is a delayed Fst.
|
/external/chromium/chrome/browser/autofill/ |
autofill_manager.cc | 72 std::vector<string16>* labels, 75 DCHECK_EQ(values->size(), labels->size()); 86 const std::pair<string16, string16> suggestion((*values)[i], (*labels)[i]); 89 labels_copy.push_back((*labels)[i]); 96 labels->swap(labels_copy); 371 std::vector<string16> labels; local 392 form_structure, field, type, &values, &labels, &icons, &unique_ids); 395 form_structure, field, type, &values, &labels, &icons, &unique_ids); 398 DCHECK_EQ(values.size(), labels.size()); 414 labels.assign(1, string16()) [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
SimpleCParser.java | 206 // token labels: 207 // rule labels: retval 208 // token list labels: 209 // rule list labels: 210 // wildcard labels: 251 // token labels: 252 // rule labels: retval 253 // token list labels: 254 // rule list labels: 255 // wildcard labels: [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/scopes/ |
SymbolTableLexer.m | 84 // token+rule list labels 116 // token+rule list labels 148 // token+rule list labels 180 // token+rule list labels 213 // token+rule list labels 246 // token+rule list labels 278 // token+rule list labels 310 // token+rule list labels 377 // token+rule list labels 444 // token+rule list labels [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/ |
SimpleCLexer.m | 84 // token+rule list labels 117 // token+rule list labels 150 // token+rule list labels 183 // token+rule list labels 216 // token+rule list labels 249 // token+rule list labels 282 // token+rule list labels 316 // token+rule list labels 350 // token+rule list labels 384 // token+rule list labels [all...] |