Generate dict code for version 401. (6bf26813) · Commits · e / os / android_packages_inputmethods_LatinIME

native/jni/CleanupNativeFileList.mk

+1 −0

Original line number	Diff line number	Diff line
		@@ -13,6 +13,7 @@
		# limitations under the License.

		LATIN_IME_CORE_SRC_FILES :=
		LATIN_IME_CORE_SRC_FILES_BACKWARD_V401 :=
		LATIN_IME_CORE_TEST_FILES :=
		LATIN_IME_JNI_SRC_FILES :=
		LATIN_IME_SRC_DIR :=

native/jni/NativeFileList.mk

+21 −0

Original line number	Diff line number	Diff line
		@@ -98,6 +98,27 @@ LATIN_IME_CORE_SRC_FILES := \
		log_utils.cpp \
		time_keeper.cpp)

		LATIN_IME_CORE_SRC_FILES_BACKWARD_V401 := \
		$(addprefix suggest/policyimpl/dictionary/structure/backward/v401/, \
		ver4_dict_buffers.cpp \
		ver4_dict_constants.cpp \
		ver4_patricia_trie_node_reader.cpp \
		ver4_patricia_trie_node_writer.cpp \
		ver4_patricia_trie_policy.cpp \
		ver4_patricia_trie_reading_utils.cpp \
		ver4_patricia_trie_writing_helper.cpp \
		ver4_pt_node_array_reader.cpp) \
		$(addprefix suggest/policyimpl/dictionary/structure/backward/v401/content/, \
		bigram_dict_content.cpp \
		probability_dict_content.cpp \
		shortcut_dict_content.cpp \
		sparse_table_dict_content.cpp \
		terminal_position_lookup_table.cpp) \
		$(addprefix suggest/policyimpl/dictionary/structure/backward/v401/bigram/, \
		ver4_bigram_list_policy.cpp)

		LATIN_IME_CORE_SRC_FILES += $(LATIN_IME_CORE_SRC_FILES_BACKWARD_V401)

		LATIN_IME_CORE_TEST_FILES := \
		defines_test.cpp \
		suggest/core/layout/normal_distribution_2d_test.cpp \

native/jni/src/suggest/policyimpl/dictionary/structure/backward/v401/Readme.txt

0 → 100644

+1 −0

Original line number	Diff line number	Diff line
		Files under this directory have been auto generated.

native/jni/src/suggest/policyimpl/dictionary/structure/backward/v401/bigram/ver4_bigram_list_policy.cpp

0 → 100644

+290 −0

