Home
last modified time | relevance | path

Searched refs:paren_id (Results 1 – 6 of 6) sorted by relevance

/external/openfst/src/include/fst/extensions/pdt/
Dparen.h55 return p.paren_id + p.state_id * kPrime; in operator()
59 Label paren_id; // ID of open (close) paren variable
62 ParenState() : paren_id(kNoLabel), state_id(kNoStateId) {} in ParenState()
64 ParenState(Label p, StateId s) : paren_id(p), state_id(s) {} in ParenState()
69 return p.paren_id == this->paren_id && p.state_id == this->state_id;
75 return paren_id < this->paren.id ||
76 (p.paren_id == this->paren.id && p.state_id < this->state_id);
182 SetIterator FindStates(Label paren_id, StateId s) const { in FindStates() argument
183 ParenState<A> paren_state(paren_id, s); in FindStates()
195 ParenArcIterator FindParenArcs(Label paren_id, StateId s) const { in FindParenArcs() argument
[all …]
Dshortest-path.h94 : paren_id(kNoLabel), src_start(kNoStateId), dest_start(kNoStateId) {} in ParenSpec()
97 : paren_id(id), src_start(s), dest_start(d) {} in ParenSpec()
99 Label paren_id; // Id of parenthesis member
106 return x.paren_id == this->paren_id &&
115 paren_id(kNoLabel), in SearchData()
120 int16 paren_id; // If parent arc has paren, paren ID, o.w. kNoLabel member
170 return data->paren_id; in ParenId()
202 data->paren_id = p; in SetParenId()
232 return paren.paren_id + paren.src_start * kPrime0 + in operator()
324 ParenSpec paren(sdata->paren_id, s.start, p.start); in GC()
[all …]
Dpdt.h53 size_t paren_id; member
55 StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {} in StackNode()
93 ssize_t paren_id = pit->second; in Find() local
95 if (label == parens_[paren_id].first) { // Open paren. in Find()
99 nodes_.push_back(StackNode(stack_id, paren_id)); in Find()
105 if (paren_id == node.paren_id) // Matching close paren. in Find()
119 return nodes_[stack_id].paren_id; in Top()
Dreplace.h165 size_t paren_id = pit->second; in Replace() local
166 open_paren = (*parens)[paren_id].first; in Replace()
167 close_paren = (*parens)[paren_id].second; in Replace()
169 size_t paren_id = nparens[nfst_id]++; in Replace() local
170 open_paren = first_open_paren + paren_id; in Replace()
171 close_paren = first_close_paren + paren_id; in Replace()
172 paren_map[paren_key] = paren_id; in Replace()
173 if (paren_id >= parens->size()) in Replace()
Dcompose.h338 ssize_t paren_id = stack_.Top(f.GetState2().GetState()); in SetState() local
339 if (paren_id != paren_id_) { in SetState()
344 paren_id_ = paren_id; in SetState()
Dexpand.h757 ssize_t paren_id = stack_.ParenId(arc.ilabel); in ProcOpenParen() local
760 balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id); in ProcOpenParen()
769 ParenState<Arc> paren_state(paren_id, source); in ProcOpenParen()
843 ssize_t paren_id = stack_.Top(si); in ProcDestStates() local
845 balance_data_->Find(paren_id, state_table_.Tuple(s).state_id); in ProcDestStates()
851 ParenState<Arc> paren_state(paren_id, dest_state); in ProcDestStates()