public UniAddress dc;

    NtlmChallenge(final byte[] challenge, final UniAddress dc) {
        this.challenge = challenge;
        this.dc = dc;
    }

    @Override
    public String toString() {
        return "NtlmChallenge[challenge=0x" + Hexdump.toHexString(challenge, 0, challenge.length * 2) + ",dc=" + dc.toString() + "]";
    }

     * Parses the given ParserRequest to create an {@link InvokerRequest}.
     * This method does interpret tool arguments.
     *
     * @param parserRequest the request containing all necessary information for parsing
     * @return the parsed invoker request. Caller must start by checking {@link InvokerRequest#parsingFailed()} as
     * if there are parser errors, this request may not be fully processed and should immediately be failed.
     */
    @Nonnull

     *      org.apache.maven.artifact.resolver.ResolutionNode)
     */

    @Override
    public ResolutionNode resolveConflict(ResolutionNode node1, ResolutionNode node2) {
        return node1.getDepth() >= node2.getDepth() ? node1 : node2;
    }

        step5 = settings.getAsBoolean("step5", true);
        step6 = settings.getAsBoolean("step6", true);
    }

    @Override
    public TokenStream create(final TokenStream tokenStream) {
        return new FlexiblePorterStemFilter(tokenStream, step1, step2, step3, step4, step5, step6);
    }

        } else {
            stopTags.addAll(JapaneseAnalyzer.getDefaultStopTags());
        }
    }

    @Override
    public TokenStream create(TokenStream tokenStream) {
        return new JapanesePartOfSpeechStopFilter(tokenStream, stopTags);
    }

                }
            }
        }
    }

    /**
     * Returns a {@link File} representing the base directory.
     *
     * @param rootDir
     *            the root directory
     * @param baseDirectory
     *            the base directory
     * @return a {@link File} representing the base directory
     */

 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getParents);
 * }
 *
 * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't
 * 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()));
 * }
 *

 *
 * {@snippet :
 * someGraphAlgorithm(startNode, MyNode::getChildren);
 * }
 *
 * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't
 * return an {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
 * transformation:
 *
 * {@snippet :
 * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild()));
 * }

    }

    @Test
    @DisplayName("Test decode returns correct bytes consumed")
    void testDecodeBytesConsumed() throws SMBProtocolDecodingException {
        // Prepare minimal buffer
        byte[] buffer = new byte[24];

        // Test with offset 0
        int bytesDecoded = response.decode(buffer, 0, 24);
        assertEquals(24, bytesDecoded, "Should return 24 bytes consumed from offset 0");

     */
    protected void waitForNext() {
        if (reloadInterval > 0) {
            ThreadUtil.sleep(reloadInterval);
        }
    }

    /**
     * Load the configuration.
     * @return The number of loaded configurations.
     */
    public abstract int load();

    /**
     * Set the interval for reloading.
     * @param reloadInterval The interval for reloading.
     */