/* * Copyright (C) 2010 The Android Open Source Project * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ package com.android.inputmethod.latin; import com.android.inputmethod.compat.InputMethodInfoCompatWrapper; import com.android.inputmethod.compat.InputMethodManagerCompatWrapper; import com.android.inputmethod.compat.InputTypeCompatUtils; import com.android.inputmethod.keyboard.Keyboard; import com.android.inputmethod.keyboard.KeyboardId; import android.content.Context; import android.content.res.Resources; import android.inputmethodservice.InputMethodService; import android.os.AsyncTask; import android.os.Handler; import android.os.HandlerThread; import android.os.Process; import android.text.InputType; import android.text.format.DateUtils; import android.util.Log; import android.view.inputmethod.EditorInfo; import java.io.BufferedReader; import java.io.File; import java.io.FileNotFoundException; import java.io.FileOutputStream; import java.io.FileReader; import java.io.IOException; import java.io.PrintWriter; import java.text.SimpleDateFormat; import java.util.Date; public class Utils { private static final String TAG = Utils.class.getSimpleName(); private static final int MINIMUM_SAFETY_NET_CHAR_LENGTH = 4; private static boolean DBG = LatinImeLogger.sDBG; private Utils() { // Intentional empty constructor for utility class. } /** * Cancel an {@link AsyncTask}. * * @param mayInterruptIfRunning true if the thread executing this * task should be interrupted; otherwise, in-progress tasks are allowed * to complete. */ public static void cancelTask(AsyncTask task, boolean mayInterruptIfRunning) { if (task != null && task.getStatus() != AsyncTask.Status.FINISHED) { task.cancel(mayInterruptIfRunning); } } public static class GCUtils { private static final String GC_TAG = GCUtils.class.getSimpleName(); public static final int GC_TRY_COUNT = 2; // GC_TRY_LOOP_MAX is used for the hard limit of GC wait, // GC_TRY_LOOP_MAX should be greater than GC_TRY_COUNT. public static final int GC_TRY_LOOP_MAX = 5; private static final long GC_INTERVAL = DateUtils.SECOND_IN_MILLIS; private static GCUtils sInstance = new GCUtils(); private int mGCTryCount = 0; public static GCUtils getInstance() { return sInstance; } public void reset() { mGCTryCount = 0; } public boolean tryGCOrWait(String metaData, Throwable t) { if (mGCTryCount == 0) { System.gc(); } if (++mGCTryCount > GC_TRY_COUNT) { LatinImeLogger.logOnException(metaData, t); return false; } else { try { Thread.sleep(GC_INTERVAL); return true; } catch (InterruptedException e) { Log.e(GC_TAG, "Sleep was interrupted."); LatinImeLogger.logOnException(metaData, t); return false; } } } } public static boolean hasMultipleEnabledIMEsOrSubtypes(InputMethodManagerCompatWrapper imm) { return imm.getEnabledInputMethodList().size() > 1 // imm.getEnabledInputMethodSubtypeList(null, false) will return the current IME's enabled // input method subtype (The current IME should be LatinIME.) || imm.getEnabledInputMethodSubtypeList(null, false).size() > 1; } public static String getInputMethodId(InputMethodManagerCompatWrapper imm, String packageName) { return getInputMethodInfo(imm, packageName).getId(); } public static InputMethodInfoCompatWrapper getInputMethodInfo( InputMethodManagerCompatWrapper imm, String packageName) { for (final InputMethodInfoCompatWrapper imi : imm.getEnabledInputMethodList()) { if (imi.getPackageName().equals(packageName)) return imi; } throw new RuntimeException("Can not find input method id for " + packageName); } public static boolean shouldBlockedBySafetyNetForAutoCorrection(SuggestedWords suggestions, Suggest suggest) { // Safety net for auto correction. // Actually if we hit this safety net, it's actually a bug. if (suggestions.size() <= 1 || suggestions.mTypedWordValid) return false; // If user selected aggressive auto correction mode, there is no need to use the safety // net. if (suggest.isAggressiveAutoCorrectionMode()) return false; CharSequence typedWord = suggestions.getWord(0); // If the length of typed word is less than MINIMUM_SAFETY_NET_CHAR_LENGTH, // we should not use net because relatively edit distance can be big. if (typedWord.length() < MINIMUM_SAFETY_NET_CHAR_LENGTH) return false; CharSequence candidateWord = suggestions.getWord(1); final int typedWordLength = typedWord.length(); final int maxEditDistanceOfNativeDictionary = typedWordLength < 5 ? 2 : typedWordLength / 2; final int distance = Utils.editDistance(typedWord, candidateWord); if (DBG) { Log.d(TAG, "Autocorrected edit distance = " + distance + ", " + maxEditDistanceOfNativeDictionary); } if (distance > maxEditDistanceOfNativeDictionary) { if (DBG) { Log.d(TAG, "Safety net: before = " + typedWord + ", after = " + candidateWord); Log.w(TAG, "(Error) The edit distance of this correction exceeds limit. " + "Turning off auto-correction."); } return true; } else { return false; } } /* package */ static class RingCharBuffer { private static RingCharBuffer sRingCharBuffer = new RingCharBuffer(); private static final char PLACEHOLDER_DELIMITER_CHAR = '\uFFFC'; private static final int INVALID_COORDINATE = -2; /* package */ static final int BUFSIZE = 20; private InputMethodService mContext; private boolean mEnabled = false; private boolean mUsabilityStudy = false; private int mEnd = 0; /* package */ int mLength = 0; private char[] mCharBuf = new char[BUFSIZE]; private int[] mXBuf = new int[BUFSIZE]; private int[] mYBuf = new int[BUFSIZE]; private RingCharBuffer() { // Intentional empty constructor for singleton. } public static RingCharBuffer getInstance() { return sRingCharBuffer; } public static RingCharBuffer init(InputMethodService context, boolean enabled, boolean usabilityStudy) { sRingCharBuffer.mContext = context; sRingCharBuffer.mEnabled = enabled || usabilityStudy; sRingCharBuffer.mUsabilityStudy = usabilityStudy; UsabilityStudyLogUtils.getInstance().init(context); return sRingCharBuffer; } private int normalize(int in) { int ret = in % BUFSIZE; return ret < 0 ? ret + BUFSIZE : ret; } public void push(char c, int x, int y) { if (!mEnabled) return; if (mUsabilityStudy) { UsabilityStudyLogUtils.getInstance().writeChar(c, x, y); } mCharBuf[mEnd] = c; mXBuf[mEnd] = x; mYBuf[mEnd] = y; mEnd = normalize(mEnd + 1); if (mLength < BUFSIZE) { ++mLength; } } public char pop() { if (mLength < 1) { return PLACEHOLDER_DELIMITER_CHAR; } else { mEnd = normalize(mEnd - 1); --mLength; return mCharBuf[mEnd]; } } public char getBackwardNthChar(int n) { if (mLength <= n || n < 0) { return PLACEHOLDER_DELIMITER_CHAR; } else { return mCharBuf[normalize(mEnd - n - 1)]; } } public int getPreviousX(char c, int back) { int index = normalize(mEnd - 2 - back); if (mLength <= back || Character.toLowerCase(c) != Character.toLowerCase(mCharBuf[index])) { return INVALID_COORDINATE; } else { return mXBuf[index]; } } public int getPreviousY(char c, int back) { int index = normalize(mEnd - 2 - back); if (mLength <= back || Character.toLowerCase(c) != Character.toLowerCase(mCharBuf[index])) { return INVALID_COORDINATE; } else { return mYBuf[index]; } } public String getLastWord(int ignoreCharCount) { StringBuilder sb = new StringBuilder(); int i = ignoreCharCount; for (; i < mLength; ++i) { char c = mCharBuf[normalize(mEnd - 1 - i)]; if (!((LatinIME)mContext).isWordSeparator(c)) { break; } } for (; i < mLength; ++i) { char c = mCharBuf[normalize(mEnd - 1 - i)]; if (!((LatinIME)mContext).isWordSeparator(c)) { sb.append(c); } else { break; } } return sb.reverse().toString(); } public void reset() { mLength = 0; } } /* Damerau-Levenshtein distance */ public static int editDistance(CharSequence s, CharSequence t) { if (s == null || t == null) { throw new IllegalArgumentException("editDistance: Arguments should not be null."); } final int sl = s.length(); final int tl = t.length(); int[][] dp = new int [sl + 1][tl + 1]; for (int i = 0; i <= sl; i++) { dp[i][0] = i; } for (int j = 0; j <= tl; j++) { dp[0][j] = j; } for (int i = 0; i < sl; ++i) { for (int j = 0; j < tl; ++j) { final char sc = Character.toLowerCase(s.charAt(i)); final char tc = Character.toLowerCase(t.charAt(j)); final int cost = sc == tc ? 0 : 1; dp[i + 1][j + 1] = Math.min( dp[i][j + 1] + 1, Math.min(dp[i + 1][j] + 1, dp[i][j] + cost)); // Overwrite for transposition cases if (i > 0 && j > 0 && sc == Character.toLowerCase(t.charAt(j - 1)) && tc == Character.toLowerCase(s.charAt(i - 1))) { dp[i + 1][j + 1] = Math.min(dp[i + 1][j + 1], dp[i - 1][j - 1] + cost); } } } if (LatinImeLogger.sDBG) { Log.d(TAG, "editDistance:" + s + "," + t); for (int i = 0; i < dp.length; ++i) { StringBuffer sb = new StringBuffer(); for (int j = 0; j < dp[i].length; ++j) { sb.append(dp[i][j]).append(','); } Log.d(TAG, i + ":" + sb.toString()); } } return dp[sl][tl]; } // Get the current stack trace public static String getStackTrace() { StringBuilder sb = new StringBuilder(); try { throw new RuntimeException(); } catch (RuntimeException e) { StackTraceElement[] frames = e.getStackTrace(); // Start at 1 because the first frame is here and we don't care about it for (int j = 1; j < frames.length; ++j) sb.append(frames[j].toString() + "\n"); } return sb.toString(); } // In dictionary.cpp, getSuggestion() method, // suggestion scores are computed using the below formula. // original score // := pow(mTypedLetterMultiplier (this is defined 2), // (the number of matched characters between typed word and suggested word)) // * (individual word's score which defined in the unigram dictionary, // and this score is defined in range [0, 255].) // Then, the following processing is applied. // - If the dictionary word is matched up to the point of the user entry // (full match up to min(before.length(), after.length()) // => Then multiply by FULL_MATCHED_WORDS_PROMOTION_RATE (this is defined 1.2) // - If the word is a true full match except for differences in accents or // capitalization, then treat it as if the score was 255. // - If before.length() == after.length() // => multiply by mFullWordMultiplier (this is defined 2)) // So, maximum original score is pow(2, min(before.length(), after.length())) * 255 * 2 * 1.2 // For historical reasons we ignore the 1.2 modifier (because the measure for a good // autocorrection threshold was done at a time when it didn't exist). This doesn't change // the result. // So, we can normalize original score by dividing pow(2, min(b.l(),a.l())) * 255 * 2. private static final int MAX_INITIAL_SCORE = 255; private static final int TYPED_LETTER_MULTIPLIER = 2; private static final int FULL_WORD_MULTIPLIER = 2; public static double calcNormalizedScore(CharSequence before, CharSequence after, int score) { final int beforeLength = before.length(); final int afterLength = after.length(); if (beforeLength == 0 || afterLength == 0) return 0; final int distance = editDistance(before, after); // If afterLength < beforeLength, the algorithm is suggesting a word by excessive character // correction. int spaceCount = 0; for (int i = 0; i < afterLength; ++i) { if (after.charAt(i) == Keyboard.CODE_SPACE) { ++spaceCount; } } if (spaceCount == afterLength) return 0; final double maximumScore = MAX_INITIAL_SCORE * Math.pow( TYPED_LETTER_MULTIPLIER, Math.min(beforeLength, afterLength - spaceCount)) * FULL_WORD_MULTIPLIER; // add a weight based on edit distance. // distance <= max(afterLength, beforeLength) == afterLength, // so, 0 <= distance / afterLength <= 1 final double weight = 1.0 - (double) distance / afterLength; return (score / maximumScore) * weight; } public static class UsabilityStudyLogUtils { private static final String USABILITY_TAG = UsabilityStudyLogUtils.class.getSimpleName(); private static final String FILENAME = "log.txt"; private static final UsabilityStudyLogUtils sInstance = new UsabilityStudyLogUtils(); private final Handler mLoggingHandler; private File mFile; private File mDirectory; private InputMethodService mIms; private PrintWriter mWriter; private final Date mDate; private final SimpleDateFormat mDateFormat; private UsabilityStudyLogUtils() { mDate = new Date(); mDateFormat = new SimpleDateFormat("dd MMM HH:mm:ss.SSS"); HandlerThread handlerThread = new HandlerThread("UsabilityStudyLogUtils logging task", Process.THREAD_PRIORITY_BACKGROUND); handlerThread.start(); mLoggingHandler = new Handler(handlerThread.getLooper()); } public static UsabilityStudyLogUtils getInstance() { return sInstance; } public void init(InputMethodService ims) { mIms = ims; mDirectory = ims.getFilesDir(); } private void createLogFileIfNotExist() { if ((mFile == null || !mFile.exists()) && (mDirectory != null && mDirectory.exists())) { try { mWriter = getPrintWriter(mDirectory, FILENAME, false); } catch (IOException e) { Log.e(USABILITY_TAG, "Can't create log file."); } } } public void writeBackSpace() { UsabilityStudyLogUtils.getInstance().write("\t0\t0"); } public void writeChar(char c, int x, int y) { String inputChar = String.valueOf(c); switch (c) { case '\n': inputChar = ""; break; case '\t': inputChar = ""; break; case ' ': inputChar = ""; break; } UsabilityStudyLogUtils.getInstance().write(inputChar + "\t" + x + "\t" + y); LatinImeLogger.onPrintAllUsabilityStudyLogs(); } public void write(final String log) { mLoggingHandler.post(new Runnable() { @Override public void run() { createLogFileIfNotExist(); final long currentTime = System.currentTimeMillis(); mDate.setTime(currentTime); final String printString = String.format("%s\t%d\t%s\n", mDateFormat.format(mDate), currentTime, log); if (LatinImeLogger.sDBG) { Log.d(USABILITY_TAG, "Write: " + log); } mWriter.print(printString); } }); } public void printAll() { mLoggingHandler.post(new Runnable() { @Override public void run() { mWriter.flush(); StringBuilder sb = new StringBuilder(); BufferedReader br = getBufferedReader(); String line; try { while ((line = br.readLine()) != null) { sb.append('\n'); sb.append(line); } } catch (IOException e) { Log.e(USABILITY_TAG, "Can't read log file."); } finally { if (LatinImeLogger.sDBG) { Log.d(USABILITY_TAG, "output all logs\n" + sb.toString()); } mIms.getCurrentInputConnection().commitText(sb.toString(), 0); try { br.close(); } catch (IOException e) { // ignore. } } } }); } public void clearAll() { mLoggingHandler.post(new Runnable() { @Override public void run() { if (mFile != null && mFile.exists()) { if (LatinImeLogger.sDBG) { Log.d(USABILITY_TAG, "Delete log file."); } mFile.delete(); mWriter.close(); } } }); } private BufferedReader getBufferedReader() { createLogFileIfNotExist(); try { return new BufferedReader(new FileReader(mFile)); } catch (FileNotFoundException e) { return null; } } private PrintWriter getPrintWriter( File dir, String filename, boolean renew) throws IOException { mFile = new File(dir, filename); if (mFile.exists()) { if (renew) { mFile.delete(); } } return new PrintWriter(new FileOutputStream(mFile), true /* autoFlush */); } } public static int getKeyboardMode(EditorInfo attribute) { if (attribute == null) return KeyboardId.MODE_TEXT; final int inputType = attribute.inputType; final int variation = inputType & InputType.TYPE_MASK_VARIATION; switch (inputType & InputType.TYPE_MASK_CLASS) { case InputType.TYPE_CLASS_NUMBER: case InputType.TYPE_CLASS_DATETIME: return KeyboardId.MODE_NUMBER; case InputType.TYPE_CLASS_PHONE: return KeyboardId.MODE_PHONE; case InputType.TYPE_CLASS_TEXT: if (InputTypeCompatUtils.isEmailVariation(variation)) { return KeyboardId.MODE_EMAIL; } else if (variation == InputType.TYPE_TEXT_VARIATION_URI) { return KeyboardId.MODE_URL; } else if (variation == InputType.TYPE_TEXT_VARIATION_SHORT_MESSAGE) { return KeyboardId.MODE_IM; } else if (variation == InputType.TYPE_TEXT_VARIATION_FILTER) { return KeyboardId.MODE_TEXT; } else if (variation == InputType.TYPE_TEXT_VARIATION_WEB_EDIT_TEXT) { return KeyboardId.MODE_WEB; } else { return KeyboardId.MODE_TEXT; } default: return KeyboardId.MODE_TEXT; } } public static boolean containsInCsv(String key, String csv) { if (csv == null) return false; for (String option : csv.split(",")) { if (option.equals(key)) return true; } return false; } public static boolean inPrivateImeOptions(String packageName, String key, EditorInfo attribute) { if (attribute == null) return false; return containsInCsv(packageName != null ? packageName + "." + key : key, attribute.privateImeOptions); } /** * Returns a main dictionary resource id * @return main dictionary resource id */ public static int getMainDictionaryResourceId(Resources res) { final String MAIN_DIC_NAME = "main"; String packageName = LatinIME.class.getPackage().getName(); return res.getIdentifier(MAIN_DIC_NAME, "raw", packageName); } public static void loadNativeLibrary() { try { System.loadLibrary("jni_latinime"); } catch (UnsatisfiedLinkError ule) { Log.e(TAG, "Could not load native library jni_latinime"); } } /** * Returns true if a and b are equal ignoring the case of the character. * @param a first character to check * @param b second character to check * @return {@code true} if a and b are equal, {@code false} otherwise. */ public static boolean equalsIgnoreCase(char a, char b) { // Some language, such as Turkish, need testing both cases. return a == b || Character.toLowerCase(a) == Character.toLowerCase(b) || Character.toUpperCase(a) == Character.toUpperCase(b); } /** * Returns true if a and b are equal ignoring the case of the characters, including if they are * both null. * @param a first CharSequence to check * @param b second CharSequence to check * @return {@code true} if a and b are equal, {@code false} otherwise. */ public static boolean equalsIgnoreCase(CharSequence a, CharSequence b) { if (a == b) return true; // including both a and b are null. if (a == null || b == null) return false; final int length = a.length(); if (length != b.length()) return false; for (int i = 0; i < length; i++) { if (!equalsIgnoreCase(a.charAt(i), b.charAt(i))) return false; } return true; } /** * Returns true if a and b are equal ignoring the case of the characters, including if a is null * and b is zero length. * @param a CharSequence to check * @param b character array to check * @param offset start offset of array b * @param length length of characters in array b * @return {@code true} if a and b are equal, {@code false} otherwise. * @throws IndexOutOfBoundsException * if {@code offset < 0 || length < 0 || offset + length > data.length}. * @throws NullPointerException if {@code b == null}. */ public static boolean equalsIgnoreCase(CharSequence a, char[] b, int offset, int length) { if (offset < 0 || length < 0 || length > b.length - offset) throw new IndexOutOfBoundsException("array.length=" + b.length + " offset=" + offset + " length=" + length); if (a == null) return length == 0; // including a is null and b is zero length. if (a.length() != length) return false; for (int i = 0; i < length; i++) { if (!equalsIgnoreCase(a.charAt(i), b[offset + i])) return false; } return true; } public static float getDipScale(Context context) { final float scale = context.getResources().getDisplayMetrics().density; return scale; } /** Convert pixel to DIP */ public static int dipToPixel(float scale, int dip) { return (int) (dip * scale + 0.5); } }