Searched refs:parens (Results 1 - 25 of 25) sorted by relevance

/external/mesa3d/src/glsl/glcpp/tests/
H A D022-define-func-arg-with-parens.c2 foo(argument(including parens)for the win)
/external/openfst/src/include/fst/extensions/pdt/
H A Dcompose.h47 const vector<pair<Label, Label> > &parens,
52 // Treat parens as multi-epsilons when composing.
53 for (size_t i = 0; i < parens.size(); ++i) {
54 matcher1->AddMultiEpsLabel(parens[i].first);
55 matcher1->AddMultiEpsLabel(parens[i].second);
56 matcher2->AddMultiEpsLabel(parens[i].first);
57 matcher2->AddMultiEpsLabel(parens[i].second);
84 const vector<pair<Label, Label> > &parens) {
88 // Treat parens as multi-epsilons when composing.
89 for (size_t i = 0; i < parens
46 PdtComposeOptions(const Fst<Arc> &ifst1, const vector<pair<Label, Label> > &parens, const Fst<Arc> &ifst2) argument
82 PdtComposeOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, const vector<pair<Label, Label> > &parens) argument
108 Compose(const Fst<Arc> &ifst1, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, const Fst<Arc> &ifst2, MutableFst<Arc> *ofst, const ComposeOptions &opts = ComposeOptions()) argument
130 Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<Arc> *ofst, const ComposeOptions &opts = ComposeOptions()) argument
[all...]
H A Dpdtscript.h60 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[
[all...]
H A Dreverse.h40 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));
38 Reverse(const Fst<Arc> &ifst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<RevArc> *ofst) argument
H A Dinfo.h48 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;
77 PdtInfo(const Fst<A> &fst, const vector<pair<typename A::Label, typename A::Label> > &parens) argument
H A Dreplace.h43 // open or close parentheses. To be interpreted as a PDT, the parens
45 // parenthesis label pairs are returned in 'parens'.
51 typename Arc::Label> > *parens,
58 parens->clear();
157 open_paren = (*parens)[paren_id].first;
158 close_paren = (*parens)[paren_id].second;
164 if (paren_id >= parens->size())
165 parens->push_back(make_pair(open_paren, close_paren));
47 Replace(const vector<pair<typename Arc::Label, const Fst<Arc>* > >& ifst_array, MutableFst<Arc> *ofst, vector<pair<typename Arc::Label, typename Arc::Label> > *parens, typename Arc::Label root) argument
H A Dexpand.h87 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'
85 ExpandFstImpl(const Fst<A> &fst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, const ExpandFstOptions<A> &opts) argument
238 ExpandFst(const Fst<A> &fst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens) argument
243 ExpandFst(const Fst<A> &fst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, const ExpandFstOptions<A> &opts) argument
350 PrunedExpand(const Fst<A> &ifst, const vector<pair<Label, Label> > &parens, bool keep_parentheses = false, const CacheOptions &opts = CacheOptions()) argument
518 InitCloseParenMultimap( const vector<pair<Label, Label> > &parens) argument
933 Expand( const Fst<Arc> &ifst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<Arc> *ofst, const ExpandOptions<Arc> &opts) argument
965 Expand( const Fst<Arc> &ifst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<Arc> *ofst, bool connect = true, bool keep_parentheses = false) argument
[all...]
H A Dpdt.h37 // open-close parenthesis label pairs are passed in 'parens'.
49 // the position in 'parens' of the parenthesis for that node.
57 PdtStack(const vector<pair<Label, Label> > &parens) argument
58 : parens_(parens), min_paren_(kNoLabel), max_paren_(kNoLabel) {
59 for (size_t i = 0; i < parens.size(); ++i) {
60 const pair<Label, Label> &p = parens[i];
H A Dshortest-path.h394 const vector<pair<Label, Label> > &parens,
398 parens_(parens),
411 for (Label i = 0; i < parens.size(); ++i) {
412 const pair<Label, Label> &p = parens[i];
503 // Find open parens per destination state and close parens per source state.
770 typename Arc::Label> > &parens,
773 PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);
780 typename Arc::Label> > &parens,
784 PdtShortestPath<Arc, Queue> psp(ifst, parens, opt
393 PdtShortestPath(const Fst<Arc> &ifst, const vector<pair<Label, Label> > &parens, const PdtShortestPathOptions<Arc, Queue> &opts) argument
768 ShortestPath(const Fst<Arc> &ifst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<Arc> *ofst, const PdtShortestPathOptions<Arc, Queue> &opts) argument
778 ShortestPath(const Fst<Arc> &ifst, const vector<pair<typename Arc::Label, typename Arc::Label> > &parens, MutableFst<Arc> *ofst) argument
[all...]
H A Dparen.h144 const vector<pair<Label, Label> > &parens, bool close)
146 parens_(parens),
148 for (Label i = 0; i < parens.size(); ++i) {
149 const pair<Label, Label> &p = parens[i];
165 // for close (open) parens reachable from that state along balanced
345 // Hash set for open parens
351 // Maps from open paren state to source states of matching close parens
438 OpenParenMap open_paren_map_; // open parens per state
440 typename OpenParenMap::const_iterator open_iter_; // cur open parens/state
143 PdtParenReachable(const Fst<A> &fst, const vector<pair<Label, Label> > &parens, bool close) argument
/external/openfst/src/extensions/pdt/
H A Dpdtscript.cc42 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, ofs
40 PdtCompose(const FstClass &ifst1, const FstClass &ifst2, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const ComposeOptions &copts, bool left_pdt) argument
54 PdtExpand(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const PdtExpandOptions &opts) argument
62 PdtExpand(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, bool connect) argument
68 PdtReplace(const vector<pair<int64, const FstClass*> > &fst_tuples, MutableFstClass *ofst, vector<pair<int64, int64> > *parens, const int64 &root) argument
84 PdtReverse(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst) argument
92 PdtShortestPath(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const PdtShortestPathOptions &opts) argument
102 PrintPdtInfo(const FstClass &ifst, const vector<pair<int64, int64> > &parens) argument
[all...]
H A Dpdtinfo.cc53 vector<pair<int64, int64> > parens; local
54 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
56 s::PrintPdtInfo(*ifst, parens);
H A Dpdtreverse.cc52 vector<pair<int64, int64> > parens, rparens; local
53 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
56 s::PdtReverse(*ifst, parens, &ofst);
H A Dpdtcompose.cc69 vector<pair<int64, int64> > parens; local
70 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
75 s::PdtCompose(*ifst1, *ifst2, parens, &ofst, copts, FLAGS_left_pdt);
H A Dpdtexpand.cc57 vector<pair<int64, int64> > parens; local
58 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
65 s::PdtExpand(*ifst, parens, &ofst, s::PdtExpandOptions(
H A Dpdtreplace.cc64 vector<pair<int64, int64> > parens; local
65 s::PdtReplace(fst_tuples, &ofst, &parens, root);
68 fst::WriteLabelPairs(FLAGS_pdt_parentheses, parens);
H A Dpdtshortestpath.cc58 vector<pair<int64, int64> > parens, rparens; local
59 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
77 s::PdtShortestPath(*ifst, parens, &ofst, opts);
/external/openfst/src/include/fst/
H A Dsparse-tuple-weight.h514 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 encountere
592 stack<int> parens; local
[all...]
H A Dpair-weight.h159 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();
H A Dtuple-weight.h189 stack<int> parens; local
192 while (c != separator || !parens.empty()) {
198 // if parens encountered before separator, they must be matched
200 parens.push(1);
202 // Fail for mismatched parens
203 if (parens.empty()) {
207 parens.pop();
/external/clang/test/SemaTemplate/
H A Dinstantiate-expr-1.cpp5 int parens : (J); member in struct:Bitfields
/external/clang/lib/Sema/
H A DSemaPseudoObject.cpp59 if (ParenExpr *parens = dyn_cast<ParenExpr>(e)) {
60 e = rebuild(parens->getSubExpr());
61 return new (S.Context) ParenExpr(parens->getLParen(),
62 parens->getRParen(),
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/
H A Djsilver.sablecc518 | {parens} paren_open expression_list paren_close // (x.y, a.b, d.e)
/external/e2fsprogs/lib/et/
H A Dtexinfo.tex1572 {\activeparens % Now, smart parens don't turn on until &foo (see \amprm)
1581 % This is the definition of ( when already inside a level of parens.
1593 %% These parens (in \boldbrax) actually are a little bolder than the
1662 \ifnum\parencount=0 \else \errmessage{unbalanced parens in @def arguments}\fi%
/external/grub/docs/
H A Dtexinfo.tex5439 % if the fn name has parens in it, \boldbrax will not be in effect yet,
5459 % At the first level, print parens in roman,
5463 % The \sf parens (in \boldbrax) actually are a little bolder than

Completed in 388 milliseconds