/external/openfst/src/include/fst/extensions/pdt/ |
paren.h | 55 return p.paren_id + p.state_id * kPrime; 59 Label paren_id; // ID of open (close) paren member in class:fst::ParenState 62 ParenState() : paren_id(kNoLabel), state_id(kNoStateId) {} 64 ParenState(Label p, StateId s) : paren_id(p), state_id(s) {} 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); 175 SetIterator FindStates(Label paren_id, StateId s) const { 176 ParenState<A> paren_state(paren_id, s) 240 Label paren_id = pit->second; local 279 Label paren_id = pit->second; local 307 Label paren_id = *paren_iter; local 327 Label paren_id = paren_iter.Value(); local 409 Label paren_id = oit->second; local 469 Label paren_id = okey.paren_id; local [all...] |
shortest-path.h | 94 : paren_id(kNoLabel), src_start(kNoStateId), dest_start(kNoStateId) {} 97 : paren_id(id), src_start(s), dest_start(d) {} 99 Label paren_id; // Id of parenthesis member in struct:fst::PdtShortestPathData::ParenSpec 106 return x.paren_id == this->paren_id && 115 paren_id(kNoLabel), 120 int16 paren_id; // If parent arc has paren, paren ID, o.w. kNoLabel member in struct:fst::PdtShortestPathData::SearchData 170 return data->paren_id; 202 data->paren_id = p; 232 return paren.paren_id + paren.src_start * kPrime0 512 Label paren_id = pit->second; local 579 Label paren_id = pit->second; local 684 Label paren_id = kNoLabel; local [all...] |
pdt.h | 48 // 'child_map_' accessed by stack_id and label. The paren_id is 52 size_t paren_id; member in struct:fst::PdtStack::StackNode 54 StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {} 92 ssize_t paren_id = pit->second; 94 if (label == parens_[paren_id].first) { // Open paren. 98 nodes_.push_back(StackNode(stack_id, paren_id)); 104 if (paren_id == node.paren_id) // Matching close paren. 118 return nodes_[stack_id].paren_id;
|
replace.h | 156 size_t paren_id = pit->second; local 157 open_paren = (*parens)[paren_id].first; 158 close_paren = (*parens)[paren_id].second; 160 size_t paren_id = nparens[nfst_id]++; local 161 open_paren = first_paren + 2 * paren_id; 163 paren_map[paren_key] = paren_id; 164 if (paren_id >= parens->size())
|
expand.h | 515 // Initializes close paren multimap, mapping pairs (s,paren_id) to 516 // all the arcs out of s labeled with close parenthese for paren_id. 757 ssize_t paren_id = stack_.ParenId(arc.ilabel); local 760 balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id); 769 ParenState<Arc> paren_state(paren_id, source); 843 ssize_t paren_id = stack_.Top(si); local 845 balance_data_->Find(paren_id, state_table_.Tuple(s).state_id); 851 ParenState<Arc> paren_state(paren_id, dest_state); [all...] |