Original line number	Diff line number	Diff line
		/*
		* Copyright (C) 2013 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.
		*/

		/*
		* !!!!! DO NOT CHANGE THE LOGIC IN THIS FILE !!!!!
		* Do not edit this file other than updating policy's interface.
		*
		* This file was generated from
		* suggest/policyimpl/dictionary/structure/v4/bigram/ver4_bigram_list_policy.cpp
		*/

		#include "suggest/policyimpl/dictionary/structure/backward/v401/bigram/ver4_bigram_list_policy.h"

		#include "suggest/core/dictionary/property/bigram_property.h"
		#include "suggest/policyimpl/dictionary/header/header_policy.h"
		#include "suggest/policyimpl/dictionary/structure/pt_common/bigram/bigram_list_read_write_utils.h"
		#include "suggest/policyimpl/dictionary/structure/backward/v401/content/bigram_dict_content.h"
		#include "suggest/policyimpl/dictionary/structure/backward/v401/content/terminal_position_lookup_table.h"
		#include "suggest/policyimpl/dictionary/structure/backward/v401/ver4_dict_constants.h"
		#include "suggest/policyimpl/dictionary/utils/forgetting_curve_utils.h"

		namespace latinime {
		namespace backward {
		namespace v401 {

		void Ver4BigramListPolicy::getNextBigram(int const outBigramPos, int const outProbability,
		bool const outHasNext, int const bigramEntryPos) const {
		const BigramEntry bigramEntry =
		mBigramDictContent->getBigramEntryAndAdvancePosition(bigramEntryPos);
		if (outBigramPos) {
		// Lookup target PtNode position.
		*outBigramPos = mTerminalPositionLookupTable->getTerminalPtNodePosition(
		bigramEntry.getTargetTerminalId());
		}
		if (outProbability) {
		if (bigramEntry.hasHistoricalInfo()) {
		*outProbability =
		ForgettingCurveUtils::decodeProbability(bigramEntry.getHistoricalInfo(),
		mHeaderPolicy);
		} else {
		*outProbability = bigramEntry.getProbability();
		}
		}
		if (outHasNext) {
		*outHasNext = bigramEntry.hasNext();
		}
		}

		bool Ver4BigramListPolicy::addNewEntry(const int terminalId, const int newTargetTerminalId,
		const BigramProperty const bigramProperty, bool const outAddedNewEntry) {
		// 1. The word has no bigrams yet.
		// 2. The word has bigrams, and there is the target in the list.
		// 3. The word has bigrams, and there is an invalid entry that can be reclaimed.
		// 4. The word has bigrams. We have to append new bigram entry to the list.
		// 5. Same as 4, but the list is the last entry of the content file.
		if (outAddedNewEntry) {
		*outAddedNewEntry = false;
		}
		const int bigramListPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		if (bigramListPos == NOT_A_DICT_POS) {
		// Case 1. PtNode that doesn't have a bigram list.
		// Create new bigram list.
		if (!mBigramDictContent->createNewBigramList(terminalId)) {
		return false;
		}
		const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
		newTargetTerminalId);
		const BigramEntry bigramEntryToWrite = createUpdatedBigramEntryFrom(&newBigramEntry,
		bigramProperty);
		// Write an entry.
		const int writingPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		if (!mBigramDictContent->writeBigramEntry(&bigramEntryToWrite, writingPos)) {
		return false;
		}
		if (outAddedNewEntry) {
		*outAddedNewEntry = true;
		}
		return true;
		}

		int tailEntryPos = NOT_A_DICT_POS;
		const int entryPosToUpdate = getEntryPosToUpdate(newTargetTerminalId, bigramListPos,
		&tailEntryPos);
		if (tailEntryPos != NOT_A_DICT_POS \|\| entryPosToUpdate == NOT_A_DICT_POS) {
		// Case 4, 5.
		// Add new entry to the bigram list.
		if (tailEntryPos == NOT_A_DICT_POS) {
		// Case 4. Create new bigram list.
		if (!mBigramDictContent->createNewBigramList(terminalId)) {
		return false;
		}
		const int destPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		// Copy existing bigram list.
		if (!mBigramDictContent->copyBigramList(bigramListPos, destPos, &tailEntryPos)) {
		return false;
		}
		}
		// Write new entry at the tail position of the bigram content.
		const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
		newTargetTerminalId);
		const BigramEntry bigramEntryToWrite = createUpdatedBigramEntryFrom(
		&newBigramEntry, bigramProperty);
		if (!mBigramDictContent->writeBigramEntryAtTail(&bigramEntryToWrite)) {
		return false;
		}
		// Update has next flag of the tail entry.
		if (!updateHasNextFlag(true /* hasNext */, tailEntryPos)) {
		return false;
		}
		if (outAddedNewEntry) {
		*outAddedNewEntry = true;
		}
		return true;
		}

		// Case 2. Overwrite the existing entry. Case 3. Reclaim and reuse the existing invalid entry.
		const BigramEntry originalBigramEntry = mBigramDictContent->getBigramEntry(entryPosToUpdate);
		if (!originalBigramEntry.isValid()) {
		// Case 3. Reuse the existing invalid entry. outAddedNewEntry is false when an existing
		// entry is updated.
		if (outAddedNewEntry) {
		*outAddedNewEntry = true;
		}
		}
		const BigramEntry updatedBigramEntry =
		originalBigramEntry.updateTargetTerminalIdAndGetEntry(newTargetTerminalId);
		const BigramEntry bigramEntryToWrite = createUpdatedBigramEntryFrom(
		&updatedBigramEntry, bigramProperty);
		return mBigramDictContent->writeBigramEntry(&bigramEntryToWrite, entryPosToUpdate);
		}

		bool Ver4BigramListPolicy::removeEntry(const int terminalId, const int targetTerminalId) {
		const int bigramListPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		if (bigramListPos == NOT_A_DICT_POS) {
		// Bigram list doesn't exist.
		return false;
		}
		const int entryPosToUpdate = getEntryPosToUpdate(targetTerminalId, bigramListPos,
		nullptr /* outTailEntryPos */);
		if (entryPosToUpdate == NOT_A_DICT_POS) {
		// Bigram entry doesn't exist.
		return false;
		}
		const BigramEntry bigramEntry = mBigramDictContent->getBigramEntry(entryPosToUpdate);
		if (targetTerminalId != bigramEntry.getTargetTerminalId()) {
		// Bigram entry doesn't exist.
		return false;
		}
		// Remove bigram entry by marking it as invalid entry and overwriting the original entry.
		const BigramEntry updatedBigramEntry = bigramEntry.getInvalidatedEntry();
		return mBigramDictContent->writeBigramEntry(&updatedBigramEntry, entryPosToUpdate);
		}

		bool Ver4BigramListPolicy::updateAllBigramEntriesAndDeleteUselessEntries(const int terminalId,
		int *const outBigramCount) {
		const int bigramListPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		if (bigramListPos == NOT_A_DICT_POS) {
		// Bigram list doesn't exist.
		return true;
		}
		bool hasNext = true;
		int readingPos = bigramListPos;
		while (hasNext) {
		const int entryPos = readingPos;
		const BigramEntry bigramEntry =
		mBigramDictContent->getBigramEntryAndAdvancePosition(&readingPos);
		hasNext = bigramEntry.hasNext();
		if (!bigramEntry.isValid()) {
		continue;
		}
		const int targetPtNodePos = mTerminalPositionLookupTable->getTerminalPtNodePosition(
		bigramEntry.getTargetTerminalId());
		if (targetPtNodePos == NOT_A_DICT_POS) {
		// Invalidate bigram entry.
		const BigramEntry updatedBigramEntry = bigramEntry.getInvalidatedEntry();
		if (!mBigramDictContent->writeBigramEntry(&updatedBigramEntry, entryPos)) {
		return false;
		}
		} else if (bigramEntry.hasHistoricalInfo()) {
		const HistoricalInfo historicalInfo = ForgettingCurveUtils::createHistoricalInfoToSave(
		bigramEntry.getHistoricalInfo(), mHeaderPolicy);
		if (ForgettingCurveUtils::needsToKeep(&historicalInfo, mHeaderPolicy)) {
		const BigramEntry updatedBigramEntry =
		bigramEntry.updateHistoricalInfoAndGetEntry(&historicalInfo);
		if (!mBigramDictContent->writeBigramEntry(&updatedBigramEntry, entryPos)) {
		return false;
		}
		*outBigramCount += 1;
		} else {
		// Remove entry.
		const BigramEntry updatedBigramEntry = bigramEntry.getInvalidatedEntry();
		if (!mBigramDictContent->writeBigramEntry(&updatedBigramEntry, entryPos)) {
		return false;
		}
		}
		} else {
		*outBigramCount += 1;
		}
		}
		return true;
		}

		int Ver4BigramListPolicy::getBigramEntryConut(const int terminalId) {
		const int bigramListPos = mBigramDictContent->getBigramListHeadPos(terminalId);
		if (bigramListPos == NOT_A_DICT_POS) {
		// Bigram list doesn't exist.
		return 0;
		}
		int bigramCount = 0;
		bool hasNext = true;
		int readingPos = bigramListPos;
		while (hasNext) {
		const BigramEntry bigramEntry =
		mBigramDictContent->getBigramEntryAndAdvancePosition(&readingPos);
		hasNext = bigramEntry.hasNext();
		if (bigramEntry.isValid()) {
		bigramCount++;
		}
		}
		return bigramCount;
		}

		int Ver4BigramListPolicy::getEntryPosToUpdate(const int targetTerminalIdToFind,
		const int bigramListPos, int *const outTailEntryPos) const {
		if (outTailEntryPos) {
		*outTailEntryPos = NOT_A_DICT_POS;
		}
		bool hasNext = true;
		int invalidEntryPos = NOT_A_DICT_POS;
		int readingPos = bigramListPos;
		while (hasNext) {
		const int entryPos = readingPos;
		const BigramEntry bigramEntry =
		mBigramDictContent->getBigramEntryAndAdvancePosition(&readingPos);
		hasNext = bigramEntry.hasNext();
		if (bigramEntry.getTargetTerminalId() == targetTerminalIdToFind) {
		// Entry with same target is found.
		return entryPos;
		} else if (!bigramEntry.isValid()) {
		// Invalid entry that can be reused is found.
		invalidEntryPos = entryPos;
		}
		if (!hasNext && mBigramDictContent->isContentTailPos(readingPos)) {
		if (outTailEntryPos) {
		*outTailEntryPos = entryPos;
		}
		}
		}
		return invalidEntryPos;
		}

		const BigramEntry Ver4BigramListPolicy::createUpdatedBigramEntryFrom(
		const BigramEntry *const originalBigramEntry,
		const BigramProperty *const bigramProperty) const {
		// TODO: Consolidate historical info and probability.
		if (mHeaderPolicy->hasHistoricalInfoOfWords()) {
		const HistoricalInfo historicalInfoForUpdate(bigramProperty->getTimestamp(),
		bigramProperty->getLevel(), bigramProperty->getCount());
		const HistoricalInfo updatedHistoricalInfo =
		ForgettingCurveUtils::createUpdatedHistoricalInfo(
		originalBigramEntry->getHistoricalInfo(), bigramProperty->getProbability(),
		&historicalInfoForUpdate, mHeaderPolicy);
		return originalBigramEntry->updateHistoricalInfoAndGetEntry(&updatedHistoricalInfo);
		} else {
		return originalBigramEntry->updateProbabilityAndGetEntry(bigramProperty->getProbability());
		}
		}

		bool Ver4BigramListPolicy::updateHasNextFlag(const bool hasNext, const int bigramEntryPos) {
		const BigramEntry bigramEntry = mBigramDictContent->getBigramEntry(bigramEntryPos);
		const BigramEntry updatedBigramEntry = bigramEntry.updateHasNextAndGetEntry(hasNext);
		return mBigramDictContent->writeBigramEntry(&updatedBigramEntry, bigramEntryPos);
		}

		} // namespace v401
		} // namespace backward
		} // namespace latinime

