HomeSort by relevance Sort by last modified time
    Searched full:parens (Results 1 - 25 of 327) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/tests/
022-define-func-arg-with-parens.c.expected 2 (argument(including parens)for the win)
022-define-func-arg-with-parens.c 2 foo(argument(including parens)for the win)
  /external/mesa3d/src/glsl/glcpp/tests/
022-define-func-arg-with-parens.c.expected 2 (argument(including parens)for the win)
022-define-func-arg-with-parens.c 2 foo(argument(including parens)for the win)
  /external/markdown/MarkdownTest/Tests_2007/
Links, inline style.text 17 [With parens in the URL](http://en.wikipedia.org/wiki/WIMP_(computing))
19 (With outer parens and [parens in url](/foo(bar)))
22 [With parens in the URL](/foo(bar) "and a title")
24 (With outer parens and [parens in url](/foo(bar) "and a title"))
Links, inline style.html 17 <p><a href="http://en.wikipedia.org/wiki/WIMP_(computing)">With parens in the URL</a></p>
19 <p>(With outer parens and <a href="/foo(bar)">parens in url</a>)</p>
21 <p><a href="/foo(bar)" title="and a title">With parens in the URL</a></p>
23 <p>(With outer parens and <a href="/foo(bar)" title="and a title">parens in url</a>)</p>
Images.text 17 ![this is a stupid URL](http://example.com/(parens).jpg)
  /external/openfst/src/include/fst/extensions/pdt/
pdtscript.h 60 vector<pair<typename Arc::Label, typename Arc::Label> > parens(
63 for (size_t i = 0; i < parens.size(); ++i) {
64 parens[i].first = args->arg3[i].first;
65 parens[i].second = args->arg3[i].second;
69 Compose(ifst1, parens, ifst2, ofst, args->arg5);
71 Compose(ifst1, ifst2, parens, ofst, args->arg5);
77 const vector<pair<int64, int64> > &parens,
103 vector<pair<typename Arc::Label, typename Arc::Label> > parens(
105 for (size_t i = 0; i < parens.size(); ++i) {
106 parens[i].first = args->arg2[i].first
    [all...]
reverse.h 40 typename Arc::Label> > &parens,
49 for (size_t i = 0; i < parens.size(); ++i) {
50 relabel_pairs.push_back(make_pair(parens[i].first, parens[i].second));
51 relabel_pairs.push_back(make_pair(parens[i].second, parens[i].first));
compose.h 37 // This class is a matcher that treats parens as multi-epsilon labels.
38 // It is most efficient if the parens are in a range non-overlapping with
296 const vector<pair<Label, Label> > *parens = 0,
299 parens_(parens ? *parens : vector<pair<Label, Label> >()),
305 if (parens) {
306 for (size_t i = 0; i < parens->size(); ++i) {
307 const pair<Label, Label> &p = (*parens)[i];
433 const vector<pair<Label, Label> > &parens,
439 filter = new PdtFilter(ifst1, ifst2, matcher1, matcher2, &parens,
    [all...]
replace.h 47 // open or close parentheses. To be interpreted as a PDT, the parens
49 // parenthesis label pairs are returned in 'parens'.
55 typename Arc::Label> > *parens,
62 parens->clear();
166 open_paren = (*parens)[paren_id].first;
167 close_paren = (*parens)[paren_id].second;
173 if (paren_id >= parens->size())
174 parens->push_back(make_pair(open_paren, close_paren));
info.h 48 typename A::Label> > &parens);
79 typename A::Label> > &parens)
94 for (size_t i = 0; i < parens.size(); ++i) {
95 const pair<Label, Label> &p = parens[i];
113 Label open_paren = parens[pit->second].first;
114 Label close_paren = parens[pit->second].second;
pdt.h 38 // open-close parenthesis label pairs are passed in 'parens'.
50 // the position in 'parens' of the parenthesis for that node.
58 PdtStack(const vector<pair<Label, Label> > &parens)
59 : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {
60 for (size_t i = 0; i < parens.size(); ++i) {
61 const pair<Label, Label> &p = parens[i];
expand.h 87 typename Arc::Label> > &parens,
90 stack_(opts.stack ? opts.stack: new PdtStack<StateId, Label>(parens)),
218 // the parens must balance on a path. The open-close parenthesis label
219 // pairs are passed in 'parens'. The expansion enforces the
240 typename Arc::Label> > &parens)
241 : ImplToFst<Impl>(new Impl(fst, parens, ExpandFstOptions<A>())) {}
245 typename Arc::Label> > &parens,
247 : ImplToFst<Impl>(new Impl(fst, parens, opts)) {}
321 // parens must balance on a path. The open-close parenthesis label
322 // pairs are passed in 'parens'. The expansion enforces th
    [all...]
  /external/openfst/src/extensions/pdt/
pdtscript.cc 42 const vector<pair<int64, int64> > &parens,
49 PdtComposeArgs args(ifst1, ifst2, parens, ofst, copts, left_pdt);
55 const vector<pair<int64, int64> > &parens,
57 PdtExpandArgs args(ifst, parens, ofst, opts);
63 const vector<pair<int64, int64> > &parens,
65 PdtExpand(ifst, parens, ofst, PdtExpandOptions(connect));
70 vector<pair<int64, int64> > *parens,
79 PdtReplaceArgs args(fst_tuples, ofst, parens, root);
85 const vector<pair<int64, int64> > &parens,
87 PdtReverseArgs args(ifst, parens, ofst)
    [all...]
pdtinfo.cc 53 vector<pair<int64, int64> > parens; local
54 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
56 s::PrintPdtInfo(*ifst, parens);
pdtreverse.cc 52 vector<pair<int64, int64> > parens, rparens; local
53 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
56 s::PdtReverse(*ifst, parens, &ofst);
pdtexpand.cc 57 vector<pair<int64, int64> > parens; local
58 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
65 s::PdtExpand(*ifst, parens, &ofst, s::PdtExpandOptions(
pdtreplace.cc 66 vector<pair<int64, int64> > parens; local
67 s::PdtReplace(fst_tuples, &ofst, &parens, root);
70 fst::WriteLabelPairs(FLAGS_pdt_parentheses, parens);
pdtshortestpath.cc 58 vector<pair<int64, int64> > parens, rparens; local
59 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
77 s::PdtShortestPath(*ifst, parens, &ofst, opts);
  /external/llvm/test/FileCheck/
var-ref-same-line.txt 14 ; Test that parens inside the regex don't confuse FileCheck
  /external/openfst/src/include/fst/
sparse-tuple-weight.h 514 stack<int> parens; local
516 while (c != separator || !parens.empty()) {
522 // If parens encountered before separator, they must be matched
524 parens.push(1);
526 // Fail for mismatched parens
527 if (parens.empty()) {
531 parens.pop();
564 stack<int> parens; local
566 while (c != separator || !parens.empty()) {
572 // If parens encountered before separator, they must be matche
592 stack<int> parens; local
    [all...]
pair-weight.h 159 stack<int> parens; local
161 while (c != separator || !parens.empty()) {
167 // if parens encountered before separator, they must be matched
169 parens.push(1);
171 // Fail for mismatched parens
172 if (parens.empty()) {
176 parens.pop();
  /external/clang/test/Parser/
cxx-ambig-paren-expr.cpp 17 // Make sure stuff inside the parens are parsed only once (only one warning).
20 // Special case: empty parens is a call, not an expression
  /external/chromium_org/cc/output/
shader.cc 151 ); // NOLINT(whitespace/parens)
191 ); // NOLINT(whitespace/parens)
223 ); // NOLINT(whitespace/parens)
271 ); // NOLINT(whitespace/parens)
282 ); // NOLINT(whitespace/parens)
327 ); // NOLINT(whitespace/parens)
338 ); // NOLINT(whitespace/parens)
397 ); // NOLINT(whitespace/parens)
461 ); // NOLINT(whitespace/parens)
505 ); // NOLINT(whitespace/parens)
    [all...]

Completed in 1644 milliseconds

1 2 3 4 5 6 7 8 91011>>