Searched refs:MakedictLog (Results 1 – 7 of 7) sorted by relevance
159 MakedictLog.i("Flattening the tree..."); in writeDictionary()162 MakedictLog.i("Computing addresses..."); in writeDictionary()165 MakedictLog.i("Checking PtNode array..."); in writeDictionary()166 if (MakedictLog.DBG) BinaryDictEncoderUtils.checkFlatPtNodeArrayList(flatNodes); in writeDictionary()173 MakedictLog.i("Writing file..."); in writeDictionary()179 if (MakedictLog.DBG) BinaryDictEncoderUtils.showStatistics(flatNodes); in writeDictionary()182 MakedictLog.i("Done"); in writeDictionary()
80 MakedictLog.e("Cannot add unigram entry for " + wordProperty.mWord); in writeDictionary()84 MakedictLog.e("Cannot flush dict with GC."); in writeDictionary()97 MakedictLog.e("Cannot add n-gram entry for " in writeDictionary()103 MakedictLog.e("Cannot flush dict with GC."); in writeDictionary()110 MakedictLog.e("Cannot flush dict with GC."); in writeDictionary()
40 private static final boolean DBG = MakedictLog.DBG;215 MakedictLog.i("Counted nodes : " + treeSize); in flattenTree()415 MakedictLog.i("Compressing the array addresses. Original size : " + offset); in computeAddresses()416 MakedictLog.i("(Recursively seen size : " + offset + ")"); in computeAddresses()441 MakedictLog.i("Compression complete in " + passes + " passes."); in computeAddresses()442 MakedictLog.i("After address compression : " in computeAddresses()580 MakedictLog.e("Unigram freq is superior to bigram freq for \"" + word in makeBigramFlags()723 MakedictLog.i("Statistics:\n" in showStatistics()
22 public class MakedictLog { class
34 private static final boolean DBG = MakedictLog.DBG;337 MakedictLog.w("Ignoring a word that is too long: word.length = " + word.length); in add()
93 MakedictLog.d("read: address=" + p.mAddress + ", numOfPtNode=" + in readUnigramsAndBigramsBinaryInner()
25 import com.android.inputmethod.latin.makedict.MakedictLog;98 MakedictLog.i(getHelp()); in displayHelp()