HomeSort by relevance Sort by last modified time
    Searched defs:TState (Results 1 - 5 of 5) sorted by null

  /nv-g11n/inputmethod/sunpinyin/slm/src/slm/
sim_dict.h 48 struct TState;
49 typedef const TState * PState;
50 struct TState {
52 std::map<TSIMChar, TState>* follow;
53 TState(TSIMWordId wid=SIM_ID_NOT_WORD) : word_id(wid), follow(NULL) { }
55 typedef std::map<TSIMChar, TState> Map_Type;
61 void close(){ freeSubTree(m_root); m_root = TState(); }
63 const TState* getRoot() const { return &m_root; }
64 int matchLongest(const CSIMDict::TState* root, CSIMDict::PState & result, const TWCHAR* str);
66 static const TState* step(const CSIMDict::TState* root, TWCHAR wch)
    [all...]
slm.h 62 * -# Add a basic type TState in Language model, a state is pair of\n
65 * double transfer(TState& history, unsigned int wid, TState& result);
80 union TState{
81 TState(const TState& b) : m_all(b.m_all) { }
82 TState(unsigned level=0, unsigned idx=0) { anony.m_Level=level; anony.m_Idx=idx; }
84 inline TState& operator++() { ++anony.m_Idx; return *this; }
92 inline bool operator==(const TState & b) const { return m_all == b.m_all; }
93 inline bool operator< (const TState & b) const { return unsigned(*this) < unsigned(b);
    [all...]
  /nv-g11n/inputmethod/sunpinyin2/src/slm/
sim_dict.h 48 struct TState;
49 typedef const TState * PState;
50 struct TState {
52 std::map<TSIMChar, TState>* follow;
53 TState(TSIMWordId wid=SIM_ID_NOT_WORD) : word_id(wid), follow(NULL) { }
55 typedef std::map<TSIMChar, TState> Map_Type;
61 void close(){ freeSubTree(m_root); m_root = TState(); }
63 const TState* getRoot() const { return &m_root; }
64 int matchLongest(const CSIMDict::TState* root, CSIMDict::PState & result, const TWCHAR* str);
66 static const TState* step(const CSIMDict::TState* root, TWCHAR wch)
    [all...]
slm.h 62 * -# Add a basic type TState in Language model, a state is pair of\n
65 * double transfer(TState& history, unsigned int wid, TState& result);
80 union TState{
81 TState(const TState& b) : m_all(b.m_all) { }
82 TState(unsigned level=0, unsigned idx=0) { anony.m_Level=level; anony.m_Idx=idx; }
84 inline TState& operator++() { ++anony.m_Idx; return *this; }
92 inline bool operator==(const TState & b) const { return m_all == b.m_all; }
93 inline bool operator< (const TState & b) const { return unsigned(*this) < unsigned(b);
    [all...]
  /nv-g11n/inputmethod/sunpinyin/ime/src/slm/
slm.h 62 * -# Add a basic type TState in Language model, a state is pair of\n
65 * double transfer(TState& history, unsigned int wid, TState& result);
80 union TState{
81 TState(const TState& b) : m_all(b.m_all) { }
82 TState(unsigned level=0, unsigned idx=0) { anony.m_Level=level; anony.m_Idx=idx; }
84 inline TState& operator++() { ++anony.m_Idx; return *this; }
92 inline bool operator==(const TState & b) const { return m_all == b.m_all; }
93 inline bool operator< (const TState & b) const { return unsigned(*this) < unsigned(b);
    [all...]

Completed in 2269 milliseconds