|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectnet.ajaest.jdk.tools.adders.TreeBuilder
public class TreeBuilder
Constructor Summary | |
---|---|
TreeBuilder()
|
Method Summary | |
---|---|
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiClassicRadicalTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiDeRooCodeTree(java.util.Set<Kanji> kanjis)
|
static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> |
buildKanjiDicNameTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>>> |
buildKanjiDicReferenceTree(java.util.Set<Kanji> kanjis)
[Dic_ref(any)] -> [Map[[Dic_name->Dic_ref(Dic_name)] To get a concrete dictionary reference list(many dictionaries has more than one reference per index: map.get(reference): Collection<Integer> indexList = map.get(index).get(dicName) To get all the references no matter the dic Collection<Integer> indexList =
CollectionsExtra.plainToList(map.get(index).values) To get a sorted dic's reference list List<Integer> refList; for(HashMap<Integer> refs :
map.values())       reflist.addAll(refs.get(dicName);//be careful with null maps! |
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiFourCornerCodeTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.lang.Integer> |
buildKanjiFrequencyTreeSet(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiGradeTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<AllowedStrokeLineEnum,java.lang.Integer> |
buildKanjiGraphTree(java.util.Set<Kanji> kanjis)
|
static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> |
buildKanjiJisCharset(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Integer,java.lang.Integer> |
buildKanjiJisCodeTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiJLPTLevelTree(java.util.Set<Kanji> kanjis)
|
static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> |
buildKanjiMeaningLangTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiMeaningTree(java.util.Set<Kanji> kanjis)
Search a meaning in any language(always lowercase): List<Integer> refs = tree.search("meaning"); Search a meaning in the language ES(always in iso639.1 and lowecase) List<Integer> refs = tree.search("meaning" + "#es"); |
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiNelsonRadicalTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiReadingTree(java.util.Set<Kanji> kanjis)
Search reading of any reading type: List<Integer> refs = tree.search("reading"); Search a reading of a particual reading type: List<Integer> refs = tree.search("reading" + "#readingtype"); |
static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> |
buildKanjiReadingTypeTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Integer,java.lang.Integer> |
buildKanjiSKIPCodeTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiSpahnHadamitzkyCodeTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiStrokeCountTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> |
buildKanjiStrokeMiscountsTree(java.util.Set<Kanji> kanjis)
|
static java.util.TreeSet<java.lang.Integer> |
buildKanjiUnicodeTree(java.util.Set<Kanji> kanjis)
|
static SequenceTree<java.lang.Character,java.lang.Integer> |
buildKanjiVariantTree(java.util.Set<Kanji> kanjis)
Search variant of any variant type: List<Integer> refs = tree.search("variant"); Search a variant of a particular variant type: List<Integer> refs = tree.search("variant" + "#variantType"); |
static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> |
buildKanjiVariantTypeTree(java.util.Set<Kanji> kanjis)
|
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public TreeBuilder()
Method Detail |
---|
public static SequenceTree<AllowedStrokeLineEnum,java.lang.Integer> buildKanjiGraphTree(java.util.Set<Kanji> kanjis) throws java.io.IOException
java.io.IOException
public static java.util.TreeSet<java.lang.Integer> buildKanjiUnicodeTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Integer,java.lang.Integer> buildKanjiJisCodeTree(java.util.Set<Kanji> kanjis)
public static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> buildKanjiJisCharset(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiClassicRadicalTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiNelsonRadicalTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiGradeTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiStrokeCountTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiStrokeMiscountsTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiVariantTree(java.util.Set<Kanji> kanjis)
List<Integer> refs = tree.search("variant");
List<Integer> refs = tree.search("variant" + "#variantType");
public static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> buildKanjiVariantTypeTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.lang.Integer> buildKanjiFrequencyTreeSet(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.Set<java.lang.Integer>> buildKanjiJLPTLevelTree(java.util.Set<Kanji> kanjis)
public static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> buildKanjiDicNameTree(java.util.Set<Kanji> kanjis)
public static java.util.TreeMap<java.lang.Integer,java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>>> buildKanjiDicReferenceTree(java.util.Set<Kanji> kanjis)
Collection<Integer> indexList = map.get(index).get(dicName)
Collection<Integer> indexList =
CollectionsExtra.plainToList(map.get(index).values)
List<Integer> refList;
for(HashMap<Integer> refs :
map.values())
reflist.addAll(refs.get(dicName);//be careful with null maps!
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiReadingTree(java.util.Set<Kanji> kanjis)
List<Integer> refs = tree.search("reading");
List<Integer> refs = tree.search("reading" + "#readingtype");
public static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> buildKanjiReadingTypeTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiMeaningTree(java.util.Set<Kanji> kanjis)
List<Integer> refs = tree.search("meaning");
List<Integer> refs = tree.search("meaning" + "#es");
public static java.util.HashMap<java.lang.String,java.util.Set<java.lang.Integer>> buildKanjiMeaningLangTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Integer,java.lang.Integer> buildKanjiSKIPCodeTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiDeRooCodeTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiFourCornerCodeTree(java.util.Set<Kanji> kanjis)
public static SequenceTree<java.lang.Character,java.lang.Integer> buildKanjiSpahnHadamitzkyCodeTree(java.util.Set<Kanji> kanjis)
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |