mirror of
https://gitlab.futo.org/keyboard/latinime.git
synced 2024-09-28 14:54:30 +01:00
635 lines
27 KiB
Java
635 lines
27 KiB
Java
/*
|
|
* Copyright (C) 2012 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.
|
|
*/
|
|
|
|
package com.android.inputmethod.latin.makedict;
|
|
|
|
import com.android.inputmethod.annotations.UsedForTesting;
|
|
import com.android.inputmethod.latin.Constants;
|
|
import com.android.inputmethod.latin.makedict.BinaryDictDecoder.CharEncoding;
|
|
import com.android.inputmethod.latin.makedict.BinaryDictDecoder.FusionDictionaryBufferInterface;
|
|
import com.android.inputmethod.latin.makedict.FormatSpec.FileHeader;
|
|
import com.android.inputmethod.latin.makedict.FormatSpec.FormatOptions;
|
|
import com.android.inputmethod.latin.makedict.FusionDictionary.CharGroup;
|
|
import com.android.inputmethod.latin.makedict.FusionDictionary.WeightedString;
|
|
|
|
import java.io.File;
|
|
import java.io.FileInputStream;
|
|
import java.io.FileNotFoundException;
|
|
import java.io.IOException;
|
|
import java.io.OutputStream;
|
|
import java.nio.channels.FileChannel;
|
|
import java.util.ArrayList;
|
|
import java.util.Iterator;
|
|
import java.util.Map;
|
|
import java.util.Stack;
|
|
|
|
public final class BinaryDictIOUtils {
|
|
private static final boolean DBG = false;
|
|
|
|
private BinaryDictIOUtils() {
|
|
// This utility class is not publicly instantiable.
|
|
}
|
|
|
|
private static final class Position {
|
|
public static final int NOT_READ_GROUPCOUNT = -1;
|
|
|
|
public int mAddress;
|
|
public int mNumOfCharGroup;
|
|
public int mPosition;
|
|
public int mLength;
|
|
|
|
public Position(int address, int length) {
|
|
mAddress = address;
|
|
mLength = length;
|
|
mNumOfCharGroup = NOT_READ_GROUPCOUNT;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Retrieves all node arrays without recursive call.
|
|
*/
|
|
private static void readUnigramsAndBigramsBinaryInner(
|
|
final FusionDictionaryBufferInterface buffer, final int headerSize,
|
|
final Map<Integer, String> words, final Map<Integer, Integer> frequencies,
|
|
final Map<Integer, ArrayList<PendingAttribute>> bigrams,
|
|
final FormatOptions formatOptions) {
|
|
int[] pushedChars = new int[FormatSpec.MAX_WORD_LENGTH + 1];
|
|
|
|
Stack<Position> stack = new Stack<Position>();
|
|
int index = 0;
|
|
|
|
Position initPos = new Position(headerSize, 0);
|
|
stack.push(initPos);
|
|
|
|
while (!stack.empty()) {
|
|
Position p = stack.peek();
|
|
|
|
if (DBG) {
|
|
MakedictLog.d("read: address=" + p.mAddress + ", numOfCharGroup=" +
|
|
p.mNumOfCharGroup + ", position=" + p.mPosition + ", length=" + p.mLength);
|
|
}
|
|
|
|
if (buffer.position() != p.mAddress) buffer.position(p.mAddress);
|
|
if (index != p.mLength) index = p.mLength;
|
|
|
|
if (p.mNumOfCharGroup == Position.NOT_READ_GROUPCOUNT) {
|
|
p.mNumOfCharGroup = BinaryDictDecoder.readCharGroupCount(buffer);
|
|
p.mAddress += getGroupCountSize(p.mNumOfCharGroup);
|
|
p.mPosition = 0;
|
|
}
|
|
if (p.mNumOfCharGroup == 0) {
|
|
stack.pop();
|
|
continue;
|
|
}
|
|
CharGroupInfo info = BinaryDictDecoder.readCharGroup(buffer,
|
|
p.mAddress - headerSize, formatOptions);
|
|
for (int i = 0; i < info.mCharacters.length; ++i) {
|
|
pushedChars[index++] = info.mCharacters[i];
|
|
}
|
|
p.mPosition++;
|
|
|
|
final boolean isMovedGroup = isMovedGroup(info.mFlags,
|
|
formatOptions);
|
|
final boolean isDeletedGroup = isDeletedGroup(info.mFlags,
|
|
formatOptions);
|
|
if (!isMovedGroup && !isDeletedGroup
|
|
&& info.mFrequency != FusionDictionary.CharGroup.NOT_A_TERMINAL) {// found word
|
|
words.put(info.mOriginalAddress, new String(pushedChars, 0, index));
|
|
frequencies.put(info.mOriginalAddress, info.mFrequency);
|
|
if (info.mBigrams != null) bigrams.put(info.mOriginalAddress, info.mBigrams);
|
|
}
|
|
|
|
if (p.mPosition == p.mNumOfCharGroup) {
|
|
if (formatOptions.mSupportsDynamicUpdate) {
|
|
final int forwardLinkAddress = buffer.readUnsignedInt24();
|
|
if (forwardLinkAddress != FormatSpec.NO_FORWARD_LINK_ADDRESS) {
|
|
// The node array has a forward link.
|
|
p.mNumOfCharGroup = Position.NOT_READ_GROUPCOUNT;
|
|
p.mAddress = forwardLinkAddress;
|
|
} else {
|
|
stack.pop();
|
|
}
|
|
} else {
|
|
stack.pop();
|
|
}
|
|
} else {
|
|
// The node array has more groups.
|
|
p.mAddress = buffer.position();
|
|
}
|
|
|
|
if (!isMovedGroup && hasChildrenAddress(info.mChildrenAddress)) {
|
|
Position childrenPos = new Position(info.mChildrenAddress + headerSize, index);
|
|
stack.push(childrenPos);
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Reads unigrams and bigrams from the binary file.
|
|
* Doesn't store a full memory representation of the dictionary.
|
|
*
|
|
* @param reader the reader.
|
|
* @param words the map to store the address as a key and the word as a value.
|
|
* @param frequencies the map to store the address as a key and the frequency as a value.
|
|
* @param bigrams the map to store the address as a key and the list of address as a value.
|
|
* @throws IOException if the file can't be read.
|
|
* @throws UnsupportedFormatException if the format of the file is not recognized.
|
|
*/
|
|
public static void readUnigramsAndBigramsBinary(final BinaryDictReader reader,
|
|
final Map<Integer, String> words, final Map<Integer, Integer> frequencies,
|
|
final Map<Integer, ArrayList<PendingAttribute>> bigrams) throws IOException,
|
|
UnsupportedFormatException {
|
|
// Read header
|
|
final FileHeader header = BinaryDictDecoder.readHeader(reader.getBuffer());
|
|
readUnigramsAndBigramsBinaryInner(reader.getBuffer(), header.mHeaderSize, words,
|
|
frequencies, bigrams, header.mFormatOptions);
|
|
}
|
|
|
|
/**
|
|
* Gets the address of the last CharGroup of the exact matching word in the dictionary.
|
|
* If no match is found, returns NOT_VALID_WORD.
|
|
*
|
|
* @param reader the reader.
|
|
* @param word the word we search for.
|
|
* @return the address of the terminal node.
|
|
* @throws IOException if the file can't be read.
|
|
* @throws UnsupportedFormatException if the format of the file is not recognized.
|
|
*/
|
|
@UsedForTesting
|
|
public static int getTerminalPosition(final BinaryDictReader reader,
|
|
final String word) throws IOException, UnsupportedFormatException {
|
|
final FusionDictionaryBufferInterface buffer = reader.getBuffer();
|
|
if (word == null) return FormatSpec.NOT_VALID_WORD;
|
|
if (buffer.position() != 0) buffer.position(0);
|
|
|
|
final FileHeader header = BinaryDictDecoder.readHeader(buffer);
|
|
int wordPos = 0;
|
|
final int wordLen = word.codePointCount(0, word.length());
|
|
for (int depth = 0; depth < Constants.DICTIONARY_MAX_WORD_LENGTH; ++depth) {
|
|
if (wordPos >= wordLen) return FormatSpec.NOT_VALID_WORD;
|
|
|
|
do {
|
|
final int charGroupCount = BinaryDictDecoder.readCharGroupCount(buffer);
|
|
boolean foundNextCharGroup = false;
|
|
for (int i = 0; i < charGroupCount; ++i) {
|
|
final int charGroupPos = buffer.position();
|
|
final CharGroupInfo currentInfo = BinaryDictDecoder.readCharGroup(buffer,
|
|
buffer.position(), header.mFormatOptions);
|
|
final boolean isMovedGroup = isMovedGroup(currentInfo.mFlags,
|
|
header.mFormatOptions);
|
|
final boolean isDeletedGroup = isDeletedGroup(currentInfo.mFlags,
|
|
header.mFormatOptions);
|
|
if (isMovedGroup) continue;
|
|
boolean same = true;
|
|
for (int p = 0, j = word.offsetByCodePoints(0, wordPos);
|
|
p < currentInfo.mCharacters.length;
|
|
++p, j = word.offsetByCodePoints(j, 1)) {
|
|
if (wordPos + p >= wordLen
|
|
|| word.codePointAt(j) != currentInfo.mCharacters[p]) {
|
|
same = false;
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (same) {
|
|
// found the group matches the word.
|
|
if (wordPos + currentInfo.mCharacters.length == wordLen) {
|
|
if (currentInfo.mFrequency == CharGroup.NOT_A_TERMINAL
|
|
|| isDeletedGroup) {
|
|
return FormatSpec.NOT_VALID_WORD;
|
|
} else {
|
|
return charGroupPos;
|
|
}
|
|
}
|
|
wordPos += currentInfo.mCharacters.length;
|
|
if (currentInfo.mChildrenAddress == FormatSpec.NO_CHILDREN_ADDRESS) {
|
|
return FormatSpec.NOT_VALID_WORD;
|
|
}
|
|
foundNextCharGroup = true;
|
|
buffer.position(currentInfo.mChildrenAddress);
|
|
break;
|
|
}
|
|
}
|
|
|
|
// If we found the next char group, it is under the file pointer.
|
|
// But if not, we are at the end of this node array so we expect to have
|
|
// a forward link address that we need to consult and possibly resume
|
|
// search on the next node array in the linked list.
|
|
if (foundNextCharGroup) break;
|
|
if (!header.mFormatOptions.mSupportsDynamicUpdate) {
|
|
return FormatSpec.NOT_VALID_WORD;
|
|
}
|
|
|
|
final int forwardLinkAddress = buffer.readUnsignedInt24();
|
|
if (forwardLinkAddress == FormatSpec.NO_FORWARD_LINK_ADDRESS) {
|
|
return FormatSpec.NOT_VALID_WORD;
|
|
}
|
|
buffer.position(forwardLinkAddress);
|
|
} while(true);
|
|
}
|
|
return FormatSpec.NOT_VALID_WORD;
|
|
}
|
|
|
|
/**
|
|
* @return the size written, in bytes. Always 3 bytes.
|
|
*/
|
|
static int writeSInt24ToBuffer(final FusionDictionaryBufferInterface buffer,
|
|
final int value) {
|
|
final int absValue = Math.abs(value);
|
|
buffer.put((byte)(((value < 0 ? 0x80 : 0) | (absValue >> 16)) & 0xFF));
|
|
buffer.put((byte)((absValue >> 8) & 0xFF));
|
|
buffer.put((byte)(absValue & 0xFF));
|
|
return 3;
|
|
}
|
|
|
|
/**
|
|
* @return the size written, in bytes. Always 3 bytes.
|
|
*/
|
|
static int writeSInt24ToStream(final OutputStream destination, final int value)
|
|
throws IOException {
|
|
final int absValue = Math.abs(value);
|
|
destination.write((byte)(((value < 0 ? 0x80 : 0) | (absValue >> 16)) & 0xFF));
|
|
destination.write((byte)((absValue >> 8) & 0xFF));
|
|
destination.write((byte)(absValue & 0xFF));
|
|
return 3;
|
|
}
|
|
|
|
/**
|
|
* @return the size written, in bytes. 1, 2, or 3 bytes.
|
|
*/
|
|
private static int writeVariableAddress(final OutputStream destination, final int value)
|
|
throws IOException {
|
|
switch (BinaryDictEncoder.getByteSize(value)) {
|
|
case 1:
|
|
destination.write((byte)value);
|
|
break;
|
|
case 2:
|
|
destination.write((byte)(0xFF & (value >> 8)));
|
|
destination.write((byte)(0xFF & value));
|
|
break;
|
|
case 3:
|
|
destination.write((byte)(0xFF & (value >> 16)));
|
|
destination.write((byte)(0xFF & (value >> 8)));
|
|
destination.write((byte)(0xFF & value));
|
|
break;
|
|
}
|
|
return BinaryDictEncoder.getByteSize(value);
|
|
}
|
|
|
|
static void skipCharGroup(final FusionDictionaryBufferInterface buffer,
|
|
final FormatOptions formatOptions) {
|
|
final int flags = buffer.readUnsignedByte();
|
|
BinaryDictDecoder.readParentAddress(buffer, formatOptions);
|
|
skipString(buffer, (flags & FormatSpec.FLAG_HAS_MULTIPLE_CHARS) != 0);
|
|
BinaryDictDecoder.readChildrenAddress(buffer, flags, formatOptions);
|
|
if ((flags & FormatSpec.FLAG_IS_TERMINAL) != 0) buffer.readUnsignedByte();
|
|
if ((flags & FormatSpec.FLAG_HAS_SHORTCUT_TARGETS) != 0) {
|
|
final int shortcutsSize = buffer.readUnsignedShort();
|
|
buffer.position(buffer.position() + shortcutsSize
|
|
- FormatSpec.GROUP_SHORTCUT_LIST_SIZE_SIZE);
|
|
}
|
|
if ((flags & FormatSpec.FLAG_HAS_BIGRAMS) != 0) {
|
|
int bigramCount = 0;
|
|
while (bigramCount++ < FormatSpec.MAX_BIGRAMS_IN_A_GROUP) {
|
|
final int bigramFlags = buffer.readUnsignedByte();
|
|
switch (bigramFlags & FormatSpec.MASK_ATTRIBUTE_ADDRESS_TYPE) {
|
|
case FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_ONEBYTE:
|
|
buffer.readUnsignedByte();
|
|
break;
|
|
case FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_TWOBYTES:
|
|
buffer.readUnsignedShort();
|
|
break;
|
|
case FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_THREEBYTES:
|
|
buffer.readUnsignedInt24();
|
|
break;
|
|
}
|
|
if ((bigramFlags & FormatSpec.FLAG_ATTRIBUTE_HAS_NEXT) == 0) break;
|
|
}
|
|
if (bigramCount >= FormatSpec.MAX_BIGRAMS_IN_A_GROUP) {
|
|
throw new RuntimeException("Too many bigrams in a group.");
|
|
}
|
|
}
|
|
}
|
|
|
|
static void skipString(final FusionDictionaryBufferInterface buffer,
|
|
final boolean hasMultipleChars) {
|
|
if (hasMultipleChars) {
|
|
int character = CharEncoding.readChar(buffer);
|
|
while (character != FormatSpec.INVALID_CHARACTER) {
|
|
character = CharEncoding.readChar(buffer);
|
|
}
|
|
} else {
|
|
CharEncoding.readChar(buffer);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Write a string to a stream.
|
|
*
|
|
* @param destination the stream to write.
|
|
* @param word the string to be written.
|
|
* @return the size written, in bytes.
|
|
* @throws IOException
|
|
*/
|
|
private static int writeString(final OutputStream destination, final String word)
|
|
throws IOException {
|
|
int size = 0;
|
|
final int length = word.length();
|
|
for (int i = 0; i < length; i = word.offsetByCodePoints(i, 1)) {
|
|
final int codePoint = word.codePointAt(i);
|
|
if (CharEncoding.getCharSize(codePoint) == 1) {
|
|
destination.write((byte)codePoint);
|
|
size++;
|
|
} else {
|
|
destination.write((byte)(0xFF & (codePoint >> 16)));
|
|
destination.write((byte)(0xFF & (codePoint >> 8)));
|
|
destination.write((byte)(0xFF & codePoint));
|
|
size += 3;
|
|
}
|
|
}
|
|
destination.write((byte)FormatSpec.GROUP_CHARACTERS_TERMINATOR);
|
|
size += FormatSpec.GROUP_TERMINATOR_SIZE;
|
|
return size;
|
|
}
|
|
|
|
/**
|
|
* Write a char group to an output stream from a CharGroupInfo.
|
|
* A char group is an in-memory representation of a node in the patricia trie.
|
|
* A char group info is a container for low-level information about how the
|
|
* char group is stored in the binary format.
|
|
*
|
|
* @param destination the stream to write.
|
|
* @param info the char group info to be written.
|
|
* @return the size written, in bytes.
|
|
*/
|
|
public static int writeCharGroup(final OutputStream destination, final CharGroupInfo info)
|
|
throws IOException {
|
|
int size = FormatSpec.GROUP_FLAGS_SIZE;
|
|
destination.write((byte)info.mFlags);
|
|
final int parentOffset = info.mParentAddress == FormatSpec.NO_PARENT_ADDRESS ?
|
|
FormatSpec.NO_PARENT_ADDRESS : info.mParentAddress - info.mOriginalAddress;
|
|
size += writeSInt24ToStream(destination, parentOffset);
|
|
|
|
for (int i = 0; i < info.mCharacters.length; ++i) {
|
|
if (CharEncoding.getCharSize(info.mCharacters[i]) == 1) {
|
|
destination.write((byte)info.mCharacters[i]);
|
|
size++;
|
|
} else {
|
|
size += writeSInt24ToStream(destination, info.mCharacters[i]);
|
|
}
|
|
}
|
|
if (info.mCharacters.length > 1) {
|
|
destination.write((byte)FormatSpec.GROUP_CHARACTERS_TERMINATOR);
|
|
size++;
|
|
}
|
|
|
|
if ((info.mFlags & FormatSpec.FLAG_IS_TERMINAL) != 0) {
|
|
destination.write((byte)info.mFrequency);
|
|
size++;
|
|
}
|
|
|
|
if (DBG) {
|
|
MakedictLog.d("writeCharGroup origin=" + info.mOriginalAddress + ", size=" + size
|
|
+ ", child=" + info.mChildrenAddress + ", characters ="
|
|
+ new String(info.mCharacters, 0, info.mCharacters.length));
|
|
}
|
|
final int childrenOffset = info.mChildrenAddress == FormatSpec.NO_CHILDREN_ADDRESS ?
|
|
0 : info.mChildrenAddress - (info.mOriginalAddress + size);
|
|
writeSInt24ToStream(destination, childrenOffset);
|
|
size += FormatSpec.SIGNED_CHILDREN_ADDRESS_SIZE;
|
|
|
|
if (info.mShortcutTargets != null && info.mShortcutTargets.size() > 0) {
|
|
final int shortcutListSize =
|
|
BinaryDictEncoder.getShortcutListSize(info.mShortcutTargets);
|
|
destination.write((byte)(shortcutListSize >> 8));
|
|
destination.write((byte)(shortcutListSize & 0xFF));
|
|
size += 2;
|
|
final Iterator<WeightedString> shortcutIterator = info.mShortcutTargets.iterator();
|
|
while (shortcutIterator.hasNext()) {
|
|
final WeightedString target = shortcutIterator.next();
|
|
destination.write((byte)BinaryDictEncoder.makeShortcutFlags(
|
|
shortcutIterator.hasNext(), target.mFrequency));
|
|
size++;
|
|
size += writeString(destination, target.mWord);
|
|
}
|
|
}
|
|
|
|
if (info.mBigrams != null) {
|
|
// TODO: Consolidate this code with the code that computes the size of the bigram list
|
|
// in BinaryDictEncoder#computeActualNodeArraySize
|
|
for (int i = 0; i < info.mBigrams.size(); ++i) {
|
|
|
|
final int bigramFrequency = info.mBigrams.get(i).mFrequency;
|
|
int bigramFlags = (i < info.mBigrams.size() - 1)
|
|
? FormatSpec.FLAG_ATTRIBUTE_HAS_NEXT : 0;
|
|
size++;
|
|
final int bigramOffset = info.mBigrams.get(i).mAddress - (info.mOriginalAddress
|
|
+ size);
|
|
bigramFlags |= (bigramOffset < 0) ? FormatSpec.FLAG_ATTRIBUTE_OFFSET_NEGATIVE : 0;
|
|
switch (BinaryDictEncoder.getByteSize(bigramOffset)) {
|
|
case 1:
|
|
bigramFlags |= FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_ONEBYTE;
|
|
break;
|
|
case 2:
|
|
bigramFlags |= FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_TWOBYTES;
|
|
break;
|
|
case 3:
|
|
bigramFlags |= FormatSpec.FLAG_ATTRIBUTE_ADDRESS_TYPE_THREEBYTES;
|
|
break;
|
|
}
|
|
bigramFlags |= bigramFrequency & FormatSpec.FLAG_ATTRIBUTE_FREQUENCY;
|
|
destination.write((byte)bigramFlags);
|
|
size += writeVariableAddress(destination, Math.abs(bigramOffset));
|
|
}
|
|
}
|
|
return size;
|
|
}
|
|
|
|
/**
|
|
* Compute the size of the char group.
|
|
*/
|
|
static int computeGroupSize(final CharGroupInfo info, final FormatOptions formatOptions) {
|
|
int size = FormatSpec.GROUP_FLAGS_SIZE + FormatSpec.PARENT_ADDRESS_SIZE
|
|
+ BinaryDictEncoder.getGroupCharactersSize(info.mCharacters)
|
|
+ getChildrenAddressSize(info.mFlags, formatOptions);
|
|
if ((info.mFlags & FormatSpec.FLAG_IS_TERMINAL) != 0) {
|
|
size += FormatSpec.GROUP_FREQUENCY_SIZE;
|
|
}
|
|
if (info.mShortcutTargets != null && !info.mShortcutTargets.isEmpty()) {
|
|
size += BinaryDictEncoder.getShortcutListSize(info.mShortcutTargets);
|
|
}
|
|
if (info.mBigrams != null) {
|
|
for (final PendingAttribute attr : info.mBigrams) {
|
|
size += FormatSpec.GROUP_FLAGS_SIZE;
|
|
size += BinaryDictEncoder.getByteSize(attr.mAddress);
|
|
}
|
|
}
|
|
return size;
|
|
}
|
|
|
|
/**
|
|
* Write a node array to the stream.
|
|
*
|
|
* @param destination the stream to write.
|
|
* @param infos an array of CharGroupInfo to be written.
|
|
* @return the size written, in bytes.
|
|
* @throws IOException
|
|
*/
|
|
static int writeNodes(final OutputStream destination, final CharGroupInfo[] infos)
|
|
throws IOException {
|
|
int size = getGroupCountSize(infos.length);
|
|
switch (getGroupCountSize(infos.length)) {
|
|
case 1:
|
|
destination.write((byte)infos.length);
|
|
break;
|
|
case 2:
|
|
destination.write((byte)(infos.length >> 8));
|
|
destination.write((byte)(infos.length & 0xFF));
|
|
break;
|
|
default:
|
|
throw new RuntimeException("Invalid group count size.");
|
|
}
|
|
for (final CharGroupInfo info : infos) size += writeCharGroup(destination, info);
|
|
writeSInt24ToStream(destination, FormatSpec.NO_FORWARD_LINK_ADDRESS);
|
|
return size + FormatSpec.FORWARD_LINK_ADDRESS_SIZE;
|
|
}
|
|
|
|
/**
|
|
* Find a word using the BinaryDictReader.
|
|
*
|
|
* @param reader the reader
|
|
* @param word the word searched
|
|
* @return the found group
|
|
* @throws IOException
|
|
* @throws UnsupportedFormatException
|
|
*/
|
|
@UsedForTesting
|
|
public static CharGroupInfo findWordByBinaryDictReader(final BinaryDictReader reader,
|
|
final String word) throws IOException, UnsupportedFormatException {
|
|
int position = getTerminalPosition(reader, word);
|
|
final FusionDictionaryBufferInterface buffer = reader.getBuffer();
|
|
if (position != FormatSpec.NOT_VALID_WORD) {
|
|
buffer.position(0);
|
|
final FileHeader header = BinaryDictDecoder.readHeader(buffer);
|
|
buffer.position(position);
|
|
return BinaryDictDecoder.readCharGroup(buffer, position, header.mFormatOptions);
|
|
}
|
|
return null;
|
|
}
|
|
|
|
private static final int HEADER_READING_BUFFER_SIZE = 16384;
|
|
/**
|
|
* Convenience method to read the header of a binary file.
|
|
*
|
|
* This is quite resource intensive - don't call when performance is critical.
|
|
*
|
|
* @param file The file to read.
|
|
* @param offset The offset in the file where to start reading the data.
|
|
* @param length The length of the data file.
|
|
*/
|
|
public static FileHeader getDictionaryFileHeader(
|
|
final File file, final long offset, final long length)
|
|
throws FileNotFoundException, IOException, UnsupportedFormatException {
|
|
final byte[] buffer = new byte[HEADER_READING_BUFFER_SIZE];
|
|
final FileInputStream inStream = new FileInputStream(file);
|
|
try {
|
|
inStream.read(buffer);
|
|
final BinaryDictDecoder.ByteBufferWrapper wrapper =
|
|
new BinaryDictDecoder.ByteBufferWrapper(inStream.getChannel().map(
|
|
FileChannel.MapMode.READ_ONLY, offset, length));
|
|
return BinaryDictDecoder.readHeader(wrapper);
|
|
} finally {
|
|
inStream.close();
|
|
}
|
|
}
|
|
|
|
public static FileHeader getDictionaryFileHeaderOrNull(final File file, final long offset,
|
|
final long length) {
|
|
try {
|
|
final FileHeader header = getDictionaryFileHeader(file, offset, length);
|
|
return header;
|
|
} catch (UnsupportedFormatException e) {
|
|
return null;
|
|
} catch (IOException e) {
|
|
return null;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Helper method to hide the actual value of the no children address.
|
|
*/
|
|
public static boolean hasChildrenAddress(final int address) {
|
|
return FormatSpec.NO_CHILDREN_ADDRESS != address;
|
|
}
|
|
|
|
/**
|
|
* Helper method to check whether the group is moved.
|
|
*/
|
|
public static boolean isMovedGroup(final int flags, final FormatOptions options) {
|
|
return options.mSupportsDynamicUpdate
|
|
&& ((flags & FormatSpec.MASK_GROUP_ADDRESS_TYPE) == FormatSpec.FLAG_IS_MOVED);
|
|
}
|
|
|
|
/**
|
|
* Helper method to check whether the dictionary can be updated dynamically.
|
|
*/
|
|
public static boolean supportsDynamicUpdate(final FormatOptions options) {
|
|
return options.mVersion >= FormatSpec.FIRST_VERSION_WITH_DYNAMIC_UPDATE
|
|
&& options.mSupportsDynamicUpdate;
|
|
}
|
|
|
|
/**
|
|
* Helper method to check whether the group is deleted.
|
|
*/
|
|
public static boolean isDeletedGroup(final int flags, final FormatOptions formatOptions) {
|
|
return formatOptions.mSupportsDynamicUpdate
|
|
&& ((flags & FormatSpec.MASK_GROUP_ADDRESS_TYPE) == FormatSpec.FLAG_IS_DELETED);
|
|
}
|
|
|
|
/**
|
|
* Compute the binary size of the group count
|
|
* @param count the group count
|
|
* @return the size of the group count, either 1 or 2 bytes.
|
|
*/
|
|
public static int getGroupCountSize(final int count) {
|
|
if (FormatSpec.MAX_CHARGROUPS_FOR_ONE_BYTE_CHARGROUP_COUNT >= count) {
|
|
return 1;
|
|
} else if (FormatSpec.MAX_CHARGROUPS_IN_A_PT_NODE_ARRAY >= count) {
|
|
return 2;
|
|
} else {
|
|
throw new RuntimeException("Can't have more than "
|
|
+ FormatSpec.MAX_CHARGROUPS_IN_A_PT_NODE_ARRAY + " groups in a node (found "
|
|
+ count + ")");
|
|
}
|
|
}
|
|
|
|
static int getChildrenAddressSize(final int optionFlags,
|
|
final FormatOptions formatOptions) {
|
|
if (formatOptions.mSupportsDynamicUpdate) return FormatSpec.SIGNED_CHILDREN_ADDRESS_SIZE;
|
|
switch (optionFlags & FormatSpec.MASK_GROUP_ADDRESS_TYPE) {
|
|
case FormatSpec.FLAG_GROUP_ADDRESS_TYPE_ONEBYTE:
|
|
return 1;
|
|
case FormatSpec.FLAG_GROUP_ADDRESS_TYPE_TWOBYTES:
|
|
return 2;
|
|
case FormatSpec.FLAG_GROUP_ADDRESS_TYPE_THREEBYTES:
|
|
return 3;
|
|
case FormatSpec.FLAG_GROUP_ADDRESS_TYPE_NOADDRESS:
|
|
default:
|
|
return 0;
|
|
}
|
|
}
|
|
}
|