Examples with Node org.trie4j.Node used on opensource projects

Example 16 with Node

use of org.trie4j.Node in project trie4j by takawitter.

the class TailLOUDSTrieWithSuffixTrieTailArrayWikipediaTest method afterVerification.

@Override
protected void afterVerification(Trie trie) throws Exception {
    TailLOUDSTrie t = (TailLOUDSTrie) trie;
    final Map<Integer, List<Integer>> childrenCounts = new TreeMap<Integer, List<Integer>>(new Comparator<Integer>() {

        @Override
        public int compare(Integer o1, Integer o2) {
            return o2 - o1;
        }
    });
    Algorithms.traverseByBreadth(t.getRoot(), new NodeVisitor() {

        @Override
        public boolean visit(Node node, int nest) {
            int n = node.getChildren().length;
            List<Integer> nodes = childrenCounts.get(n);
            if (nodes == null) {
                nodes = new ArrayList<Integer>();
                childrenCounts.put(n, nodes);
            }
            nodes.add(c++);
            return c < 6189;
        }

        int c = 0;
    });
    for (Map.Entry<Integer, List<Integer>> entry : childrenCounts.entrySet()) {
        System.out.println(entry.getKey() + ": " + entry.getValue());
    }
}

Example 17 with Node

use of org.trie4j.Node in project trie4j by takawitter.

the class MapPatriciaTrieWikipediaTest method afterVerification.

@Override
protected void afterVerification(Trie trie) throws Exception {
    final AtomicInteger nodes = new AtomicInteger();
    final AtomicInteger leaves = new AtomicInteger();
    Algorithms.traverseByDepth(trie.getRoot(), new NodeVisitor() {

        @Override
        public boolean visit(Node node, int nest) {
            if (node.isTerminate())
                leaves.incrementAndGet();
            else
                nodes.incrementAndGet();
            return true;
        }
    });
    System.out.println(String.format("%d nodes and %d leaves", nodes.intValue(), leaves.intValue()));
    super.afterVerification(trie);
}

Example 18 with Node

use of org.trie4j.Node in project trie4j by takawitter.

the class MapTailPatriciaTrieWithSuffixTrieTailBuilderWikipediaTest method afterVerification.

@Override
protected void afterVerification(Trie trie) throws Exception {
    final AtomicInteger nodes = new AtomicInteger();
    final AtomicInteger leaves = new AtomicInteger();
    Algorithms.traverseByDepth(trie.getRoot(), new NodeVisitor() {

        @Override
        public boolean visit(Node node, int nest) {
            if (node.isTerminate())
                leaves.incrementAndGet();
            else
                nodes.incrementAndGet();
            return true;
        }
    });
    System.out.println(String.format("%d nodes and %d leaves", nodes.intValue(), leaves.intValue()));
    super.afterVerification(trie);
}

Example 19 with Node

use of org.trie4j.Node in project trie4j by takawitter.

the class PatriciaTrieWikipediaTest method afterVerification.

@Override
protected void afterVerification(Trie trie) throws Exception {
    final AtomicInteger nodes = new AtomicInteger();
    final AtomicInteger leaves = new AtomicInteger();
    Algorithms.traverseByDepth(trie.getRoot(), new NodeVisitor() {

        @Override
        public boolean visit(Node node, int nest) {
            if (node.isTerminate())
                leaves.incrementAndGet();
            else
                nodes.incrementAndGet();
            return true;
        }
    });
    System.out.println(String.format("%d nodes and %d leaves", nodes.intValue(), leaves.intValue()));
    super.afterVerification(trie);
}

Example 20 with Node

use of org.trie4j.Node in project trie4j by takawitter.

the class BitVectorExp method main.

public static void main(String[] args) throws Exception {
    Trie trie = new PatriciaTrie();
    int c = 0;
    // You can download archive from http://dumps.wikimedia.org/jawiki/latest/
    LapTimer t = new LapTimer();
    for (String word : new WikipediaTitles()) {
        trie.insert(word);
        c++;
        if (c == maxCount)
            break;
    }
    t.lapMillis("trie building done. %d words.", c);
    final BytesSuccinctBitVector bv = new BytesSuccinctBitVector(5000000);
    final AtomicInteger nodeCount = new AtomicInteger();
    Algorithms.traverseByDepth(trie.getRoot(), new NodeVisitor() {

        @Override
        public boolean visit(Node node, int nest) {
            Node[] children = node.getChildren();
            if (children != null) {
                int n = node.getChildren().length;
                for (int i = 0; i < n; i++) {
                    bv.append(true);
                }
            }
            bv.append(false);
            nodeCount.incrementAndGet();
            return true;
        }
    });
    trie = null;
    t.lapMillis("done. %d nodes inserted. do rank and select", nodeCount.intValue());
    for (int i = 0; i < c; i += 100) {
        int count = bv.rank(i, true);
        bv.select(count, true);
    }
    t.lapMillis("done.");
    Thread.sleep(10000);
}