Package com.googlecode.gaal.suffix.api.IntervalTree

Examples of com.googlecode.gaal.suffix.api.IntervalTree.Interval.left()

421
422
423
424
425
426
427
428
429
430
431
        while (iterator.hasNext()) {
            Interval node = iterator.next();
            Integer style = styleMap.get(node);
            if (style != null) {
                NodeStyle nodeStyle = TikzConstants.CELL_STYLES[style];
                for (int i = node.left(); i <= node.right(); i++) {
                    IntSequence subSequence = sequence.subSequence(suffixTable[i], suffixTable[i] + node.lcp());
                    for (int j = 0; j < subSequence.size(); j++) {
                        if (!usedCells[i][j]) {
                            usedCells[i][j] = true;
                            drawing.drawCell(i, j, symbolTable.toToken(subSequence.get(j)).toString(), nodeStyle);
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
            children.add(iterator.next());
        int n = children.size();

        for (int i = 1; i < n; i++) {
            Interval child = children.get(i);
            int lb = child.left();
            result[lb] = esa.getLcpTable()[lb] * esa.alphabetSize() + depth(i + 1, n);
        }
        for (Node child : children) {
            traverseDepths(child, result, esa);
        }
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    }

    @Test
    public void testGetTop() {
        Interval top = lst.top();
        assertTrue(top.left() == 0);
        assertTrue(top.right() == text.length - 1);
        assertTrue(top.lcp() == 0);
    }

    @Test
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
    }

    @Test
    public void testTop() {
        Interval top = esa.top();
        assertTrue(top.left() == 0);
        assertTrue(top.right() == text.length - 1);
        assertTrue(top.lcp() == 0);
    }

    @Test
View Full Code Here
218
219
220
221
222
223
224
225
226
227
228
            if (!(obj instanceof Interval))
                return false;
            Interval other = (Interval) obj;
            if (lcp != other.lcp())
                return false;
            if (left != other.left())
                return false;
            if (right != other.right())
                return false;
            return true;
        }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
                fail("right context not found");
            } else {
                NavigableSet<Integer> leftIndices = intervalIndices(leftInterval);
                int[] suffixTable = lst.getSuffixTable();
                expectedSet = new HashMultiset<IntSequence>();
                for (int i = rightInterval.left(); i <= rightInterval.right(); i++) {
                    int end = suffixTable[i];
                    Integer start = leftIndices.floor(end);
                    if (start != null && end - start < WINDOW_SIZE) {
                        IntSequence fillerSeq = lst.getSequence().subSequence(start, end);
                        boolean hasSpecial = false;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.