| /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));
|
| 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;
|
| 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));
|
| 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...] |
| 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...] |
| 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];
|
| shortest-path.h | 393 const vector<pair<Label, Label> > &parens,
397 parens_(parens),
410 for (Label i = 0; i < parens.size(); ++i) {
411 const pair<Label, Label> &p = parens[i];
503 // Find open parens per destination state and close parens per source state.
778 typename Arc::Label> > &parens,
781 PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);
788 typename Arc::Label> > &parens,
792 PdtShortestPath<Arc, Queue> psp(ifst, parens, opts)
[all...] |
| paren.h | 144 const vector<pair<Label, Label> > &parens, bool close)
146 parens_(parens),
149 for (Label i = 0; i < parens.size(); ++i) {
150 const pair<Label, Label> &p = parens[i];
172 // for close (open) parens reachable from that state along balanced
353 // Hash set for open parens
359 // Maps from open paren state to source states of matching close parens
446 OpenParenMap open_paren_map_; // open parens per state
448 typename OpenParenMap::const_iterator open_iter_; // cur open parens/state
|
| /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);
|
| pdtcompose.cc | 72 vector<pair<int64, int64> > parens; local
73 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false);
93 s::PdtCompose(*ifst1, *ifst2, parens, &ofst, copts, FLAGS_left_pdt);
|
| /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();
|
| tuple-weight.h | 189 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/ |
| instantiate-expr-1.cpp | 5 int parens : (J); member in struct:Bitfields
|
| /external/clang/lib/Sema/ |
| SemaPseudoObject.cpp | 61 if (ParenExpr *parens = dyn_cast<ParenExpr>(e)) {
62 e = rebuild(parens->getSubExpr());
63 return new (S.Context) ParenExpr(parens->getLParen(),
64 parens->getRParen(),
[all...] |
| /ndk/sources/host-tools/nawk-20071023/ |
| FIXES | 172 added some parens to isblank, in another attempt to make things
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| jsilver.sablecc | 518 | {parens} paren_open expression_list paren_close // (x.y, a.b, d.e)
|
| /external/e2fsprogs/lib/et/ |
| texinfo.tex | [all...] |
| /ndk/sources/host-tools/sed-4.2.1/build-aux/ |
| texinfo.tex | [all...] |
