final Suggester suggester = Suggester.builder().build(client, "switch-test");
        suggester.createIndexIfNothing();
        Thread.sleep(100);

        // Create additional update index (making 2 total)
        final String updateAlias = suggester.getIndex() + ".update";
        final String extraIndexName = suggester.getIndex() + ".extra";

   *
   * @param arrays zero or more {@code char} arrays
   * @return a single array containing all the values from the source arrays, in order
   * @throws IllegalArgumentException if the total number of elements in {@code arrays} does not fit
   *     in an {@code int}
   */
  public static char[] concat(char[]... arrays) {
    long length = 0;
    for (char[] array : arrays) {

     */

    private byte command, flags;
    /**
     * Starting position of the SMB header in the buffer.
     */
    protected int headerStart;
    /**
     * Total length of the SMB message.
     */
    protected int length;
    /**
     * Batch level for batched requests.
     */
    protected int batchLevel;
    /**
     * Error code returned by the server.

        Duration time = Duration.between(session.getRequest().getStartInstant(), finish);

        String wallClock = session.getRequest().getDegreeOfConcurrency() > 1 ? " (Wall Clock)" : "";

        logger.info("Total time:  {}{}", formatDuration(time), wallClock);

        ZonedDateTime rounded = finish.truncatedTo(ChronoUnit.SECONDS).atZone(ZoneId.systemDefault());
        logger.info("Finished at: {}", formatTimestamp(rounded));
    }

	}
	if partSize == 0 {
		return 0, errPartSizeZero
	}
	if partIndex < 1 {
		return 0, errPartSizeIndex
	}
	if totalSize == -1 {
		return -1, nil
	}
	if totalSize > 0 {
		// Compute the total count of parts
		partsCount := totalSize/partSize + 1
		// Return the part's size
		switch {
		case int64(partIndex) < partsCount:
			currPartSize = partSize
		case int64(partIndex) == partsCount:

type sparseEntry struct{ Offset, Length int64 }

func (s sparseEntry) endOffset() int64 { return s.Offset + s.Length }

// A sparse file can be represented as either a sparseDatas or a sparseHoles.
// As long as the total size is known, they are equivalent and one can be
// converted to the other form and back. The various tar formats with sparse
// file support represent sparse files in the sparseDatas form. That is, they

			 "node.name":"search_engine",
			 "discovery.seed_hosts":"search_engine",
			 "cluster.initial_cluster_manager_nodes":"search_engine",
			 "node.roles":"cluster_manager,data,ingest,ml",
			 -->
			 "indices.breaker.total.limit":"100%",
			 "action.auto_create_index":"-*"}
		</property>
		<!-- Dictionaries -->
		<postConstruct name="addConfigFile">
			<arg>"fess"</arg>
			<arg>"mapping.txt"</arg>
		</postConstruct>

        // Set converter and number of entries
        setConverter(response, 0);
        setNumEntries(response, numShares);

        // Calculate total buffer size
        int entrySize = 20; // 14 + 2 + 4
        int totalEntrySize = entrySize * numShares;
        int totalRemarkSize = 0;
        for (String remark : remarks) {

    }

    @Override
    public String toString() {
      return "BY_TO_STRING";
    }

    private Object readResolve() {
      return INSTANCE;
    }
  }

  // Always equal is a valid total ordering. And it works for any Object.
  private static final class AlwaysEqual extends Ordering<@Nullable Object>
      implements Serializable {
    private static final AlwaysEqual INSTANCE = new AlwaysEqual();

        SuggestItem[] mergedItems = writer.mergeItems(new SuggestItem[] { item1, item2, item3, item4, item5 });

        assertNotNull(mergedItems);
        assertEquals(1, mergedItems.length);
        // Total frequency should be 1+2+3+4+5 = 15
        assertEquals(15, mergedItems[0].getDocFreq());
    }

    @Test
    public void test_mergeItemsWithNoMatch() throws Exception {