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

Examples of com.googlecode.gaal.suffix.api.IntervalTree.Interval

122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
    }

    @Test
    public void testSearch() {
        IntSequence pattern;
        Interval interval;
        pattern = new ArraySequence(new int[] { 3, 4 });
        interval = lst.search(pattern);
        System.out.printf("%s\t->%s\n", interval, interval.label());
        assertTrue(seqEquals(interval.label(), pattern));
        pattern = new ArraySequence(new int[] { 3, 4, 2, 1 });
        interval = lst.search(pattern);
        System.out.printf("%s\t->%s\n", interval, interval.label());
        assertTrue(seqEquals(interval.label(), pattern));
        pattern = new ArraySequence(new int[] { 3, 4, 1 });
        interval = lst.search(pattern);
        assertNull(interval);
    }
View Full Code Here
144
145
146
147
148
149
150
151
152
        int[] expectedArray = {2, 1};
        IntSequence pattern = new ArraySequence(patternToFind);
        IntSequence expected = new ArraySequence(expectedArray);
        System.out.println("Looking for : " + pattern);
        System.out.println("Expected: " + expected);
        Interval result = lst.longestSearch(pattern);
        System.out.println("Longest found: " + result.label());
        assertEquals(expected, result.label());
    }
View Full Code Here
78
79
80
81
82
83
84
85
86
87
        assertArrayEquals(pChildTable, epa.getChildTable());
    }

    @Test
    public void testTop() {
        Interval top = esa.top();
        assertTrue(top.left() == 0);
        assertTrue(top.right() == text.length - 1);
        assertTrue(top.lcp() == 0);
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
    @Test
    public void testTraversePreOrder() {
        Iterator<Node> iterator = esa.preorderIterator();
        int i = 0;
        while (iterator.hasNext()) {
            Interval node = iterator.next();
            IntervalImpl ref = preOrder[i++];
            if (!ref.equals(node)) {
                System.err.println(ref + " != " + node);
                fail("node mismatch");
            } else {
View Full Code Here
215
216
217
218
219
220
221
222
223
224
225
226
227
228
                return true;
            if (obj == null)
                return false;
            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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
        Multiset<IntSequence> expectedSet = null;
        if (leftInterval == null) {
            System.err.printf("left context not found: %s\n", left);
            fail("left context not found");
        } else {
            Interval rightInterval = lst.search(right);
            if (rightInterval == null) {
                System.err.printf("right context not found: %s\n", right);
                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

Related Classes of com.googlecode.gaal.suffix.api.IntervalTree.Interval

  • com.googlecode.gaal.analysis.impl.Analyser
  • com.googlecode.gaal.analysis.impl.ConcurrentEmbeddedContextExtractor$ContextIterator
  • com.googlecode.gaal.analysis.impl.ContextExtractorTest
  • com.googlecode.gaal.analysis.impl.RecursiveIntervalExtractor$RecursiveIntervalIterator
  • com.googlecode.gaal.analysis.impl.SimpleContextFilter
  • com.googlecode.gaal.suffix.algorithm.impl.ExtendedLcpTableBuilderImpl
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest$IntervalImpl
  • com.googlecode.gaal.suffix.impl.LinearizedSuffixTreeImplTest
  • com.googlecode.gaal.vis.TableVisualizer
    • 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.