2012-06-08 10:04:09 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2012 The Android Open Source Project
|
|
|
|
*
|
2013-01-21 12:52:57 +00:00
|
|
|
* 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
|
2012-06-08 10:04:09 +00:00
|
|
|
*
|
2013-01-21 12:52:57 +00:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
2012-06-08 10:04:09 +00:00
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
2013-01-21 12:52:57 +00:00
|
|
|
* 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.
|
2012-06-08 10:04:09 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
package com.android.inputmethod.latin;
|
|
|
|
|
2012-07-05 03:36:06 +00:00
|
|
|
import android.inputmethodservice.InputMethodService;
|
2012-06-08 11:23:13 +00:00
|
|
|
import android.text.TextUtils;
|
2012-06-08 10:04:09 +00:00
|
|
|
import android.util.Log;
|
|
|
|
import android.view.KeyEvent;
|
|
|
|
import android.view.inputmethod.CompletionInfo;
|
|
|
|
import android.view.inputmethod.CorrectionInfo;
|
2012-06-08 10:44:38 +00:00
|
|
|
import android.view.inputmethod.ExtractedText;
|
|
|
|
import android.view.inputmethod.ExtractedTextRequest;
|
2012-06-08 10:04:09 +00:00
|
|
|
import android.view.inputmethod.InputConnection;
|
|
|
|
|
2012-06-08 11:23:13 +00:00
|
|
|
import com.android.inputmethod.latin.define.ProductionFlag;
|
2013-07-22 03:43:37 +00:00
|
|
|
import com.android.inputmethod.latin.settings.SettingsValues;
|
2013-06-23 16:11:32 +00:00
|
|
|
import com.android.inputmethod.latin.utils.CapsModeUtils;
|
2013-06-25 08:03:05 +00:00
|
|
|
import com.android.inputmethod.latin.utils.DebugLogUtils;
|
2013-06-23 16:11:32 +00:00
|
|
|
import com.android.inputmethod.latin.utils.StringUtils;
|
2013-06-25 08:28:39 +00:00
|
|
|
import com.android.inputmethod.latin.utils.TextRange;
|
2012-07-20 18:02:39 +00:00
|
|
|
import com.android.inputmethod.research.ResearchLogger;
|
2012-06-08 11:23:13 +00:00
|
|
|
|
2012-09-14 07:27:04 +00:00
|
|
|
import java.util.Locale;
|
2012-06-08 10:44:38 +00:00
|
|
|
import java.util.regex.Pattern;
|
|
|
|
|
2012-06-08 10:04:09 +00:00
|
|
|
/**
|
2012-09-10 10:27:45 +00:00
|
|
|
* Enrichment class for InputConnection to simplify interaction and add functionality.
|
|
|
|
*
|
|
|
|
* This class serves as a wrapper to be able to simply add hooks to any calls to the underlying
|
|
|
|
* InputConnection. It also keeps track of a number of things to avoid having to call upon IPC
|
|
|
|
* all the time to find out what text is in the buffer, when we need it to determine caps mode
|
|
|
|
* for example.
|
2012-06-08 10:04:09 +00:00
|
|
|
*/
|
2012-09-27 09:16:16 +00:00
|
|
|
public final class RichInputConnection {
|
2012-06-08 10:04:09 +00:00
|
|
|
private static final String TAG = RichInputConnection.class.getSimpleName();
|
|
|
|
private static final boolean DBG = false;
|
2012-09-10 10:27:45 +00:00
|
|
|
private static final boolean DEBUG_PREVIOUS_TEXT = false;
|
2012-10-01 07:03:21 +00:00
|
|
|
private static final boolean DEBUG_BATCH_NESTING = false;
|
2012-06-08 10:44:38 +00:00
|
|
|
// Provision for a long word pair and a separator
|
2013-07-26 03:35:11 +00:00
|
|
|
private static final int LOOKBACK_CHARACTER_NUM = Constants.DICTIONARY_MAX_WORD_LENGTH * 2 + 1;
|
2012-06-08 10:44:38 +00:00
|
|
|
private static final Pattern spaceRegex = Pattern.compile("\\s+");
|
|
|
|
private static final int INVALID_CURSOR_POSITION = -1;
|
|
|
|
|
2012-09-10 10:27:45 +00:00
|
|
|
/**
|
|
|
|
* This variable contains the value LatinIME thinks the cursor position should be at now.
|
|
|
|
* This is a few steps in advance of what the TextView thinks it is, because TextView will
|
|
|
|
* only know after the IPC calls gets through.
|
|
|
|
*/
|
|
|
|
private int mCurrentCursorPosition = INVALID_CURSOR_POSITION; // in chars, not code points
|
|
|
|
/**
|
|
|
|
* This contains the committed text immediately preceding the cursor and the composing
|
|
|
|
* text if any. It is refreshed when the cursor moves by calling upon the TextView.
|
|
|
|
*/
|
2013-03-29 09:39:28 +00:00
|
|
|
private final StringBuilder mCommittedTextBeforeComposingText = new StringBuilder();
|
2012-09-10 10:27:45 +00:00
|
|
|
/**
|
|
|
|
* This contains the currently composing text, as LatinIME thinks the TextView is seeing it.
|
|
|
|
*/
|
2013-03-29 09:39:28 +00:00
|
|
|
private final StringBuilder mComposingText = new StringBuilder();
|
2012-09-10 10:27:45 +00:00
|
|
|
// A hint on how many characters to cache from the TextView. A good value of this is given by
|
|
|
|
// how many characters we need to be able to almost always find the caps mode.
|
|
|
|
private static final int DEFAULT_TEXT_CACHE_SIZE = 100;
|
|
|
|
|
2012-07-05 03:36:06 +00:00
|
|
|
private final InputMethodService mParent;
|
2012-06-08 10:04:09 +00:00
|
|
|
InputConnection mIC;
|
|
|
|
int mNestLevel;
|
2012-07-05 03:36:06 +00:00
|
|
|
public RichInputConnection(final InputMethodService parent) {
|
|
|
|
mParent = parent;
|
2012-06-08 10:04:09 +00:00
|
|
|
mIC = null;
|
|
|
|
mNestLevel = 0;
|
|
|
|
}
|
|
|
|
|
2012-09-10 10:27:45 +00:00
|
|
|
private void checkConsistencyForDebug() {
|
|
|
|
final ExtractedTextRequest r = new ExtractedTextRequest();
|
|
|
|
r.hintMaxChars = 0;
|
|
|
|
r.hintMaxLines = 0;
|
|
|
|
r.token = 1;
|
|
|
|
r.flags = 0;
|
|
|
|
final ExtractedText et = mIC.getExtractedText(r, 0);
|
|
|
|
final CharSequence beforeCursor = getTextBeforeCursor(DEFAULT_TEXT_CACHE_SIZE, 0);
|
|
|
|
final StringBuilder internal = new StringBuilder().append(mCommittedTextBeforeComposingText)
|
|
|
|
.append(mComposingText);
|
|
|
|
if (null == et || null == beforeCursor) return;
|
|
|
|
final int actualLength = Math.min(beforeCursor.length(), internal.length());
|
|
|
|
if (internal.length() > actualLength) {
|
|
|
|
internal.delete(0, internal.length() - actualLength);
|
|
|
|
}
|
|
|
|
final String reference = (beforeCursor.length() <= actualLength) ? beforeCursor.toString()
|
|
|
|
: beforeCursor.subSequence(beforeCursor.length() - actualLength,
|
|
|
|
beforeCursor.length()).toString();
|
|
|
|
if (et.selectionStart != mCurrentCursorPosition
|
|
|
|
|| !(reference.equals(internal.toString()))) {
|
|
|
|
final String context = "Expected cursor position = " + mCurrentCursorPosition
|
|
|
|
+ "\nActual cursor position = " + et.selectionStart
|
|
|
|
+ "\nExpected text = " + internal.length() + " " + internal
|
|
|
|
+ "\nActual text = " + reference.length() + " " + reference;
|
|
|
|
((LatinIME)mParent).debugDumpStateAndCrashWithException(context);
|
|
|
|
} else {
|
2013-06-25 08:03:05 +00:00
|
|
|
Log.e(TAG, DebugLogUtils.getStackTrace(2));
|
2012-09-10 10:27:45 +00:00
|
|
|
Log.e(TAG, "Exp <> Actual : " + mCurrentCursorPosition + " <> " + et.selectionStart);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-07-05 03:36:06 +00:00
|
|
|
public void beginBatchEdit() {
|
2012-06-08 10:04:09 +00:00
|
|
|
if (++mNestLevel == 1) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.beginBatchEdit();
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
} else {
|
|
|
|
if (DBG) {
|
|
|
|
throw new RuntimeException("Nest level too deep");
|
|
|
|
} else {
|
|
|
|
Log.e(TAG, "Nest level too deep : " + mNestLevel);
|
|
|
|
}
|
|
|
|
}
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
|
2012-06-08 10:04:09 +00:00
|
|
|
public void endBatchEdit() {
|
|
|
|
if (mNestLevel <= 0) Log.e(TAG, "Batch edit not in progress!"); // TODO: exception instead
|
2012-08-02 00:26:45 +00:00
|
|
|
if (--mNestLevel == 0 && null != mIC) {
|
|
|
|
mIC.endBatchEdit();
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
}
|
|
|
|
|
2013-07-26 06:46:56 +00:00
|
|
|
public void resetCachesUponCursorMove(final int newCursorPosition,
|
|
|
|
final boolean shouldFinishComposition) {
|
|
|
|
mCurrentCursorPosition = newCursorPosition;
|
2012-09-10 10:27:45 +00:00
|
|
|
mComposingText.setLength(0);
|
|
|
|
mCommittedTextBeforeComposingText.setLength(0);
|
2012-11-14 03:22:40 +00:00
|
|
|
final CharSequence textBeforeCursor = getTextBeforeCursor(DEFAULT_TEXT_CACHE_SIZE, 0);
|
|
|
|
if (null != textBeforeCursor) mCommittedTextBeforeComposingText.append(textBeforeCursor);
|
2013-05-08 09:44:50 +00:00
|
|
|
if (null != mIC && shouldFinishComposition) {
|
2012-09-10 10:27:45 +00:00
|
|
|
mIC.finishComposingText();
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-09-10 10:27:45 +00:00
|
|
|
ResearchLogger.richInputConnection_finishComposingText();
|
|
|
|
}
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
2012-06-08 14:02:37 +00:00
|
|
|
private void checkBatchEdit() {
|
|
|
|
if (mNestLevel != 1) {
|
|
|
|
// TODO: exception instead
|
|
|
|
Log.e(TAG, "Batch edit level incorrect : " + mNestLevel);
|
2013-06-25 08:03:05 +00:00
|
|
|
Log.e(TAG, DebugLogUtils.getStackTrace(4));
|
2012-06-08 14:02:37 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-08 10:04:09 +00:00
|
|
|
public void finishComposingText() {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
mCommittedTextBeforeComposingText.append(mComposingText);
|
|
|
|
mCurrentCursorPosition += mComposingText.length();
|
|
|
|
mComposingText.setLength(0);
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.finishComposingText();
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-08-02 00:26:45 +00:00
|
|
|
ResearchLogger.richInputConnection_finishComposingText();
|
|
|
|
}
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public void commitText(final CharSequence text, final int i) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
mCommittedTextBeforeComposingText.append(text);
|
|
|
|
mCurrentCursorPosition += text.length() - mComposingText.length();
|
|
|
|
mComposingText.setLength(0);
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.commitText(text, i);
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
2012-12-03 13:00:35 +00:00
|
|
|
public CharSequence getSelectedText(final int flags) {
|
|
|
|
if (null == mIC) return null;
|
|
|
|
return mIC.getSelectedText(flags);
|
|
|
|
}
|
|
|
|
|
2013-07-02 09:07:35 +00:00
|
|
|
public boolean canDeleteCharacters() {
|
|
|
|
return mCurrentCursorPosition > 0;
|
|
|
|
}
|
|
|
|
|
2012-09-14 07:53:01 +00:00
|
|
|
/**
|
|
|
|
* Gets the caps modes we should be in after this specific string.
|
|
|
|
*
|
|
|
|
* This returns a bit set of TextUtils#CAP_MODE_*, masked by the inputType argument.
|
|
|
|
* This method also supports faking an additional space after the string passed in argument,
|
|
|
|
* to support cases where a space will be added automatically, like in phantom space
|
|
|
|
* state for example.
|
|
|
|
* Note that for English, we are using American typography rules (which are not specific to
|
|
|
|
* American English, it's just the most common set of rules for English).
|
|
|
|
*
|
|
|
|
* @param inputType a mask of the caps modes to test for.
|
|
|
|
* @param locale what language should be considered.
|
|
|
|
* @param hasSpaceBefore if we should consider there should be a space after the string.
|
|
|
|
* @return the caps modes that should be on as a set of bits
|
|
|
|
*/
|
|
|
|
public int getCursorCapsMode(final int inputType, final Locale locale,
|
|
|
|
final boolean hasSpaceBefore) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2012-06-08 10:04:09 +00:00
|
|
|
if (null == mIC) return Constants.TextUtils.CAP_MODE_OFF;
|
2012-09-14 09:53:56 +00:00
|
|
|
if (!TextUtils.isEmpty(mComposingText)) {
|
|
|
|
if (hasSpaceBefore) {
|
|
|
|
// If we have some composing text and a space before, then we should have
|
|
|
|
// MODE_CHARACTERS and MODE_WORDS on.
|
|
|
|
return (TextUtils.CAP_MODE_CHARACTERS | TextUtils.CAP_MODE_WORDS) & inputType;
|
|
|
|
} else {
|
|
|
|
// We have some composing text - we should be in MODE_CHARACTERS only.
|
|
|
|
return TextUtils.CAP_MODE_CHARACTERS & inputType;
|
|
|
|
}
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
// TODO: this will generally work, but there may be cases where the buffer contains SOME
|
|
|
|
// information but not enough to determine the caps mode accurately. This may happen after
|
|
|
|
// heavy pressing of delete, for example DEFAULT_TEXT_CACHE_SIZE - 5 times or so.
|
|
|
|
// getCapsMode should be updated to be able to return a "not enough info" result so that
|
|
|
|
// we can get more context only when needed.
|
|
|
|
if (TextUtils.isEmpty(mCommittedTextBeforeComposingText) && 0 != mCurrentCursorPosition) {
|
|
|
|
mCommittedTextBeforeComposingText.append(
|
|
|
|
getTextBeforeCursor(DEFAULT_TEXT_CACHE_SIZE, 0));
|
|
|
|
}
|
|
|
|
// This never calls InputConnection#getCapsMode - in fact, it's a static method that
|
|
|
|
// never blocks or initiates IPC.
|
2013-02-12 07:15:47 +00:00
|
|
|
return CapsModeUtils.getCapsMode(mCommittedTextBeforeComposingText, inputType, locale,
|
2012-09-14 07:53:01 +00:00
|
|
|
hasSpaceBefore);
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
2012-10-16 21:41:15 +00:00
|
|
|
public int getCodePointBeforeCursor() {
|
|
|
|
if (mCommittedTextBeforeComposingText.length() < 1) return Constants.NOT_A_CODE;
|
|
|
|
return Character.codePointBefore(mCommittedTextBeforeComposingText,
|
|
|
|
mCommittedTextBeforeComposingText.length());
|
|
|
|
}
|
|
|
|
|
2013-07-26 08:06:32 +00:00
|
|
|
public CharSequence getTextBeforeCursor(final int n, final int flags) {
|
|
|
|
final int cachedLength =
|
|
|
|
mCommittedTextBeforeComposingText.length() + mComposingText.length();
|
|
|
|
// If we have enough characters to satisfy the request, or if we have all characters in
|
|
|
|
// the text field, then we can return the cached version right away.
|
|
|
|
if (cachedLength >= n || cachedLength >= mCurrentCursorPosition) {
|
|
|
|
final StringBuilder s = new StringBuilder(mCommittedTextBeforeComposingText);
|
|
|
|
s.append(mComposingText);
|
|
|
|
if (s.length() > n) {
|
|
|
|
s.delete(0, s.length() - n);
|
|
|
|
}
|
|
|
|
return s;
|
|
|
|
}
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2013-07-26 08:06:32 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
return mIC.getTextBeforeCursor(n, flags);
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
return null;
|
|
|
|
}
|
|
|
|
|
2013-07-26 08:06:32 +00:00
|
|
|
public CharSequence getTextAfterCursor(final int n, final int flags) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2013-07-26 08:06:32 +00:00
|
|
|
if (null != mIC) return mIC.getTextAfterCursor(n, flags);
|
2012-06-08 10:04:09 +00:00
|
|
|
return null;
|
|
|
|
}
|
|
|
|
|
2013-07-26 08:06:32 +00:00
|
|
|
public void deleteSurroundingText(final int beforeLength, final int afterLength) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2013-07-26 08:06:32 +00:00
|
|
|
final int remainingChars = mComposingText.length() - beforeLength;
|
2012-09-10 10:27:45 +00:00
|
|
|
if (remainingChars >= 0) {
|
|
|
|
mComposingText.setLength(remainingChars);
|
|
|
|
} else {
|
|
|
|
mComposingText.setLength(0);
|
|
|
|
// Never cut under 0
|
|
|
|
final int len = Math.max(mCommittedTextBeforeComposingText.length()
|
|
|
|
+ remainingChars, 0);
|
|
|
|
mCommittedTextBeforeComposingText.setLength(len);
|
|
|
|
}
|
2013-07-26 08:06:32 +00:00
|
|
|
if (mCurrentCursorPosition > beforeLength) {
|
|
|
|
mCurrentCursorPosition -= beforeLength;
|
2012-09-10 10:27:45 +00:00
|
|
|
} else {
|
|
|
|
mCurrentCursorPosition = 0;
|
|
|
|
}
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
2013-07-26 08:06:32 +00:00
|
|
|
mIC.deleteSurroundingText(beforeLength, afterLength);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2013-07-26 08:06:32 +00:00
|
|
|
ResearchLogger.richInputConnection_deleteSurroundingText(beforeLength, afterLength);
|
2012-08-02 00:26:45 +00:00
|
|
|
}
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public void performEditorAction(final int actionId) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.performEditorAction(actionId);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-08-02 00:26:45 +00:00
|
|
|
ResearchLogger.richInputConnection_performEditorAction(actionId);
|
|
|
|
}
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public void sendKeyEvent(final KeyEvent keyEvent) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (keyEvent.getAction() == KeyEvent.ACTION_DOWN) {
|
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2013-01-06 02:10:27 +00:00
|
|
|
// This method is only called for enter or backspace when speaking to old applications
|
|
|
|
// (target SDK <= 15 (Build.VERSION_CODES.ICE_CREAM_SANDWICH_MR1)), or for digits.
|
2012-09-10 10:27:45 +00:00
|
|
|
// When talking to new applications we never use this method because it's inherently
|
|
|
|
// racy and has unpredictable results, but for backward compatibility we continue
|
|
|
|
// sending the key events for only Enter and Backspace because some applications
|
|
|
|
// mistakenly catch them to do some stuff.
|
|
|
|
switch (keyEvent.getKeyCode()) {
|
2013-01-06 02:10:27 +00:00
|
|
|
case KeyEvent.KEYCODE_ENTER:
|
|
|
|
mCommittedTextBeforeComposingText.append("\n");
|
|
|
|
mCurrentCursorPosition += 1;
|
|
|
|
break;
|
|
|
|
case KeyEvent.KEYCODE_DEL:
|
|
|
|
if (0 == mComposingText.length()) {
|
|
|
|
if (mCommittedTextBeforeComposingText.length() > 0) {
|
|
|
|
mCommittedTextBeforeComposingText.delete(
|
|
|
|
mCommittedTextBeforeComposingText.length() - 1,
|
|
|
|
mCommittedTextBeforeComposingText.length());
|
2012-09-10 10:27:45 +00:00
|
|
|
}
|
2013-01-06 02:10:27 +00:00
|
|
|
} else {
|
|
|
|
mComposingText.delete(mComposingText.length() - 1, mComposingText.length());
|
|
|
|
}
|
|
|
|
if (mCurrentCursorPosition > 0) mCurrentCursorPosition -= 1;
|
|
|
|
break;
|
|
|
|
case KeyEvent.KEYCODE_UNKNOWN:
|
|
|
|
if (null != keyEvent.getCharacters()) {
|
|
|
|
mCommittedTextBeforeComposingText.append(keyEvent.getCharacters());
|
|
|
|
mCurrentCursorPosition += keyEvent.getCharacters().length();
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
final String text = new String(new int[] { keyEvent.getUnicodeChar() }, 0, 1);
|
|
|
|
mCommittedTextBeforeComposingText.append(text);
|
|
|
|
mCurrentCursorPosition += text.length();
|
|
|
|
break;
|
2012-09-10 10:27:45 +00:00
|
|
|
}
|
|
|
|
}
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.sendKeyEvent(keyEvent);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-08-02 00:26:45 +00:00
|
|
|
ResearchLogger.richInputConnection_sendKeyEvent(keyEvent);
|
|
|
|
}
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
2012-12-13 12:59:13 +00:00
|
|
|
public void setComposingRegion(final int start, final int end) {
|
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
final CharSequence textBeforeCursor =
|
|
|
|
getTextBeforeCursor(DEFAULT_TEXT_CACHE_SIZE + (end - start), 0);
|
|
|
|
mCommittedTextBeforeComposingText.setLength(0);
|
2013-03-29 09:39:28 +00:00
|
|
|
if (!TextUtils.isEmpty(textBeforeCursor)) {
|
|
|
|
final int indexOfStartOfComposingText =
|
|
|
|
Math.max(textBeforeCursor.length() - (end - start), 0);
|
|
|
|
mComposingText.append(textBeforeCursor.subSequence(indexOfStartOfComposingText,
|
|
|
|
textBeforeCursor.length()));
|
|
|
|
mCommittedTextBeforeComposingText.append(
|
|
|
|
textBeforeCursor.subSequence(0, indexOfStartOfComposingText));
|
|
|
|
}
|
2012-12-13 12:59:13 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.setComposingRegion(start, end);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-07-26 08:06:32 +00:00
|
|
|
public void setComposingText(final CharSequence text, final int newCursorPosition) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
mCurrentCursorPosition += text.length() - mComposingText.length();
|
|
|
|
mComposingText.setLength(0);
|
|
|
|
mComposingText.append(text);
|
|
|
|
// TODO: support values of i != 1. At this time, this is never called with i != 1.
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
2013-07-26 08:06:32 +00:00
|
|
|
mIC.setComposingText(text, newCursorPosition);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2013-07-26 08:06:32 +00:00
|
|
|
ResearchLogger.richInputConnection_setComposingText(text, newCursorPosition);
|
2012-08-02 00:26:45 +00:00
|
|
|
}
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
2013-07-26 08:06:32 +00:00
|
|
|
public void setSelection(final int start, final int end) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
2013-07-26 08:06:32 +00:00
|
|
|
mIC.setSelection(start, end);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2013-07-26 08:06:32 +00:00
|
|
|
ResearchLogger.richInputConnection_setSelection(start, end);
|
2012-08-02 00:26:45 +00:00
|
|
|
}
|
|
|
|
}
|
2013-07-26 08:06:32 +00:00
|
|
|
mCurrentCursorPosition = start;
|
2012-09-10 10:27:45 +00:00
|
|
|
mCommittedTextBeforeComposingText.setLength(0);
|
|
|
|
mCommittedTextBeforeComposingText.append(getTextBeforeCursor(DEFAULT_TEXT_CACHE_SIZE, 0));
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public void commitCorrection(final CorrectionInfo correctionInfo) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
|
|
|
// This has no effect on the text field and does not change its content. It only makes
|
|
|
|
// TextView flash the text for a second based on indices contained in the argument.
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.commitCorrection(correctionInfo);
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
public void commitCompletion(final CompletionInfo completionInfo) {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2013-04-10 13:05:34 +00:00
|
|
|
CharSequence text = completionInfo.getText();
|
|
|
|
// text should never be null, but just in case, it's better to insert nothing than to crash
|
|
|
|
if (null == text) text = "";
|
2012-09-10 10:27:45 +00:00
|
|
|
mCommittedTextBeforeComposingText.append(text);
|
|
|
|
mCurrentCursorPosition += text.length() - mComposingText.length();
|
|
|
|
mComposingText.setLength(0);
|
2012-08-02 00:26:45 +00:00
|
|
|
if (null != mIC) {
|
|
|
|
mIC.commitCompletion(completionInfo);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-08-02 00:26:45 +00:00
|
|
|
ResearchLogger.richInputConnection_commitCompletion(completionInfo);
|
|
|
|
}
|
|
|
|
}
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT) checkConsistencyForDebug();
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|
2012-06-08 10:44:38 +00:00
|
|
|
|
2012-12-06 11:47:19 +00:00
|
|
|
@SuppressWarnings("unused")
|
2012-10-03 06:19:43 +00:00
|
|
|
public String getNthPreviousWord(final String sentenceSeperators, final int n) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2012-06-08 10:44:38 +00:00
|
|
|
if (null == mIC) return null;
|
2013-07-26 08:06:32 +00:00
|
|
|
final CharSequence prev = getTextBeforeCursor(LOOKBACK_CHARACTER_NUM, 0);
|
2012-09-10 10:27:45 +00:00
|
|
|
if (DEBUG_PREVIOUS_TEXT && null != prev) {
|
|
|
|
final int checkLength = LOOKBACK_CHARACTER_NUM - 1;
|
|
|
|
final String reference = prev.length() <= checkLength ? prev.toString()
|
|
|
|
: prev.subSequence(prev.length() - checkLength, prev.length()).toString();
|
|
|
|
final StringBuilder internal = new StringBuilder()
|
|
|
|
.append(mCommittedTextBeforeComposingText).append(mComposingText);
|
|
|
|
if (internal.length() > checkLength) {
|
|
|
|
internal.delete(0, internal.length() - checkLength);
|
|
|
|
if (!(reference.equals(internal.toString()))) {
|
|
|
|
final String context =
|
|
|
|
"Expected text = " + internal + "\nActual text = " + reference;
|
|
|
|
((LatinIME)mParent).debugDumpStateAndCrashWithException(context);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-07-06 03:34:41 +00:00
|
|
|
return getNthPreviousWord(prev, sentenceSeperators, n);
|
2012-06-08 10:44:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
private static boolean isSeparator(int code, String sep) {
|
|
|
|
return sep.indexOf(code) != -1;
|
|
|
|
}
|
|
|
|
|
2012-07-06 03:34:41 +00:00
|
|
|
// Get the nth word before cursor. n = 1 retrieves the word immediately before the cursor,
|
|
|
|
// n = 2 retrieves the word before that, and so on. This splits on whitespace only.
|
|
|
|
// Also, it won't return words that end in a separator (if the nth word before the cursor
|
|
|
|
// ends in a separator, it returns null).
|
2012-06-08 10:44:38 +00:00
|
|
|
// Example :
|
2012-07-06 03:34:41 +00:00
|
|
|
// (n = 1) "abc def|" -> def
|
|
|
|
// (n = 1) "abc def |" -> def
|
|
|
|
// (n = 1) "abc def. |" -> null
|
|
|
|
// (n = 1) "abc def . |" -> null
|
|
|
|
// (n = 2) "abc def|" -> abc
|
|
|
|
// (n = 2) "abc def |" -> abc
|
|
|
|
// (n = 2) "abc def. |" -> abc
|
|
|
|
// (n = 2) "abc def . |" -> def
|
|
|
|
// (n = 2) "abc|" -> null
|
|
|
|
// (n = 2) "abc |" -> null
|
|
|
|
// (n = 2) "abc. def|" -> null
|
2012-10-03 06:19:43 +00:00
|
|
|
public static String getNthPreviousWord(final CharSequence prev,
|
2012-07-06 03:34:41 +00:00
|
|
|
final String sentenceSeperators, final int n) {
|
2012-06-08 10:44:38 +00:00
|
|
|
if (prev == null) return null;
|
2012-10-03 06:19:43 +00:00
|
|
|
final String[] w = spaceRegex.split(prev);
|
2012-06-08 10:44:38 +00:00
|
|
|
|
2012-07-06 03:34:41 +00:00
|
|
|
// If we can't find n words, or we found an empty word, return null.
|
2012-10-03 06:19:43 +00:00
|
|
|
if (w.length < n) return null;
|
|
|
|
final String nthPrevWord = w[w.length - n];
|
|
|
|
final int length = nthPrevWord.length();
|
|
|
|
if (length <= 0) return null;
|
2012-06-08 10:44:38 +00:00
|
|
|
|
|
|
|
// If ends in a separator, return null
|
2012-10-03 06:19:43 +00:00
|
|
|
final char lastChar = nthPrevWord.charAt(length - 1);
|
2012-06-08 10:44:38 +00:00
|
|
|
if (sentenceSeperators.contains(String.valueOf(lastChar))) return null;
|
|
|
|
|
2012-10-03 06:19:43 +00:00
|
|
|
return nthPrevWord;
|
2012-06-08 10:44:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @param separators characters which may separate words
|
|
|
|
* @return the word that surrounds the cursor, including up to one trailing
|
|
|
|
* separator. For example, if the field contains "he|llo world", where |
|
|
|
|
* represents the cursor, then "hello " will be returned.
|
|
|
|
*/
|
2013-04-10 07:38:37 +00:00
|
|
|
public CharSequence getWordAtCursor(String separators) {
|
2012-06-08 10:44:38 +00:00
|
|
|
// getWordRangeAtCursor returns null if the connection is null
|
2013-06-25 08:28:39 +00:00
|
|
|
TextRange r = getWordRangeAtCursor(separators, 0);
|
2012-06-08 10:44:38 +00:00
|
|
|
return (r == null) ? null : r.mWord;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the text surrounding the cursor.
|
|
|
|
*
|
|
|
|
* @param sep a string of characters that split words.
|
|
|
|
* @param additionalPrecedingWordsCount the number of words before the current word that should
|
|
|
|
* be included in the returned range
|
|
|
|
* @return a range containing the text surrounding the cursor
|
|
|
|
*/
|
2013-06-25 08:28:39 +00:00
|
|
|
public TextRange getWordRangeAtCursor(final String sep,
|
|
|
|
final int additionalPrecedingWordsCount) {
|
2012-07-05 03:36:06 +00:00
|
|
|
mIC = mParent.getCurrentInputConnection();
|
2012-06-08 10:44:38 +00:00
|
|
|
if (mIC == null || sep == null) {
|
|
|
|
return null;
|
|
|
|
}
|
2013-04-10 07:38:37 +00:00
|
|
|
final CharSequence before = mIC.getTextBeforeCursor(1000,
|
|
|
|
InputConnection.GET_TEXT_WITH_STYLES);
|
|
|
|
final CharSequence after = mIC.getTextAfterCursor(1000,
|
|
|
|
InputConnection.GET_TEXT_WITH_STYLES);
|
2012-06-08 10:44:38 +00:00
|
|
|
if (before == null || after == null) {
|
|
|
|
return null;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Going backward, alternate skipping non-separators and separators until enough words
|
|
|
|
// have been read.
|
2012-10-03 06:19:43 +00:00
|
|
|
int count = additionalPrecedingWordsCount;
|
2012-12-27 06:29:39 +00:00
|
|
|
int startIndexInBefore = before.length();
|
2012-06-08 10:44:38 +00:00
|
|
|
boolean isStoppingAtWhitespace = true; // toggles to indicate what to stop at
|
|
|
|
while (true) { // see comments below for why this is guaranteed to halt
|
2012-12-27 06:29:39 +00:00
|
|
|
while (startIndexInBefore > 0) {
|
|
|
|
final int codePoint = Character.codePointBefore(before, startIndexInBefore);
|
2012-06-08 10:44:38 +00:00
|
|
|
if (isStoppingAtWhitespace == isSeparator(codePoint, sep)) {
|
|
|
|
break; // inner loop
|
|
|
|
}
|
2012-12-27 06:29:39 +00:00
|
|
|
--startIndexInBefore;
|
2012-06-08 10:44:38 +00:00
|
|
|
if (Character.isSupplementaryCodePoint(codePoint)) {
|
2012-12-27 06:29:39 +00:00
|
|
|
--startIndexInBefore;
|
2012-06-08 10:44:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
// isStoppingAtWhitespace is true every other time through the loop,
|
|
|
|
// so additionalPrecedingWordsCount is guaranteed to become < 0, which
|
|
|
|
// guarantees outer loop termination
|
2012-10-03 06:19:43 +00:00
|
|
|
if (isStoppingAtWhitespace && (--count < 0)) {
|
2012-06-08 10:44:38 +00:00
|
|
|
break; // outer loop
|
|
|
|
}
|
|
|
|
isStoppingAtWhitespace = !isStoppingAtWhitespace;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Find last word separator after the cursor
|
2012-12-27 06:29:39 +00:00
|
|
|
int endIndexInAfter = -1;
|
|
|
|
while (++endIndexInAfter < after.length()) {
|
|
|
|
final int codePoint = Character.codePointAt(after, endIndexInAfter);
|
2012-06-08 10:44:38 +00:00
|
|
|
if (isSeparator(codePoint, sep)) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (Character.isSupplementaryCodePoint(codePoint)) {
|
2012-12-27 06:29:39 +00:00
|
|
|
++endIndexInAfter;
|
2012-06-08 10:44:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-25 08:28:39 +00:00
|
|
|
return new TextRange(TextUtils.concat(before, after), startIndexInBefore,
|
2013-06-20 09:58:58 +00:00
|
|
|
before.length() + endIndexInAfter, before.length());
|
2012-06-08 10:44:38 +00:00
|
|
|
}
|
|
|
|
|
2012-06-08 11:23:13 +00:00
|
|
|
public boolean isCursorTouchingWord(final SettingsValues settingsValues) {
|
2012-10-03 06:19:43 +00:00
|
|
|
final CharSequence before = getTextBeforeCursor(1, 0);
|
|
|
|
final CharSequence after = getTextAfterCursor(1, 0);
|
2012-06-08 11:23:13 +00:00
|
|
|
if (!TextUtils.isEmpty(before) && !settingsValues.isWordSeparator(before.charAt(0))
|
2013-01-11 11:23:48 +00:00
|
|
|
&& !settingsValues.isWordConnector(before.charAt(0))) {
|
2012-06-08 11:23:13 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
if (!TextUtils.isEmpty(after) && !settingsValues.isWordSeparator(after.charAt(0))
|
2013-01-11 11:23:48 +00:00
|
|
|
&& !settingsValues.isWordConnector(after.charAt(0))) {
|
2012-06-08 11:23:13 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
public void removeTrailingSpace() {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-06-08 11:23:13 +00:00
|
|
|
final CharSequence lastOne = getTextBeforeCursor(1, 0);
|
|
|
|
if (lastOne != null && lastOne.length() == 1
|
2012-10-29 05:46:34 +00:00
|
|
|
&& lastOne.charAt(0) == Constants.CODE_SPACE) {
|
2012-06-08 11:23:13 +00:00
|
|
|
deleteSurroundingText(1, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-06-08 12:45:41 +00:00
|
|
|
public boolean sameAsTextBeforeCursor(final CharSequence text) {
|
|
|
|
final CharSequence beforeText = getTextBeforeCursor(text.length(), 0);
|
|
|
|
return TextUtils.equals(text, beforeText);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* (non-javadoc)
|
|
|
|
* Returns the word before the cursor if the cursor is at the end of a word, null otherwise
|
|
|
|
*/
|
|
|
|
public CharSequence getWordBeforeCursorIfAtEndOfWord(final SettingsValues settings) {
|
|
|
|
// Bail out if the cursor is in the middle of a word (cursor must be followed by whitespace,
|
|
|
|
// separator or end of line/text)
|
|
|
|
// Example: "test|"<EOL> "te|st" get rejected here
|
|
|
|
final CharSequence textAfterCursor = getTextAfterCursor(1, 0);
|
|
|
|
if (!TextUtils.isEmpty(textAfterCursor)
|
|
|
|
&& !settings.isWordSeparator(textAfterCursor.charAt(0))) return null;
|
|
|
|
|
|
|
|
// Bail out if word before cursor is 0-length or a single non letter (like an apostrophe)
|
|
|
|
// Example: " -|" gets rejected here but "e-|" and "e|" are okay
|
|
|
|
CharSequence word = getWordAtCursor(settings.mWordSeparators);
|
|
|
|
// We don't suggest on leading single quotes, so we have to remove them from the word if
|
|
|
|
// it starts with single quotes.
|
2012-10-29 05:46:34 +00:00
|
|
|
while (!TextUtils.isEmpty(word) && Constants.CODE_SINGLE_QUOTE == word.charAt(0)) {
|
2012-06-08 12:45:41 +00:00
|
|
|
word = word.subSequence(1, word.length());
|
|
|
|
}
|
|
|
|
if (TextUtils.isEmpty(word)) return null;
|
2012-06-25 06:58:53 +00:00
|
|
|
// Find the last code point of the string
|
|
|
|
final int lastCodePoint = Character.codePointBefore(word, word.length());
|
|
|
|
// If for some reason the text field contains non-unicode binary data, or if the
|
|
|
|
// charsequence is exactly one char long and the contents is a low surrogate, return null.
|
|
|
|
if (!Character.isDefined(lastCodePoint)) return null;
|
|
|
|
// Bail out if the cursor is not at the end of a word (cursor must be preceded by
|
|
|
|
// non-whitespace, non-separator, non-start-of-text)
|
|
|
|
// Example ("|" is the cursor here) : <SOL>"|a" " |a" " | " all get rejected here.
|
|
|
|
if (settings.isWordSeparator(lastCodePoint)) return null;
|
2012-06-08 12:45:41 +00:00
|
|
|
final char firstChar = word.charAt(0); // we just tested that word is not empty
|
|
|
|
if (word.length() == 1 && !Character.isLetter(firstChar)) return null;
|
|
|
|
|
2013-01-11 11:23:48 +00:00
|
|
|
// We don't restart suggestion if the first character is not a letter, because we don't
|
|
|
|
// start composing when the first character is not a letter.
|
|
|
|
if (!Character.isLetter(firstChar)) return null;
|
2012-06-08 12:45:41 +00:00
|
|
|
|
|
|
|
return word;
|
|
|
|
}
|
2012-06-08 12:50:34 +00:00
|
|
|
|
2012-08-31 02:09:28 +00:00
|
|
|
public boolean revertDoubleSpacePeriod() {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-06-08 12:50:34 +00:00
|
|
|
// Here we test whether we indeed have a period and a space before us. This should not
|
|
|
|
// be needed, but it's there just in case something went wrong.
|
|
|
|
final CharSequence textBeforeCursor = getTextBeforeCursor(2, 0);
|
2012-12-23 23:12:51 +00:00
|
|
|
final String periodSpace = ". ";
|
2013-07-26 08:06:32 +00:00
|
|
|
if (!TextUtils.equals(periodSpace, textBeforeCursor)) {
|
2012-06-08 12:50:34 +00:00
|
|
|
// Theoretically we should not be coming here if there isn't ". " before the
|
|
|
|
// cursor, but the application may be changing the text while we are typing, so
|
|
|
|
// anything goes. We should not crash.
|
|
|
|
Log.d(TAG, "Tried to revert double-space combo but we didn't find "
|
2012-12-23 23:12:51 +00:00
|
|
|
+ "\"" + periodSpace + "\" just before the cursor.");
|
2012-06-08 12:50:34 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
deleteSurroundingText(2, 0);
|
2012-08-28 17:26:21 +00:00
|
|
|
final String doubleSpace = " ";
|
|
|
|
commitText(doubleSpace, 1);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-12-23 23:12:51 +00:00
|
|
|
ResearchLogger.richInputConnection_revertDoubleSpacePeriod();
|
2012-08-28 17:26:21 +00:00
|
|
|
}
|
2012-06-08 12:50:34 +00:00
|
|
|
return true;
|
|
|
|
}
|
2012-06-08 12:56:44 +00:00
|
|
|
|
|
|
|
public boolean revertSwapPunctuation() {
|
2012-10-01 07:03:21 +00:00
|
|
|
if (DEBUG_BATCH_NESTING) checkBatchEdit();
|
2012-06-08 12:56:44 +00:00
|
|
|
// Here we test whether we indeed have a space and something else before us. This should not
|
|
|
|
// be needed, but it's there just in case something went wrong.
|
|
|
|
final CharSequence textBeforeCursor = getTextBeforeCursor(2, 0);
|
|
|
|
// NOTE: This does not work with surrogate pairs. Hopefully when the keyboard is able to
|
|
|
|
// enter surrogate pairs this code will have been removed.
|
|
|
|
if (TextUtils.isEmpty(textBeforeCursor)
|
2012-10-29 05:46:34 +00:00
|
|
|
|| (Constants.CODE_SPACE != textBeforeCursor.charAt(1))) {
|
2012-06-08 12:56:44 +00:00
|
|
|
// We may only come here if the application is changing the text while we are typing.
|
|
|
|
// This is quite a broken case, but not logically impossible, so we shouldn't crash,
|
|
|
|
// but some debugging log may be in order.
|
|
|
|
Log.d(TAG, "Tried to revert a swap of punctuation but we didn't "
|
|
|
|
+ "find a space just before the cursor.");
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
deleteSurroundingText(2, 0);
|
2012-08-28 17:26:21 +00:00
|
|
|
final String text = " " + textBeforeCursor.subSequence(0, 1);
|
|
|
|
commitText(text, 1);
|
2013-03-18 09:21:18 +00:00
|
|
|
if (ProductionFlag.USES_DEVELOPMENT_ONLY_DIAGNOSTICS) {
|
2012-12-23 23:12:51 +00:00
|
|
|
ResearchLogger.richInputConnection_revertSwapPunctuation();
|
2012-08-28 17:26:21 +00:00
|
|
|
}
|
2012-06-08 12:56:44 +00:00
|
|
|
return true;
|
|
|
|
}
|
2012-09-12 03:40:36 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Heuristic to determine if this is an expected update of the cursor.
|
|
|
|
*
|
|
|
|
* Sometimes updates to the cursor position are late because of their asynchronous nature.
|
|
|
|
* This method tries to determine if this update is one, based on the values of the cursor
|
|
|
|
* position in the update, and the currently expected position of the cursor according to
|
|
|
|
* LatinIME's internal accounting. If this is not a belated expected update, then it should
|
|
|
|
* mean that the user moved the cursor explicitly.
|
|
|
|
* This is quite robust, but of course it's not perfect. In particular, it will fail in the
|
|
|
|
* case we get an update A, the user types in N characters so as to move the cursor to A+N but
|
|
|
|
* we don't get those, and then the user places the cursor between A and A+N, and we get only
|
|
|
|
* this update and not the ones in-between. This is almost impossible to achieve even trying
|
|
|
|
* very very hard.
|
|
|
|
*
|
|
|
|
* @param oldSelStart The value of the old cursor position in the update.
|
|
|
|
* @param newSelStart The value of the new cursor position in the update.
|
|
|
|
* @return whether this is a belated expected update or not.
|
|
|
|
*/
|
|
|
|
public boolean isBelatedExpectedUpdate(final int oldSelStart, final int newSelStart) {
|
|
|
|
// If this is an update that arrives at our expected position, it's a belated update.
|
|
|
|
if (newSelStart == mCurrentCursorPosition) return true;
|
|
|
|
// If this is an update that moves the cursor from our expected position, it must be
|
|
|
|
// an explicit move.
|
|
|
|
if (oldSelStart == mCurrentCursorPosition) return false;
|
|
|
|
// The following returns true if newSelStart is between oldSelStart and
|
|
|
|
// mCurrentCursorPosition. We assume that if the updated position is between the old
|
|
|
|
// position and the expected position, then it must be a belated update.
|
|
|
|
return (newSelStart - oldSelStart) * (mCurrentCursorPosition - newSelStart) >= 0;
|
|
|
|
}
|
2013-04-15 08:33:48 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Looks at the text just before the cursor to find out if it looks like a URL.
|
|
|
|
*
|
|
|
|
* The weakest point here is, if we don't have enough text bufferized, we may fail to realize
|
|
|
|
* we are in URL situation, but other places in this class have the same limitation and it
|
|
|
|
* does not matter too much in the practice.
|
|
|
|
*/
|
|
|
|
public boolean textBeforeCursorLooksLikeURL() {
|
|
|
|
return StringUtils.lastPartLooksLikeURL(mCommittedTextBeforeComposingText);
|
|
|
|
}
|
2012-06-08 10:04:09 +00:00
|
|
|
}
|