* @return the relevant document IDs
     */
    public List<String> getRelevantDocIds() {
        return relevantDocIds;
    }

    /**
     * Returns the list of relevant indexes (1-based) from search results.
     *
     * @return the relevant indexes
     */
    public List<Integer> getRelevantIndexes() {
        return relevantIndexes;
    }

    /**
     * Returns whether relevant results were found.
     *

        return badWords;
    }

    /**
     * Indexes a single suggest item.
     * @param item The suggest item to index.
     * @return The SuggestIndexResponse.
     */
    public SuggestIndexResponse index(final SuggestItem item) {
        ensureOperations();
        return indexingOps.index(index, item, badWords);
    }

    /**
     * Indexes multiple suggest items.

			}
			if !reflect.DeepEqual(testCase.indexes, gotIndexes) {
				t.Errorf("Expected %v, got %v", testCase.indexes, gotIndexes)
			}
		})
	}
}

// Test tests calculating set indexes.
func TestGetSetIndexes(t *testing.T) {
	testCases := []struct {
		args       []string
		totalSizes []uint64
		indexes    [][]uint64
		success    bool
	}{
		// Invalid inputs.
		{

        private int index = -1;
        private final int maxIndex = keyToIndex().size();

        @Override
        protected @Nullable Entry<K, V> computeNext() {
          for (index++; index < maxIndex; index++) {
            V value = getValue(index);
            if (value != null) {
              return immutableEntry(getKey(index), value);
            }
          }

     */
    @Override
    public String escape(String s) {
      int slen = s.length();
      for (int index = 0; index < slen; index++) {
        char c = s.charAt(index);
        if (c < replacements.length && replacements[c] != null) {
          return escapeSlow(s, index);
        }
      }
      return s;
    }

    @Override
    protected char @Nullable [] escape(char c) {

        private int index = -1;
        private final int maxIndex = keyToIndex().size();

        @Override
        protected @Nullable Entry<K, V> computeNext() {
          for (index++; index < maxIndex; index++) {
            V value = getValue(index);
            if (value != null) {
              return immutableEntry(getKey(index), value);
            }
          }

    }

    /**
     * Indexes a single suggest item.
     *
     * @param index The index name
     * @param item The suggest item to index
     * @param badWords The list of bad words to filter against
     * @return The SuggestIndexResponse
     */
    public SuggestIndexResponse index(final String index, final SuggestItem item, final String[] badWords) {
        return index(index, new SuggestItem[] { item }, badWords);
    }

	HasConstraint(dst interface{}, name string) bool

	// Indexes
	CreateIndex(dst interface{}, name string) error
	DropIndex(dst interface{}, name string) error
	HasIndex(dst interface{}, name string) bool
	RenameIndex(dst interface{}, oldName, newName string) error
	GetIndexes(dst interface{}) ([]Index, error)

/**
 * Form class for creating protected words dictionary entries.
 * Protected words are terms that should not be modified or analyzed during
 * text processing, preserving their original form in search indexes.
 *
 */
public class CreateForm {

    /**
     * Creates a new CreateForm instance.
     */
    public CreateForm() {
        // Default constructor
    }

    /** Dictionary identifier */

        @DisplayName("Returns 0 regardless of dst and index")
        void returnsZero_forVariousIndexes(int index) {
            // Arrange
            Smb2LogoffResponse resp = newResponse();
            byte[] buffer = new byte[8];
            byte[] original = buffer.clone();

            // Act
            int written = resp.writeBytesWireFormat(buffer, index);

            // Assert