private
val dirVersionPattern = "\\d+\\.\\d+(\\.\\d+)?(-\\w+)*(-\\d{14}[+-]\\d{4})?".toRegex()


val logger = Logging.getLogger("gradlebuild.cleanup")


/**
 * Removes state for versions that we're unlikely to ever need again, such as old snapshot versions.
 */
@Suppress("LoopWithTooManyJumpStatements")

        // The root artifact may, or may not be resolved so we need to check before we attempt to resolve.
        // This is often an artifact like a POM that is taken from disk and we already have hold of the
        // file reference. But this may be a Maven Plugin that we need to resolve from a remote repository
        // as well as its dependencies.

        ns.encode(buf);

        // Find where the actual data starts (after alignment)
        int alignmentBytes = 0;
        if (startIndex % 2 != 0) {
            alignmentBytes = 1; // Need 1 byte of padding for 2-byte alignment
        }

        // The value 0xCD should be encoded as a 16-bit value (0x00CD) in little-endian
        byte[] bufferData = buf.getBuffer();

	// HTTP request for testing when `objectLayer` is set to `nil`.
	// There is no need to use an existing bucket and valid input for creating the request
	// since the `objectLayer==nil`  check is performed before any other checks inside the handlers.

        with:
          # For discussion, see the first setup-java block.
          # The generate-docs workflow doesn't run tests, so we don't have to care which version Maven would select for that step.
          # But we need Java 11 for JDiff.
          java-version: |
            11
            25
          distribution: 'temurin'
          cache: 'maven'
      - name: 'Generate latest docs'
        env:

      entries[srcIndex] = 0;

      // also need to update whoever's "next" pointer was pointing to the last entry place
      int tableIndex = smearedHash(object) & mask;
      int next = CompactHashing.tableGet(table, tableIndex);
      int srcNext = srcIndex + 1;
      if (next == srcNext) {
        // we need to update the root pointer
        CompactHashing.tableSet(table, tableIndex, dstIndex + 1);

	disks := er.getDisks()
	// Assume (N/2 + 1) quorum for Delete()
	// this is a theoretical assumption such that
	// for delete's we do not need to honor storage
	// class for objects that have reduced quorum
	// due to storage class - this only needs to be honored
	// for Read() requests alone that we already do.
	writeQuorum := len(disks)/2 + 1

	g := errgroup.WithNErrs(len(disks))

 * </ul>
 *
 * <p>This annotation is a temporary hack. We will remove it after <a
 * href="https://github.com/google/guava/issues/6126#issuecomment-1203145963">tools no longer need
 * it</a>.
 */
@GwtCompatible
@Retention(CLASS)
@Target({FIELD, METHOD, PARAMETER})

 * </ul>
 *
 * <p>This annotation is a temporary hack. We will remove it after <a
 * href="https://github.com/google/guava/issues/6126#issuecomment-1203145963">tools no longer need
 * it</a>.
 */
@GwtCompatible
@Retention(CLASS)
@Target({FIELD, METHOD, PARAMETER})

 * </ul>
 *
 * <p>This annotation is a temporary hack. We will remove it after <a
 * href="https://github.com/google/guava/issues/6126#issuecomment-1203145963">tools no longer need
 * it</a>.
 */
@GwtCompatible
@Retention(CLASS)
@Target({FIELD, METHOD, PARAMETER})