add a word to the candidates list if there is no duplication . concode_field_sep int FREQ_USER concode_elem_sep int mCandidateCase concode_elem_sep ArrayList<WnnWord> mConvResult concode_elem_sep int CASE_HEAD_UPPER concode_elem_sep HashMap<String,WnnWord> mCandTable concode_elem_sep int DICT_FOR_CORRECT_MISTYPE concode_elem_sep int DICT_DEFAULT concode_elem_sep WnnDictionary mDictionary concode_elem_sep int CASE_LOWER concode_elem_sep int CASE_UPPER concode_elem_sep int PREDICT_LIMIT concode_elem_sep int mOutputNum concode_elem_sep int FREQ_LEARN concode_elem_sep String mInputString concode_elem_sep String mSearchKey concode_elem_sep CandidateFilter mFilter concode_field_sep int addWord concode_elem_sep void setPreferences concode_elem_sep void init concode_elem_sep boolean initializeDictionary concode_elem_sep boolean initializeDictionary concode_elem_sep boolean learn concode_elem_sep int searchWords concode_elem_sep int searchWords concode_elem_sep WnnWord[] getUserDictionaryWords concode_elem_sep void clearCandidates concode_elem_sep boolean setSearchKey concode_elem_sep int convert concode_elem_sep void setFilter concode_elem_sep WnnWord getCandidate concode_elem_sep boolean setDictionary concode_elem_sep void breakSequence concode_elem_sep int makeCandidateListOf concode_elem_sep int predict concode_elem_sep WnnWord getNextCandidate concode_elem_sep boolean deleteWord concode_elem_sep void close
boolean function ( WnnWord arg0 ) { if ( arg0 . candidate == null || mCandTable . containsKey ( arg0 . candidate ) ) { return false ; } if ( mFilter != null && ! mFilter . isAllowed ( arg0 ) ) { return false ; } mCandTable . put ( arg0 . candidate , arg0 ) ; mConvResult . add ( arg0 ) ; return true ; }