| /nv-g11n/inputmethod/sunpinyin2/src/lexicon/ |
| pytrie.h | 46 struct TNode {
63 { return sizeof(TNode) + sizeof(TTransUnit)*nTransfer +
66 TNode()
112 isValid(const TNode* pnode, bool allowNonComplete, unsigned csLevel=0);
118 const TNode*
120 { return (TNode*)(m_mem+getRootOffset()); }
122 const TNode*
124 { return (offset < getRootOffset())?NULL:((TNode*)(m_mem+offset)); }
138 inline const TNode*
139 transfer(const TNode* pnode, unsigned s) cons
[all...] |
| pytrie_gen.h | 25 class TNode;
70 typedef std::map<unsigned, TNode*> CTrans;
71 typedef std::set<TNode*> CNodeSet;
72 typedef std::list<TNode*> CNodeList;
121 typedef std::map<PNodeSet, TNode*> CStateMap;
123 class TNode {
133 TNode();
138 TNode m_RootNode;
156 print(FILE* fp, TNode* root, std::string& pinyin);
165 TNode*
[all...] |
| pytrie_gen.cpp | 210 printf("\n %d primitive nodes", TNode::m_AllNodes.size()); fflush(stdout);
213 printf("\n %d total nodes", TNode::m_AllNodes.size()); fflush(stdout);
222 CPinyinTrieMaker::CNodeList CPinyinTrieMaker::TNode::m_AllNodes;
223 CPinyinTrieMaker::TNode::TNode()
283 CPinyinTrieMaker::print(FILE* fp, TNode* root, std::string& pinyin)
306 CPinyinTrieMaker::TNode*
307 CPinyinTrieMaker::insertTransfer(TNode* pnode, unsigned s)
312 TNode *p = new TNode();
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/lexicon/ |
| pytrie_gen.h | 56 class TNode;
103 typedef std::map<unsigned char, TNode*> CTrans;
104 typedef std::set<TNode*> CNodeSet;
105 typedef std::list<TNode*> CNodeList;
154 typedef std::map<PNodeSet, TNode*> CStateMap;
156 class TNode {
165 TNode();
171 TNode m_RootNode;
190 print(FILE* fp, TNode* root, std::string& pinyin);
216 TNode*
[all...] |
| pytrie.cpp | 55 const CPinyinTrie::TNode*
56 CPinyinTrie::transfer(const TNode* pnode, const unsigned char* str) const
65 const CPinyinTrie::TNode*
66 CPinyinTrie::transfer(const TNode* pnode, const TWCHAR* wstr) const
75 const CPinyinTrie::TNode*
76 CPinyinTrie::transfer(const TNode* pnode, const unsigned char* str, int nlen) const
85 const CPinyinTrie::TNode*
86 CPinyinTrie::transfer(const TNode* pnode, const TWCHAR* wstr, int nlen) const
96 CPinyinTrie::isValid(const TNode* pnode, bool allowNonComplete, bool allowGBK)
104 CPinyinTrie::TNode::transfer(unsigned char c) cons
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/ |
| sim_slm.cpp | 54 level[lvl] = new TNode [sz[lvl]];
55 fread(level[lvl], sizeof(TNode), sz[lvl], fp);
74 delete [] ((TNode*)level[lvl]);
100 void* pstate = ((TNode*)level[0]);
107 int h = ((TNode*)pstate)->child;
108 int t = (((TNode*)pstate)+1)->child;
110 bow = ((TNode*)pstate)->bow;
115 TNode* p = (TNode*)level[lvl+1];
122 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLea
[all...] |
| slm.cpp | 111 TNode* pn = (TNode*)(m_bowTable + (1 << BITS_BOW));
190 TNode* pn = ((TNode *)m_Levels[lvl]) + ((lvl)?pos:0);
195 TNode* pBase =(TNode*)m_Levels[lvl+1];
228 return cost + m_prTable[((TNode *)m_Levels[0])->pr()];
230 return cost * m_prTable[((TNode *)m_Levels[0])->pr()];
261 const TNode *pn = ((const TNode *)m_Levels[st.getLevel()]) + st.getIdx()
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/ |
| sim_slm.cpp | 54 level[lvl] = new TNode [sz[lvl]];
55 fread(level[lvl], sizeof(TNode), sz[lvl], fp);
74 delete [] ((TNode*)level[lvl]);
100 void* pstate = ((TNode*)level[0]);
107 int h = ((TNode*)pstate)->child;
108 int t = (((TNode*)pstate)+1)->child;
110 bow = ((TNode*)pstate)->bow;
115 TNode* p = (TNode*)level[lvl+1];
122 return ((TLeaf*)pstate)->pr; // as we derive TNode from TLea
[all...] |
| slm.cpp | 117 TNode* pn = (TNode*)(m_bowTable + (1 << BITS_BOW));
196 TNode* pn = ((TNode *)m_Levels[lvl]) + ((lvl)?pos:0);
201 TNode* pBase =(TNode*)m_Levels[lvl+1];
234 return cost + m_prTable[((TNode *)m_Levels[0])->pr()];
236 return cost * m_prTable[((TNode *)m_Levels[0])->pr()];
267 const TNode *pn = ((const TNode *)m_Levels[st.getLevel()]) + st.getIdx()
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/slmprune/ |
| slmprune.cpp | 113 fwrite(level[i], sizeof(TNode), sz[i], out);
138 int CutLevel(CSIMSlm::TNode* pfirst, CSIMSlm::TNode* plast, chIterator chfirst, chIterator chlast, bool bUseLogPr)
179 hw[lvl] = (((TNode*)level[lvl])+idx[lvl])->id;
182 TNode* pnode = ((TNode*)level[j])+idx[j];
189 TNode* pn = ((TNode*)level[lvl]) + idx[lvl];
213 (((TNode*)level[lvl]) + pinfo->idx)->pr = 0.0; // -log(1.0)
215 (((TNode*)level[lvl]) + pinfo->idx)->pr = 1.0; // -log(1.0
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/slmprune/ |
| slmprune.cpp | 113 fwrite(level[i], sizeof(TNode), sz[i], out);
138 int CutLevel(CSIMSlm::TNode* pfirst, CSIMSlm::TNode* plast, chIterator chfirst, chIterator chlast, bool bUseLogPr)
179 hw[lvl] = (((TNode*)level[lvl])+idx[lvl])->id;
182 TNode* pnode = ((TNode*)level[j])+idx[j];
189 TNode* pn = ((TNode*)level[lvl]) + idx[lvl];
213 (((TNode*)level[lvl]) + pinfo->idx)->pr = 0.0; // -log(1.0)
215 (((TNode*)level[lvl]) + pinfo->idx)->pr = 1.0; // -log(1.0
[all...] |
| /nv-g11n/inputmethod/sunpinyin/ime/src/slm/ |
| slm.cpp | 111 TNode* pn = (TNode*)(m_bowTable + (1 << BITS_BOW));
188 TNode* pn = ((TNode *)m_Levels[lvl]) + ((lvl)?pos:0);
193 TNode* pBase =(TNode*)m_Levels[lvl+1];
226 return cost + m_prTable[((TNode *)m_Levels[0])->pr()];
228 return cost * m_prTable[((TNode *)m_Levels[0])->pr()];
259 const TNode *pn = ((const TNode *)m_Levels[st.getLevel()]) + st.getIdx()
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/tslmpack/ |
| common.h | 46 typedef std::vector<CThreadSlm::TNode> TNodeLevel;
48 typedef std::vector<CThreadSlm::TNode*> TNodeLevels;
|
| arpa_slm.h | 61 struct TNode : public TLeaf {
67 typedef std::vector<TNode> TNodeLevel;
107 unsigned find_1st_child(unsigned lvl, const TNode& node, int last_child);
|
| arpa_conv.cpp | 89 // convert CArpaSlm::TNode to CThreadSlm::TNode
109 CThreadSlm::TNode operator()(const CArpaSlm::TNode& node) {
110 CThreadSlm::TNode tnode; local
111 tnode.set_wid(node.wid);
112 tnode.set_bon(node.bon);
113 tnode.set_bol(node.bol);
114 tnode.set_ch(node.ch)
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/tslmpack/ |
| common.h | 46 typedef std::vector<CThreadSlm::TNode> TNodeLevel;
48 typedef std::vector<CThreadSlm::TNode*> TNodeLevels;
|
| arpa_slm.h | 61 struct TNode : public TLeaf {
67 typedef std::vector<TNode> TNodeLevel;
107 unsigned find_1st_child(unsigned lvl, const TNode& node, int last_child);
|
| arpa_conv.cpp | 89 // convert CArpaSlm::TNode to CThreadSlm::TNode
109 CThreadSlm::TNode operator()(const CArpaSlm::TNode& node) {
110 CThreadSlm::TNode tnode; local
111 tnode.set_wid(node.wid);
112 tnode.set_bon(node.bon);
113 tnode.set_bol(node.bol);
114 tnode.set_ch(node.ch)
[all...] |
| /nv-g11n/inputmethod/sunpinyin/ime/src/lexicon/ |
| pytrie.cpp | 55 const CPinyinTrie::TNode*
56 CPinyinTrie::transfer(const TNode* pnode, const unsigned char* str) const
65 const CPinyinTrie::TNode*
66 CPinyinTrie::transfer(const TNode* pnode, const TWCHAR* wstr) const
75 const CPinyinTrie::TNode*
76 CPinyinTrie::transfer(const TNode* pnode, const unsigned char* str, int nlen) const
85 const CPinyinTrie::TNode*
86 CPinyinTrie::transfer(const TNode* pnode, const TWCHAR* wstr, int nlen) const
96 CPinyinTrie::isValid(const TNode* pnode, bool allowNonComplete, bool allowGBK)
104 CPinyinTrie::TNode::transfer(unsigned char c) cons
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/tslmendian/ |
| slm_file.h | 96 CThreadSlm::TNode* m_nodes;
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/tslmendian/ |
| slm_file.h | 96 CThreadSlm::TNode* m_nodes;
|
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/thread/ |
| slmthread.cpp | 107 void* pstate = ((TNode*)level[0]);
109 int h = ((TNode*)pstate)->child;
110 int t = (((TNode*)pstate)+1)->child;
116 TNode* p = (TNode*)level[lvl+1];
118 m = (pstate != NULL)?(((TNode*)pstate) - p):(-1);
130 if (idx >= 0 && ((TNode*)(level[n]))[idx].child < ((TNode*)(level[n]))[idx+1].child) {
147 history.push_back(((TNode*)(level[i]))[idx].id);
180 TNode* pn = (TNode*)(level[i])
[all...] |
| /nv-g11n/inputmethod/sunpinyin2/src/slm/thread/ |
| slmthread.cpp | 107 void* pstate = ((TNode*)level[0]);
109 int h = ((TNode*)pstate)->child;
110 int t = (((TNode*)pstate)+1)->child;
116 TNode* p = (TNode*)level[lvl+1];
118 m = (pstate != NULL)?(((TNode*)pstate) - p):(-1);
130 if (idx >= 0 && ((TNode*)(level[n]))[idx].child < ((TNode*)(level[n]))[idx+1].child) {
147 history.push_back(((TNode*)(level[i]))[idx].id);
180 TNode* pn = (TNode*)(level[i])
[all...] |
| /nv-g11n/inputmethod/sunpinyin/slm/src/slm/slminfo/ |
| slminfo.cpp | 128 offset += sz[i]*sizeof(CSIMSlm::TNode);
133 CSIMSlm::TNode nodes[16][2]; //it should be N+1, Yet some compiler do not support it
141 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TNode)*idx[i], SEEK_SET);
142 fread(&(nodes[i][0]), sizeof(CSIMSlm::TNode), 2, fp);
155 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TNode)*(idx[i]+1), SEEK_SET);
156 fread(&(nodes[i][1]), sizeof(CSIMSlm::TNode), 1, fp);
199 fseek(fp, level_offset[lvl]+sizeof(CSIMSlm::TNode)*(idx[lvl]+1), SEEK_SET);
200 fread(&(nodes[lvl][1]), sizeof(CSIMSlm::TNode), 1, fp);
|
| /nv-g11n/inputmethod/sunpinyin2/src/slm/slminfo/ |
| slminfo.cpp | 128 offset += sz[i]*sizeof(CSIMSlm::TNode);
133 CSIMSlm::TNode nodes[16][2]; //it should be N+1, Yet some compiler do not support it
141 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TNode)*idx[i], SEEK_SET);
142 fread(&(nodes[i][0]), sizeof(CSIMSlm::TNode), 2, fp);
155 fseek(fp, level_offset[i]+sizeof(CSIMSlm::TNode)*(idx[i]+1), SEEK_SET);
156 fread(&(nodes[i][1]), sizeof(CSIMSlm::TNode), 1, fp);
199 fseek(fp, level_offset[lvl]+sizeof(CSIMSlm::TNode)*(idx[lvl]+1), SEEK_SET);
200 fread(&(nodes[lvl][1]), sizeof(CSIMSlm::TNode), 1, fp);
|
