| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/ids2ngram/ |
| ids2ngram.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
63 TMapIterator its=map.begin(), ite=map.end(); local
64 for (; its != ite; ++its) {
65 fwrite(its->first.ids, sizeof(TSIMWordId), N, out);
66 fwrite(&(its->second), sizeof(unsigned int), 1, out);
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/ids2ngram/ |
| ids2ngram.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
63 TMapIterator its=map.begin(), ite=map.end(); local
64 for (; its != ite; ++its) {
65 fwrite(its->first.ids, sizeof(TSIMWordId), N, out);
66 fwrite(&(its->second), sizeof(unsigned int), 1, out);
|
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/slmseg/ |
| slmseg.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
253 * Lattice head should have one state, with its TState using slm's root. its
254 * pr = 0 and its mp_btword == NULL;
256 * with its right = left+1, right == tail.
321 TLatticeColumnStates::iterator its = states.begin(); local
323 TLatticeWord* pbtword = its->second.mp_btword;
324 CThreadSlm::TState btstate = its->second.m_btstate;
325 its = lattice[pbtword->m_left].m_states.find(btstate);
326 assert(its != lattice[pbtword->m_left].m_states.end())
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/slmseg/ |
| slmseg.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
253 * Lattice head should have one state, with its TState using slm's root. its
254 * pr = 0 and its mp_btword == NULL;
256 * with its right = left+1, right == tail.
321 TLatticeColumnStates::iterator its = states.begin(); local
323 TLatticeWord* pbtword = its->second.mp_btword;
324 CThreadSlm::TState btstate = its->second.m_btstate;
325 its = lattice[pbtword->m_left].m_states.find(btstate);
326 assert(its != lattice[pbtword->m_left].m_states.end())
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/lexicon/ |
| pytrie_gen.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
228 std::set<TSyllableInfo>::iterator its = pyset.begin(); local
230 for (; its != ite; ++its) {
231 const char *t = its->m_py.c_str();
232 int cost = its->m_cost;
243 CPinyinTrieMaker::TWordId wid(myid, cost, its->m_cost < 0, gbcategory & 0x1, gbcategory & 0x2);
|
| /nv-g11n/inputmethod/sunpinyin2/src/lexicon/ |
| pytrie_gen.cpp | 189 std::set<TSyllableInfo>::const_iterator its = pyset.begin(); local
191 for (; its != ite; ++its) {
192 const char *t = its->m_py.c_str();
193 int cost = its->m_cost;
204 CPinyinTrieMaker::TWordId wid(myid, cost, its->m_cost < 0, gbcategory);
|
| /nv-g11n/inputmethod/sunpinyin/ime/src/ |
| imi_context.cpp | 32 * Version 2.1, or to extend the choice of license to its licensees as provided
689 CLatticeStates::iterator its = b->m_pInnerData->m_LatticeNodes.begin(); local
691 for (; its != ite; ++its) {
692 if (its->m_pBackTraceNode && its->m_pBackTraceNode->m_BoneAfter == bone) {
693 cp.m_Candi.m_WordId = its->m_BackTraceWordId;
700 //assert(its->m_pBackTraceNode->m_Score < 0.0 && its->m_Score < 0.0);
703 cp.m_Rank = TCandiRank(false, false, len, true, its->m_Score / its->m_pBackTraceNode->m_Score)
1245 CSkeletonIter nit, oit, its = boneStart; local
[all...] |
