blob: 742e388e4421ecfd8c988ba355db8117441bcfd2 [file] [log] [blame]
satoke808e432010-12-02 14:53:24 +09001/*
Ken Wakasaa10b1a82013-01-08 17:23:43 +09002 * Copyright (C) 2010 The Android Open Source Project
Ken Wakasa0bbb9172012-07-25 17:51:43 +09003 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
Ken Wakasaa10b1a82013-01-08 17:23:43 +09008 * http://www.apache.org/licenses/LICENSE-2.0
Ken Wakasa0bbb9172012-07-25 17:51:43 +09009 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
satoke808e432010-12-02 14:53:24 +090016
17#ifndef LATINIME_DEFINES_H
18#define LATINIME_DEFINES_H
19
Ken Wakasa1ce96fe2012-11-15 19:09:11 +090020#ifdef __GNUC__
21#define AK_FORCE_INLINE __attribute__((always_inline)) __inline__
22#else // __GNUC__
23#define AK_FORCE_INLINE inline
24#endif // __GNUC__
25
Ken Wakasa6cee61d2013-01-15 16:15:48 +090026#if defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
27#undef AK_FORCE_INLINE
28#define AK_FORCE_INLINE inline
29#endif // defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
30
Ken Wakasa6c224392013-01-22 13:14:53 +090031// Must be equal to Constants.Dictionary.MAX_WORD_LENGTH in Java
Ken Wakasa5db594a2013-01-12 01:18:00 +090032#define MAX_WORD_LENGTH 48
Ken Wakasa6c224392013-01-22 13:14:53 +090033// Must be equal to BinaryDictionary.MAX_RESULTS in Java
Ken Wakasa5db594a2013-01-12 01:18:00 +090034#define MAX_RESULTS 18
Ken Wakasa6c224392013-01-22 13:14:53 +090035// Must be equal to ProximityInfo.MAX_PROXIMITY_CHARS_SIZE in Java
36#define MAX_PROXIMITY_CHARS_SIZE 16
37#define ADDITIONAL_PROXIMITY_CHAR_DELIMITER_CODE 2
Jean Chalard7eba0192013-06-27 17:31:13 +090038#define NELEMS(x) (sizeof(x) / sizeof((x)[0]))
39
40AK_FORCE_INLINE static int intArrayToCharArray(const int *const source, const int sourceSize,
41 char *dest, const int destSize) {
42 // We want to always terminate with a 0 char, so stop one short of the length to make
43 // sure there is room.
44 const int destLimit = destSize - 1;
45 int si = 0;
46 int di = 0;
47 while (si < sourceSize && di < destLimit && 0 != source[si]) {
48 const int codePoint = source[si++];
49 if (codePoint < 0x7F) { // One byte
50 dest[di++] = codePoint;
51 } else if (codePoint < 0x7FF) { // Two bytes
52 if (di + 1 >= destLimit) break;
53 dest[di++] = 0xC0 + (codePoint >> 6);
54 dest[di++] = 0x80 + (codePoint & 0x3F);
55 } else if (codePoint < 0xFFFF) { // Three bytes
56 if (di + 2 >= destLimit) break;
57 dest[di++] = 0xE0 + (codePoint >> 12);
58 dest[di++] = 0x80 + ((codePoint >> 6) & 0x3F);
59 dest[di++] = 0x80 + (codePoint & 0x3F);
60 } else if (codePoint <= 0x1FFFFF) { // Four bytes
61 if (di + 3 >= destLimit) break;
62 dest[di++] = 0xF0 + (codePoint >> 18);
63 dest[di++] = 0x80 + ((codePoint >> 12) & 0x3F);
64 dest[di++] = 0x80 + ((codePoint >> 6) & 0x3F);
65 dest[di++] = 0x80 + (codePoint & 0x3F);
66 } else if (codePoint <= 0x3FFFFFF) { // Five bytes
67 if (di + 4 >= destLimit) break;
68 dest[di++] = 0xF8 + (codePoint >> 24);
69 dest[di++] = 0x80 + ((codePoint >> 18) & 0x3F);
70 dest[di++] = 0x80 + ((codePoint >> 12) & 0x3F);
71 dest[di++] = 0x80 + ((codePoint >> 6) & 0x3F);
72 dest[di++] = codePoint & 0x3F;
73 } else if (codePoint <= 0x7FFFFFFF) { // Six bytes
74 if (di + 5 >= destLimit) break;
75 dest[di++] = 0xFC + (codePoint >> 30);
76 dest[di++] = 0x80 + ((codePoint >> 24) & 0x3F);
77 dest[di++] = 0x80 + ((codePoint >> 18) & 0x3F);
78 dest[di++] = 0x80 + ((codePoint >> 12) & 0x3F);
79 dest[di++] = 0x80 + ((codePoint >> 6) & 0x3F);
80 dest[di++] = codePoint & 0x3F;
81 } else {
82 // Not a code point... skip.
83 }
84 }
85 dest[di] = 0;
86 return di;
87}
Satoshi Kataoka42217382012-12-17 23:28:17 +090088
satok827ced82011-07-14 09:01:09 +090089#if defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
Ken Wakasae3f26dd2012-07-27 18:06:06 +090090#include <android/log.h>
91#ifndef LOG_TAG
92#define LOG_TAG "LatinIME: "
Ken Wakasa6cee61d2013-01-15 16:15:48 +090093#endif // LOG_TAG
Ken Wakasae3f26dd2012-07-27 18:06:06 +090094#define AKLOGE(fmt, ...) __android_log_print(ANDROID_LOG_ERROR, LOG_TAG, fmt, ##__VA_ARGS__)
95#define AKLOGI(fmt, ...) __android_log_print(ANDROID_LOG_INFO, LOG_TAG, fmt, ##__VA_ARGS__)
satok6ad15fc2012-01-16 16:21:21 +090096
Ken Wakasa5db594a2013-01-12 01:18:00 +090097#define DUMP_RESULT(words, frequencies) do { dumpResult(words, frequencies); } while (0)
Ken Wakasaf2789812012-09-04 12:49:46 +090098#define DUMP_WORD(word, length) do { dumpWord(word, length); } while (0)
Jean Chalard7eba0192013-06-27 17:31:13 +090099#define INTS_TO_CHARS(input, length, output, outlength) do { \
100 intArrayToCharArray(input, length, output, outlength); } while (0)
Satoshi Kataoka42217382012-12-17 23:28:17 +0900101
Ken Wakasa1e614932012-10-29 18:06:22 +0900102static inline void dumpWordInfo(const int *word, const int length, const int rank,
Satoshi Kataokae0e67372013-03-18 13:08:31 +0900103 const int probability) {
Satoshi Kataoka586b0ca2012-08-06 11:20:54 +0900104 static char charBuf[50];
Jean Chalard7eba0192013-06-27 17:31:13 +0900105 const int N = intArrayToCharArray(word, length, charBuf, NELEMS(charBuf));
Satoshi Kataoka42217382012-12-17 23:28:17 +0900106 if (N > 1) {
Satoshi Kataokae0e67372013-03-18 13:08:31 +0900107 AKLOGI("%2d [ %s ] (%d)", rank, charBuf, probability);
Satoshi Kataoka586b0ca2012-08-06 11:20:54 +0900108 }
109}
110
Ken Wakasa5db594a2013-01-12 01:18:00 +0900111static inline void dumpResult(const int *outWords, const int *frequencies) {
Satoshi Kataoka586b0ca2012-08-06 11:20:54 +0900112 AKLOGI("--- DUMP RESULT ---------");
Ken Wakasa5db594a2013-01-12 01:18:00 +0900113 for (int i = 0; i < MAX_RESULTS; ++i) {
114 dumpWordInfo(&outWords[i * MAX_WORD_LENGTH], MAX_WORD_LENGTH, i, frequencies[i]);
Satoshi Kataoka586b0ca2012-08-06 11:20:54 +0900115 }
116 AKLOGI("-------------------------");
117}
118
Ken Wakasa1ce96fe2012-11-15 19:09:11 +0900119static AK_FORCE_INLINE void dumpWord(const int *word, const int length) {
Tadashi G. Takaokad1dbdb62012-03-06 15:35:46 +0900120 static char charBuf[50];
Jean Chalard7eba0192013-06-27 17:31:13 +0900121 const int N = intArrayToCharArray(word, length, charBuf, NELEMS(charBuf));
Satoshi Kataoka42217382012-12-17 23:28:17 +0900122 if (N > 1) {
Satoshi Kataoka586b0ca2012-08-06 11:20:54 +0900123 AKLOGI("[ %s ]", charBuf);
124 }
satok6ad15fc2012-01-16 16:21:21 +0900125}
126
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900127#ifndef __ANDROID__
Satoshi Kataoka1c8fc832012-09-06 21:31:54 +0900128#include <cassert>
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900129#include <execinfo.h>
130#include <stdlib.h>
Satoshi Kataoka1c8fc832012-09-06 21:31:54 +0900131
Satoshi Kataokadd4d9382013-01-09 12:54:39 +0900132#define DO_ASSERT_TEST
Satoshi Kataoka1c8fc832012-09-06 21:31:54 +0900133#define ASSERT(success) do { if (!(success)) { showStackTrace(); assert(success);} } while (0)
134#define SHOW_STACK_TRACE do { showStackTrace(); } while (0)
135
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900136static inline void showStackTrace() {
137 void *callstack[128];
138 int i, frames = backtrace(callstack, 128);
139 char **strs = backtrace_symbols(callstack, frames);
140 for (i = 0; i < frames; ++i) {
141 if (i == 0) {
142 AKLOGI("=== Trace ===");
143 continue;
144 }
145 AKLOGI("%s", strs[i]);
146 }
147 free(strs);
148}
Ken Wakasa6cee61d2013-01-15 16:15:48 +0900149#else // __ANDROID__
Satoshi Kataoka1c8fc832012-09-06 21:31:54 +0900150#include <cassert>
Satoshi Kataokadd4d9382013-01-09 12:54:39 +0900151#define DO_ASSERT_TEST
Satoshi Kataoka1c8fc832012-09-06 21:31:54 +0900152#define ASSERT(success) assert(success)
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900153#define SHOW_STACK_TRACE
Ken Wakasa6cee61d2013-01-15 16:15:48 +0900154#endif // __ANDROID__
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900155
Ken Wakasa6cee61d2013-01-15 16:15:48 +0900156#else // defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
satok9fb6f472012-01-13 18:01:22 +0900157#define AKLOGE(fmt, ...)
158#define AKLOGI(fmt, ...)
Ken Wakasa5db594a2013-01-12 01:18:00 +0900159#define DUMP_RESULT(words, frequencies)
satok6ad15fc2012-01-16 16:21:21 +0900160#define DUMP_WORD(word, length)
Satoshi Kataokadd4d9382013-01-09 12:54:39 +0900161#undef DO_ASSERT_TEST
Satoshi Kataoka5540acb2012-09-03 18:35:32 +0900162#define ASSERT(success)
163#define SHOW_STACK_TRACE
Ken Wakasa1e614932012-10-29 18:06:22 +0900164#define INTS_TO_CHARS(input, length, output)
Ken Wakasa6cee61d2013-01-15 16:15:48 +0900165#endif // defined(FLAG_DO_PROFILE) || defined(FLAG_DBG)
satok827ced82011-07-14 09:01:09 +0900166
satok20d9fda2011-07-13 14:40:30 +0900167#ifdef FLAG_DO_PROFILE
satok61e2f852011-01-05 14:13:07 +0900168// Profiler
169#include <time.h>
satok9fb6f472012-01-13 18:01:22 +0900170
satok61e2f852011-01-05 14:13:07 +0900171#define PROF_BUF_SIZE 100
satok0028ed32012-05-16 20:42:12 +0900172static float profile_buf[PROF_BUF_SIZE];
173static float profile_old[PROF_BUF_SIZE];
satok61e2f852011-01-05 14:13:07 +0900174static unsigned int profile_counter[PROF_BUF_SIZE];
175
Ken Wakasae90b3332011-01-07 15:01:51 +0900176#define PROF_RESET prof_reset()
177#define PROF_COUNT(prof_buf_id) ++profile_counter[prof_buf_id]
Ken Wakasaf2789812012-09-04 12:49:46 +0900178#define PROF_OPEN do { PROF_RESET; PROF_START(PROF_BUF_SIZE - 1); } while (0)
Ken Wakasae90b3332011-01-07 15:01:51 +0900179#define PROF_START(prof_buf_id) do { \
Ken Wakasaf2789812012-09-04 12:49:46 +0900180 PROF_COUNT(prof_buf_id); profile_old[prof_buf_id] = (clock()); } while (0)
181#define PROF_CLOSE do { PROF_END(PROF_BUF_SIZE - 1); PROF_OUTALL; } while (0)
Ken Wakasae90b3332011-01-07 15:01:51 +0900182#define PROF_END(prof_buf_id) profile_buf[prof_buf_id] += ((clock()) - profile_old[prof_buf_id])
183#define PROF_CLOCKOUT(prof_buf_id) \
satok9fb6f472012-01-13 18:01:22 +0900184 AKLOGI("%s : clock is %f", __FUNCTION__, (clock() - profile_old[prof_buf_id]))
Ken Wakasaf2789812012-09-04 12:49:46 +0900185#define PROF_OUTALL do { AKLOGI("--- %s ---", __FUNCTION__); prof_out(); } while (0)
satok61e2f852011-01-05 14:13:07 +0900186
Tadashi G. Takaokad1dbdb62012-03-06 15:35:46 +0900187static inline void prof_reset(void) {
Ken Wakasae90b3332011-01-07 15:01:51 +0900188 for (int i = 0; i < PROF_BUF_SIZE; ++i) {
satok61e2f852011-01-05 14:13:07 +0900189 profile_buf[i] = 0;
190 profile_old[i] = 0;
191 profile_counter[i] = 0;
192 }
193}
194
Tadashi G. Takaokad1dbdb62012-03-06 15:35:46 +0900195static inline void prof_out(void) {
satok61e2f852011-01-05 14:13:07 +0900196 if (profile_counter[PROF_BUF_SIZE - 1] != 1) {
satok9fb6f472012-01-13 18:01:22 +0900197 AKLOGI("Error: You must call PROF_OPEN before PROF_CLOSE.");
satok61e2f852011-01-05 14:13:07 +0900198 }
satok9fb6f472012-01-13 18:01:22 +0900199 AKLOGI("Total time is %6.3f ms.",
Ken Wakasa77e8e812012-08-02 19:48:08 +0900200 profile_buf[PROF_BUF_SIZE - 1] * 1000.0f / static_cast<float>(CLOCKS_PER_SEC));
Ken Wakasa2a6f58d2012-11-27 19:40:38 +0900201 float all = 0.0f;
Ken Wakasae90b3332011-01-07 15:01:51 +0900202 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
satok61e2f852011-01-05 14:13:07 +0900203 all += profile_buf[i];
204 }
Ken Wakasa2a6f58d2012-11-27 19:40:38 +0900205 if (all < 1.0f) all = 1.0f;
Ken Wakasae90b3332011-01-07 15:01:51 +0900206 for (int i = 0; i < PROF_BUF_SIZE - 1; ++i) {
Ken Wakasa2a6f58d2012-11-27 19:40:38 +0900207 if (profile_buf[i] > 0.0f) {
satok9fb6f472012-01-13 18:01:22 +0900208 AKLOGI("(%d): Used %4.2f%%, %8.4f ms. Called %d times.",
Ken Wakasa2a6f58d2012-11-27 19:40:38 +0900209 i, (profile_buf[i] * 100.0f / all),
Ken Wakasa77e8e812012-08-02 19:48:08 +0900210 profile_buf[i] * 1000.0f / static_cast<float>(CLOCKS_PER_SEC),
211 profile_counter[i]);
Ken Wakasae90b3332011-01-07 15:01:51 +0900212 }
satok61e2f852011-01-05 14:13:07 +0900213 }
214}
215
satok20d9fda2011-07-13 14:40:30 +0900216#else // FLAG_DO_PROFILE
satok61e2f852011-01-05 14:13:07 +0900217#define PROF_BUF_SIZE 0
218#define PROF_RESET
219#define PROF_COUNT(prof_buf_id)
220#define PROF_OPEN
221#define PROF_START(prof_buf_id)
222#define PROF_CLOSE
223#define PROF_END(prof_buf_id)
224#define PROF_CLOCK_OUT(prof_buf_id)
225#define PROF_CLOCKOUT(prof_buf_id)
226#define PROF_OUTALL
227
satok20d9fda2011-07-13 14:40:30 +0900228#endif // FLAG_DO_PROFILE
229
230#ifdef FLAG_DBG
satok20d9fda2011-07-13 14:40:30 +0900231#define DEBUG_DICT true
232#define DEBUG_DICT_FULL false
satok0cedd2b2011-08-12 01:05:27 +0900233#define DEBUG_EDIT_DISTANCE false
satok20d9fda2011-07-13 14:40:30 +0900234#define DEBUG_NODE DEBUG_DICT_FULL
235#define DEBUG_TRACE DEBUG_DICT_FULL
satok1a6da632011-12-16 23:15:06 +0900236#define DEBUG_PROXIMITY_INFO false
satok0cb20972012-03-13 22:07:56 +0900237#define DEBUG_PROXIMITY_CHARS false
satok10266c02011-08-19 22:05:59 +0900238#define DEBUG_CORRECTION false
satok29dc8062012-01-17 15:59:15 +0900239#define DEBUG_CORRECTION_FREQ false
Satoshi Kataoka0ed8c6e2012-12-04 16:28:06 +0900240#define DEBUG_SAMPLING_POINTS false
241#define DEBUG_POINTS_PROBABILITY false
242#define DEBUG_DOUBLE_LETTER false
Satoshi Kataokabc25b802013-02-21 21:54:21 +0900243#define DEBUG_CACHE false
244#define DEBUG_DUMP_ERROR false
Satoshi Kataoka8b3009e2013-04-10 11:45:12 +0900245#define DEBUG_EVALUATE_MOST_PROBABLE_STRING false
satok20d9fda2011-07-13 14:40:30 +0900246
Satoshi Kataoka952ec492012-09-11 15:51:38 +0900247#ifdef FLAG_FULL_DBG
248#define DEBUG_GEO_FULL true
249#else
Satoshi Kataoka23a57ea2012-09-10 17:59:17 +0900250#define DEBUG_GEO_FULL false
Satoshi Kataoka952ec492012-09-11 15:51:38 +0900251#endif
Satoshi Kataoka23a57ea2012-09-10 17:59:17 +0900252
satok20d9fda2011-07-13 14:40:30 +0900253#else // FLAG_DBG
satok827ced82011-07-14 09:01:09 +0900254
satok20d9fda2011-07-13 14:40:30 +0900255#define DEBUG_DICT false
256#define DEBUG_DICT_FULL false
satok0cedd2b2011-08-12 01:05:27 +0900257#define DEBUG_EDIT_DISTANCE false
satok20d9fda2011-07-13 14:40:30 +0900258#define DEBUG_NODE false
259#define DEBUG_TRACE false
260#define DEBUG_PROXIMITY_INFO false
satok0cb20972012-03-13 22:07:56 +0900261#define DEBUG_PROXIMITY_CHARS false
satok10266c02011-08-19 22:05:59 +0900262#define DEBUG_CORRECTION false
263#define DEBUG_CORRECTION_FREQ false
Keisuke Kuroyanagi806eba42012-10-09 19:57:08 +0900264#define DEBUG_SAMPLING_POINTS false
265#define DEBUG_POINTS_PROBABILITY false
Satoshi Kataoka9af53352012-11-16 23:06:41 +0900266#define DEBUG_DOUBLE_LETTER false
Satoshi Kataokabc25b802013-02-21 21:54:21 +0900267#define DEBUG_CACHE false
268#define DEBUG_DUMP_ERROR false
Satoshi Kataoka8b3009e2013-04-10 11:45:12 +0900269#define DEBUG_EVALUATE_MOST_PROBABLE_STRING false
satok20d9fda2011-07-13 14:40:30 +0900270
Satoshi Kataoka23a57ea2012-09-10 17:59:17 +0900271#define DEBUG_GEO_FULL false
272
satoke808e432010-12-02 14:53:24 +0900273#endif // FLAG_DBG
274
Jean Chalarda5d58492011-02-18 17:50:58 +0900275#ifndef S_INT_MAX
satok3c4bb772011-03-04 22:50:19 -0800276#define S_INT_MAX 2147483647 // ((1 << 31) - 1)
Jean Chalarda5d58492011-02-18 17:50:58 +0900277#endif
Jean Chalard592f2b32012-11-20 21:19:26 +0900278#ifndef S_INT_MIN
279// The literal constant -2147483648 does not work in C prior C90, because
280// the compiler tries to fit the positive number into an int and then negate it.
281// GCC warns about this.
282#define S_INT_MIN (-2147483647 - 1) // -(1 << 31)
283#endif
Satoshi Kataokaee62b782013-01-21 18:29:27 +0900284
Ken Wakasa6c224392013-01-22 13:14:53 +0900285#define M_PI_F 3.14159265f
Satoshi Kataokaee62b782013-01-21 18:29:27 +0900286#define MAX_PERCENTILE 100
287
Jean Chalard22025c62012-11-29 17:33:53 +0900288// Number of base-10 digits in the largest integer + 1 to leave room for a zero terminator.
289// As such, this is the maximum number of characters will be needed to represent an int as a
290// string, including the terminator; this is used as the size of a string buffer large enough to
291// hold any value that is intended to fit in an integer, e.g. in the code that reads the header
292// of the binary dictionary where a {key,value} string pair scheme is used.
293#define LARGEST_INT_DIGIT_COUNT 11
satok662fe692010-12-08 17:05:39 +0900294
Ken Wakasaf2789812012-09-04 12:49:46 +0900295#define NOT_A_CODE_POINT (-1)
296#define NOT_A_DISTANCE (-1)
297#define NOT_A_COORDINATE (-1)
Ken Wakasaf2789812012-09-04 12:49:46 +0900298#define NOT_AN_INDEX (-1)
299#define NOT_A_PROBABILITY (-1)
Keisuke Kuroynagi68e7edf2013-06-27 12:53:31 +0900300#define NOT_A_DICT_POS (S_INT_MIN)
Jean Chalard459cd6f2013-10-01 17:30:40 +0900301
Jean Chalardbb570902013-09-30 21:39:43 +0900302// A special value to mean the first word confidence makes no sense in this case,
303// e.g. this is not a multi-word suggestion.
Jean Chalard459cd6f2013-10-01 17:30:40 +0900304#define NOT_A_FIRST_WORD_CONFIDENCE (S_INT_MAX)
305// How high the confidence needs to be for us to auto-commit. Arbitrary.
306// This needs to be the same as CONFIDENCE_FOR_AUTO_COMMIT in BinaryDictionary.java
307#define CONFIDENCE_FOR_AUTO_COMMIT (1000000)
308// 80% of the full confidence
309#define DISTANCE_WEIGHT_FOR_AUTO_COMMIT (80 * CONFIDENCE_FOR_AUTO_COMMIT / 100)
310// 100% of the full confidence
311#define LENGTH_WEIGHT_FOR_AUTO_COMMIT (CONFIDENCE_FOR_AUTO_COMMIT)
312// 80% of the full confidence
313#define SPACE_COUNT_WEIGHT_FOR_AUTO_COMMIT (80 * CONFIDENCE_FOR_AUTO_COMMIT / 100)
satoke808e432010-12-02 14:53:24 +0900314
satok817e5172011-03-04 06:06:45 -0800315#define KEYCODE_SPACE ' '
Ken Wakasa1e614932012-10-29 18:06:22 +0900316#define KEYCODE_SINGLE_QUOTE '\''
317#define KEYCODE_HYPHEN_MINUS '-'
satok817e5172011-03-04 06:06:45 -0800318
Tom Ouyang31f7ece2013-02-21 15:42:05 -0800319#define SUGGEST_INTERFACE_OUTPUT_SCALE 1000000.0f
Satoshi Kataokae0e67372013-03-18 13:08:31 +0900320#define MAX_PROBABILITY 255
321#define MAX_BIGRAM_ENCODED_PROBABILITY 15
satoke808e432010-12-02 14:53:24 +0900322
Ken Wakasa9e0c7112012-08-09 22:26:58 +0900323// Assuming locale strings such as en_US, sr-Latn etc.
324#define MAX_LOCALE_STRING_LENGTH 10
325
Satoshi Kataoka830ba672013-03-05 14:12:06 +0900326// Max value for length, distance and probability which are used in weighting
327// TODO: Remove
328#define MAX_VALUE_FOR_WEIGHTING 10000000
Satoshi Kataoka687a2442012-08-23 15:46:43 +0900329
Keisuke Kuroyanagi95a49a52012-09-04 17:00:24 +0900330// The max number of the keys in one keyboard layout
331#define MAX_KEY_COUNT_IN_A_KEYBOARD 64
332
Ken Wakasa5150e152012-09-27 19:21:25 +0900333// TODO: Remove
Satoshi Kataokafe4f1ce2012-12-10 17:17:52 +0900334#define MAX_POINTER_COUNT 1
Satoshi Kataoka99eae8e2013-01-30 20:55:31 +0900335#define MAX_POINTER_COUNT_G 2
Ken Wakasa5150e152012-09-27 19:21:25 +0900336
Ken Wakasa871b8c92013-01-31 18:05:26 +0900337template<typename T> AK_FORCE_INLINE const T &min(const T &a, const T &b) { return a < b ? a : b; }
338template<typename T> AK_FORCE_INLINE const T &max(const T &a, const T &b) { return a > b ? a : b; }
satokf5cded12010-12-06 21:28:24 +0900339
satoke05b3f42012-01-31 17:15:43 +0900340// DEBUG
Ken Wakasaf2789812012-09-04 12:49:46 +0900341#define INPUTLENGTH_FOR_DEBUG (-1)
342#define MIN_OUTPUT_INDEX_FOR_DEBUG (-1)
satoke05b3f42012-01-31 17:15:43 +0900343
satok1bc038c2012-06-14 11:25:50 -0700344#define DISALLOW_COPY_AND_ASSIGN(TypeName) \
345 TypeName(const TypeName&); \
346 void operator=(const TypeName&)
347
348#define DISALLOW_IMPLICIT_CONSTRUCTORS(TypeName) \
349 TypeName(); \
350 DISALLOW_COPY_AND_ASSIGN(TypeName)
351
Satoshi Kataoka3e8c58f2012-06-05 17:55:52 +0900352// Used as a return value for character comparison
353typedef enum {
354 // Same char, possibly with different case or accent
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900355 MATCH_CHAR,
Satoshi Kataoka3e8c58f2012-06-05 17:55:52 +0900356 // It is a char located nearby on the keyboard
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900357 PROXIMITY_CHAR,
Satoshi Kataoka3e8c58f2012-06-05 17:55:52 +0900358 // Additional proximity char which can differ by language.
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900359 ADDITIONAL_PROXIMITY_CHAR,
360 // It is a substitution char
361 SUBSTITUTION_CHAR,
362 // It is an unrelated char
363 UNRELATED_CHAR,
Satoshi Kataoka3e8c58f2012-06-05 17:55:52 +0900364} ProximityType;
Satoshi Kataoka6ae8dd42012-11-22 20:15:40 +0900365
366typedef enum {
367 NOT_A_DOUBLE_LETTER,
368 A_DOUBLE_LETTER,
369 A_STRONG_DOUBLE_LETTER
370} DoubleLetterLevel;
Satoshi Kataokad8708912013-03-04 17:05:28 +0900371
372typedef enum {
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900373 // Correction for MATCH_CHAR
Satoshi Kataokad8708912013-03-04 17:05:28 +0900374 CT_MATCH,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900375 // Correction for PROXIMITY_CHAR
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900376 CT_PROXIMITY,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900377 // Correction for ADDITIONAL_PROXIMITY_CHAR
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900378 CT_ADDITIONAL_PROXIMITY,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900379 // Correction for SUBSTITUTION_CHAR
Satoshi Kataokaf4425aa2013-03-07 13:06:32 +0900380 CT_SUBSTITUTION,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900381 // Skip one omitted letter
Satoshi Kataokad8708912013-03-04 17:05:28 +0900382 CT_OMISSION,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900383 // Delete an unnecessarily inserted letter
Satoshi Kataokad8708912013-03-04 17:05:28 +0900384 CT_INSERTION,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900385 // Swap the order of next two touch points
Satoshi Kataokad8708912013-03-04 17:05:28 +0900386 CT_TRANSPOSITION,
Satoshi Kataokad8708912013-03-04 17:05:28 +0900387 CT_COMPLETION,
388 CT_TERMINAL,
Satoshi Kataoka75322ce2013-06-14 18:40:59 +0900389 CT_TERMINAL_INSERTION,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900390 // Create new word with space omission
Jean Chalardda06e382013-09-30 18:41:55 +0900391 CT_NEW_WORD_SPACE_OMISSION,
Keisuke Kuroynagi911f3262013-04-24 20:21:18 +0900392 // Create new word with space substitution
Satoshi Kataoka252412d2013-04-16 14:39:30 +0900393 CT_NEW_WORD_SPACE_SUBSTITUTION,
Satoshi Kataokad8708912013-03-04 17:05:28 +0900394} CorrectionType;
Keisuke Kuroynagi60a169f2013-04-25 16:47:38 +0900395
396// ErrorType is mainly decided by CorrectionType but it is also depending on if
397// the correction has really been performed or not.
398typedef enum {
399 // Substitution, omission and transposition
400 ET_EDIT_CORRECTION,
401 // Proximity error
402 ET_PROXIMITY_CORRECTION,
403 // Completion
404 ET_COMPLETION,
405 // New word
406 // TODO: Remove.
407 // A new word error should be an edit correction error or a proximity correction error.
408 ET_NEW_WORD,
409 // Treat error as an intentional omission when the CorrectionType is omission and the node can
410 // be intentional omission.
411 ET_INTENTIONAL_OMISSION,
412 // Not treated as an error. Tracked for checking exact match
413 ET_NOT_AN_ERROR
414} ErrorType;
satoke808e432010-12-02 14:53:24 +0900415#endif // LATINIME_DEFINES_H