* bit(j) about half the time
   *
   * <p>Funneling is pretty simple to detect. The key idea is to find example keys which
   * unequivocally demonstrate that funneling cannot be occurring. This is done bit-by-bit. For each
   * input bit(i) and output bit(j), two pairs of keys must be found with all bits identical except
   * bit(i). One pair must differ in output bit(j), and one pair must not. This proves that input

         * ours as they do when they perform the same comparison in reverse. To provide that
         * behavior on all platforms, TypeResolver must return the appropriate TypeVariable
         * implementation in each of the three possible cases:
         *
         * 1. Under Android, the built-in TypeVariable implementation interoperates with ours.

    /**
     * Return an array of Access Control Entry (ACE) objects representing
     * the security descriptor associated with this file or directory.
     * <p>
     * Initially, the SIDs within each ACE will not be resolved however when
     * <code>getType()</code>, <code>getDomainName()</code>, <code>getAccountName()</code>,
     * or <code>toString()</code> is called, the names will attempt to be

        // FileBasicInfo typically contains creation time, last access time, last write time, change time, and attributes
        byte[] buffer = new byte[40];

        // Mock times (8 bytes each)
        for (int i = 0; i < 32; i++) {
            buffer[i] = (byte) (i % 256);
        }

        // Mock attributes (4 bytes)
        buffer[32] = 0x01;
        buffer[33] = 0x00;

   * plus the given elements, according to {@link #expectContents(java.util.Collection)}. In other
   * words, for the default {@code expectContents()} implementation, the number of occurrences of
   * each given element has increased by one since the test collection was created, and the number
   * of occurrences of all other elements has not changed.
   *

        // Test at various positions in the buffer
        int[] positions = { 0, 10, 50, 100, 150 };

        for (int pos : positions) {
            when(mockConfig.getPid()).thenReturn(1234); // Mock getPid for each new instance
            response = new TestSmbComNtTransactionResponse(mockConfig); // Reset response

            // Fill buffer at position
            for (int i = 0; i < 37; i++) {

            domains.domains[0].sid = new jcifs.dcerpc.rpc.sid_t();
            rpc.domains = domains;

            // Names: provide account names and types for each SID
            lsarpc.LsarTransNameArray names = new lsarpc.LsarTransNameArray();
            names.count = in.length;
            names.names = new lsarpc.LsarTranslatedName[in.length];
            // First is a user

    lock01 = factory3.newReentrantLock(OtherOrder.FIRST);
    lock02 = factory3.newReentrantLock(OtherOrder.SECOND);
    lock03 = factory3.newReentrantLock(OtherOrder.THIRD);
  }

  // In the unittest, create each ordered factory with its own set of lock
  // graph nodes (as opposed to using the static per-Enum map) to avoid
  // conflicts across different test runs.
  private <E extends Enum<E>>

    Function<? super Integer, Y> g = SerializableTester.reserializeAndAssert(f);
    for (int i = 1; i < 5; i++) {
      // convoluted way to check that the same result happens from each
      Y expected = null;
      try {
        expected = f.apply(i);
      } catch (IllegalArgumentException e) {
        try {
          g.apply(i);
          fail();

  }

  /**
   * Copies all of the mappings from the specified map to this map. The effect of this call is
   * equivalent to that of calling {@code put(k, v)} on this map once for each mapping from key
   * {@code k} to value {@code v} in the specified map. The behavior of this operation is undefined
   * if the specified map is modified while the operation is in progress.
   */