2009-03-13 22:11:42 +00:00
|
|
|
/*
|
2010-03-26 22:07:10 +00:00
|
|
|
* Copyright (C) 2008 The Android Open Source Project
|
2009-03-13 22:11:42 +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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
package com.android.inputmethod.latin;
|
|
|
|
|
2010-11-29 08:57:48 +00:00
|
|
|
import android.content.Context;
|
|
|
|
import android.util.Log;
|
|
|
|
|
2010-08-20 05:35:02 +00:00
|
|
|
import java.io.IOException;
|
2010-11-29 08:57:48 +00:00
|
|
|
import java.io.InputStream;
|
2010-08-20 05:35:02 +00:00
|
|
|
import java.nio.ByteBuffer;
|
|
|
|
import java.nio.ByteOrder;
|
|
|
|
import java.nio.channels.Channels;
|
2009-03-13 22:11:42 +00:00
|
|
|
import java.util.Arrays;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Implements a static, compacted, binary dictionary of standard words.
|
|
|
|
*/
|
|
|
|
public class BinaryDictionary extends Dictionary {
|
|
|
|
|
2010-08-20 05:35:02 +00:00
|
|
|
/**
|
|
|
|
* There is difference between what java and native code can handle.
|
|
|
|
* This value should only be used in BinaryDictionary.java
|
|
|
|
* It is necessary to keep it at this value because some languages e.g. German have
|
|
|
|
* really long words.
|
|
|
|
*/
|
|
|
|
protected static final int MAX_WORD_LENGTH = 48;
|
|
|
|
|
|
|
|
private static final String TAG = "BinaryDictionary";
|
2009-03-13 22:11:42 +00:00
|
|
|
private static final int MAX_ALTERNATIVES = 16;
|
2010-08-20 05:35:02 +00:00
|
|
|
private static final int MAX_WORDS = 18;
|
|
|
|
private static final int MAX_BIGRAMS = 60;
|
2009-03-13 22:11:42 +00:00
|
|
|
|
|
|
|
private static final int TYPED_LETTER_MULTIPLIER = 2;
|
|
|
|
|
2010-08-20 05:35:02 +00:00
|
|
|
private int mDicTypeId;
|
2009-03-13 22:11:42 +00:00
|
|
|
private int mNativeDict;
|
2010-08-20 05:35:02 +00:00
|
|
|
private int mDictLength;
|
2010-12-01 12:22:15 +00:00
|
|
|
private final int[] mInputCodes = new int[MAX_WORD_LENGTH * MAX_ALTERNATIVES];
|
|
|
|
private final char[] mOutputChars = new char[MAX_WORD_LENGTH * MAX_WORDS];
|
|
|
|
private final char[] mOutputChars_bigrams = new char[MAX_WORD_LENGTH * MAX_BIGRAMS];
|
|
|
|
private final int[] mFrequencies = new int[MAX_WORDS];
|
|
|
|
private final int[] mFrequencies_bigrams = new int[MAX_BIGRAMS];
|
2010-08-20 05:35:02 +00:00
|
|
|
// Keep a reference to the native dict direct buffer in Java to avoid
|
|
|
|
// unexpected deallocation of the direct buffer.
|
|
|
|
private ByteBuffer mNativeDictDirectBuffer;
|
2009-03-13 22:11:42 +00:00
|
|
|
|
|
|
|
static {
|
|
|
|
try {
|
|
|
|
System.loadLibrary("jni_latinime");
|
|
|
|
} catch (UnsatisfiedLinkError ule) {
|
|
|
|
Log.e("BinaryDictionary", "Could not load native library jni_latinime");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a dictionary from a raw resource file
|
|
|
|
* @param context application context for reading resources
|
|
|
|
* @param resId the resource containing the raw binary dictionary
|
|
|
|
*/
|
2010-08-20 05:35:02 +00:00
|
|
|
public BinaryDictionary(Context context, int[] resId, int dicTypeId) {
|
|
|
|
if (resId != null && resId.length > 0 && resId[0] != 0) {
|
2009-03-13 22:11:42 +00:00
|
|
|
loadDictionary(context, resId);
|
|
|
|
}
|
2010-08-20 05:35:02 +00:00
|
|
|
mDicTypeId = dicTypeId;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a dictionary from a byte buffer. This is used for testing.
|
|
|
|
* @param context application context for reading resources
|
|
|
|
* @param byteBuffer a ByteBuffer containing the binary dictionary
|
|
|
|
*/
|
|
|
|
public BinaryDictionary(Context context, ByteBuffer byteBuffer, int dicTypeId) {
|
|
|
|
if (byteBuffer != null) {
|
|
|
|
if (byteBuffer.isDirect()) {
|
|
|
|
mNativeDictDirectBuffer = byteBuffer;
|
|
|
|
} else {
|
|
|
|
mNativeDictDirectBuffer = ByteBuffer.allocateDirect(byteBuffer.capacity());
|
|
|
|
byteBuffer.rewind();
|
|
|
|
mNativeDictDirectBuffer.put(byteBuffer);
|
|
|
|
}
|
|
|
|
mDictLength = byteBuffer.capacity();
|
|
|
|
mNativeDict = openNative(mNativeDictDirectBuffer,
|
2010-12-01 12:22:15 +00:00
|
|
|
TYPED_LETTER_MULTIPLIER, FULL_WORD_FREQ_MULTIPLIER,
|
|
|
|
MAX_WORD_LENGTH, MAX_WORDS, MAX_ALTERNATIVES);
|
2010-08-20 05:35:02 +00:00
|
|
|
}
|
|
|
|
mDicTypeId = dicTypeId;
|
2009-03-13 22:11:42 +00:00
|
|
|
}
|
|
|
|
|
2010-08-20 05:35:02 +00:00
|
|
|
private native int openNative(ByteBuffer bb, int typedLetterMultiplier,
|
2010-12-01 12:22:15 +00:00
|
|
|
int fullWordMultiplier, int maxWordLength, int maxWords, int maxAlternatives);
|
2009-03-13 22:11:42 +00:00
|
|
|
private native void closeNative(int dict);
|
|
|
|
private native boolean isValidWordNative(int nativeData, char[] word, int wordLength);
|
|
|
|
private native int getSuggestionsNative(int dict, int[] inputCodes, int codesSize,
|
2010-12-01 12:22:15 +00:00
|
|
|
char[] outputChars, int[] frequencies,
|
|
|
|
int[] nextLettersFrequencies, int nextLettersSize);
|
2010-08-20 05:35:02 +00:00
|
|
|
private native int getBigramsNative(int dict, char[] prevWord, int prevWordLength,
|
|
|
|
int[] inputCodes, int inputCodesLength, char[] outputChars, int[] frequencies,
|
|
|
|
int maxWordLength, int maxBigrams, int maxAlternatives);
|
|
|
|
|
|
|
|
private final void loadDictionary(Context context, int[] resId) {
|
|
|
|
InputStream[] is = null;
|
|
|
|
try {
|
|
|
|
// merging separated dictionary into one if dictionary is separated
|
|
|
|
int total = 0;
|
|
|
|
is = new InputStream[resId.length];
|
|
|
|
for (int i = 0; i < resId.length; i++) {
|
|
|
|
is[i] = context.getResources().openRawResource(resId[i]);
|
|
|
|
total += is[i].available();
|
|
|
|
}
|
|
|
|
|
|
|
|
mNativeDictDirectBuffer =
|
|
|
|
ByteBuffer.allocateDirect(total).order(ByteOrder.nativeOrder());
|
|
|
|
int got = 0;
|
|
|
|
for (int i = 0; i < resId.length; i++) {
|
|
|
|
got += Channels.newChannel(is[i]).read(mNativeDictDirectBuffer);
|
|
|
|
}
|
|
|
|
if (got != total) {
|
|
|
|
Log.e(TAG, "Read " + got + " bytes, expected " + total);
|
|
|
|
} else {
|
|
|
|
mNativeDict = openNative(mNativeDictDirectBuffer,
|
2010-12-01 12:22:15 +00:00
|
|
|
TYPED_LETTER_MULTIPLIER, FULL_WORD_FREQ_MULTIPLIER,
|
|
|
|
MAX_WORD_LENGTH, MAX_WORDS, MAX_ALTERNATIVES);
|
2010-08-20 05:35:02 +00:00
|
|
|
mDictLength = total;
|
|
|
|
}
|
|
|
|
} catch (IOException e) {
|
|
|
|
Log.w(TAG, "No available memory for binary dictionary");
|
|
|
|
} finally {
|
|
|
|
try {
|
|
|
|
if (is != null) {
|
|
|
|
for (int i = 0; i < is.length; i++) {
|
|
|
|
is[i].close();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} catch (IOException e) {
|
|
|
|
Log.w(TAG, "Failed to close input stream");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public void getBigrams(final WordComposer codes, final CharSequence previousWord,
|
|
|
|
final WordCallback callback, int[] nextLettersFrequencies) {
|
|
|
|
|
|
|
|
char[] chars = previousWord.toString().toCharArray();
|
|
|
|
Arrays.fill(mOutputChars_bigrams, (char) 0);
|
|
|
|
Arrays.fill(mFrequencies_bigrams, 0);
|
|
|
|
|
|
|
|
int codesSize = codes.size();
|
|
|
|
Arrays.fill(mInputCodes, -1);
|
|
|
|
int[] alternatives = codes.getCodesAt(0);
|
|
|
|
System.arraycopy(alternatives, 0, mInputCodes, 0,
|
|
|
|
Math.min(alternatives.length, MAX_ALTERNATIVES));
|
|
|
|
|
|
|
|
int count = getBigramsNative(mNativeDict, chars, chars.length, mInputCodes, codesSize,
|
|
|
|
mOutputChars_bigrams, mFrequencies_bigrams, MAX_WORD_LENGTH, MAX_BIGRAMS,
|
|
|
|
MAX_ALTERNATIVES);
|
|
|
|
|
2010-12-06 12:28:24 +00:00
|
|
|
for (int j = 0; j < count; ++j) {
|
2010-08-20 05:35:02 +00:00
|
|
|
if (mFrequencies_bigrams[j] < 1) break;
|
2010-12-06 12:28:24 +00:00
|
|
|
final int start = j * MAX_WORD_LENGTH;
|
2010-08-20 05:35:02 +00:00
|
|
|
int len = 0;
|
2010-12-06 12:28:24 +00:00
|
|
|
while (len < MAX_WORD_LENGTH && mOutputChars_bigrams[start + len] != 0) {
|
|
|
|
++len;
|
2010-08-20 05:35:02 +00:00
|
|
|
}
|
|
|
|
if (len > 0) {
|
|
|
|
callback.addWord(mOutputChars_bigrams, start, len, mFrequencies_bigrams[j],
|
|
|
|
mDicTypeId, DataType.BIGRAM);
|
|
|
|
}
|
|
|
|
}
|
2009-03-13 22:11:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
2010-02-05 22:07:04 +00:00
|
|
|
public void getWords(final WordComposer codes, final WordCallback callback,
|
|
|
|
int[] nextLettersFrequencies) {
|
2009-03-13 22:11:42 +00:00
|
|
|
final int codesSize = codes.size();
|
2010-08-20 05:35:02 +00:00
|
|
|
// Won't deal with really long words.
|
2009-03-13 22:11:42 +00:00
|
|
|
if (codesSize > MAX_WORD_LENGTH - 1) return;
|
2010-12-01 12:22:15 +00:00
|
|
|
|
2009-03-13 22:11:42 +00:00
|
|
|
Arrays.fill(mInputCodes, -1);
|
|
|
|
for (int i = 0; i < codesSize; i++) {
|
|
|
|
int[] alternatives = codes.getCodesAt(i);
|
|
|
|
System.arraycopy(alternatives, 0, mInputCodes, i * MAX_ALTERNATIVES,
|
|
|
|
Math.min(alternatives.length, MAX_ALTERNATIVES));
|
|
|
|
}
|
|
|
|
Arrays.fill(mOutputChars, (char) 0);
|
2009-06-04 19:20:45 +00:00
|
|
|
Arrays.fill(mFrequencies, 0);
|
|
|
|
|
2010-12-01 10:09:29 +00:00
|
|
|
int count = getSuggestionsNative(mNativeDict, mInputCodes, codesSize, mOutputChars,
|
2010-12-01 12:22:15 +00:00
|
|
|
mFrequencies, nextLettersFrequencies,
|
2010-02-05 22:07:04 +00:00
|
|
|
nextLettersFrequencies != null ? nextLettersFrequencies.length : 0);
|
2009-06-04 19:20:45 +00:00
|
|
|
|
2010-12-06 12:28:24 +00:00
|
|
|
for (int j = 0; j < count; ++j) {
|
2009-03-13 22:11:42 +00:00
|
|
|
if (mFrequencies[j] < 1) break;
|
2010-12-06 12:28:24 +00:00
|
|
|
final int start = j * MAX_WORD_LENGTH;
|
2009-03-13 22:11:42 +00:00
|
|
|
int len = 0;
|
2010-12-06 12:28:24 +00:00
|
|
|
while (len < MAX_WORD_LENGTH && mOutputChars[start + len] != 0) {
|
|
|
|
++len;
|
2009-03-13 22:11:42 +00:00
|
|
|
}
|
|
|
|
if (len > 0) {
|
2010-08-20 05:35:02 +00:00
|
|
|
callback.addWord(mOutputChars, start, len, mFrequencies[j], mDicTypeId,
|
|
|
|
DataType.UNIGRAM);
|
2009-03-13 22:11:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
public boolean isValidWord(CharSequence word) {
|
|
|
|
if (word == null) return false;
|
2009-12-01 19:44:22 +00:00
|
|
|
char[] chars = word.toString().toCharArray();
|
2009-03-13 22:11:42 +00:00
|
|
|
return isValidWordNative(mNativeDict, chars, chars.length);
|
|
|
|
}
|
2009-06-04 19:20:45 +00:00
|
|
|
|
2009-12-18 21:39:18 +00:00
|
|
|
public int getSize() {
|
|
|
|
return mDictLength; // This value is initialized on the call to openNative()
|
|
|
|
}
|
|
|
|
|
2009-10-12 20:48:35 +00:00
|
|
|
@Override
|
2009-03-13 22:11:42 +00:00
|
|
|
public synchronized void close() {
|
|
|
|
if (mNativeDict != 0) {
|
|
|
|
closeNative(mNativeDict);
|
|
|
|
mNativeDict = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
@Override
|
|
|
|
protected void finalize() throws Throwable {
|
|
|
|
close();
|
|
|
|
super.finalize();
|
|
|
|
}
|
|
|
|
}
|