null

Home

Sort by

Searched defs:paren_id (Results 1 - 5 of 5) sorted by relevance

/external/openfst/src/include/fst/extensions/pdt/
H A D	pdt.h	`49 // 'child_map_' accessed by stack_id and label. The paren_id is 53 size_t paren_id; member in struct:fst::PdtStack::StackNode 55 StackNode(StackId p, size_t i) : parent_id(p), paren_id(i) {} 93 ssize_t paren_id = pit->second; 95 if (label == parens_[paren_id].first) { // Open paren. 99 nodes_.push_back(StackNode(stack_id, paren_id)); 105 if (paren_id == node.paren_id) // Matching close paren. 119 return nodes_[stack_id].paren_id;`
H A D	replace.h	`165 size_t paren_id = pit->second; local 166 open_paren = (parens)[paren_id].first; 167 close_paren = (parens)[paren_id].second; 169 size_t paren_id = nparens[nfst_id]++; local 170 open_paren = first_open_paren + paren_id; 171 close_paren = first_close_paren + paren_id; 172 paren_map[paren_key] = paren_id; 173 if (paren_id >= parens->size())`
H A D	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); 182 SetIterator FindStates(Label paren_id, StateId s) const { argument 183 ParenState<A> paren_state(paren_id, 195 FindParenArcs(Label paren_id, StateId s) const argument 248 Label paren_id = pit->second; local 287 Label paren_id = pit->second; local 315 Label paren_id = *paren_iter; local 335 Label paren_id = paren_iter.Value(); local 377 OpenInsert(Label paren_id, StateId open_dest) argument 389 CloseInsert(Label paren_id, StateId open_dest, StateId close_source) argument 398 Find(Label paren_id, StateId open_dest) argument 417 Label paren_id = oit->second; local 477 Label paren_id = okey.paren_id; local [all...]
H A D	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);`
H A D	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 512 Label paren_id = pit->second; local 580 Label paren_id = pit->second; local 597 ProcOpenParen( Label paren_id, SearchState s, Arc arc, Weight w) argument 639 ProcCloseParen( Label paren_id, SearchState s, const Arc &arc, Weight w) argument 659 Relax( SearchState s, SearchState t, Arc arc, Weight w, Label paren_id) argument 689 Label paren_id = kNoLabel; local 732 GetPathArc( SearchState s, SearchState d, Label paren_id, bool open_paren) argument [all...]

Completed in 2085 milliseconds