* up using the entries array directly and writing over the entry objects with
           * non-terminal entries, but this is safe; if this Builder is used further, it will grow
           * the entries array (so it can't affect the original array), and future build() calls
           * will always copy any entry objects that cannot be safely reused.
           */

          // there's a way around creating the separate sortedKeys array, and if we're allocating
          // one array of size n, we might as well allocate two -- to say nothing of the allocation
          // done in Arrays.sort.
          for (int i = 0; i < size; i++) {
            // We're careful to put only K instances in.
            if (i > 0 && comparator.compare((K) sortedKeys[i - 1], (K) sortedKeys[i]) == 0) {

        assertFalse(Arrays.equals(signingKey, appKey), "Signing and application keys should be different");
        assertFalse(Arrays.equals(signingKey, encKey), "Signing and encryption keys should be different");
        assertFalse(Arrays.equals(signingKey, decKey), "Signing and decryption keys should be different");

        return value;
    }

    /**
     * Gets a typed value from a document map.
     * Supports conversion to String, Date, Long, Integer, Double, Float, Boolean,
     * List, and String array types. Handles both single values and arrays/lists.
     *
     * @param <T> the type to convert the value to
     * @param doc the document map to extract the value from
     * @param key the key to look up in the document map

        // Arrange a minimal response with given retval
        doAnswer(inv -> {
            jcifs.dcerpc.msrpc.MsrpcLookupSids rpc = inv.getArgument(0);
            rpc.retval = ret;
            // Provide empty arrays to satisfy code paths
            rpc.names = new lsarpc.LsarTransNameArray();
            rpc.names.count = sids.length;
            rpc.names.names = new lsarpc.LsarTranslatedName[sids.length];

    private final MavenProject aProject = createA();

    private final MavenProject bProject = createProject(Arrays.asList(toDependency(aProject)), "bProject");

    private final MavenProject cProject = createProject(Arrays.asList(toDependency(bProject)), "cProject");

    private final MavenProject dProject = createProject(
            Arrays.asList(toDependency(aProject), toDependency(bProject), toDependency(cProject)), "dProject");

                if (hashesExternal && ntlm.hashesExternal) {
                    return Arrays.equals(ansiHash, ntlm.ansiHash) && Arrays.equals(unicodeHash, ntlm.unicodeHash);
                    /* This still isn't quite right. If one npa object does not have external

		// Array + object = depth 2 = false
		{input: `[{"bio":"bada bing bada boom","id":1,"name":"Charles","falseVal":false}]`, maxDepth: 1, mustFail: true},
		// Depth 2 = ok
		{input: `[{"bio":"bada bing bada boom","id":1,"name":"Charles","falseVal":false}]`, maxDepth: 2, mustFail: false},
		// Arrays:

        assertNotNull(second);
        // Due to round-robin, should get different channels or same order
        assertTrue(Arrays.asList(channel1, channel2).contains(first));
        assertTrue(Arrays.asList(channel1, channel2).contains(second));
    }

    @Test
    void testLeastLoadedStrategy() {
        loadBalancer.setStrategy(LoadBalancingStrategy.LEAST_LOADED);

import static com.google.common.base.Preconditions.checkArgument;
import static com.google.common.base.Preconditions.checkNotNull;
import static com.google.common.base.Preconditions.checkState;
import static java.util.Arrays.asList;

import com.google.common.base.Joiner;
import com.google.common.collect.ImmutableMap;
import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.lang.reflect.GenericArrayType;