/external/stlport/test/unit/ |
H A D | unique_test.cpp | 52 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; local 54 const unsigned count = sizeof(labels) / sizeof(labels[0]); 56 unique((const char**)labels, (const char**)labels + count, str_equal); 59 CPPUNIT_ASSERT(*labels[0] == 'Q'); 60 CPPUNIT_ASSERT(*labels[1] == 'W'); 61 CPPUNIT_ASSERT(*labels[2] == 'E'); 62 CPPUNIT_ASSERT(*labels[3] == 'R'); 63 CPPUNIT_ASSERT(*labels[ 88 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; local [all...] |
H A D | bsearch_test.cpp | 40 char const* labels[] = { "aa", "dd", "ff", "jj", "ss", "zz" }; local 41 const unsigned count = sizeof(labels) / sizeof(labels[0]); 44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare));
|
/external/jmonkeyengine/engine/src/core/com/jme3/app/ |
H A D | StatsView.java | 64 private BitmapText[] labels; field in class:StatsView 84 labels = new BitmapText[statLabels.length]; 87 for (int i = 0; i < labels.length; i++){ 88 labels[i] = new BitmapText(font); 89 labels[i].setLocalTranslation(0, labels[i].getLineHeight() * (i+1), 0); 90 attachChild(labels[i]); 102 for (int i = 0; i < labels.length; i++) { 105 labels[i].setText(stringBuilder);
|
/external/webkit/Source/WebKit/android/WebCoreSupport/autofill/ |
H A D | AutoFillHostAndroid.cpp | 38 void AutoFillHostAndroid::AutoFillSuggestionsReturned(const std::vector<string16>& names, const std::vector<string16>& labels, const std::vector<string16>& icons, const std::vector<int>& uniqueIds) argument 42 mAutofill->querySuccessful(names[0], labels[0], uniqueIds[0]);
|
H A D | AutoFillHostAndroid.h | 46 virtual void AutoFillSuggestionsReturned(const std::vector<string16>& names, const std::vector<string16>& labels, const std::vector<string16>& icons, const std::vector<int>& uniqueIds);
|
/external/openfst/src/include/fst/ |
H A D | icu.h | 68 bool UTF8StringToLabels(const string &str, vector<Label> *labels) { argument 78 labels->push_back(c); 84 bool LabelsToUTF8String(const vector<Label> &labels, string *str) { argument 87 for (size_t i = 0; i < labels.size(); ++i) { 88 u_str.setTo(labels[i]);
|
H A D | string.h | 52 vector<Label> labels; local 53 if (!ConvertStringToLabels(s, &labels)) 55 Compile(labels, fst); 60 bool ConvertStringToLabels(const string &str, vector<Label> *labels) const { 61 labels->clear(); 64 labels->push_back(static_cast<unsigned char>(str[i])); 66 return UTF8StringToLabels(str, labels); 78 labels->push_back(label); 85 void Compile(const vector<Label> &labels, MutableFst<A> *fst) const { argument 87 while (fst->NumStates() <= labels 96 Compile(const vector<Label> &labels, CompactFst<A, StringCompactor<A>, Unsigned> *fst) const argument [all...] |
/external/webkit/Source/WebCore/html/ |
H A D | HTMLProgressElement.idl | 30 readonly attribute NodeList labels;
|
H A D | HTMLKeygenElement.idl | 49 readonly attribute NodeList labels;
|
H A D | HTMLMeterElement.idl | 37 readonly attribute NodeList labels;
|
H A D | HTMLOutputElement.idl | 41 readonly attribute NodeList labels;
|
/external/chromium/chrome/browser/autofill/ |
H A D | autofill_profile_unittest.cc | 163 // As labels are empty they are adjusted the first time. 327 std::vector<string16> labels; local 330 &labels); 331 EXPECT_EQ(ASCIIToUTF16("John Doe, 666 Erebus St."), labels[0]); 332 EXPECT_EQ(ASCIIToUTF16("Jane Doe, 123 Letha Shore."), labels[1]); 336 &labels); 338 labels[0]); 340 labels[1]); 349 UNKNOWN_TYPE, 2, &labels); 350 EXPECT_EQ(ASCIIToUTF16("Elysium, CA"), labels[ 379 EXPECT_EQ(string16(), labels[0]); local 380 EXPECT_EQ(string16(), labels[1]); local 416 std::vector<string16> labels; local 450 std::vector<string16> labels; local 474 std::vector<string16> labels; local 491 labels[1]) << labels[1]; local [all...] |
H A D | autofill_host.h | 45 virtual void AutoFillSuggestionsReturned(const std::vector<string16>& values, const std::vector<string16>& labels, const std::vector<string16>& icons, const std::vector<int>& unique_ids) = 0;
|
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/ |
H A D | test-tree-wizard.rb | 254 @wizard.visit( tree, B ) do |node, parent, child_index, labels| 266 @wizard.visit( tree, C ) do |node, parent, child_index, labels| 278 @wizard.visit( tree, B ) do |node, parent, child_index, labels| 290 @wizard.visit( tree, A ) do |node, parent, child_index, labels| 305 @wizard.visit( tree, B ) do |node, parent, child_index, labels| 317 @wizard.visit( tree, A ) do |node, parent, child_index, labels| 328 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels| 340 @wizard.visit(tree, '(A B)') do |node, parent, child_index, labels| 347 def labeled_context(node, parent, index, labels, *names) 348 suffix = names.map { |n| labels[ [all...] |
/external/webkit/Source/WebKit/mac/WebView/ |
H A D | WebHTMLRepresentation.h | 70 - (NSString *)searchForLabels:(NSArray *)labels beforeElement:(DOMElement *)element resultDistance:(WebNSUInteger*)outDistance resultIsInCellAbove:(BOOL*)outIsInCellAbove; 71 - (NSString *)matchLabels:(NSArray *)labels againstElement:(DOMElement *)element; 74 - (NSString *)searchForLabels:(NSArray *)labels beforeElement:(DOMElement *)element; // Use -searchForLabels:beforeElement:resultDistance:resultIsInCellAbove:
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | MachineProbe.java | 78 /** Return a list of edge labels from start state to targetState. */ 81 List<IntSet> labels = new ArrayList<IntSet>(); 89 labels.add(e.label.getSet()); 93 return labels; 101 public String getInputSequenceDisplay(Grammar g, List<IntSet> labels) { argument 103 for (IntSet label : labels) 111 * labels sequence. The nfaStates gives the set of NFA states associated 113 * nfaStates[i] will have an edge intersecting with labels[i]. 116 List<Set<NFAState>> nfaStates, List<IntSet> labels) { 121 IntSet label = labels 115 getGrammarLocationsForInputSequence( List<Set<NFAState>> nfaStates, List<IntSet> labels) argument [all...] |
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTreeWizard.java | 193 public void visit(Object t, Object parent, int childIndex, Map labels) { 210 public void visit(Object t, Object parent, int childIndex, Map labels) { 242 public void visit(Object t, Object parent, int childIndex, Map labels) { 259 public void visit(Object t, Object parent, int childIndex, Map labels) { 262 "["+childIndex+"]"+labels.get("a")+"&"+labels.get("b")); 326 Map labels = new HashMap(); 327 boolean valid = wiz.parse(t, "(%a:A %b:B %c:C)", labels); 329 assertEquals("A", labels.get("a").toString()); 330 assertEquals("B", labels [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeWizard.java | 59 public void visit(Object t, Object parent, int childIndex, Map labels); argument 63 public void visit(Object t, Object parent, int childIndex, Map labels) { argument 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 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 Ma 310 parse(Object t, String pattern, Map labels) argument 332 _parse(Object t1, TreePattern tpattern, Map labels) argument [all...] |
/external/webkit/Source/WebCore/page/mac/ |
H A D | FrameMac.mm | 68 // Either get cached regexp or build one that matches any of the labels. 70 static RegularExpression* regExpForLabels(NSArray* labels) 86 CFIndex cacheHit = [regExpLabels indexOfObject:labels]; 91 unsigned int numLabels = [labels count]; 94 String label = [labels objectAtIndex:i]; 126 [regExpLabels insertObject:labels atIndex:0]; 139 NSString* Frame::searchForLabelsBeforeElement(NSArray* labels, Element* element, size_t* resultDistance, bool* resultIsInCellAbove) 141 RegularExpression* regExp = regExpForLabels(labels); 208 static NSString *matchLabelsAgainstString(NSArray *labels, const String& stringToMatch) 219 RegularExpression* regExp = regExpForLabels(labels); [all...] |
/external/antlr/antlr-3.4/runtime/Python/unittests/ |
H A D | testtreewizard.py | 375 def visitor(node, parent, childIndex, labels): 389 def visitor(node, parent, childIndex, labels): 403 def visitor(node, parent, childIndex, labels): 417 def visitor(node, parent, childIndex, labels): 431 def visitor(node, parent, childIndex, labels): 445 def visitor(node, parent, childIndex, labels): 462 def visitor(node, parent, childIndex, labels): 478 def visitor(node, parent, childIndex, labels): 495 def visitor(node, parent, childIndex, labels): 501 labels[' [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | GrammarDanglingStateMessage.java | 61 List labels = probe.getSampleNonDeterministicInputSequence(problemState); 62 String input = probe.getInputSequenceDisplay(labels);
|
H A D | RecursionOverflowMessage.java | 75 List labels = 77 String input = probe.getInputSequenceDisplay(labels);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | ACyclicDFACodeGenerator.java | 115 if ( edgeST.impl.formalArguments.get("labels")!=null ) { 116 List labels = edge.label.getSet().toList(); 117 for (int j = 0; j < labels.size(); j++) { 118 Integer vI = (Integer) labels.get(j); 121 labels.set(j, label); // rewrite List element to be name 123 edgeST.add("labels", labels);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeWizard.cs | 70 void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels); argument 74 public virtual void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { argument 259 public void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { argument 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) { argument 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 Ma 391 Parse(object t, string pattern, IDictionary<string, object> labels) argument 415 ParseCore(object t1, TreePattern tpattern, IDictionary<string, object> labels) argument [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | 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 ) argument 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 Ma [all...] |