* A "token" is just a string with some content that we can use later to verify this user.
    * Normally, a token is set to expire after some time.
        * So, the user will have to log in again at some point later.
        * And if the token is stolen, the risk is less. It is not like a permanent key that will work forever (in most of the cases).
* The frontend stores that token temporarily somewhere.

            processor.setSearcher(new TestSearcher(100));
            final TestSearcher searcher = new TestSearcher(50);
            processor.register(searcher);
            processor.register(searcher); // Register same instance again
            processor.init();

            // Should still work without errors
            final List<Map<String, Object>> results = processor.search("*", new TestSearchRequestParams(0, 10, 0), OptionalThing.empty());

            flags ^= FileNotifyInformation.FILE_NOTIFY_CHANGE_SIZE;
            assertTrue((flags & FileNotifyInformation.FILE_NOTIFY_CHANGE_SIZE) != 0);

            // Toggle FILE_NOTIFY_CHANGE_SIZE flag again (remove it)
            flags ^= FileNotifyInformation.FILE_NOTIFY_CHANGE_SIZE;
            assertFalse((flags & FileNotifyInformation.FILE_NOTIFY_CHANGE_SIZE) != 0);
        }
    }

    // Helper methods

		b = append(b, c.Nonce...)
		return b, c.Algorithm
	}
	return b, kms.AES256
}

// ciphertext is a structure that contains the encrypted
// bytes and all relevant information to decrypt these
// bytes again with a cryptographic key.
type ciphertext struct {
	Algorithm kms.SecretKeyType
	ID        string
	IV        []byte
	Nonce     []byte
	Bytes     []byte
}

    @Test
    public void testInitMultipleTimes() throws IOException {
        // Test multiple initialization calls
        converter.init();
        assertTrue(testConverter.isInitialized());

        // Call init again
        converter.init();
        assertTrue(testConverter.isInitialized());
        assertEquals(2, testConverter.getInitCount());
    }

    @Test
    public void testInitWithException() {

./mc mb -l myminio/versioned

./mc mirror internal myminio/versioned/ --quiet >/dev/null

## Soft delete (creates delete markers)
./mc rm -r --force myminio/versioned >/dev/null

## mirror again to create another set of version on top
./mc mirror internal myminio/versioned/ --quiet >/dev/null

expected_checksum=$(./mc cat internal/dsync/drwmutex.go | md5sum)

user_count=$(./mc admin user list myminio/ | wc -l)

      return false;
    }

    /*
     * Loop as long as we have references available so as not to waste CPU looking up the Method
     * over and over again.
     */
    while (true) {
      Reference<?> furtherReference = queue.poll();
      if (furtherReference == null) {
        return true;
      }

    public static final String ERRORS_APP_DB_ALREADY_UPDATED = "{errors.app.db.already.updated}";

    /** The key of the message: The data already exists. Please try again. */
    public static final String ERRORS_APP_DB_ALREADY_EXISTS = "{errors.app.db.already.exists}";

    /** The key of the message: It may have been processed before this request. Please try again. */

   * expanded mask.  We do not try to detect or remove such cells,
   * under the assumption that for long-running instances, observed
   * contention levels will recur, so the cells will eventually be
   * needed again; and for short-lived ones, it does not matter.
   */

  /**
   * Padded variant of AtomicLong supporting only raw accesses plus CAS. The value field is placed
   * between pads, hoping that the JVM doesn't reorder them.

                true), RESOURCE_LOCKED("Resource is locked", ErrorCategory.RESOURCE, true),

        // Transient errors
        BUSY("Server busy", ErrorCategory.TRANSIENT, true), TRY_AGAIN("Try again later", ErrorCategory.TRANSIENT,
                true), SERVICE_UNAVAILABLE("Service temporarily unavailable", ErrorCategory.TRANSIENT, true),

        // Generic errors