int expected = original & 0xFF;
        NdrShort ns = new NdrShort(original);
        buf.reset();
        ns.encode(buf); // should not throw

        // After encoding, check how many bytes were used
        int bytesUsed = buf.getIndex();
        // Should be 2 bytes for the short value (alignment may add padding)
        assertTrue(bytesUsed >= 2, "Should use at least 2 bytes for short");

            }
            return true; // Signature verification succeeded
        } finally {
            this.signingLock.unlock();
        }
    }

    /**
     * Securely wipe signing key from memory
     */
    public void secureWipeKey() {
        this.signingLock.lock();
        try {
            if (this.signingKey != null) {

          writePingFrame()
          return@schedule pingIntervalNanos
        }
      }
      if (messageAndCloseQueue.isNotEmpty()) {
        runWriter() // Send messages that were enqueued before we were connected.
      }
    }

    reader =
      WebSocketReader(
        isClient = client,
        source = socket.source,
        frameCallback = this,

        // Create a buffer large enough to hold the read bytes
        byte[] buffer = new byte[6];
        int bytesRead = packet.readTrailerWireFormat(bais, buffer, 0);

        // Verify that 6 bytes were read, which is the expected length.
        assertEquals(6, bytesRead);
    }

    @Test
    void readTrailerWireFormatShouldThrowIOExceptionOnUnexpectedEOF() throws IOException {

 * default} methods. Specifically, it forwards calls only for methods that existed <a
 * href="https://docs.oracle.com/javase/7/docs/api/java/util/Iterator.html">before {@code default}
 * methods were introduced</a>. For newer methods, like {@code forEachRemaining}, it inherits their
 * default implementations. When those implementations invoke methods, they invoke methods on the
 * {@code ForwardingIterator}.
 *

   * using a secondary hash (Marsaglia XorShift) to try to find a
   * free slot.
   *
   * The table size is capped because, when there are more threads
   * than CPUs, supposing that each thread were bound to a CPU,
   * there would exist a perfect hash function mapping threads to
   * slots that eliminates collisions. When we reach capacity, we
   * search for this mapping by randomly varying the hash codes of

     *
     * @throws IllegalArgumentException if duplicate keys were added
     */
    public ImmutableMap<K, V> build() {
      return buildOrThrow();
    }

    /**
     * Returns a newly-created immutable map, or throws an exception if any key was added more than
     * once. The iteration order of the returned map is the order in which entries were inserted

     * until all the Listeners are installed and {@link #markReady()} is called. It is our caller's
     * responsibility to only call {@link #markReady()} if all services were new at the time this
     * method was called and when all the listeners were installed.
     */
    ServiceManagerState(ImmutableCollection<Service> services) {
      this.numberOfServices = services.size();
      servicesByState.putAll(NEW, services);

        assertEquals("field1:value1", facetQueryView.getQueryMap().get("label1"));
        assertEquals("field2:value2", facetQueryView.getQueryMap().get("label2"));

        // Check that queries were added to FacetInfo
        assertEquals(2, testFacetInfo.getAddedQueries().size());
        assertTrue(testFacetInfo.getAddedQueries().contains("field1:value1"));

### Getestet

* 100 % <abbr title="Der Prozentsatz an Code, der automatisch getestet wird">Testabdeckung</abbr>.
* 100 % <abbr title="Python-Typannotationen, mit denen Ihr Editor und andere exteren Werkezuge Sie besser unterstützen können">Typen annotiert</abbr>.