Method binarySearch

src/main/java/wycc/util/Trie.java:318–335

(final Trie[] children, final int nchildren, final String key)

	}

	private static final int binarySearch(final Trie[] children, final int nchildren, final String key) {
		int low = 0;
        int high = nchildren-1;

        while (low <= high) {
            int mid = (low + high) >> 1;
            int c = children[mid].component.compareTo(key);

            if (c < 0) {
                low = mid + 1;
            } else if (c > 0) {
                high = mid - 1;
            } else {
                return mid;
            }
        }
        return -(low + 1);
	}

	private static final class InternalIterator implements Iterator<String> {
		private final Trie id;