Recursive: false,
			Immediate: false,
		}); err != errFileAccessDenied {
			t.Errorf("expected: %s, got: %s", errFileAccessDenied, err)
		}
	}

	// TestXLStorage for delete on an removed disk.
	// should fail with disk not found.
	err = xlStorageDeletedStorage.Delete(t.Context(), "del-vol", "my-file", DeleteOptions{
		Recursive: false,
		Immediate: false,
	})

    }

    @Test
    public void test_constructorWithThrowableCause_StackOverflowError() {
        // Test with StackOverflowError as cause
        String message = "SSO login recursive overflow";
        StackOverflowError error = new StackOverflowError("Stack overflow in authentication chain");
        SsoLoginException exception = new SsoLoginException(message, error);

	id           string     `msg:"id"`
	error        string     `msg:"err"`
	root         string     `msg:"root"`
	fileNotFound bool       `msg:"fnf"`
	status       scanStatus `msg:"stat"`
	recursive    bool       `msg:"rec"`
	dataVersion  uint8      `msg:"v"`
}

func (m *metacache) finished() bool {
	return !m.ended.IsZero()
}

// worthKeeping indicates if the cache by itself is worth keeping.

                    request.setFileId(handle.directoryFile.getFileId());
                    request.setCompletionFilter(getNotificationFilter());
                    request.setWatchTree(false);  // Non-recursive for now
                    
                    Smb2ChangeNotifyResponse response = (Smb2ChangeNotifyResponse) 
                        handle.directoryFile.getTree().send(request);
                    

 *   <li>Are the node objects' implementations of {@code equals()}/{@code hashCode()} <a
 *       href="https://github.com/google/guava/wiki/GraphsExplained#non-recursiveness">recursive</a>?
 * </ol>
 *
 * <p>If your answers are:
 *
 * <ul>
 *   <li>(1) "no" and (2) "no", use {@link #forGraph(SuccessorsFunction)}.
 *   <li>(1) "yes" and (2) "yes", use {@link #forTree(SuccessorsFunction)}.

     */
    public static final String NAME_DIRECTORY_RESPONSE = "DLse";

    private static final byte[] CONTEXT_NAME_BYTES = NAME_DIRECTORY_REQUEST.getBytes();

    /**
     * Directory lease flag for recursive caching
     */
    public static final int DIRECTORY_LEASE_FLAG_RECURSIVE = 0x00000001;

    /**
     * Directory lease flag for enabling notifications
     */

					// and check if that disk
					// appears in outDatedDisks.
					tamperedIndex = index
					dErr := erasureDisks[index].Delete(t.Context(), bucket, pathJoin(object, fi.DataDir, "part.1"), DeleteOptions{
						Recursive: false,
						Immediate: false,
					})
					if dErr != nil {
						t.Fatalf("Failed to delete %s - %v", filepath.Join(object, "part.1"), dErr)
					}
					break
				}
			case corruptPart:

                    .desc("Force the use of an alternate POM file (or directory with pom.xml)")
                    .get());
            options.addOption(Option.builder(NON_RECURSIVE)
                    .longOpt("non-recursive")
                    .desc(
                            "Do not recurse into sub-projects. When used together with -pl, do not recurse into sub-projects of selected aggregators")
                    .get());

		{mgmtPrefix: "objprefix"},
		// Valid cases
		{},
		{mgmtBucket: "bucket"},
		{mgmtBucket: "bucket", mgmtPrefix: "objprefix"},
	}

	// Body is always valid - we do not test JSON decoding.
	body := `{"recursive": false, "dryRun": true, "remove": false, "scanMode": 0}`

	// Test all combinations!
	for pIdx, params := range qParamsArr {
		for vIdx, vars := range varsArr {

		writers := make([]io.Writer, len(disks))
		for i, disk := range disks {
			if disk == OfflineDisk {
				continue
			}
			disk.Delete(context.Background(), "testbucket", "object", DeleteOptions{
				Recursive: false,
				Immediate: false,
			})
			writers[i] = newBitrotWriter(disk, "", "testbucket", "object", erasure.ShardFileSize(size), DefaultBitrotAlgorithm, erasure.ShardSize())
		}