com.mayabot.nlp.algorithm.collection.bintrie.BinTrieTreeBuilder Maven / Gradle / Ivy
/*
* Copyright 2018 mayabot.com authors. All rights reserved.
*
* 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.mayabot.nlp.algorithm.collection.bintrie;
import java.util.Map;
import java.util.function.Function;
/**
* @author jimichan
*/
@SuppressWarnings("unchecked")
public enum BinTrieTreeBuilder {
_default(false, HashTrieNode::new),
bigArray(false, ArrayTrieNode::new),
bigHash(false, ArrayTrieNode::new),
miniArray(true, ArrayTrieNode::new),
miniHash(true, HashTrieNode::new);
private boolean rootUseMap;
BinTrieTree.TrieNodeFactory nodeFactory;
BinTrieTreeBuilder(boolean rootUseMap, BinTrieTree.TrieNodeFactory nodeFactory) {
this.rootUseMap = rootUseMap;
this.nodeFactory = nodeFactory;
}
public BinTrieTree build() {
return new BinTrieTree<>(rootUseMap, nodeFactory);
}
public BinTrieTree build(Map map) {
BinTrieTree tree = new BinTrieTree<>(rootUseMap, nodeFactory);
for (Map.Entry entry : map.entrySet()) {
tree.put(entry.getKey(), entry.getValue());
}
return tree;
}
/**
* 每行的格式 word[空格]args
*
* @param split
* @param lines
* @param transFun
* @return BinTrieTree T
*/
public BinTrieTree build(String split, Iterable lines, Function transFun) {
BinTrieTree tree = new BinTrieTree<>(rootUseMap, nodeFactory);
final String[] empty = new String[0];
for (String line : lines) {
String[] list = line.split(split);
if (list.length == 1) {
tree.put(list[0], transFun.apply(empty));
} else {
String[] sublist = new String[list.length - 1];
System.arraycopy(list, 1, sublist, 0, sublist.length);
tree.put(list[0], transFun.apply(sublist));
}
}
return tree;
}
}