Home
last modified time | relevance | path

Searched refs:labels (Results 1 – 25 of 277) sorted by relevance

12345678910>>...12

/external/stlport/test/unit/
Dunique_test.cpp52 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in unique2() local
54 const unsigned count = sizeof(labels) / sizeof(labels[0]); in unique2()
56 unique((const char**)labels, (const char**)labels + count, str_equal); in unique2()
59 CPPUNIT_ASSERT(*labels[0] == 'Q'); in unique2()
60 CPPUNIT_ASSERT(*labels[1] == 'W'); in unique2()
61 CPPUNIT_ASSERT(*labels[2] == 'E'); in unique2()
62 CPPUNIT_ASSERT(*labels[3] == 'R'); in unique2()
63 CPPUNIT_ASSERT(*labels[4] == 'T'); in unique2()
64 CPPUNIT_ASSERT(*labels[5] == 'Y'); in unique2()
88 const char* labels[] = {"Q", "Q", "W", "W", "E", "E", "R", "T", "T", "Y", "Y"}; in uniqcpy2() local
[all …]
Dbsearch_test.cpp40 char const* labels[] = { "aa", "dd", "ff", "jj", "ss", "zz" }; in bsearch2() local
41 const unsigned count = sizeof(labels) / sizeof(labels[0]); in bsearch2()
44 CPPUNIT_ASSERT(binary_search(labels, labels + count, (const char *)"ff", str_compare)); in bsearch2()
/external/antlr/antlr-3.4/runtime/Ruby/test/unit/
Dtest-tree-wizard.rb254 @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) argument
348 suffix = names.map { |n| labels[n].to_s }.join('&')
[all …]
/external/chromium/chrome/browser/autofill/
Dautofill_profile_unittest.cc327 std::vector<string16> labels; in TEST() local
330 &labels); in TEST()
331 EXPECT_EQ(ASCIIToUTF16("John Doe, 666 Erebus St."), labels[0]); in TEST()
332 EXPECT_EQ(ASCIIToUTF16("Jane Doe, 123 Letha Shore."), labels[1]); in TEST()
336 &labels); in TEST()
338 labels[0]); in TEST()
340 labels[1]); in TEST()
349 UNKNOWN_TYPE, 2, &labels); in TEST()
350 EXPECT_EQ(ASCIIToUTF16("Elysium, CA"), labels[0]); in TEST()
351 EXPECT_EQ(ASCIIToUTF16("Dis, CA"), labels[1]); in TEST()
[all …]
Dautofill_manager_unittest.cc236 const std::vector<string16>& labels, in ExpectSuggestions() argument
247 ASSERT_EQ(expected_num_suggestions, labels.size()); in ExpectSuggestions()
253 EXPECT_EQ(expected_labels[i], labels[i]); in ExpectSuggestions()
525 std::vector<string16>* labels, in GetAutofillSuggestionsMessage() argument
540 if (labels) in GetAutofillSuggestionsMessage()
541 *labels = autofill_param.c; in GetAutofillSuggestionsMessage()
620 std::vector<string16> labels; in TEST_F() local
624 &page_id, &values, &labels, &icons, &unique_ids); in TEST_F()
638 ExpectSuggestions(page_id, values, labels, icons, unique_ids, in TEST_F()
664 std::vector<string16> labels; in TEST_F() local
[all …]
Dautofill_manager.cc72 std::vector<string16>* labels, in RemoveDuplicateSuggestions() argument
75 DCHECK_EQ(values->size(), labels->size()); in RemoveDuplicateSuggestions()
86 const std::pair<string16, string16> suggestion((*values)[i], (*labels)[i]); in RemoveDuplicateSuggestions()
89 labels_copy.push_back((*labels)[i]); in RemoveDuplicateSuggestions()
96 labels->swap(labels_copy); in RemoveDuplicateSuggestions()
371 std::vector<string16> labels; in OnQueryFormFieldAutofill() local
392 form_structure, field, type, &values, &labels, &icons, &unique_ids); in OnQueryFormFieldAutofill()
395 form_structure, field, type, &values, &labels, &icons, &unique_ids); in OnQueryFormFieldAutofill()
398 DCHECK_EQ(values.size(), labels.size()); in OnQueryFormFieldAutofill()
414 labels.assign(1, string16()); in OnQueryFormFieldAutofill()
[all …]
/external/openfst/src/include/fst/
Dstring.h52 vector<Label> labels; in operator() local
53 if (!ConvertStringToLabels(s, &labels)) in operator()
55 Compile(labels, fst); in operator()
60 bool ConvertStringToLabels(const string &str, vector<Label> *labels) const { in ConvertStringToLabels() argument
61 labels->clear(); in ConvertStringToLabels()
64 labels->push_back(static_cast<unsigned char>(str[i])); in ConvertStringToLabels()
66 return UTF8StringToLabels(str, labels); in ConvertStringToLabels()
78 labels->push_back(label); in ConvertStringToLabels()
85 void Compile(const vector<Label> &labels, MutableFst<A> *fst) const { in Compile() argument
87 while (fst->NumStates() <= labels.size()) in Compile()
[all …]
Dicu.h68 bool UTF8StringToLabels(const string &str, vector<Label> *labels) { in UTF8StringToLabels() argument
78 labels->push_back(c); in UTF8StringToLabels()
84 bool LabelsToUTF8String(const vector<Label> &labels, string *str) { in LabelsToUTF8String() argument
87 for (size_t i = 0; i < labels.size(); ++i) { in LabelsToUTF8String()
88 u_str.setTo(labels[i]); in LabelsToUTF8String()
/external/jmonkeyengine/engine/src/core/com/jme3/app/
DStatsView.java64 private BitmapText[] labels; field in StatsView
84 labels = new BitmapText[statLabels.length]; in StatsView()
87 for (int i = 0; i < labels.length; i++){ in StatsView()
88 labels[i] = new BitmapText(font); in StatsView()
89 labels[i].setLocalTranslation(0, labels[i].getLineHeight() * (i+1), 0); in StatsView()
90 attachChild(labels[i]); in StatsView()
102 for (int i = 0; i < labels.length; i++) { in update()
105 labels[i].setText(stringBuilder); in update()
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/
DTestTreeWizard.java193 public void visit(Object t, Object parent, int childIndex, Map labels) { in testRepeatsVisitWithContext()
210 public void visit(Object t, Object parent, int childIndex, Map labels) { in testRepeatsVisitWithNullParentAndContext()
242 public void visit(Object t, Object parent, int childIndex, Map labels) { in testVisitPatternMultiple()
259 public void visit(Object t, Object parent, int childIndex, Map labels) { in testVisitPatternMultipleWithLabels()
262 "["+childIndex+"]"+labels.get("a")+"&"+labels.get("b")); in testVisitPatternMultipleWithLabels()
326 Map labels = new HashMap(); in testParseLabels() local
327 boolean valid = wiz.parse(t, "(%a:A %b:B %c:C)", labels); in testParseLabels()
329 assertEquals("A", labels.get("a").toString()); in testParseLabels()
330 assertEquals("B", labels.get("b").toString()); in testParseLabels()
331 assertEquals("C", labels.get("c").toString()); in testParseLabels()
[all …]
/external/antlr/antlr-3.4/runtime/Python/unittests/
Dtesttreewizard.py375 def visitor(node, parent, childIndex, labels): argument
389 def visitor(node, parent, childIndex, labels): argument
403 def visitor(node, parent, childIndex, labels): argument
417 def visitor(node, parent, childIndex, labels): argument
431 def visitor(node, parent, childIndex, labels): argument
445 def visitor(node, parent, childIndex, labels): argument
462 def visitor(node, parent, childIndex, labels): argument
478 def visitor(node, parent, childIndex, labels): argument
495 def visitor(node, parent, childIndex, labels): argument
501 labels['a'],
[all …]
Dtesttree.py920 labels = {}
924 labels)
926 node = labels.get("x")
939 labels = {}
943 labels)
945 node = labels.get("x")
958 labels = {}
962 labels)
964 node = labels.get("x")
977 labels = {}
[all …]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DTreeWizard.java59 public void visit(Object t, Object parent, int childIndex, Map labels); in visit() argument
63 public void visit(Object t, Object parent, int childIndex, Map labels) { in visit() argument
227 public void visit(Object t, Object parent, int childIndex, Map labels) { in find()
286 final Map labels = new HashMap(); // reused for each _parse in visit() local
291 labels.clear(); in visit()
292 if ( _parse(t, tpattern, labels) ) { in visit()
293 visitor.visit(t, parent, childIndex, labels); in visit()
310 public boolean parse(Object t, String pattern, Map labels) { in parse() argument
319 boolean matched = _parse(t, tpattern, labels); in parse()
332 protected boolean _parse(Object t1, TreePattern tpattern, Map labels) { in _parse() argument
[all …]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DTreeWizard.cs73 … void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ); in Visit() argument
78 …c virtual void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ) in Visit() argument
296 … public void Visit( object t, object parent, int childIndex, IDictionary<string, object> labels ) in Visit() argument
387 …( TreeWizard outer, IContextVisitor visitor, IDictionary<string, object> labels, TreePattern tpatt… in VisitTreeWizardContextVisitor() argument
391 _labels = labels; in VisitTreeWizardContextVisitor()
427 … IDictionary<string, object> labels = new Dictionary<string, object>(); // reused for each _parse in Visit()
429 … Visit( t, rootTokenType, new VisitTreeWizardContextVisitor( this, visitor, labels, tpattern ) ); in Visit()
447 public bool Parse( object t, string pattern, IDictionary<string, object> labels ) in Parse() argument
457 bool matched = ParseCore( t, tpattern, labels ); in Parse()
473 …ected virtual bool ParseCore( object t1, TreePattern tpattern, IDictionary<string, object> labels ) in ParseCore() argument
[all …]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
DTreeWizard.cs70 void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels); in Visit() argument
74 …c virtual void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { in Visit() argument
259 … public void Visit(object t, object parent, int childIndex, IDictionary<string, object> labels) { in Visit() argument
336 …r(TreeWizard outer, IContextVisitor visitor, IDictionary<string, object> labels, TreePattern tpatt… in VisitTreeWizardContextVisitor() argument
339 _labels = labels; in VisitTreeWizardContextVisitor()
371 … IDictionary<string, object> labels = new Dictionary<string, object>(); // reused for each _parse in Visit()
373 … Visit(t, rootTokenType, new VisitTreeWizardContextVisitor(this, visitor, labels, tpattern)); in Visit()
391 public bool Parse(object t, string pattern, IDictionary<string, object> labels) { in Parse() argument
400 bool matched = ParseCore(t, tpattern, labels); in Parse()
415 …ected virtual bool ParseCore(object t1, TreePattern tpattern, IDictionary<string, object> labels) { in ParseCore() argument
[all …]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
DMachineProbe.java81 List<IntSet> labels = new ArrayList<IntSet>(); in getEdgeLabels() local
89 labels.add(e.label.getSet()); in getEdgeLabels()
93 return labels; in getEdgeLabels()
101 public String getInputSequenceDisplay(Grammar g, List<IntSet> labels) { in getInputSequenceDisplay() argument
103 for (IntSet label : labels) in getInputSequenceDisplay()
116 List<Set<NFAState>> nfaStates, List<IntSet> labels) { in getGrammarLocationsForInputSequence() argument
121 IntSet label = labels.get(i); in getGrammarLocationsForInputSequence()
DDecisionProbe.java304 List<Label> labels = new ArrayList<Label>(); // may access ith element; use array in getSampleNonDeterministicInputSequence() local
306 return labels; in getSampleNonDeterministicInputSequence()
311 labels); in getSampleNonDeterministicInputSequence()
312 return labels; in getSampleNonDeterministicInputSequence()
319 public String getInputSequenceDisplay(List labels) { in getInputSequenceDisplay() argument
322 for (Iterator it = labels.iterator(); it.hasNext();) { in getInputSequenceDisplay()
361 List labels) in getNFAPathStatesForAlt() argument
381 labels, in getNFAPathStatesForAlt()
775 List<Label> labels) in getSampleInputSequenceUsingStateSet() argument
786 labels.add(t.label); // traverse edge and track label in getSampleInputSequenceUsingStateSet()
[all …]
/external/v8/src/
Dprettyprinter.cc150 ZoneStringList* labels = node->target()->labels(); in VisitContinueStatement() local
151 if (labels != NULL) { in VisitContinueStatement()
153 ASSERT(labels->length() > 0); // guaranteed to have at least one entry in VisitContinueStatement()
154 PrintLiteral(labels->at(0), false); // any label from the list is fine in VisitContinueStatement()
162 ZoneStringList* labels = node->target()->labels(); in VisitBreakStatement() local
163 if (labels != NULL) { in VisitBreakStatement()
165 ASSERT(labels->length() > 0); // guaranteed to have at least one entry in VisitBreakStatement()
166 PrintLiteral(labels->at(0), false); // any label from the list is fine in VisitBreakStatement()
188 PrintLabels(node->labels()); in VisitSwitchStatement()
200 PrintLabels(node->labels()); in VisitDoWhileStatement()
[all …]
/external/opencv/ml/src/
Dmlem.cpp79 CvEMParams params, CvMat* labels ) in CvEM() argument
85 train(samples, sample_idx, params, labels); in CvEM()
304 CvEMParams _params, CvMat* labels ) in train() argument
332 if( labels && (!CV_IS_MAT(labels) || CV_MAT_TYPE(labels->type) != CV_32SC1 || in train()
333 labels->cols != 1 && labels->rows != 1 || labels->cols + labels->rows - 1 != nsamples )) in train()
362 if( labels ) in train()
365 cvZero( labels ); in train()
370 int lstep = CV_IS_MAT_CONT(labels->type) ? 1 : labels->step/sizeof(int); in train()
378 labels->data.i[i*lstep] = cvRound(predict(&sample, &prob)); in train()
488 CvMat* labels = 0; in init_auto() local
[all …]
/external/antlr/antlr-3.4/runtime/Python/antlr3/
Dtreewizard.py422 def visitor(tree, parent, childIndex, labels): argument
513 def rootvisitor(tree, parent, childIndex, labels): argument
514 labels = {}
515 if self._parse(tree, tpattern, labels):
516 visitor(tree, parent, childIndex, labels)
521 def parse(self, t, pattern, labels=None): argument
537 return self._parse(t, tpattern, labels)
540 def _parse(self, t1, tpattern, labels): argument
562 if tpattern.label is not None and labels is not None:
564 labels[tpattern.label] = t1
[all …]
/external/opencv/cv/src/
Dcvdistransform.cpp229 int step, float* dist, int dststep, int* labels, int lstep, in icvDistanceTransformEx_5x5_C1R() argument
243 lstep /= sizeof(labels[0]); in icvDistanceTransformEx_5x5_C1R()
252 int* lls = (int*)(labels + i*lstep); in icvDistanceTransformEx_5x5_C1R()
329 int* lls = (int*)(labels + i*lstep); in icvDistanceTransformEx_5x5_C1R()
719 CvMat lstub, *labels = (CvMat*)labelsarr; in cvDistTransform() local
728 (CV_MAT_TYPE(dst->type) != CV_8UC1 || distType != CV_DIST_L1 || labels)) ) in cvDistTransform()
740 maskSize = !labels ? CV_DIST_MASK_3 : CV_DIST_MASK_5; in cvDistTransform()
741 else if( distType == CV_DIST_L2 && labels ) in cvDistTransform()
750 if( labels ) in cvDistTransform()
752 CV_CALL( labels = cvGetMat( labels, &lstub )); in cvDistTransform()
[all …]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
Dwizard.rb410 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 = {} ) argument
429 labels[ pattern.label ] = tree if labels && pattern.label
438 return( false ) unless match!( actual_child, pattern_child, labels )
441 return labels
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
DACyclicDFACodeGenerator.java116 List labels = edge.label.getSet().toList(); in walkFixedDFAGeneratingStateMachine() local
117 for (int j = 0; j < labels.size(); j++) { in walkFixedDFAGeneratingStateMachine()
118 Integer vI = (Integer) labels.get(j); in walkFixedDFAGeneratingStateMachine()
121 labels.set(j, label); // rewrite List element to be name in walkFixedDFAGeneratingStateMachine()
123 edgeST.add("labels", labels); in walkFixedDFAGeneratingStateMachine()
/external/iproute2/doc/
Dapi-ip6-flowlabels.tex42 \item To assign flow labels to packets sent by user.
44 \item To get flow labels of received packets. I do not know
46 want to use flow labels to distinguish sub-flows.
48 \item To allocate flow labels in the way, compliant to RFC2460. Namely:
52 Flow labels must be uniformly distributed (pseudo-)random numbers,
65 with flow labels.
74 Flow labels have finite lifetime and source is not allowed to reuse
120 support flow labels, this field is not zero, but a random number.
149 message to user space, though the kernels which support flow labels
223 longer than boot time require to store allocated labels at stable
[all …]
/external/webkit/Source/WebKit/win/
DWebHTMLRepresentation.cpp200 /* [size_is][in] */ BSTR* labels, in deprecatedSearchForLabels() argument
205 return m_frame->searchForLabelsBeforeElement(labels, cLabels, beforeElement, 0, 0, result); in deprecatedSearchForLabels()
209 /* [size_is][in] */ BSTR* labels, in matchLabels() argument
214 return m_frame->matchLabelsAgainstElement(labels, cLabels, againstElement, result); in matchLabels()
217 HRESULT WebHTMLRepresentation::searchForLabels(BSTR* labels, unsigned cLabels, IDOMElement* beforeE… in searchForLabels() argument
219 …return m_frame->searchForLabelsBeforeElement(labels, cLabels, beforeElement, resultDistance, resul… in searchForLabels()

12345678910>>...12