UnmodifiableIterator<T> iterator) {
    return checkNotNull(iterator);
  }

  /**
   * Returns the number of elements remaining in {@code iterator}. The iterator will be left
   * exhausted: its {@code hasNext()} method will return {@code false}.
   */
  public static int size(Iterator<?> iterator) {
    long count = 0L;
    while (iterator.hasNext()) {
      iterator.next();

    }

    @Test
    @DisplayName("Should handle Unicode characters in delimiter")
    void testJoinWithUnicodeDelimiter() {
        String result = StringUtil.join("→", "left", "right");
        assertEquals("left→right", result);
    }

    @Test
    @DisplayName("Should handle Unicode characters in elements")
    void testJoinWithUnicodeElements() {

.sidebar-mini.sidebar-collapse .sidebar-search {
	display: none !important;
}

input[type="file"].form-control:not([type="file"]) {
	height: 0% !important;
}

#result ol {
	list-style: none !important;
	padding-left: 0;
}

#result ol li {
	margin-bottom: 0;
}

#result .title {
	margin: 1.0em 0 0.5em 0;
	font-size: 120%;
	font-weight: 600;
}

section.content table {
	display: table;

import org.gradle.api.tasks.Internal;
import org.gradle.api.tasks.Optional;

/**
 * A transformation to remove the key/value of a given match. To help keep logic simple, an empty match object will be left behind
 * if/when the only key/value is removed.
 */
public class RemoveMatch implements RestTestTransformByParentObject {
    private final String removeKey;
    private final String testName;

    INSTANCE;

    @Override
    public int compare(float[] left, float[] right) {
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Float.compare(left[i], right[i]);
        if (result != 0) {
          return result;
        }
      }
      return left.length - right.length;
    }

    @Override
    public String toString() {

                                            value="<la:message key="labels.design_button_back" />">
                                        <i class="fa fa-arrow-circle-left" aria-hidden="true"></i>
                                        <la:message key="labels.design_button_back"/>
                                    </button>

		// as the left most elements, regardless of IP based sorting.
		{
			ipList:       []string{"hostname", "127.0.0.1", "192.168.1.106"},
			sortedIPList: []string{"hostname", "192.168.1.106", "127.0.0.1"},
		},
		// Non parsable ip is assumed to be hostname, with a mixed input of ip and hostname.
		// gets preserved and moved into left most elements, regardless of
		// IP based sorting.
		{

    INSTANCE;

    @Override
    public int compare(long[] left, long[] right) {
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        if (left[i] != right[i]) {
          return UnsignedLongs.compare(left[i], right[i]);
        }
      }
      return left.length - right.length;
    }

    @Override
    public String toString() {

    INSTANCE;

    @Override
    public int compare(double[] left, double[] right) {
      int minLength = Math.min(left.length, right.length);
      for (int i = 0; i < minLength; i++) {
        int result = Double.compare(left[i], right[i]);
        if (result != 0) {
          return result;
        }
      }
      return left.length - right.length;
    }

    @Override

   * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Bytes.asList(array),
   * distance)}, but is somewhat faster.
   *
   * <p>The provided "distance" may be negative, which will rotate left.
   *
   * @since 32.0.0
   */
  public static void rotate(byte[] array, int distance) {
    rotate(array, distance, 0, array.length);
  }

  /**