`"Will you walk a little faster?" said a whiting to a snail.
"There's a porpoise close behind us, and he's treading on my
 tail.
See how eagerly the lobsters and the turtles all advance!
They are waiting on the shingle--will you come and join the
dance?

Will you, won't you, will you, won't you, will you join the
dance?
Will you, won't you, will you, won't you, won't you join the
dance?

    // We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    // all the way up again.

Nous accueillons les pull requests pour votre langue.

### Traductions

- [English](../../README.md)
- [日本語 (Japanese)](../ja/README.md)
- [简体中文 (Simplified Chinese)](../zh-CN/README.md)
- [Español (Spanish)](../es/README.md)

Aceitamos pull requests para o seu idioma.

### Traduções

- [English](../../README.md)
- [日本語 (Japanese)](../ja/README.md)
- [简体中文 (Simplified Chinese)](../zh-CN/README.md)
- [Español (Spanish)](../es/README.md)

  /** Whether we've successfully flushed the encoder. */
  private boolean doneFlushing;

  /**
   * Creates a new input stream that will encode the characters from {@code reader} into bytes using
   * the given character set. Malformed input and unmappable characters will be replaced.
   *
   * @param reader input source
   * @param charset character set used for encoding chars to bytes

    void testDecodeDataIntegrity() throws SMBProtocolDecodingException {
        // Prepare buffer with specific pattern
        byte[] buffer = new byte[32];
        byte[] expectedData = new byte[16];

        // Fill data section with pattern
        for (int i = 0; i < 16; i++) {
            expectedData[i] = (byte) (0xA0 + i);
            buffer[16 + i] = expectedData[i];
        }

        // Set header values

                    process.destroy();
                    teminated = true;
                } catch (final Exception e) {
                    if (logger.isInfoEnabled()) {
                        logger.info("Could not kill subprocess: process={}", process, e);
                    }
                }
            }
        }

        /**
         * Sets the finished flag to indicate whether the process has completed.

        int[] offsets = { 0, 1, 10, 50, 100 };

        for (int offset : offsets) {
            byte[] buffer = new byte[200];
            // Fill buffer with pattern to ensure proper writing
            for (int i = 0; i < buffer.length; i++) {
                buffer[i] = (byte) 0xFF;
            }

            int bytesEncoded = request.encode(buffer, offset);

    byte[][] arrays = new byte[arraysDim1][];
    // it's shared to avoid using too much memory in tests
    byte[] sharedArray = new byte[arraysDim2];
    Arrays.fill(arrays, sharedArray);

    try {
      Bytes.concat(arrays);
      fail();
    } catch (IllegalArgumentException expected) {
    }
  }

  public void testEnsureCapacity() {

   * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
   * first permutation will be in ascending order, and the last will be in descending order.
   *
   * <p>Duplicate elements are considered equal. For example, the list [1, 1] will have only one
   * permutation, instead of two. This is why the elements have to implement {@link Comparable}.
   *