while (lower <= upper) {
      int middle = (lower + upper) >>> 1;
      int c = comparator.compare(key, list.get(middle));
      if (c < 0) {
        upper = middle - 1;
      } else if (c > 0) {
        lower = middle + 1;
      } else {
        return lower
            + presentBehavior.resultIndex(
                comparator, key, list.subList(lower, upper + 1), middle - lower);
      }
    }

    /**
     * Time encoding type: 1970 epoch, 32-bit seconds, little-endian.
     */
    public static final int TIME_1970_SEC_32LE = 2;

    /**
     * Time encoding type: 1904 epoch, 32-bit seconds, big-endian.
     */
    public static final int TIME_1904_SEC_32BE = 3;

    /**
     * Time encoding type: 1904 epoch, 32-bit seconds, little-endian.
     */
    public static final int TIME_1904_SEC_32LE = 4;

        dst[di++] = (byte) (i >> 16 & 0xFF);
        dst[di++] = (byte) (i >> 8 & 0xFF);
        dst[di] = (byte) (i & 0xFF);
        return 4;
    }

    /**
     * Encodes a 16-bit unsigned integer in little-endian byte order.
     *
     * @param s the short value to encode
     * @param dst the destination byte array
     * @param di the starting index in the destination array
     * @return the number of bytes written (2)

        // Reserved (2 bytes)
        buffer[index++] = 0;
        buffer[index++] = 0;

        // Flags (2 bytes) - little-endian
        int flags = 0x0001;
        buffer[index++] = (byte) (flags & 0xFF);
        buffer[index++] = (byte) ((flags >> 8) & 0xFF);

        // Session ID (8 bytes) - little-endian
        buffer[index++] = (byte) (testSessionId & 0xFF);
        buffer[index++] = (byte) ((testSessionId >> 8) & 0xFF);

John Doe
```

The function does the following:

* Takes a `first_name` and `last_name`.
* Converts the first letter of each one to upper case with `title()`.
* <abbr title="Puts them together, as one. With the contents of one after the other.">Concatenates</abbr> them with a space in the middle.

{* ../../docs_src/python_types/tutorial001.py hl[2] *}

### Edit it { #edit-it }

It's a very simple program.

            assertEquals(context.size(), encodedSize);
            assertEquals(1, buffer[0]); // hash algo count (little endian)
            assertEquals(0, buffer[1]);
            assertEquals(8, buffer[2]); // salt length (little endian)
            assertEquals(0, buffer[3]);
            assertEquals(1, buffer[4]); // SHA512 hash algo (little endian)
            assertEquals(0, buffer[5]);

   * {@code int} value in little-endian order.
   *
   * @throws IllegalStateException if {@code bits() < 32}
   */
  public abstract int asInt();

  /**
   * Returns the first eight bytes of {@linkplain #asBytes() this hashcode's bytes}, converted to a
   * {@code long} value in little-endian order.
   *
   * @throws IllegalStateException if {@code bits() < 64}
   */

    }

    return true
  }

  override fun equals(other: Any?): Boolean {
    if (other !is ConnectionSpec) return false
    if (other === this) return true

    if (this.isTls != other.isTls) return false

    if (isTls) {
      if (!Arrays.equals(this.cipherSuitesAsString, other.cipherSuitesAsString)) return false
      if (!Arrays.equals(this.tlsVersionsAsString, other.tlsVersionsAsString)) return false

        void testToStringWithNestedExceptions() {
            Exception innermost = new IOException("Innermost exception");
            Exception middle = new RuntimeException("Middle exception", innermost);
            Exception rootCause = new IllegalStateException("Outer exception", middle);
            TransportException exception = new TransportException("Transport failed", rootCause);

            String result = exception.toString();

  /**
   * Returns a hash function implementing the <a
   * href="https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp">32-bit murmur3
   * algorithm, x86 variant</a> (little-endian variant), using the given seed value, <b>with a known
   * bug</b> as described in the deprecation text.
   *
   * <p>The C++ equivalent is the MurmurHash3_x86_32 function (Murmur3A), which however does not