/**
     * Just bypasses TransWaitNamedPipe - used by DCERPC bind.
     *
     * @param b the byte array containing the data to write
     * @param off the start offset in the data
     * @param len the number of bytes to write
     * @param flags write operation flags
     * @throws IOException if an I/O error occurs
     */
    public void writeDirect(final byte[] b, int off, int len, final int flags) throws IOException {

          <type>String</type>
        </field>
        <field>
          <name>buildNumber</name>
          <version>1.0.0+</version>
          <description>The incremental build number</description>
          <type>int</type>
        </field>
        <field>
          <name>localCopy</name>
          <version>1.0.0+</version>

    }

    /**
     * Get the current key rotation count
     *
     * @return number of times keys have been rotated
     */
    public int getKeyRotationCount() {
        return rotationCount;
    }

    /**
     * Set the key rotation bytes limit
     *
     * @param limit number of bytes to encrypt before rotating keys
     */
    public void setKeyRotationBytesLimit(long limit) {

```Python hl_lines="1"
async def get_burgers(number: int):
    # Готовим бургеры по специальному асинхронному рецепту
    return burgers
```

...вместо `def`:

```Python hl_lines="2"
# Это не асинхронный код
def get_sequential_burgers(number: int):
    # Готовим бургеры последовательно по шагам
    return burgers
```

            longString.append("x");
        }
        assertEquals(1056L, MemoryUtil.sizeOf(longString.toString()));
    }

    public void test_sizeOf_numberTypes() {
        // Test various Number subclasses
        assertEquals(24L, MemoryUtil.sizeOf(new BigInteger("123456789")));
        assertEquals(24L, MemoryUtil.sizeOf(new BigDecimal("123.456")));
        assertEquals(24L, MemoryUtil.sizeOf((byte) 1));

   * Creates a {@code CompactLinkedHashSet} instance, with a high enough "initial capacity" that it
   * <i>should</i> hold {@code expectedSize} elements without rebuilding internal data structures.
   *
   * @param expectedSize the number of elements you expect to add to the returned set
   * @return a new, empty {@code CompactLinkedHashSet} with enough capacity to hold {@code
   *     expectedSize} elements without resizing

      for (CharSink out : BROKEN_SINKS) {
        int suppressed = runSuppressionFailureTest(in, out);
        assertThat(suppressed).isAtMost(1);
      }
    }
  }

  /**
   * @return the number of exceptions that were suppressed on the expected thrown exception
   */
  private static int runSuppressionFailureTest(CharSource in, CharSink out) {
    try {
      in.copyTo(out);
      fail();

            return baos.toByteArray();
        } catch (IOException e) {
            throw new CIFSException("LZ77+Huffman decompression failed", e);
        }
    }

    /**
     * Counts the number of unique bytes in the data (for entropy estimation).
     */
    private int countUniqueBytes(byte[] data) {
        boolean[] seen = new boolean[256];
        int count = 0;

        for (byte b : data) {

  private var closed: Boolean = false

  /**
   * The number of HTTP requests received thus far by this server. This may exceed the number of
   * HTTP connections when connection reuse is in practice.
   */
  public val requestCount: Int
    get() = atomicRequestCount.get()

  /** The number of bytes of the POST body to keep in memory to the given limit. */

  }

  public void testPeekingIteratorBehavesLikeIteratorOnSingletonIterable() {
    actsLikeIteratorHelper(singletonList(new Object()));
  }

  // TODO(cpovirk): instead of skipping, use a smaller number of steps
  @GwtIncompatible // works but takes 5 minutes to run
  public void testPeekingIteratorBehavesLikeIteratorOnThreeElementIterable() {
    actsLikeIteratorHelper(Lists.newArrayList("A", "B", "C"));
  }