*            see constants in {@link FileNotifyInformation}
     * @param recursive
     *            whether to also watch subdirectories
     * @return watch context, needs to be closed when finished
     * @throws CIFSException if an error occurs accessing the resource
     */
    SmbWatchHandle watch(int filter, boolean recursive) throws CIFSException;

    /**

import java.util.List;

import jcifs.dcerpc.ndr.NdrBuffer;
import jcifs.dcerpc.ndr.NdrException;

/**
 * WitnessAsyncNotify RPC message implementation for MS-SWN specification.
 * This message is used to receive asynchronous notifications from the witness service.
 */
public class WitnessAsyncNotifyMessage extends WitnessRpcMessage {

    // Input parameters for WitnessAsyncNotify
    private byte[] contextHandle;

     * ({@code project.build.outputDirectory} or {@code project.build.testOutputDirectory}),
     * not the project base directory. Maven 3 plugins (like maven-resources-plugin) expect to receive
     * the relative path and perform the resolution themselves.
     * </p>
     * <p>
     * <strong>Effect on Module and Target Version:</strong>

* Add a **JSON Schema** for the response, in the OpenAPI *path operation*.
    * This will be used by the **automatic docs**.
    * It will also be used by automatic client code generation tools.

      throw new RuntimeException(Arrays.toString(stimuli), e);
    }
  }

  private void recurse(int level) {
    // We're going to reuse the stimuli array 3^steps times by overwriting it
    // in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {
      // Keep recursing to fill the array.

// delete the tracker on disk.
func (h *healingTracker) delete(ctx context.Context) error {
	return h.disk.Delete(ctx, minioMetaBucket,
		pathJoin(bucketMetaPrefix, healingTrackerFilename),
		DeleteOptions{
			Recursive: false,
			Immediate: false,
		},
	)
}

func (h *healingTracker) isHealed(bucket string) bool {
	h.mu.RLock()
	defer h.mu.RUnlock()
	return slices.Contains(h.HealedBuckets, bucket)
}

      }
    }
  }

  private void recurse(int level) {
    // We're going to reuse the stimuli array 3^steps times by overwriting it
    // in a recursive loop.  Sneaky.
    if (level == stimuli.length) {
      // We've filled the array.
      compareResultsForThisListOfStimuli();
    } else {
      // Keep recursing to fill the array.

   * if {@code n == 0}.
   *
   * <p><b>Warning:</b> the result takes <i>O(n log n)</i> space, so use cautiously.
   *
   * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced
   * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at
   * the end).
   *
   * @throws IllegalArgumentException if {@code n < 0}

        // Then
        assertEquals(8192, sendBufferSize, "Should delegate send buffer size");
        assertEquals(8192, receiveBufferSize, "Should delegate receive buffer size");
        assertEquals(65536, maximumBufferSize, "Should delegate maximum buffer size");
        assertEquals(65024, transactionBufferSize, "Should delegate transaction buffer size");

 * @since 11.0
 */
@Immutable
public interface HashFunction {
  /**
   * Begins a new hash code computation by returning an initialized, stateful {@code Hasher}
   * instance that is ready to receive data. Example:
   *
   * {@snippet :
   * HashFunction hf = Hashing.md5();
   * HashCode hc = hf.newHasher()
   *     .putLong(id)
   *     .putBoolean(isActive)
   *     .hash();
   * }
   */