Package com.googlecode.gaal.data.impl

Examples of com.googlecode.gaal.data.impl.ArraySequence

254
255
256
257
258
259
260
261
            for (int i = 0; i < indices.size(); i++) {
                if (!removedIndices.get(i)) {
                    newIndices[counter++] = indices.get(i);
                }
            }
            return new ArraySequence(newIndices);
        }
    }
View Full Code Here
100
101
102
103
104
105
106
            return interval;
        }

        @Override
        public IntSequence embeddingIndices() {
            return new ArraySequence(embeddingSuffixTable, left, right + 1);
        }
View Full Code Here
42
43
44
45
46
47
48
            return right - left + 1;
        }

        @Override
        public IntSequence indices() {
            return new ArraySequence(suffixTable, left, right + 1);
        }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
            } // right half
        }

        // recurse if names are not yet unique
        if (name < n02) {
            sort(new ArraySequence(s12), sa12, n02, name);
            // store unique names in s12 using the suffix array
            for (int i = 0; i < n02; i++)
                s12[sa12[i]] = i + 1;
        } else
            // generate the suffix array of s12 directly
View Full Code Here
60
61
62
63
64
65
66
67
68
    private LinearizedSuffixTree lpt;

    @Before
    public void setUp() throws Exception {

        IntSequence sequence = new ArraySequence(text);
        lst = new LinearizedSuffixTreeImpl(sequence, alphabet.length - 1);
        lpt = new LinearizedSuffixTreeImpl(sequence.reverse(), alphabet.length - 1);
    }
View Full Code Here
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
140
141
142
143
144
145
146
147
148
149
150
151
   
    @Test
    public void testLongestSearch() {
        int[] patternToFind = { 2, 1, 4 };
        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
65
66
67
68
69
70
71
72
73
    private EnhancedSuffixArray esa;
    private EnhancedSuffixArray epa;

    @Before
    public void setUp() throws Exception {
        IntSequence sequence = new ArraySequence(text);
        esa = new EnhancedSuffixArrayImpl(sequence, alphabet.length - 1);
        epa = new EnhancedSuffixArrayImpl(sequence.reverse(), alphabet.length - 1);
    }
View Full Code Here
153
154
155
156
157
158
159
        String[] stringArray = string.split(" ");
        int[] intArray = new int[stringArray.length];
        for (int i = 0; i < intArray.length; i++) {
            intArray[i] = corpus.toInt(stringArray[i]);
        }
        return new ArraySequence(intArray);
    }
View Full Code Here
TOP

Related Classes of com.googlecode.gaal.data.impl.ArraySequence

  • com.googlecode.gaal.analysis.impl.ContextExtractorTest
  • com.googlecode.gaal.suffix.algorithm.impl.SkewSuffixTableBuilder
  • com.googlecode.gaal.suffix.impl.AbstractIntervalTree$AbstractInterval
  • com.googlecode.gaal.suffix.impl.EmbeddedSuffixTreeImpl$EmbeddedIntervalImpl
  • com.googlecode.gaal.suffix.impl.EnhancedSuffixArrayImplTest
  • com.googlecode.gaal.suffix.impl.LinearizedSuffixTreeImplTest
  • com.googlecode.gaal.vis.VectorVisualizer
    • 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.