/**
     * Returns the list of suggested words.
     * @return The list of words.
     */
    public List<String> getWords() {
        return words;
    }

    /**
     * Returns the number of suggested words.
     * @return The number of words.
     */
    public int getNum() {
        return num;
    }

    /**
     * Returns the total number of hits.
     * @return The total number of hits.
     */

     * @param words the list of popular words
     * @param total the total number of words
     * @param items the list of suggested items
     */
    public PopularWordsResponse(final String index, final long tookMs, final List<String> words, final long total,
            final List<SuggestItem> items) {
        this.index = index;
        this.tookMs = tookMs;
        this.words = words;
        num = words.size();

    }

    /**
     * Gets the new input words.
     * Returns a defensive copy to prevent external modification.
     *
     * @return The new input words (defensive copy).
     */
    public String[] getNewInputs() {
        return newInputs == null ? null : newInputs.clone();
    }

    /**
     * Sets the new input words.
     *
     * @param newInputs The new input words.
     */

		if !isSpace(r) {
			break
		}
	}
	// Scan until space, marking end of word.
	for width, i := 0, start; i < len(data); i += width {
		var r rune
		r, width = utf8.DecodeRune(data[i:])
		if isSpace(r) {
			return i + width, data[start:i], nil
		}
	}
	// If we're at EOF, we have a final, non-empty, non-terminated word. Return it.
	if atEOF && len(data) > start {
		return len(data), data[start:], nil
	}

public interface ContentsParser {
    /**
     * Parses the given search words and creates a SuggestItem.
     *
     * @param words the array of search words
     * @param readings the array of readings corresponding to the search words
     * @param fields the array of fields associated with the search words
     * @param tags the array of tags associated with the search words
     * @param roles the array of roles associated with the search words

or Longitude either, but thought they were nice grand words to
say.)

  Presently she began again.  `I wonder if I shall fall right
THROUGH the earth!  How funny it'll seem to come out among the
people that walk with their heads downward!  The Antipathies, I
think--' (she was rather glad there WAS no one listening, this
time, as it didn't sound at all the right word) `--but I shall

import org.junit.jupiter.api.Tag;
import org.junit.jupiter.api.Test;

import io.restassured.RestAssured;
import io.restassured.path.json.JsonPath;

/**
 * Integration tests for the Suggest Words API (/api/v1/suggest-words)
 */
@Tag("it")
public class SuggestWordsApiTests extends ITBase {

    @BeforeAll
    protected static void initAll() {
        RestAssured.baseURI = getFessUrl();
        settingTestToken();

            return FormatType.LABEL;
        }
        if ("popular-words".equals(type)) {
            return FormatType.POPULARWORD;
        }
        if ("favorites".equals(type)) {
            return FormatType.FAVORITES;
        }
        if ("health".equals(type)) {
            return FormatType.PING;
        }
        if ("suggest-words".equals(type)) {
            return FormatType.SUGGEST;
        }

  }

  abstract String normalizeWord(String word);

  String normalizeFirstWord(String word) {
    return normalizeWord(word);
  }

  private static String firstCharOnlyToUpper(String word) {
    return word.isEmpty()
        ? word
        : Ascii.toUpperCase(word.charAt(0)) + Ascii.toLowerCase(word.substring(1));
  }

    Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl();

    /*
     * These arrays are set up to test that the comparator compares bytes within a word in the
     * correct order—in order words, that it doesn't mix up big-endian and little-endian. The first
     * array has a smaller element at one index, and then the second array has a smaller element at
     * the next.
     */