Package com.googlecode.gaal.suffix.api.SuffixTree

Examples of com.googlecode.gaal.suffix.api.SuffixTree.Node

61
62
63
64
65
66
67
68
69
        @Override
        public Node next() {
            if (next == null)
                throw new NoSuchElementException();
            Node node = next;
            advance();
            return node;
        }
View Full Code Here
119
120
121
122
123
124
125
126
127
        @Override
        public Node next() {
            if (node == null)
                throw new NoSuchElementException();
            Node result = node;
            advance();
            return result;
        }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
                @SuppressWarnings("unchecked")
                BinaryNode<? extends Interval> binaryInterval = (BinaryNode<? extends Interval>) node;
                visualizeNode(binaryInterval.leftChild(), node, number, style, depth + 1);
                visualizeNode(binaryInterval.rightChild(), node, number, style, depth + 1);
            } else if (node instanceof Node) {
                Node n = (Node) node;
                Iterator<Node> childIterator = n.childIterator();
                while (childIterator.hasNext()) {
                    visualizeNode(childIterator.next(), node, number, style, depth + 1);
                }
            }
        } else if (depth == maxDepth) {
View Full Code Here
93
94
95
96
97
98
99
100
101
102
103
    private void compareChildren(Node node, int depth, int[] levelCounter) {
        Iterator<Node> iterator = node.childIterator();
        assertTrue("terminal or has next test failed", node.isTerminal() || iterator.hasNext());
        while (iterator.hasNext()) {
            Node child = iterator.next();
            IntervalImpl ref = children[depth - 1][levelCounter[depth - 1]++];
            System.out.println(node + " -> " + child);
            if (!ref.equals(child)) {
                System.err.println(ref + " != " + child + "," + depth);
                fail("child mismatch");
View Full Code Here
TOP

Related Classes of com.googlecode.gaal.suffix.api.SuffixTree.Node

  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayBase$ChildIterator
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayBase$PreorderIterator
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest
  • com.googlecode.gaal.vis.TreeVisualizer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.