2011-02-22 08:28:55 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2011 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.
|
|
|
|
*/
|
|
|
|
|
2012-07-31 08:56:40 +00:00
|
|
|
#include <cassert>
|
|
|
|
#include <cmath>
|
|
|
|
#include <cstring>
|
2012-03-13 07:33:47 +00:00
|
|
|
#include <string>
|
2011-02-22 08:28:55 +00:00
|
|
|
|
2011-03-04 14:06:45 +00:00
|
|
|
#define LOG_TAG "LatinIME: proximity_info.cpp"
|
|
|
|
|
2012-03-13 07:33:47 +00:00
|
|
|
#include "additional_proximity_chars.h"
|
2012-08-02 10:48:08 +00:00
|
|
|
#include "char_utils.h"
|
2012-05-16 14:05:32 +00:00
|
|
|
#include "defines.h"
|
2012-08-08 11:43:47 +00:00
|
|
|
#include "jni.h"
|
2011-02-22 08:28:55 +00:00
|
|
|
#include "proximity_info.h"
|
|
|
|
|
|
|
|
namespace latinime {
|
2011-06-18 04:09:55 +00:00
|
|
|
|
2012-08-08 11:43:47 +00:00
|
|
|
static inline void safeGetOrFillZeroIntArrayRegion(JNIEnv *env, jintArray jArray, jsize len,
|
|
|
|
jint *buffer) {
|
|
|
|
if (jArray && buffer) {
|
|
|
|
env->GetIntArrayRegion(jArray, 0, len, buffer);
|
|
|
|
} else if (buffer) {
|
|
|
|
memset(buffer, 0, len);
|
2011-09-27 02:15:18 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-08-08 11:43:47 +00:00
|
|
|
static inline void safeGetOrFillZeroFloatArrayRegion(JNIEnv *env, jfloatArray jArray, jsize len,
|
|
|
|
jfloat *buffer) {
|
|
|
|
if (jArray && buffer) {
|
|
|
|
env->GetFloatArrayRegion(jArray, 0, len, buffer);
|
|
|
|
} else if (buffer) {
|
|
|
|
memset(buffer, 0, len);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ProximityInfo::ProximityInfo(JNIEnv *env, const char *localeCStr, const int maxProximityCharsSize,
|
2012-03-13 07:33:47 +00:00
|
|
|
const int keyboardWidth, const int keyboardHeight, const int gridWidth,
|
2012-08-08 11:43:47 +00:00
|
|
|
const int gridHeight, const int mostCommonKeyWidth, const jintArray proximityChars,
|
|
|
|
const int keyCount, const jintArray keyXCoordinates, const jintArray keyYCoordinates,
|
|
|
|
const jintArray keyWidths, const jintArray keyHeights, const jintArray keyCharCodes,
|
|
|
|
const jfloatArray sweetSpotCenterXs, const jfloatArray sweetSpotCenterYs,
|
|
|
|
const jfloatArray sweetSpotRadii)
|
2011-03-04 14:06:45 +00:00
|
|
|
: MAX_PROXIMITY_CHARS_SIZE(maxProximityCharsSize), KEYBOARD_WIDTH(keyboardWidth),
|
|
|
|
KEYBOARD_HEIGHT(keyboardHeight), GRID_WIDTH(gridWidth), GRID_HEIGHT(gridHeight),
|
2012-03-07 06:12:22 +00:00
|
|
|
MOST_COMMON_KEY_WIDTH_SQUARE(mostCommonKeyWidth * mostCommonKeyWidth),
|
2011-03-04 14:06:45 +00:00
|
|
|
CELL_WIDTH((keyboardWidth + gridWidth - 1) / gridWidth),
|
2011-09-21 03:02:47 +00:00
|
|
|
CELL_HEIGHT((keyboardHeight + gridHeight - 1) / gridHeight),
|
2011-09-28 03:59:43 +00:00
|
|
|
KEY_COUNT(min(keyCount, MAX_KEY_COUNT_IN_A_KEYBOARD)),
|
2011-10-06 10:12:20 +00:00
|
|
|
HAS_TOUCH_POSITION_CORRECTION_DATA(keyCount > 0 && keyXCoordinates && keyYCoordinates
|
|
|
|
&& keyWidths && keyHeights && keyCharCodes && sweetSpotCenterXs
|
|
|
|
&& sweetSpotCenterYs && sweetSpotRadii),
|
2012-08-08 07:46:16 +00:00
|
|
|
mLocaleStr(localeCStr) {
|
2012-06-13 23:07:54 +00:00
|
|
|
const int proximityGridLength = GRID_WIDTH * GRID_HEIGHT * MAX_PROXIMITY_CHARS_SIZE;
|
2011-03-04 14:06:45 +00:00
|
|
|
if (DEBUG_PROXIMITY_INFO) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("Create proximity info array %d", proximityGridLength);
|
2011-03-04 14:06:45 +00:00
|
|
|
}
|
2012-06-05 08:55:52 +00:00
|
|
|
mProximityCharsArray = new int32_t[proximityGridLength];
|
2012-08-08 11:43:47 +00:00
|
|
|
safeGetOrFillZeroIntArrayRegion(env, proximityChars, proximityGridLength, mProximityCharsArray);
|
|
|
|
safeGetOrFillZeroIntArrayRegion(env, keyXCoordinates, KEY_COUNT, mKeyXCoordinates);
|
|
|
|
safeGetOrFillZeroIntArrayRegion(env, keyYCoordinates, KEY_COUNT, mKeyYCoordinates);
|
|
|
|
safeGetOrFillZeroIntArrayRegion(env, keyWidths, KEY_COUNT, mKeyWidths);
|
|
|
|
safeGetOrFillZeroIntArrayRegion(env, keyHeights, KEY_COUNT, mKeyHeights);
|
|
|
|
safeGetOrFillZeroIntArrayRegion(env, keyCharCodes, KEY_COUNT, mKeyCharCodes);
|
|
|
|
safeGetOrFillZeroFloatArrayRegion(env, sweetSpotCenterXs, KEY_COUNT, mSweetSpotCenterXs);
|
|
|
|
safeGetOrFillZeroFloatArrayRegion(env, sweetSpotCenterYs, KEY_COUNT, mSweetSpotCenterYs);
|
|
|
|
safeGetOrFillZeroFloatArrayRegion(env, sweetSpotRadii, KEY_COUNT, mSweetSpotRadii);
|
2011-09-21 03:02:47 +00:00
|
|
|
initializeCodeToKeyIndex();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Build the reversed look up table from the char code to the index in mKeyXCoordinates,
|
|
|
|
// mKeyYCoordinates, mKeyWidths, mKeyHeights, mKeyCharCodes.
|
|
|
|
void ProximityInfo::initializeCodeToKeyIndex() {
|
2011-09-29 07:44:54 +00:00
|
|
|
memset(mCodeToKeyIndex, -1, (MAX_CHAR_CODE + 1) * sizeof(mCodeToKeyIndex[0]));
|
2011-09-21 03:02:47 +00:00
|
|
|
for (int i = 0; i < KEY_COUNT; ++i) {
|
|
|
|
const int code = mKeyCharCodes[i];
|
2011-09-29 07:44:54 +00:00
|
|
|
if (0 <= code && code <= MAX_CHAR_CODE) {
|
2011-09-21 03:02:47 +00:00
|
|
|
mCodeToKeyIndex[code] = i;
|
2011-09-29 07:44:54 +00:00
|
|
|
}
|
2011-09-21 03:02:47 +00:00
|
|
|
}
|
2011-02-22 08:28:55 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
ProximityInfo::~ProximityInfo() {
|
|
|
|
delete[] mProximityCharsArray;
|
|
|
|
}
|
2011-03-04 14:06:45 +00:00
|
|
|
|
|
|
|
inline int ProximityInfo::getStartIndexFromCoordinates(const int x, const int y) const {
|
2011-03-05 06:50:19 +00:00
|
|
|
return ((y / CELL_HEIGHT) * GRID_WIDTH + (x / CELL_WIDTH))
|
2011-03-04 14:06:45 +00:00
|
|
|
* MAX_PROXIMITY_CHARS_SIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool ProximityInfo::hasSpaceProximity(const int x, const int y) const {
|
2011-12-15 13:29:05 +00:00
|
|
|
if (x < 0 || y < 0) {
|
|
|
|
if (DEBUG_DICT) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("HasSpaceProximity: Illegal coordinates (%d, %d)", x, y);
|
2011-12-16 14:15:06 +00:00
|
|
|
assert(false);
|
2011-12-15 13:29:05 +00:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2011-03-04 14:06:45 +00:00
|
|
|
const int startIndex = getStartIndexFromCoordinates(x, y);
|
|
|
|
if (DEBUG_PROXIMITY_INFO) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("hasSpaceProximity: index %d, %d, %d", startIndex, x, y);
|
2011-03-04 14:06:45 +00:00
|
|
|
}
|
2012-07-25 08:51:43 +00:00
|
|
|
int32_t *proximityCharsArray = mProximityCharsArray;
|
2011-03-04 14:06:45 +00:00
|
|
|
for (int i = 0; i < MAX_PROXIMITY_CHARS_SIZE; ++i) {
|
|
|
|
if (DEBUG_PROXIMITY_INFO) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("Index: %d", mProximityCharsArray[startIndex + i]);
|
2011-03-04 14:06:45 +00:00
|
|
|
}
|
2012-06-05 08:55:52 +00:00
|
|
|
if (proximityCharsArray[startIndex + i] == KEYCODE_SPACE) {
|
2011-03-04 14:06:45 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
2011-02-22 08:28:55 +00:00
|
|
|
}
|
2011-06-18 04:09:55 +00:00
|
|
|
|
2012-03-23 07:05:18 +00:00
|
|
|
int ProximityInfo::squaredDistanceToEdge(const int keyId, const int x, const int y) const {
|
2012-03-22 08:39:27 +00:00
|
|
|
if (keyId < 0) return true; // NOT_A_ID is -1, but return whenever < 0 just in case
|
2012-03-07 06:12:22 +00:00
|
|
|
const int left = mKeyXCoordinates[keyId];
|
|
|
|
const int top = mKeyYCoordinates[keyId];
|
2012-03-14 14:17:12 +00:00
|
|
|
const int right = left + mKeyWidths[keyId];
|
2012-03-07 06:12:22 +00:00
|
|
|
const int bottom = top + mKeyHeights[keyId];
|
|
|
|
const int edgeX = x < left ? left : (x > right ? right : x);
|
|
|
|
const int edgeY = y < top ? top : (y > bottom ? bottom : y);
|
|
|
|
const int dx = x - edgeX;
|
|
|
|
const int dy = y - edgeY;
|
|
|
|
return dx * dx + dy * dy;
|
|
|
|
}
|
|
|
|
|
|
|
|
void ProximityInfo::calculateNearbyKeyCodes(
|
2012-03-23 07:05:18 +00:00
|
|
|
const int x, const int y, const int32_t primaryKey, int *inputCodes) const {
|
2012-06-05 08:55:52 +00:00
|
|
|
int32_t *proximityCharsArray = mProximityCharsArray;
|
2012-03-07 06:12:22 +00:00
|
|
|
int insertPos = 0;
|
|
|
|
inputCodes[insertPos++] = primaryKey;
|
|
|
|
const int startIndex = getStartIndexFromCoordinates(x, y);
|
2012-03-23 10:38:23 +00:00
|
|
|
if (startIndex >= 0) {
|
2012-03-23 10:25:10 +00:00
|
|
|
for (int i = 0; i < MAX_PROXIMITY_CHARS_SIZE; ++i) {
|
2012-06-05 08:55:52 +00:00
|
|
|
const int32_t c = proximityCharsArray[startIndex + i];
|
2012-03-23 10:25:10 +00:00
|
|
|
if (c < KEYCODE_SPACE || c == primaryKey) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
const int keyIndex = getKeyIndex(c);
|
|
|
|
const bool onKey = isOnKey(keyIndex, x, y);
|
|
|
|
const int distance = squaredDistanceToEdge(keyIndex, x, y);
|
|
|
|
if (onKey || distance < MOST_COMMON_KEY_WIDTH_SQUARE) {
|
|
|
|
inputCodes[insertPos++] = c;
|
|
|
|
if (insertPos >= MAX_PROXIMITY_CHARS_SIZE) {
|
|
|
|
if (DEBUG_DICT) {
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
return;
|
2012-03-13 13:07:56 +00:00
|
|
|
}
|
2012-03-07 06:12:22 +00:00
|
|
|
}
|
|
|
|
}
|
2012-03-23 10:25:10 +00:00
|
|
|
const int additionalProximitySize =
|
|
|
|
AdditionalProximityChars::getAdditionalCharsSize(&mLocaleStr, primaryKey);
|
|
|
|
if (additionalProximitySize > 0) {
|
|
|
|
inputCodes[insertPos++] = ADDITIONAL_PROXIMITY_CHAR_DELIMITER_CODE;
|
|
|
|
if (insertPos >= MAX_PROXIMITY_CHARS_SIZE) {
|
2012-03-23 10:36:07 +00:00
|
|
|
if (DEBUG_DICT) {
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
return;
|
2012-03-14 14:17:12 +00:00
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
const int32_t *additionalProximityChars =
|
2012-03-23 10:25:10 +00:00
|
|
|
AdditionalProximityChars::getAdditionalChars(&mLocaleStr, primaryKey);
|
|
|
|
for (int j = 0; j < additionalProximitySize; ++j) {
|
|
|
|
const int32_t ac = additionalProximityChars[j];
|
|
|
|
int k = 0;
|
|
|
|
for (; k < insertPos; ++k) {
|
|
|
|
if ((int)ac == inputCodes[k]) {
|
|
|
|
break;
|
|
|
|
}
|
2012-03-13 09:26:23 +00:00
|
|
|
}
|
2012-03-23 10:25:10 +00:00
|
|
|
if (k < insertPos) {
|
|
|
|
continue;
|
2012-03-13 13:07:56 +00:00
|
|
|
}
|
2012-03-23 10:25:10 +00:00
|
|
|
inputCodes[insertPos++] = ac;
|
|
|
|
if (insertPos >= MAX_PROXIMITY_CHARS_SIZE) {
|
|
|
|
if (DEBUG_DICT) {
|
|
|
|
assert(false);
|
|
|
|
}
|
|
|
|
return;
|
2012-03-23 10:36:07 +00:00
|
|
|
}
|
2012-03-13 13:07:56 +00:00
|
|
|
}
|
2012-03-13 09:26:23 +00:00
|
|
|
}
|
2012-03-23 10:38:23 +00:00
|
|
|
}
|
2012-03-13 13:07:56 +00:00
|
|
|
// Add a delimiter for the proximity characters
|
2012-03-14 14:17:12 +00:00
|
|
|
for (int i = insertPos; i < MAX_PROXIMITY_CHARS_SIZE; ++i) {
|
|
|
|
inputCodes[i] = NOT_A_CODE;
|
|
|
|
}
|
2012-03-07 06:12:22 +00:00
|
|
|
}
|
|
|
|
|
2011-10-06 10:12:20 +00:00
|
|
|
int ProximityInfo::getKeyIndex(const int c) const {
|
2012-03-14 14:17:12 +00:00
|
|
|
if (KEY_COUNT == 0) {
|
2011-10-06 10:12:20 +00:00
|
|
|
// We do not have the coordinate data
|
2012-03-23 08:05:03 +00:00
|
|
|
return NOT_AN_INDEX;
|
2011-10-04 08:04:07 +00:00
|
|
|
}
|
2011-11-11 05:26:13 +00:00
|
|
|
const unsigned short baseLowerC = toBaseLowerCase(c);
|
2011-10-06 10:12:20 +00:00
|
|
|
if (baseLowerC > MAX_CHAR_CODE) {
|
2012-03-23 08:05:03 +00:00
|
|
|
return NOT_AN_INDEX;
|
2011-10-04 08:04:07 +00:00
|
|
|
}
|
2011-10-06 10:12:20 +00:00
|
|
|
return mCodeToKeyIndex[baseLowerC];
|
2011-10-04 08:04:07 +00:00
|
|
|
}
|
2012-06-27 05:52:40 +00:00
|
|
|
|
|
|
|
// TODO: [Staging] Optimize
|
|
|
|
void ProximityInfo::getCenters(int *centerXs, int *centerYs, int *codeToKeyIndex,
|
|
|
|
int *keyToCodeIndex, int *keyCount, int *keyWidth) const {
|
|
|
|
*keyCount = KEY_COUNT;
|
2012-08-02 10:48:08 +00:00
|
|
|
*keyWidth = sqrt(static_cast<float>(MOST_COMMON_KEY_WIDTH_SQUARE));
|
2012-06-27 05:52:40 +00:00
|
|
|
|
|
|
|
for (int i = 0; i < KEY_COUNT; ++i) {
|
|
|
|
const int code = mKeyCharCodes[i];
|
|
|
|
const int lowerCode = toBaseLowerCase(code);
|
|
|
|
centerXs[i] = mKeyXCoordinates[i] + mKeyWidths[i] / 2;
|
|
|
|
centerYs[i] = mKeyYCoordinates[i] + mKeyHeights[i] / 2;
|
|
|
|
codeToKeyIndex[code] = i;
|
|
|
|
if (code != lowerCode && lowerCode >= 0 && lowerCode <= MAX_CHAR_CODE) {
|
|
|
|
codeToKeyIndex[lowerCode] = i;
|
|
|
|
keyToCodeIndex[i] = lowerCode;
|
|
|
|
} else {
|
|
|
|
keyToCodeIndex[i] = code;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-06-18 04:09:55 +00:00
|
|
|
} // namespace latinime
|