6a1b37353d
This CL partially reverts - Id88b02b74bdfe4ca05b08181ceb6b34d5652fc0c - I05c7d8429e8d9a26139456763c77997340fea8c2 And followup (remove shortcut support) - I73b7dc008a5acaf75a31a36a2d332b5afabd82d0 Bug: 28255684 Test: make -j10 dicttool_aosp Change-Id: I2e01ed86b9517a1141aee35ea6d8ef39258981d1
54 lines
2.3 KiB
Java
54 lines
2.3 KiB
Java
/*
|
|
* Copyright (C) 2011 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.latin.makedict.FormatSpec.DictionaryOptions;
|
|
import com.android.inputmethod.latin.makedict.FusionDictionary.PtNodeArray;
|
|
|
|
import junit.framework.TestCase;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.HashMap;
|
|
|
|
/**
|
|
* Unit tests for BinaryDictEncoderUtils.flattenTree().
|
|
*/
|
|
public class BinaryDictEncoderFlattenTreeTests extends TestCase {
|
|
// Test the flattened array contains the expected number of nodes, and
|
|
// that it does not contain any duplicates.
|
|
public void testFlattenNodes() {
|
|
final FusionDictionary dict = new FusionDictionary(new PtNodeArray(),
|
|
new DictionaryOptions(new HashMap<String, String>()));
|
|
dict.add("foo", new ProbabilityInfo(1), false /* isNotAWord */,
|
|
false /* isPossiblyOffensive */);
|
|
dict.add("fta", new ProbabilityInfo(1), false /* isNotAWord */,
|
|
false /* isPossiblyOffensive */);
|
|
dict.add("ftb", new ProbabilityInfo(1), false /* isNotAWord */,
|
|
false /* isPossiblyOffensive */);
|
|
dict.add("bar", new ProbabilityInfo(1), false /* isNotAWord */,
|
|
false /* isPossiblyOffensive */);
|
|
dict.add("fool", new ProbabilityInfo(1), false /* isNotAWord */,
|
|
false /* isPossiblyOffensive */);
|
|
final ArrayList<PtNodeArray> result =
|
|
BinaryDictEncoderUtils.flattenTree(dict.mRootNodeArray);
|
|
assertEquals(4, result.size());
|
|
while (!result.isEmpty()) {
|
|
final PtNodeArray n = result.remove(0);
|
|
assertFalse("Flattened array contained the same node twice", result.contains(n));
|
|
}
|
|
}
|
|
}
|