/*
 * Copyright (C) 2004-2007
 * Takashi Okamoto <tora@debian.org>
 * Matt Francis <asbel@neosheffield.co.uk>
 * 
 * This library is free software; you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 2.1 of the License, or any later version.
 * 
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 * 
 */

package net.java.sen.trie;

import java.nio.IntBuffer;


/**
 * Searches a Trie data file
 */
public class TrieSearcher {
	/**
	 * Searches for Trie keys forming a complete substring of the given
	 * sentence, starting at the given position within the sentence
	 * 
	 * @param trieData The Trie data to search
	 * @param iterator The character iterator to read search characters from
	 * @param results An array used to return the values of the found keys
	 * @return The number of results found
	 * 
	 * @throws ArrayIndexOutOfBoundsException if results[] is too small
	 */
	public static int commonPrefixSearch(IntBuffer trieData, CharIterator iterator, int results[]) {

		int b = trieData.get(0 << 1);
		int num = 0;
		int n;
		int p;

		while (iterator.hasNext()) {

			p = b;
			n = trieData.get(p << 1);
			if (b == trieData.get((p << 1) + 1) && n < 0) {
				// Will throw ArrayIndexOutOfBoundsException if results[] is too small
				results[num] = -n - 1;
				num++;
			}

			p = b + iterator.next() + 1;


			if (((p << 1) + 1) >= trieData.limit()) {
				// We fell off the end of the Trie data
				return num;
			}


			if (b == trieData.get((p << 1) + 1)) {
				b = trieData.get(p << 1);
			} else {
				return num;
			}
		}

		p = b;
		n = trieData.get(p << 1);
		if (b == trieData.get((p << 1) + 1) && (n < 0)) {
			// Will throw ArrayIndexOutOfBoundsException if results[] is too small
			results[num] = -n - 1;
			num++;
		}

		return num;

	}
}

/*
 * Copyright (C) 2004-2007
 * Takashi Okamoto <tora@debian.org>
 * Matt Francis <asbel@neosheffield.co.uk>
 * 
 * This library is free software; you can redistribute it and/or modify it under
 * the terms of the GNU Lesser General Public License as published by the Free
 * Software Foundation; either version 2.1 of the License, or any later version.
 * 
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more
 * details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with this library; if not, write to the Free Software Foundation, Inc.,
 * 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 * 
 */

package net.java.sen.trie;

import java.nio.IntBuffer;


/**
 * Searches a Trie data file
 */
public class TrieSearcher {
	/**
	 * Searches for Trie keys forming a complete substring of the given
	 * sentence, starting at the given position within the sentence
	 * 
	 * @param trieData The Trie data to search
	 * @param iterator The character iterator to read search characters from
	 * @param results An array used to return the values of the found keys
	 * @return The number of results found
	 * 
	 * @throws ArrayIndexOutOfBoundsException if results[] is too small
	 */
	public static int commonPrefixSearch(IntBuffer trieData, CharIterator iterator, int results[]) {

		int b = trieData.get(0 << 1);
		int num = 0;
		int n;
		int p;

		while (iterator.hasNext()) {

			p = b;
			n = trieData.get(p << 1);
			if (n < 0 && b == trieData.get((p << 1) + 1)) {
				// Will throw ArrayIndexOutOfBoundsException if results[] is too small
				results[num] = -n - 1;
				num++;
			}

			p = b + iterator.next() + 1;


			if (((p << 1) + 1) >= trieData.limit()) {
				// We fell off the end of the Trie data
				return num;
			}


			if (b == trieData.get((p << 1) + 1)) {
				b = trieData.get(p << 1);
			} else {
				return num;
			}
		}

		p = b;
		n = trieData.get(p << 1);
		if ((n < 0) && b == trieData.get((p << 1) + 1)) {
			// Will throw ArrayIndexOutOfBoundsException if results[] is too small
			results[num] = -n - 1;
			num++;
		}

		return num;

	}
}

swap order of testing