// Test with zero length buffer
        buffer.putShort(0, (short) 0);
        buffer.putShort(2, (short) 0);
        buffer.putInt(4, 8); // Offset doesn't matter for zero length
        result = NtlmMessage.readSecurityBuffer(data, 0);
        assertEquals(0, result.length, "Should return empty array for zero length buffer.");

   * interned, thus preventing these instances from being garbage-collected. If this retention is
   * acceptable, this implementation may perform better than {@link #newWeakInterner}.
   */
  public static <E> Interner<E> newStrongInterner() {
    return newBuilder().strong().build();
  }

  /**

            if (null == value) {
                processConfiguration(lookup, bean, loader, configuration, evaluator, listener);
            } else {
                // Use optimized helper for better performance
                new EnhancedCompositeBeanHelper(lookup, loader, evaluator, listener)
                        .setDefault(bean, value, configuration);
            }
            return bean;

   *
   * <p><b>Warning:</b> This method, which reencodes the input before processing it, is useful only
   * for cross-language compatibility. For other use cases, prefer {@link #putUnencodedChars}, which
   * is faster, produces the same output across Java releases, and processes every {@code char} in
   * the input, even if some are invalid.
   */
  @CanIgnoreReturnValue

    CharArrayDecorator(char[] @Nullable [] replacements) {
      this.replacements = replacements;
      this.replaceLength = replacements.length;
    }

    /*
     * Overriding escape method to be slightly faster for this decorator. We test the replacements
     * array directly, saving a method call.
     */
    @Override
    public String escape(String s) {
      int slen = s.length();

    for (p in properties) {
        when (jvmSignature) {
            p.fieldSignature?.toString() -> return predicate.match(p)
            p.getterSignature?.toString() -> return predicate.match(p.getter)
            p.setterSignature?.toString() -> return p.setter?.let { predicate.match(it) } ?: false
        }
    }
    return false
}

interface AttributePredicate {
    fun match(kmClass: KmClass): Boolean

        assertEquals(1.2f, data.getWeight(), 0.001f);
    }

    public void test_orderIndependence() {
        // Test that order of method calls doesn't matter
        RequestData data1 = RequestDataBuilder.newRequestData().url("https://example.com").weight(1.5f).get().build();

        return address != null && !address.isLoopbackAddress() 
            && !address.isLinkLocalAddress();
    }
    
    public int getScore() {
        // Score interface for selection (higher is better)
        int score = linkSpeed;  // Base score is link speed
        
        if (rssCapable) score += 1000;   // Prefer RSS-capable
        if (rdmaCapable) score += 2000;  // Prefer RDMA-capable

     * these arguments are added as a new {@link SourceRoot} element.
     * Otherwise (i.e., in case of potential conflict), the behavior depends on the {@code ProjectManager}.
     * The default implementation does nothing in the latter case.
     *
     * @param project the project to update
     * @param scope scope (main or test) of the directory to add
     * @param language language of the files contained in the directory to add

 * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
 * transformation:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father()));
 * }
 *
 * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
 * successors, iterating over the edges, etc.) should declare their input to be of a type that