HomeSort by relevance Sort by last modified time
    Searched refs:TLeafLevel (Results 1 - 14 of 14) sorted by null

  /nv-g11n/inputmethod/sunpinyin/slm/src/slm/tslmpack/
arpa_slm.h 68 typedef std::vector<TLeaf> TLeafLevel;
72 TLeafLevel m_lastLevel;
84 const TLeafLevel& getLastLevel() const { return m_lastLevel; }
common.h 47 typedef std::vector<CThreadSlm::TLeaf> TLeafLevel;
slmpack.cpp 112 typedef CArpaSlm::TLeafLevel TLeafLevel;
113 const TLeafLevel& level = slm.getLastLevel();
114 for (TLeafLevel::const_iterator leaf = level.begin(); leaf != level.end(); ++leaf) {
arpa_conv.cpp 153 const CArpaSlm::TLeafLevel& level = slm.getLastLevel();
arpa_slm.cpp 225 TLeafLevel::iterator found = lower_bound(m_lastLevel.begin(), m_lastLevel.end(), node.hw, CompareNode<TLeaf>(lvl));
  /nv-g11n/inputmethod/sunpinyin2/src/slm/tslmpack/
arpa_slm.h 68 typedef std::vector<TLeaf> TLeafLevel;
72 TLeafLevel m_lastLevel;
84 const TLeafLevel& getLastLevel() const { return m_lastLevel; }
common.h 47 typedef std::vector<CThreadSlm::TLeaf> TLeafLevel;
slmpack.cpp 112 typedef CArpaSlm::TLeafLevel TLeafLevel;
113 const TLeafLevel& level = slm.getLastLevel();
114 for (TLeafLevel::const_iterator leaf = level.begin(); leaf != level.end(); ++leaf) {
arpa_conv.cpp 153 const CArpaSlm::TLeafLevel& level = slm.getLastLevel();
arpa_slm.cpp 225 TLeafLevel::iterator found = lower_bound(m_lastLevel.begin(), m_lastLevel.end(), node.hw, CompareNode<TLeaf>(lvl));
  /nv-g11n/inputmethod/sunpinyin/slm/src/slm/
sim_slmbuilder.cpp 120 ((TLeafLevel*)level[n])->reserve(1024);
192 TLeafLevel* pll = (TLeafLevel*)(level[nlevel]);
210 ch = ((TLeafLevel*)(level[i+1]))->size();
223 TLeafLevel& v = *(TLeafLevel*)(level[nlevel]);
244 TLeafLevel& v = *(TLeafLevel*)(level[nlevel]);
305 TLeafLevel& v = *(TLeafLevel*)(level[lvl])
    [all...]
sim_slmbuilder.h 81 typedef std::vector<TLeaf> TLeafLevel;
83 typedef TLeafLevel::iterator TLeafIterator;
  /nv-g11n/inputmethod/sunpinyin2/src/slm/
sim_slmbuilder.cpp 120 ((TLeafLevel*)level[n])->reserve(1024);
192 TLeafLevel* pll = (TLeafLevel*)(level[nlevel]);
210 ch = ((TLeafLevel*)(level[i+1]))->size();
223 TLeafLevel& v = *(TLeafLevel*)(level[nlevel]);
244 TLeafLevel& v = *(TLeafLevel*)(level[nlevel]);
305 TLeafLevel& v = *(TLeafLevel*)(level[lvl])
    [all...]
sim_slmbuilder.h 81 typedef std::vector<TLeaf> TLeafLevel;
83 typedef TLeafLevel::iterator TLeafIterator;

Completed in 420 milliseconds