log.error("Failed to create child URL", e);
                    continue;
                }
            }
            try (SmbResource nr = adapt(n)) {
                if (!this.filter.accept(nr)) {
                    continue;
                }
                return nr;
            } catch (final CIFSException e) {
                log.error("Failed to apply filter", e);
                continue;

        You can use [the template](https://github.com/gradle/gradle-issue-reproducer) with a Gradle GitHub action set up to showcase your problem.
        In the rare cases where this is infeasible, we will also accept a detailed set of instructions.
        You can also use [Gradle Project Replicator](https://github.com/android/project-replicator) to reproduce the structure of your project.
    validations:
      required: true
  - type: input

        // Current behavior of test impl: returns same reference
        assertSame(raw, t.toByteArray(), "should return the same reference as mechanismToken");
    }

    @Test
    @DisplayName("Setters accept null and getters return null")
    void settersAcceptNull() {
        TestSpnegoToken t = new TestSpnegoToken();
        t.setMechanismToken(null);
        t.setMechanismListMIC(null);

    String[] WINERR_MESSAGES = { "The operation completed successfully.", "Access is denied.",
            "No more connections can be made to this remote computer at this time because there are already as many connections as the computer can accept.",
            "The pipe state is invalid.", "All pipe instances are busy.", "The pipe is being closed.",
            "No process is on the other end of the pipe.", "More data is available.", "The service is not available",

                    log.error("Failed to create child URL", e);
                    continue;
                }
            }

            try (SmbResource r = adapt(fe)) {
                if (this.filter.accept(r)) {
                    return r;
                }
            } catch (final MalformedURLException e) {
                log.error("Failed to create child URL", e);
                continue;

    String[] WINERR_MESSAGES = { "The operation completed successfully.", "Access is denied.",
            "No more connections can be made to this remote computer at this time because there are already as many connections as the computer can accept.",
            "The pipe state is invalid.", "All pipe instances are busy.", "The pipe is being closed.",
            "No process is on the other end of the pipe.", "More data is available.",

  /**
   * A {@link Correspondence} which accepts finite values within {@link #ALLOWED_ERROR} of each
   * other.
   */
  private static final Correspondence<Number, Number> FINITE_QUANTILE_CORRESPONDENCE =
      Correspondence.tolerance(ALLOWED_ERROR);

  /**
   * A {@link Correspondence} which accepts either finite values within {@link #ALLOWED_ERROR} of

  /**
   * A {@link Correspondence} which accepts finite values within {@link #ALLOWED_ERROR} of each
   * other.
   */
  private static final Correspondence<Number, Number> FINITE_QUANTILE_CORRESPONDENCE =
      Correspondence.tolerance(ALLOWED_ERROR);

  /**
   * A {@link Correspondence} which accepts either finite values within {@link #ALLOWED_ERROR} of

     *
     * @param visitor the visitor to call back, must not be {@code null}
     * @return {@code true} to visit siblings nodes of this node as well, {@code false} to skip siblings
     */
    boolean accept(@Nonnull NodeVisitor visitor);

    /**
     * Returns a new tree starting at this node, filtering the children.
     * Note that this node will not be filtered and only the children
     * and its descendant will be checked.

        }, docPerReq, () -> {
            systemHelper.calibrateCpuLoad();
            ThreadUtil.sleep(interval);
        }).then(response -> {
            refresh();
            success.accept(true);
        }).error(t -> error.accept(t));
    }

    /**
     * Purges old suggest data from documents.
     *
     * @param time The timestamp to purge data before.
     */