aboutsummaryrefslogtreecommitdiffstats
path: root/native/jni/src/proximity_info_state.cpp
diff options
context:
space:
mode:
authorKen Wakasa <kwakasa@google.com>2012-12-10 23:36:22 +0900
committerKen Wakasa <kwakasa@google.com>2012-12-10 23:41:45 +0900
commit082507e1da56c6cefe575ec3d6a334e9b717e3fa (patch)
treea43fbb3d4bfe50bfe412309174d2761ea55df863 /native/jni/src/proximity_info_state.cpp
parentfc799ba03c53869a62a46544c3c2524a66cda328 (diff)
downloadlatinime-082507e1da56c6cefe575ec3d6a334e9b717e3fa.tar.gz
latinime-082507e1da56c6cefe575ec3d6a334e9b717e3fa.tar.xz
latinime-082507e1da56c6cefe575ec3d6a334e9b717e3fa.zip
Header clean up
Change-Id: If9b2ea4ed8c1c4cf73463f0ac4bc63d4bb8cba42
Diffstat (limited to 'native/jni/src/proximity_info_state.cpp')
-rw-r--r--native/jni/src/proximity_info_state.cpp7
1 files changed, 3 insertions, 4 deletions
diff --git a/native/jni/src/proximity_info_state.cpp b/native/jni/src/proximity_info_state.cpp
index 78791757f..39d53fb52 100644
--- a/native/jni/src/proximity_info_state.cpp
+++ b/native/jni/src/proximity_info_state.cpp
@@ -16,7 +16,6 @@
#include <cstring> // for memset()
#include <sstream> // for debug prints
-#include <stdint.h>
#define LOG_TAG "LatinIME: proximity_info_state.cpp"
@@ -758,8 +757,8 @@ float ProximityInfoState::calculateSquaredDistanceFromSweetSpotCenter(
}
// Puts possible characters into filter and returns new filter size.
-int32_t ProximityInfoState::getAllPossibleChars(
- const size_t index, int32_t *const filter, const int32_t filterSize) const {
+int ProximityInfoState::getAllPossibleChars(
+ const size_t index, int *const filter, const int filterSize) const {
if (index >= mSampledInputXs.size()) {
return filterSize;
}
@@ -767,7 +766,7 @@ int32_t ProximityInfoState::getAllPossibleChars(
const int keyCount = mProximityInfo->getKeyCount();
for (int j = 0; j < keyCount; ++j) {
if (mSearchKeysVector[index].test(j)) {
- const int32_t keyCodePoint = mProximityInfo->getCodePointOf(j);
+ const int keyCodePoint = mProximityInfo->getCodePointOf(j);
bool insert = true;
// TODO: Avoid linear search
for (int k = 0; k < filterSize; ++k) {