import org.jspecify.annotations.Nullable;

/**
 * A hash function is a collision-averse pure function that maps an arbitrary block of data to a
 * number called a <i>hash code</i>.
 *
 * <h3>Definition</h3>
 *
 * <p>Unpacking this definition:
 *
 * <ul>
 *   <li><b>block of data:</b> the input for a hash function is always, in concept, an ordered byte

 * block. With this structure the compiler inserts an implicit `finally` clause that calls
 * [close()][Response.close] for you.
 *
 * ```java
 * Call call = client.newCall(request);
 * try (Response response = call.execute()) {
 * ... // Use the response.
 * }
 * ```
 *
 * You can use a similar block for asynchronous calls:
 *
 * ```java

    netsh advfirewall firewall add rule name="Allow Metadata Proxy" dir=in action=allow protocol=TCP localport=80 remoteip="$CONTAINER_IP_ADDR"

    # Stop non-essential indexing and link tracking services that
    # may lock new files or symlinks.
    # They may be causing sporadic "Permission denied" errors during Bazel builds.
    # b/461500885

    assertFalse(task.isDone());
    assertFalse(task.isCancelled());

    // Start the task to put it in the RUNNING state.  Have to use a separate
    // thread because the task will block on the task latch after unblocking
    // the run latch.
    exec.execute(task);
    runLatch.await();
    assertEquals(1, listenerLatch.getCount());
    assertFalse(task.isDone());
    assertFalse(task.isCancelled());

        SmbWatchHandle concurrentHandle = new SmbWatchHandle() {
            private final Object lock = new Object();
            private int watchCount = 0;

            @Override
            public List<FileNotifyInformation> watch() throws CIFSException {
                synchronized (lock) {
                    watchCount++;
                    try {
                        // Simulate some processing time

    /** LM compatibility level */
    int LM_COMPATIBILITY = Config.getInt("jcifs.smb1.smb.lmCompatibility", 3);

    /** No flags set */
    int FLAGS_NONE = 0x00;
    /** Lock and read write and unlock flag */
    int FLAGS_LOCK_AND_READ_WRITE_AND_UNLOCK = 0x01;
    /** Receive buffer posted flag */
    int FLAGS_RECEIVE_BUFFER_POSTED = 0x02;
    /** Path names are caseless flag */

    private static final Logger log = LoggerFactory.getLogger(NameServiceClientImpl.class);

    private final Object LOCK = new Object();

    private int nbnsIndex = 0;

    private final Map<Name, CacheEntry> addressCache = new HashMap<>();
    private final Set<Name> inFlightLookups = new HashSet<>();

    private final int lport;

 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */
package jcifs.internal.smb2.lock;

import jcifs.CIFSContext;
import jcifs.Configuration;
import jcifs.internal.smb2.ServerMessageBlock2Request;
import jcifs.internal.smb2.Smb2Constants;
import jcifs.internal.smb2.lease.Smb2LeaseKey;

    @Deprecated
    void setBlacklisted(boolean blackListed);

    /**
     * @return whether the repository is blocked
     * @since 3.8.1
     **/
    boolean isBlocked();

    /**
     * @param blocked block the repository?
     * @since 3.8.1
     **/
    void setBlocked(boolean blocked);

    //
    // New interface methods for the repository system.
    //
    /**
     *
     * @param artifact an artifact

    //     in all.
    // (3) "Successive". We can consider that we are exchanging a block of size d (a[0..d-1]) with a
    //     block of size n-d (a[d..n-1]), where in general these blocks have different sizes. If we
    //     imagine a line separating the first block from the second, we can proceed by exchanging
    //     the smaller of these blocks with the far end of the other one. That leaves us with a