2010-09-01 14:18:39 +00:00
|
|
|
/*
|
2011-05-20 03:09:57 +00:00
|
|
|
* Copyright (C) 2010 The Android Open Source Project
|
2010-09-01 14:18:39 +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
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2010-12-02 09:46:21 +00:00
|
|
|
package com.android.inputmethod.keyboard;
|
2010-09-01 14:18:39 +00:00
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
import android.util.Log;
|
|
|
|
|
2010-09-02 15:45:26 +00:00
|
|
|
import java.util.Arrays;
|
2010-09-01 14:18:39 +00:00
|
|
|
import java.util.List;
|
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
public class KeyDetector {
|
|
|
|
private static final String TAG = KeyDetector.class.getSimpleName();
|
|
|
|
private static final boolean DEBUG = false;
|
2010-09-03 05:46:14 +00:00
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
public static final int NOT_A_CODE = -1;
|
2011-11-29 07:56:27 +00:00
|
|
|
private static final int NOT_A_KEY = -1;
|
2010-09-03 05:46:14 +00:00
|
|
|
|
2011-07-04 10:59:57 +00:00
|
|
|
private final int mKeyHysteresisDistanceSquared;
|
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
private Keyboard mKeyboard;
|
|
|
|
private int mCorrectionX;
|
|
|
|
private int mCorrectionY;
|
|
|
|
private boolean mProximityCorrectOn;
|
|
|
|
private int mProximityThresholdSquare;
|
2010-09-03 05:46:14 +00:00
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
// working area
|
|
|
|
private static final int MAX_NEARBY_KEYS = 12;
|
|
|
|
private final int[] mDistances = new int[MAX_NEARBY_KEYS];
|
|
|
|
private final int[] mIndices = new int[MAX_NEARBY_KEYS];
|
2010-09-01 14:18:39 +00:00
|
|
|
|
2011-07-04 10:59:57 +00:00
|
|
|
/**
|
|
|
|
* This class handles key detection.
|
|
|
|
*
|
|
|
|
* @param keyHysteresisDistance if the pointer movement distance is smaller than this, the
|
|
|
|
* movement will not been handled as meaningful movement. The unit is pixel.
|
|
|
|
*/
|
|
|
|
public KeyDetector(float keyHysteresisDistance) {
|
|
|
|
mKeyHysteresisDistanceSquared = (int)(keyHysteresisDistance * keyHysteresisDistance);
|
|
|
|
}
|
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
public void setKeyboard(Keyboard keyboard, float correctionX, float correctionY) {
|
2010-09-01 14:18:39 +00:00
|
|
|
if (keyboard == null)
|
|
|
|
throw new NullPointerException();
|
2010-09-02 12:54:26 +00:00
|
|
|
mCorrectionX = (int)correctionX;
|
|
|
|
mCorrectionY = (int)correctionY;
|
2010-09-01 14:18:39 +00:00
|
|
|
mKeyboard = keyboard;
|
2011-07-29 00:05:40 +00:00
|
|
|
final int threshold = keyboard.mMostCommonKeyWidth;
|
2011-07-04 10:59:57 +00:00
|
|
|
mProximityThresholdSquare = threshold * threshold;
|
|
|
|
}
|
|
|
|
|
|
|
|
public int getKeyHysteresisDistanceSquared() {
|
|
|
|
return mKeyHysteresisDistanceSquared;
|
2010-09-01 14:18:39 +00:00
|
|
|
}
|
|
|
|
|
2010-09-02 12:54:26 +00:00
|
|
|
protected int getTouchX(int x) {
|
|
|
|
return x + mCorrectionX;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected int getTouchY(int y) {
|
|
|
|
return y + mCorrectionY;
|
|
|
|
}
|
|
|
|
|
2011-07-08 05:31:29 +00:00
|
|
|
public Keyboard getKeyboard() {
|
2011-04-15 04:05:58 +00:00
|
|
|
if (mKeyboard == null)
|
2010-09-02 15:45:26 +00:00
|
|
|
throw new IllegalStateException("keyboard isn't set");
|
2011-07-08 05:31:29 +00:00
|
|
|
return mKeyboard;
|
2010-09-02 15:45:26 +00:00
|
|
|
}
|
|
|
|
|
2010-09-01 14:18:39 +00:00
|
|
|
public void setProximityCorrectionEnabled(boolean enabled) {
|
|
|
|
mProximityCorrectOn = enabled;
|
|
|
|
}
|
|
|
|
|
|
|
|
public boolean isProximityCorrectionEnabled() {
|
|
|
|
return mProximityCorrectOn;
|
|
|
|
}
|
|
|
|
|
|
|
|
public void setProximityThreshold(int threshold) {
|
|
|
|
mProximityThresholdSquare = threshold * threshold;
|
|
|
|
}
|
|
|
|
|
2011-08-23 03:08:36 +00:00
|
|
|
public boolean alwaysAllowsSlidingInput() {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
/**
|
2011-11-29 07:56:27 +00:00
|
|
|
* Computes maximum size of the array that can contain all nearby key codes returned by
|
|
|
|
* {@link #getKeyAndNearbyCodes}.
|
2011-04-15 04:05:58 +00:00
|
|
|
*
|
2011-11-29 07:56:27 +00:00
|
|
|
* @return Returns maximum size of the array that can contain all nearby key codes returned
|
|
|
|
* by {@link #getKeyAndNearbyCodes}.
|
2011-04-15 04:05:58 +00:00
|
|
|
*/
|
|
|
|
protected int getMaxNearbyKeys() {
|
|
|
|
return MAX_NEARBY_KEYS;
|
|
|
|
}
|
|
|
|
|
2010-09-03 05:46:14 +00:00
|
|
|
/**
|
2011-11-29 07:56:27 +00:00
|
|
|
* Allocates array that can hold all key codes returned by {@link #getKeyAndNearbyCodes}
|
2010-09-03 05:46:14 +00:00
|
|
|
* method. The maximum size of the array should be computed by {@link #getMaxNearbyKeys}.
|
|
|
|
*
|
2011-11-29 07:56:27 +00:00
|
|
|
* @return Allocates and returns an array that can hold all key codes returned by
|
|
|
|
* {@link #getKeyAndNearbyCodes} method. All elements in the returned array are
|
2011-04-28 14:39:49 +00:00
|
|
|
* initialized by {@link #NOT_A_CODE} value.
|
2010-09-03 05:46:14 +00:00
|
|
|
*/
|
2010-09-02 15:45:26 +00:00
|
|
|
public int[] newCodeArray() {
|
|
|
|
int[] codes = new int[getMaxNearbyKeys()];
|
2011-04-28 14:39:49 +00:00
|
|
|
Arrays.fill(codes, NOT_A_CODE);
|
2010-09-02 15:45:26 +00:00
|
|
|
return codes;
|
|
|
|
}
|
|
|
|
|
2011-04-15 04:05:58 +00:00
|
|
|
private void initializeNearbyKeys() {
|
|
|
|
Arrays.fill(mDistances, Integer.MAX_VALUE);
|
|
|
|
Arrays.fill(mIndices, NOT_A_KEY);
|
|
|
|
}
|
|
|
|
|
2010-09-03 05:46:14 +00:00
|
|
|
/**
|
2011-04-15 04:05:58 +00:00
|
|
|
* Insert the key into nearby keys buffer and sort nearby keys by ascending order of distance.
|
2011-04-28 14:39:49 +00:00
|
|
|
* If the distance of two keys are the same, the key which the point is on should be considered
|
|
|
|
* as a closer one.
|
2010-09-03 05:46:14 +00:00
|
|
|
*
|
2011-04-15 04:05:58 +00:00
|
|
|
* @param keyIndex index of the key.
|
|
|
|
* @param distance distance between the key's edge and user touched point.
|
2011-04-28 14:39:49 +00:00
|
|
|
* @param isOnKey true if the point is on the key.
|
2011-04-15 04:05:58 +00:00
|
|
|
* @return order of the key in the nearby buffer, 0 if it is the nearest key.
|
2010-09-03 05:46:14 +00:00
|
|
|
*/
|
2011-04-28 14:39:49 +00:00
|
|
|
private int sortNearbyKeys(int keyIndex, int distance, boolean isOnKey) {
|
2011-04-15 04:05:58 +00:00
|
|
|
final int[] distances = mDistances;
|
|
|
|
final int[] indices = mIndices;
|
|
|
|
for (int insertPos = 0; insertPos < distances.length; insertPos++) {
|
2011-04-28 14:39:49 +00:00
|
|
|
final int comparingDistance = distances[insertPos];
|
|
|
|
if (distance < comparingDistance || (distance == comparingDistance && isOnKey)) {
|
2011-04-15 04:05:58 +00:00
|
|
|
final int nextPos = insertPos + 1;
|
|
|
|
if (nextPos < distances.length) {
|
|
|
|
System.arraycopy(distances, insertPos, distances, nextPos,
|
|
|
|
distances.length - nextPos);
|
|
|
|
System.arraycopy(indices, insertPos, indices, nextPos,
|
|
|
|
indices.length - nextPos);
|
|
|
|
}
|
|
|
|
distances[insertPos] = distance;
|
|
|
|
indices[insertPos] = keyIndex;
|
|
|
|
return insertPos;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return distances.length;
|
|
|
|
}
|
|
|
|
|
|
|
|
private void getNearbyKeyCodes(final int[] allCodes) {
|
2011-08-02 21:35:18 +00:00
|
|
|
final List<Key> keys = getKeyboard().mKeys;
|
2011-04-15 04:05:58 +00:00
|
|
|
final int[] indices = mIndices;
|
|
|
|
|
|
|
|
// allCodes[0] should always have the key code even if it is a non-letter key.
|
|
|
|
if (indices[0] == NOT_A_KEY) {
|
|
|
|
allCodes[0] = NOT_A_CODE;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
int numCodes = 0;
|
|
|
|
for (int j = 0; j < indices.length && numCodes < allCodes.length; j++) {
|
|
|
|
final int index = indices[j];
|
|
|
|
if (index == NOT_A_KEY)
|
|
|
|
break;
|
|
|
|
final int code = keys.get(index).mCode;
|
|
|
|
// filter out a non-letter key from nearby keys
|
|
|
|
if (code < Keyboard.CODE_SPACE)
|
|
|
|
continue;
|
|
|
|
allCodes[numCodes++] = code;
|
|
|
|
}
|
|
|
|
}
|
2010-09-01 14:18:39 +00:00
|
|
|
|
2010-09-03 05:46:14 +00:00
|
|
|
/**
|
2011-11-29 07:56:27 +00:00
|
|
|
* Finds all possible nearby key codes around a touch event point and returns the nearest key.
|
|
|
|
* The algorithm to determine the nearby keys depends on the threshold set by
|
2010-09-03 05:46:14 +00:00
|
|
|
* {@link #setProximityThreshold(int)} and the mode set by
|
|
|
|
* {@link #setProximityCorrectionEnabled(boolean)}.
|
|
|
|
*
|
|
|
|
* @param x The x-coordinate of a touch point
|
|
|
|
* @param y The y-coordinate of a touch point
|
2011-11-29 07:56:27 +00:00
|
|
|
* @param allCodes All nearby key codes except functional key are returned in this array
|
|
|
|
* @return The nearest key
|
2010-09-03 05:46:14 +00:00
|
|
|
*/
|
2011-11-29 07:56:27 +00:00
|
|
|
public Key getKeyAndNearbyCodes(int x, int y, final int[] allCodes) {
|
2011-08-02 21:35:18 +00:00
|
|
|
final List<Key> keys = getKeyboard().mKeys;
|
2011-04-15 04:05:58 +00:00
|
|
|
final int touchX = getTouchX(x);
|
|
|
|
final int touchY = getTouchY(y);
|
|
|
|
|
|
|
|
initializeNearbyKeys();
|
2011-11-29 07:56:27 +00:00
|
|
|
Key primaryKey = null;
|
2011-04-15 04:05:58 +00:00
|
|
|
for (final int index : mKeyboard.getNearestKeys(touchX, touchY)) {
|
|
|
|
final Key key = keys.get(index);
|
2011-04-28 14:39:49 +00:00
|
|
|
final boolean isOnKey = key.isOnKey(touchX, touchY);
|
2011-04-15 04:05:58 +00:00
|
|
|
final int distance = key.squaredDistanceToEdge(touchX, touchY);
|
2011-04-28 14:39:49 +00:00
|
|
|
if (isOnKey || (mProximityCorrectOn && distance < mProximityThresholdSquare)) {
|
|
|
|
final int insertedPosition = sortNearbyKeys(index, distance, isOnKey);
|
2011-11-29 07:56:27 +00:00
|
|
|
if (insertedPosition == 0 && isOnKey) {
|
|
|
|
primaryKey = key;
|
|
|
|
}
|
2011-04-15 04:05:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (allCodes != null && allCodes.length > 0) {
|
|
|
|
getNearbyKeyCodes(allCodes);
|
|
|
|
if (DEBUG) {
|
|
|
|
Log.d(TAG, "x=" + x + " y=" + y
|
2011-12-01 07:34:23 +00:00
|
|
|
+ " primary=" + printableCode(primaryKey)
|
|
|
|
+ " codes=" + printableCodes(allCodes));
|
2011-04-15 04:05:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-11-29 07:56:27 +00:00
|
|
|
return primaryKey;
|
2011-04-15 04:05:58 +00:00
|
|
|
}
|
2011-12-01 07:34:23 +00:00
|
|
|
|
|
|
|
public static String printableCode(Key key) {
|
|
|
|
return key != null ? printableCode(key.mCode) : "none";
|
|
|
|
}
|
|
|
|
|
|
|
|
public static String printableCode(int primaryCode) {
|
|
|
|
if (primaryCode < 0) return String.format("%4d", primaryCode);
|
|
|
|
if (primaryCode < 0x100) return String.format("\\u%02x", primaryCode);
|
|
|
|
return String.format("\\u04x", primaryCode);
|
|
|
|
}
|
|
|
|
|
|
|
|
public static String printableCodes(int[] codes) {
|
|
|
|
final StringBuilder sb = new StringBuilder();
|
|
|
|
for (final int code : codes) {
|
|
|
|
if (code == NOT_A_CODE) break;
|
|
|
|
if (sb.length() > 0) sb.append(", ");
|
|
|
|
sb.append(code);
|
|
|
|
}
|
|
|
|
return "[" + sb + "]";
|
|
|
|
}
|
2010-09-03 05:46:14 +00:00
|
|
|
}
|