begin to write phrase lookup header

1 files changed, 4 insertions, 25 deletions

diff --git a/src/lookup/pinyin_lookup.h b/src/lookup/pinyin_lookup.h
index 244d15f..c95d16d 100644
--- a/src/lookup/pinyin_lookup.h
+++ b/src/lookup/pinyin_lookup.h
@@ -62,30 +62,6 @@ struct lookup_constraint_t{
 };
 
 typedef GArray * CandidateConstraints; /* Array of lookup_constraint_t */
-typedef GArray * MatchResults;         /* Array of phrase_token_t */
-
-namespace novel{
-class PinyinLargeTable;
-class FacadePhraseIndex;
-class Bigram;
-};
-
-/* Note:
- *   LookupStepIndex:
- *     the main purpose of lookup step index is served for an index
- *     for lookup step content, which can quickly merge the same node
- *     with different possibilities,
- *     then only keep the highest value of the node.
- *   LookupStepContent:
- *     the place to store the lookup values of current step,
- *     and indexed by lookup step index.
- *     See also comments on lookup_value_t.
- */
-
-typedef GHashTable * LookupStepIndex;
-/* Key: lookup_key_t, Value: int m, index to m_steps_content[i][m] */
-typedef GArray * LookupStepContent; /* array of lookup_value_t */
-
 
 /* Note:
  *   winner tree for beam search.
@@ -121,7 +97,10 @@ protected:
     /* Array of LookupStepContent */
 
     GArray * m_table_cache;
-    /* Array of PhraseIndexRanges */
+    /* Array of PhraseIndexRanges,
+     *   PhraseIndexRanges is an array of GArray of PhraseIndexRange,
+     *   indexed by phrase library (only contains enabled phrase libraries).
+     */
     
     WinnerTree * m_winner_tree;