}
  }

  /**
   * Returns an address from a <b>little-endian ordered</b> byte array (the opposite of what {@link
   * InetAddress#getByAddress} expects).
   *
   * <p>IPv4 address byte array must be 4 bytes long and IPv6 byte array must be 16 bytes long.
   *
   * @param addr the raw IP address in little-endian byte order
   * @return an InetAddress object created from the raw IP address

        // When
        byte[] messageBytes = type3.toByteArray();

        // Then
        assertTrue(messageBytes.length >= 12);
        // Message type should be 3 (little endian)
        assertEquals(3, messageBytes[8] & 0xFF);
        assertEquals(0, messageBytes[9] & 0xFF);
        assertEquals(0, messageBytes[10] & 0xFF);
        assertEquals(0, messageBytes[11] & 0xFF);
    }

     * for (Lock lock : locks) {
     *   lock.unlock();
     * }
     *
     * If we only held the int[] stripes, translating it on the fly to L's, the original locks might
     * be garbage collected after locking them, ending up in a huge mess.
     */
    @SuppressWarnings("unchecked") // we carefully replaced all keys with their respective L's
    List<L> asStripes = (List<L>) result;
    return Collections.unmodifiableList(asStripes);
  }

            int bytesEncoded = buffer.encode(dst, 0);

            // Manually verify the encoded bytes
            assertEquals(buffer.size(), bytesEncoded);

            // Check referral level (little-endian)
            assertEquals(4, dst[0] & 0xFF);
            assertEquals(0, dst[1] & 0xFF);

            // Check path starts at byte 2
            byte[] expectedPathBytes = path.getBytes(StandardCharsets.UTF_16LE);

        protected boolean prevPage;
        /**
         * The starting record number for the current page of search results.
         */
        protected long startRecordNumber;
        /**
         * The ending record number for the current page of search results.
         */
        protected long endRecordNumber;
        /**
         * The list of page numbers for pagination.
         */

      if (!seen.add(this)) {
        return null; // Already traversed this node.
      }
      ExampleStackTrace found = allowedPriorLocks.get(node);
      if (found != null) {
        return found; // Found a path ending at the node!
      }
      // Recurse the edges.
      for (Entry<LockGraphNode, ExampleStackTrace> entry : allowedPriorLocks.entrySet()) {
        LockGraphNode preAcquiredLock = entry.getKey();

      System.arraycopy(hash, 0, hashes, i * hashBytes, hash.length);
    }

    // Then hash the result array
    byte[] result = hashFunction.hash(hashes, 0);

    // interpreted in little-endian order.
    int verification = Integer.reverseBytes(Ints.fromByteArray(result));

    if (expected != verification) {
      throw new AssertionError(
          "Expected: "
              + Integer.toHexString(expected)

            description,
            cls,
            explicitTestNames.get(0),
            cls.getName());
    return new AssertionError(message, e);
  }

  /**
   * Finds the classes not ending with a test suffix and not covered by an explicit test whose name
   * is {@code explicitTestNames}.
   */
  @VisibleForTesting
  List<Class<?>> findClassesToTest(

      System.arraycopy(hash, 0, hashes, i * hashBytes, hash.length);
    }

    // Then hash the result array
    byte[] result = hashFunction.hash(hashes, 0);

    // interpreted in little-endian order.
    int verification = Integer.reverseBytes(Ints.fromByteArray(result));

    if (expected != verification) {
      throw new AssertionError(
          "Expected: "
              + Integer.toHexString(expected)

    <magic priority="50">
      <!-- MM.* = Big endian (M=Motorola) and 0x002a in big endian    -->
      <match value="MM\x00\x2a" type="string" offset="0"/>
      <!-- II*. = Little endian (I=Intel) and 0x002a in little endian -->
      <match value="II\x2a\x00" type="string" offset="0"/>
      <!-- MM.+ = Big endian (M=Motorola) and 0x002a in big endian-->
      <match value="MM\x00\x2b" type="string" offset="0"/>