1 // Copyright 2011 Google Inc. All Rights Reserved.
3 // Licensed under the Apache License, Version 2.0 (the "License");
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
7 // http://www.apache.org/licenses/LICENSE-2.0
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an "AS IS" BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
15 package com.hughes.android.dictionary.engine;
17 import com.hughes.util.raf.RAFListSerializer;
18 import com.hughes.util.raf.RAFSerializable;
19 import com.ibm.icu.text.Transliterator;
21 import java.io.IOException;
22 import java.io.PrintStream;
23 import java.io.RandomAccessFile;
24 import java.util.ArrayList;
25 import java.util.List;
26 import java.util.regex.Pattern;
28 public class PairEntry extends AbstractEntry implements RAFSerializable<PairEntry>, Comparable<PairEntry> {
30 public final List<Pair> pairs;
32 public PairEntry(final EntrySource entrySource) {
34 pairs = new ArrayList<Pair>(1);
37 public PairEntry(final EntrySource entrySource, final String lang1, final String lang2) {
39 this.pairs.add(new Pair(lang1, lang2));
42 public PairEntry(final Dictionary dictionary, final RandomAccessFile raf, final int index) throws IOException {
43 super(dictionary, raf, index);
44 final int size = raf.readInt();
45 pairs = new ArrayList<PairEntry.Pair>(size);
46 for (int i = 0; i < size; ++i) {
47 pairs.add(new Pair(raf.readUTF(), raf.readUTF()));
51 public void write(RandomAccessFile raf) throws IOException {
53 // TODO: this could be a short.
54 raf.writeInt(pairs.size());
55 for (int i = 0; i < pairs.size(); ++i) {
56 assert pairs.get(i).lang1.length() > 0;
57 raf.writeUTF(pairs.get(i).lang1);
58 raf.writeUTF(pairs.get(i).lang2);
62 static final class Serializer implements RAFListSerializer<PairEntry> {
64 final Dictionary dictionary;
66 Serializer(Dictionary dictionary) {
67 this.dictionary = dictionary;
71 public PairEntry read(RandomAccessFile raf, int index) throws IOException {
72 return new PairEntry(dictionary, raf, index);
76 public void write(RandomAccessFile raf, PairEntry t) throws IOException {
82 public void addToDictionary(final Dictionary dictionary) {
84 dictionary.pairEntries.add(this);
85 index = dictionary.pairEntries.size() - 1;
89 public RowBase CreateRow(int rowIndex, Index dictionaryIndex) {
90 return new Row(this.index, rowIndex, dictionaryIndex);
94 // --------------------------------------------------------------------
97 public static class Row extends RowBase {
99 Row(final RandomAccessFile raf, final int thisRowIndex,
100 final Index index) throws IOException {
101 super(raf, thisRowIndex, index);
104 Row(final int referenceIndex, final int thisRowIndex,
106 super(referenceIndex, thisRowIndex, index);
110 public String toString() {
111 return getRawText(false);
114 public PairEntry getEntry() {
115 return index.dict.pairEntries.get(referenceIndex);
119 public void print(PrintStream out) {
120 final PairEntry pairEntry = getEntry();
121 for (int i = 0; i < pairEntry.pairs.size(); ++i) {
122 out.print((i == 0 ? " " : " ") + pairEntry.pairs.get(i));
128 public String getRawText(boolean compact) {
129 final PairEntry pairEntry = getEntry();
130 return pairEntry.getRawText(compact);
134 public RowMatchType matches(final List<String> searchTokens, final Pattern orderedMatchPattern, final Transliterator normalizer, final boolean swapPairEntries) {
135 final int side = swapPairEntries ? 1 : 0;
136 final List<Pair> pairs = getEntry().pairs;
137 final String[] pairSides = new String[pairs.size()];
138 for (int i = 0; i < pairs.size(); ++i) {
139 pairSides[i] = normalizer.transform(pairs.get(i).get(side));
141 for (int i = searchTokens.size() - 1; i >= 0; --i) {
142 final String searchToken = searchTokens.get(i);
143 boolean found = false;
144 for (final String pairSide : pairSides) {
145 found |= pairSide.contains(searchToken);
148 return RowMatchType.NO_MATCH;
151 for (final String pairSide : pairSides) {
152 if (orderedMatchPattern.matcher(pairSide).find()) {
153 return RowMatchType.ORDERED_MATCH;
156 return RowMatchType.BAG_OF_WORDS_MATCH;
160 public int getSideLength(boolean swapPairEntries) {
162 final int side = swapPairEntries ? 1 : 0;
163 for (final Pair pair : getEntry().pairs) {
164 result += pair.get(side).length();
171 public String getRawText(final boolean compact) {
173 return this.pairs.get(0).toStringTab();
175 final StringBuilder builder = new StringBuilder();
176 for (int i = 0; i < this.pairs.size(); ++i) {
178 builder.append(" | ");
180 builder.append(this.pairs.get(i).lang1);
182 builder.append("\t");
183 for (int i = 0; i < this.pairs.size(); ++i) {
185 builder.append(" | ");
187 builder.append(this.pairs.get(i).lang2);
189 return builder.toString();
193 public int compareTo(final PairEntry that) {
194 return this.getRawText(false).compareTo(that.getRawText(false));
198 public String toString() {
199 return getRawText(false);
202 // -----------------------------------------------------------------------
204 public static final class Pair {
206 public final String lang1;
207 public final String lang2;
209 public Pair(final String lang1, final String lang2) {
212 if (!(lang1.trim().length() > 0 && lang2.trim().length() > 0)) {
213 System.err.println("poop");
215 assert lang1.trim().length() > 0 || lang2.trim().length() > 0 : "Empty pair!!!";
216 assert lang1.trim().length() > 0 && lang2.trim().length() > 0 : "Empty pair!!!";
219 public Pair(final String lang1, final String lang2, final boolean swap) {
220 this(swap ? lang2 : lang1, swap ? lang1 : lang2);
223 public String toString() {
224 return lang1 + " :: " + lang2;
227 public String toStringTab() {
228 return lang1 + "\t" + lang2;
231 public String get(int i) {
237 throw new IllegalArgumentException();