public void testCombinationsExhaustively_startingFromArbitrary() {
    Ordering<Object> arbitrary = Ordering.arbitrary();
    Object[] array = {1, "foo", new Object()};

    // There's no way to tell what the order should be except empirically
    sort(array, arbitrary);
    testExhaustively(arbitrary, array);
  }

  /**
   * Requires at least 3 elements in {@code strictlyOrderedElements} in order to test the varargs

import static org.mockito.Mockito.atLeastOnce;
import static org.mockito.Mockito.verify;
import static org.mockito.Mockito.when;

import java.net.InetAddress;
import java.net.UnknownHostException;
import java.util.Arrays;
import java.util.concurrent.TimeUnit;

import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.DisplayName;
import org.junit.jupiter.api.Test;
import org.junit.jupiter.api.Timeout;

    } catch (Exception e) { // sneaky checked exception
      throw new RuntimeException(Arrays.toString(stimuli), e);
    }
  }

  private void recurse(int level) {
    // We're going to reuse the stimuli array 3^steps times by overwriting it
    // in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {

    }

    /**
     * Validates array is not null and has expected length
     *
     * @param array the array to validate
     * @param expectedLength the expected length
     * @param fieldName the field name for error reporting
     * @throws IllegalArgumentException if array is invalid
     */
    public static void validateArrayLength(byte[] array, int expectedLength, String fieldName) {

     * to equals(), and we will deduplicate those properly, albeit at some cost in allocations.
     */
    int expectedSize =
        elements instanceof Set ? array.length : estimatedSizeForUnknownDuplication(array.length);
    return fromArrayWithExpectedSize(array, expectedSize);
  }

  /**
   * Returns an immutable set containing each of {@code elements}, minus duplicates, in the order

    }

    @Test
    @DisplayName("readUShort throws on too short array")
    void testReadUShortOutOfBounds() {
        byte[] a = new byte[] { 0x02 };
        assertThrows(IndexOutOfBoundsException.class, () -\u003e NtlmMessage.readUShort(a, 0));
    }

    @Test
    @DisplayName("readULong throws on too short array")
    void testReadULongOutOfBounds() {
        byte[] a = new byte[] { 0x01, 0x02, 0x03 };

        // Act
        AppConfigurationEntry[] a1 = cfg.getAppConfigurationEntry("x");
        AppConfigurationEntry[] a2 = cfg.getAppConfigurationEntry("y");

        // Assert
        assertNotSame(a1, a2, "Arrays should be different instances");
        assertEquals(1, a1.length);
        assertEquals(1, a2.length);

        AppConfigurationEntry e1 = a1[0];
        AppConfigurationEntry e2 = a2[0];

import static org.junit.jupiter.api.Assertions.assertNotSame;
import static org.junit.jupiter.api.Assertions.assertThrows;

import java.security.MessageDigest;
import java.security.NoSuchAlgorithmException;
import java.util.Arrays;

import org.junit.jupiter.api.Test;

class HMACT64Test {

    private static final byte[] TEST_KEY = "testkey".getBytes();
    private static final byte[] LONG_TEST_KEY = new byte[80]; // Longer than 64 bytes

   * they're defined above -- including logic to add and subtract 1 to map between the values stored
   * in the predecessor/successor arrays and the indexes in the elements array that they identify.
   */

    // TODO(kevinb): understand why we still get a warning despite @SafeVarargs!
    return Arrays.<Predicate<? super T>>asList(first, second);
  }

  private static <T> List<T> defensiveCopy(T... array) {
    return defensiveCopy(Arrays.asList(array));
  }

  static <T> List<T> defensiveCopy(Iterable<T> iterable) {
    ArrayList<T> list = new ArrayList<>();