try {
            // For TCP fallback, simulate writing data through the TCP socket
            int bytesToWrite = Math.min(length, buffer.remaining());

            ByteBuffer writeBuffer = buffer.duplicate();
            writeBuffer.limit(writeBuffer.position() + bytesToWrite);

            int totalWritten = 0;
            while (writeBuffer.hasRemaining()) {

    /**
     * Calculates the effective repositories for the given input repositories which are assumed to be already mirrored
     * (if applicable). This process will essentially remove duplicate repositories by merging them into one equivalent
     * repository. It is worth to point out that merging does not simply choose one of the input repositories and

    checkNotNull(mergeFunction, "mergeFunction");

    /*
     * No mutable Table exactly matches the insertion order behavior of ImmutableTable.Builder, but
     * the Builder can't efficiently support merging of duplicate values.  Getting around this
     * requires some work.
     */

    return Collector.of(
        ImmutableTableCollectorState<R, C, V>::new,
        (state, input) ->
            state.put(

        assertNull(facetInfo.size);
        assertNull(facetInfo.minDocCount);
        assertNull(facetInfo.sort);
        assertNull(facetInfo.missing);
    }

    // Test init with duplicate and empty field names
    public void test_init_withDuplicateAndEmptyFieldNames() {
        FessConfig fessConfig = new FessConfig.SimpleImpl() {
            @Override
            public String getQueryFacetFields() {

        return buf.toString().trim();
    }

    /**
     * Replaces duplicate hosts in the URL using the duplicate host helper.
     *
     * @param url the URL to process
     * @return the URL with duplicate hosts replaced
     */
    protected String replaceDuplicateHost(final String url) {
        try {
            // remove duplicate host

   * referencing the type variables seem worthwhile.
   */
  final void checkNoDuplicate(R rowKey, C columnKey, @Nullable V existingValue, V newValue) {
    checkArgument(
        existingValue == null,
        "Duplicate key: (row=%s, column=%s), values: [%s, %s].",
        rowKey,
        columnKey,
        newValue,
        existingValue);
  }

  // redeclare to satisfy our test for b/310253115
  @Override

    }

    /**
     * Gets the maximum number of duplicated paths to attempt.
     *
     * @return the maximum duplicated path count
     */
    public int getMaxDuplicatedPath() {
        return maxDuplicatedPath;
    }

    /**
     * Sets the maximum number of duplicated paths to attempt.
     *
     * @param maxDuplicatedPath the maximum duplicated path count to set
     */

    checkNotNull(mergeFunction, "mergeFunction");

    /*
     * No mutable Table exactly matches the insertion order behavior of ImmutableTable.Builder, but
     * the Builder can't efficiently support merging of duplicate values.  Getting around this
     * requires some work.
     */

    return Collector.of(
        ImmutableTableCollectorState<R, C, V>::new,
        (state, input) ->
            state.put(

                field.setAccessible(true);
                String value = (String) field.get(null);
                assertFalse("Duplicate value found: " + value + " for field: " + field.getName(), values.contains(value));
                values.add(value);
            }
        }
    }

    /**

				for idx, column := range columns {
					if field := sch.LookUpField(column); field != nil && field.Readable {
						fields[idx] = field
						if count, ok := matchedFieldCount[column]; ok {
							// handle duplicate fields
							for _, selectField := range sch.Fields {
								if selectField.DBName == column && selectField.Readable {
									if count == 0 {
										matchedFieldCount[column]++
										fields[idx] = selectField