Lines Matching refs:RadixTreeNode
45 protected RadixTreeNode<T> root;
53 root = new RadixTreeNode<T>();
61 public void visit(String key, RadixTreeNode<T> parent,
62 RadixTreeNode<T> node) {
75 public void visit(String key, RadixTreeNode<T> parent, RadixTreeNode<T> node) {
92 public void visit(String key, RadixTreeNode<T> parent,
93 RadixTreeNode<T> node) {
101 Iterator<RadixTreeNode<T>> it = parent.getChildern()
135 private void mergeNodes(RadixTreeNode<T> parent,
136 RadixTreeNode<T> child) {
175 private void insert(String key, RadixTreeNode<T> node, T value)
185 for (RadixTreeNode<T> child : node.getChildern()) {
195 RadixTreeNode<T> n = new RadixTreeNode<T>();
215 RadixTreeNode<T> n1 = new RadixTreeNode<T>();
223 node.setChildern(new ArrayList<RadixTreeNode<T>>());
227 RadixTreeNode<T> n2 = new RadixTreeNode<T>();
240 RadixTreeNode<T> n = new RadixTreeNode<T>();
257 RadixTreeNode<T> node = searchPefix(key, root);
269 private void getNodes(RadixTreeNode<T> parent, ArrayList<T> keys, int limit) {
270 Queue<RadixTreeNode<T>> queue = new LinkedList<RadixTreeNode<T>>();
275 RadixTreeNode<T> node = queue.remove();
288 private RadixTreeNode<T> searchPefix(String key, RadixTreeNode<T> node) {
289 RadixTreeNode<T> result = null;
298 for (RadixTreeNode<T> child : node.getChildern()) {
311 public void visit(String key, RadixTreeNode<T> parent,
312 RadixTreeNode<T> node) {
346 RadixTreeNode<T> parent, RadixTreeNode<T> node) {
358 for (RadixTreeNode<T> child : node.getChildern()) {
384 private void display(int level, RadixTreeNode<T> node) {
391 private void formatNodeTo(Formatter f, int level, RadixTreeNode<T> node) {
405 for (RadixTreeNode<T> child : node.getChildern()) {
435 private String complete(String key, RadixTreeNode<T> node, String base) {
453 for (RadixTreeNode<T> child : node.getChildern()) {
