Examples of com.ctc.wstx.util.WordResolver

com.ctc.wstx.util.WordResolver
A specialized Map/Symbol table - like data structure that can be used for both checking whether a word (passed in as a char array) exists in certain set of words AND getting that word as a String. It is reasonably efficient both time and speed-wise, at least for certain use cases; specifically, if there is no existing key to use, it is more efficient way to get to a shared copy of that String The general usage pattern is expected to be such that most checks are positive, ie. that the word indeed is contained in the structure.
Although this is an efficient data struct for specific set of usage patterns, one restriction is that the full set of words to include has to be known before constructing the instnace. Also, the size of the set is limited to total word content of about 20k characters.
TODO: Should document the internal data structure...

        TreeSet<String> set = new TreeSet<String>();
        for (int i = 0, len = words.length; i < len; ++i) {
            set.add(words[i]);
        }


        WordResolver wr = WordResolver.constructInstance(set);


        assertEquals(wr.size(), set.size());


        Iterator<String> it = set.iterator();


        // Let's first check if words that should be there, are:
        while (it.hasNext()) {
            String str = it.next();


            assertEquals(str, wr.find(str));
            // And then, let's make sure intern()ing isn't needed:
            assertEquals(str, wr.find(""+str));


            char[] strArr = str.toCharArray();
            char[] strArr2 = new char[strArr.length + 4];
            System.arraycopy(strArr, 0, strArr2, 3, strArr.length);
            assertEquals(str, wr.find(strArr, 0, str.length()));
            assertEquals(str, wr.find(strArr2, 3, str.length() + 3));
        }


        // And then that ones shouldn't be there aren't:
        for (int i = 0, len = missingWords.length; i < len; ++i) {
            checkNotFind(wr, missingWords[i]);

View Full Code Here

        TreeSet set = new TreeSet();
        for (int i = 0, len = words.length; i < len; ++i) {
            set.add(words[i]);
        }


        WordResolver wr = WordResolver.constructInstance(set);


        assertEquals(wr.size(), set.size());


        Iterator it = set.iterator();


        // Let's first check if words that should be there, are:
        while (it.hasNext()) {
            String str = (String) it.next();


            assertEquals(str, wr.find(str));
            // And then, let's make sure intern()ing isn't needed:
            assertEquals(str, wr.find(""+str));


            char[] strArr = str.toCharArray();
            char[] strArr2 = new char[strArr.length + 4];
            System.arraycopy(strArr, 0, strArr2, 3, strArr.length);
            assertEquals(str, wr.find(strArr, 0, str.length()));
            assertEquals(str, wr.find(strArr2, 3, str.length() + 3));
        }


        // And then that ones shouldn't be there aren't:
        for (int i = 0, len = missingWords.length; i < len; ++i) {
            checkNotFind(wr, missingWords[i]);

View Full Code Here

TOP

Related Classes of com.ctc.wstx.util.WordResolver

wstxtest.util.TestWordResolver

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.