native/jni/src/suggest/policyimpl/dictionary/structure/backward/v401/bigram/ver4_bigram_list_policy.h

0 → 100644

+93 −0

Original line number	Diff line number	Diff line
		/*
		* Copyright (C) 2013 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.
		*/

		/*
		* !!!!! DO NOT CHANGE THE LOGIC IN THIS FILE !!!!!
		* Do not edit this file other than updating policy's interface.
		*
		* This file was generated from
		* suggest/policyimpl/dictionary/structure/v4/bigram/ver4_bigram_list_policy.h
		*/

		#ifndef LATINIME_BACKWARD_V401_VER4_BIGRAM_LIST_POLICY_H
		#define LATINIME_BACKWARD_V401_VER4_BIGRAM_LIST_POLICY_H

		#include "defines.h"
		#include "suggest/core/policy/dictionary_bigrams_structure_policy.h"
		#include "suggest/policyimpl/dictionary/structure/backward/v401/content/bigram_entry.h"

		namespace latinime {
		namespace backward {
		namespace v401 {

		class BigramDictContent;
		} // namespace v401
		} // namespace backward
		class BigramProperty;
		namespace backward {
		namespace v401 {
		} // namespace v401
		} // namespace backward
		class HeaderPolicy;
		namespace backward {
		namespace v401 {
		class TerminalPositionLookupTable;

		class Ver4BigramListPolicy : public DictionaryBigramsStructurePolicy {
		public:
		Ver4BigramListPolicy(BigramDictContent *const bigramDictContent,
		const TerminalPositionLookupTable *const terminalPositionLookupTable,
		const HeaderPolicy *const headerPolicy)
		: mBigramDictContent(bigramDictContent),
		mTerminalPositionLookupTable(terminalPositionLookupTable),
		mHeaderPolicy(headerPolicy) {}

		void getNextBigram(int const outBigramPos, int const outProbability,
		bool const outHasNext, int const bigramEntryPos) const;

		void skipAllBigrams(int *const pos) const {
		// Do nothing because we don't need to skip bigram lists in ver4 dictionaries.
		}

		bool addNewEntry(const int terminalId, const int newTargetTerminalId,
		const BigramProperty const bigramProperty, bool const outAddedNewEntry);

		bool removeEntry(const int terminalId, const int targetTerminalId);

		bool updateAllBigramEntriesAndDeleteUselessEntries(const int terminalId,
		int *const outBigramCount);

		int getBigramEntryConut(const int terminalId);

		private:
		DISALLOW_IMPLICIT_CONSTRUCTORS(Ver4BigramListPolicy);

		int getEntryPosToUpdate(const int targetTerminalIdToFind, const int bigramListPos,
		int *const outTailEntryPos) const;

		const BigramEntry createUpdatedBigramEntryFrom(const BigramEntry *const originalBigramEntry,
		const BigramProperty *const bigramProperty) const;

		bool updateHasNextFlag(const bool hasNext, const int bigramEntryPos);

		BigramDictContent *const mBigramDictContent;
		const TerminalPositionLookupTable *const mTerminalPositionLookupTable;
		const HeaderPolicy *const mHeaderPolicy;
		};
		} // namespace v401
		} // namespace backward
		} // namespace latinime
		#endif /* LATINIME_BACKWARD_V401_VER4_BIGRAM_LIST_POLICY_H */