byte[] mic = ctx.calculateMIC(data);
            assertNotNull(mic);
            ctx.verifyMIC(data, mic); // should not throw
        }
    }

    @Nested
    @DisplayName("Invalid and null inputs")
    class InvalidInputs {
        @Test
        @DisplayName("getSigningKey throws when unavailable")
        void testGetSigningKeyThrows() {

 *
 * <p>Performance note: Even though the {@code ComparisonChain} caller always invokes its {@code
 * compare} methods unconditionally, the {@code ComparisonChain} implementation stops calling its
 * inputs' {@link Comparable#compareTo compareTo} and {@link Comparator#compare compare} methods as
 * soon as one of them returns a nonzero result. This optimization is typically important only in

    if (yStats.count() == 0) {
      sumOfProductsOfDeltas = values.sumOfProductsOfDeltas();
    } else {
      // This is a generalized version of the calculation in add(double, double) above. Note that
      // non-finite inputs will have sumOfProductsOfDeltas = NaN, so non-finite values will result
      // in NaN naturally.
      sumOfProductsOfDeltas +=
          values.sumOfProductsOfDeltas()
              + (values.xStats().mean() - xStats.mean())

        testClassesDirs = sourceSet.output.classesDirs
        classpath = sourceSet.runtimeClasspath
        extraConfig.execute(this)
        if (!integTest.generateDefaultAutoTestedSamplesTest.get()) {
            inputs.dir(layout.projectDirectory.dir("src/main")).withPathSensitivity(PathSensitivity.RELATIVE)
        }
        setUpAgentIfNeeded(testType, executer)
    }


private

     * @param recessive the recessive (lower priority) XML node
     * @param childMergeOverride optional override for the child merge mode
     * @return the merged XML node, or null if both inputs are null
     */
    protected abstract XmlNode doMerge(XmlNode dominant, XmlNode recessive, Boolean childMergeOverride);

    /**
     * Gets the singleton instance of the XmlService.
     *

                    }

                    tasks.register<JapicmpTaskWithKotlin>("checkBinaryCompatibility") {

                        dependsOn(":v1:jar", ":v2:jar")
                        inputs.files(extractGradleApiInfo)

                        oldArchives.from(v1Jar)
                        oldClasspath.from(v1.configurations.named("runtimeClasspath"), v1Jar)

                        newArchives.from(v2Jar)

     * @param    len        count of bytes in input block to consider
     */
    @Override
    public void engineUpdate(final byte[] input, final int offset, final int len) {
        // make sure we don't exceed input's allocated size/length
        if (offset < 0 || len < 0 || (long) offset + len > input.length) {
            throw new ArrayIndexOutOfBoundsException();
        }

   * </ul>
   *
   * <p>This method is suitable for the common use case of dividing work among buckets that meet the
   * following conditions:
   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,

            SmbFileInputStream in = newStream();
            int v = in.read();
            assertEquals(-1, v);
        }
    }

    @Nested
    @DisplayName("Edge and invalid inputs")
    class EdgeCases {

        @Test
        @DisplayName("read(null) throws NullPointerException")
        void readNullArrayThrows() throws Exception {
            SmbFileInputStream in = newStream();

### Core Design Principles
CoreLib follows a **utility-class pattern** where most functionality is exposed through static methods:

- **Assertion-based validation** - All methods validate inputs using `AssertionUtil.assertArgumentNotNull()` and `AssertionUtil.assertArgumentNotEmpty()`