};

            // Act
            int decodedSize = context.decode(buffer, 0, buffer.length);

            // Assert
            assertEquals(4, decodedSize);
            assertEquals(0, context.getHashAlgos().length);
            assertEquals(0, context.getSalt().length);
        }

        @ParameterizedTest
        @ValueSource(ints = { 0, 1, 3, 5, 10 })

m"),h["data-validation-regexp"]=e.attr("pattern")),e.attr("maxlength")&&(b.push("length"),h["data-validation-length"]="max"+e.attr("maxlength")),!c&&e.attr("list")){var l=[],m=a("#"+e.attr("list"));if(m.find("option").each(function(){l.push(a(this).text())}),0===l.length){var n=a.trim(a("#"+e.attr("list")).text()).split("\n");a.each(n,function(b,c){l.push(a.trim(c))})}m.remove(),a.formUtils.suggest(e,l)}if(b.length){f||(h["data-validation-optional"]="true"),g=!0;var o=(e.attr("data-validation")||"")+"...

            if (offset + length <= bufferSize && length >= 24) {
                assertDoesNotThrow(() -> {
                    info.decode(buffer, offset, length);
                });
            }
        }
    }

    @Nested
    @DisplayName("Interface Compatibility Tests")
    class InterfaceCompatibilityTests {

        @Test

        // At offset 128 + 64 (header start), set context with excessive data length
        int contextPos = 192;
        SMBUtil.writeInt2(1, buffer, contextPos); // Context type
        SMBUtil.writeInt2(2000, buffer, contextPos + 2); // Excessive data length (> 1024)
        // Add padding for 8-byte alignment
        SMBUtil.writeInt2(0, buffer, contextPos + 4); // Reserved

    E[] array = collection.toArray(empty);
    assertEquals(
        "toArray(emptyT[]) should return an array of type T", empty.getClass(), array.getClass());
    assertEquals("toArray(emptyT[]).length:", getNumElements(), array.length);
    expectArrayContentsAnyOrder(createSamplesArray(), array);
  }

  @CollectionFeature.Require(KNOWN_ORDER)
  public void testToArray_emptyArray_ordered() {

    Integer[] array = new Integer[elements.length];
    int i = 0;
    for (Object e : elements) {
      array[i++] = (Integer) e;
    }
    return create(array);
  }

  protected abstract Set<Integer> create(Integer[] elements);

  @Override
  public Integer[] createArray(int length) {
    return new Integer[length];
  }

  /**
   * {@inheritDoc}
   *

    AnEnum[] array = new AnEnum[elements.length];
    int i = 0;
    for (Object e : elements) {
      array[i++] = (AnEnum) e;
    }
    return create(array);
  }

  protected abstract Multiset<AnEnum> create(AnEnum[] elements);

  @Override
  public AnEnum[] createArray(int length) {
    return new AnEnum[length];
  }

  /** Sorts the enums according to their natural ordering. */

        if (args == null) {
            return paramTypes.length == 0;
        }
        if (paramTypes.length != args.length) {
            return false;
        }
        for (int i = 0; i < args.length; ++i) {
            if (args[i] == null) {
                continue;
            }

y(n,arguments)}return r._=e,this.on(t,r,n)},emit:function(t){for(var e=[].slice.call(arguments,1),n=((this.e||(this.e={}))[t]||[]).slice(),o=0,r=n.length;o<r;o++)n[o].fn.apply(n[o].ctx,e);return this},off:function(t,e){var n=this.e||(this.e={}),o=n[t],r=[];if(o&&e)for(var i=0,u=o.length;i<u;i++)o[i].fn!==e&&o[i].fn._!==e&&r.push(o[i]);return r.length?n[t]=r:delete n[t],this}},t.exports=e,t.exports.TinyEmitter=e}},r={},o.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return...

        }
    }

    /**
     * Update digest with data
     *
     * @param input
     *            The input data to update the digest with
     * @param offset
     *            The starting offset in the input data
     * @param len
     *            The length of data to process
     */