### 3.1 Automatic removal of non current objects versions

A non-current object version is a version which is not the latest for a given object. It is possible to set up an automatic removal of non-current versions when a version becomes older than a given number of days.

e.g., To scan objects stored under `user-uploads/` prefix and remove versions older than one year.

```
{
    "Rules": [
        {
            "ID": "Removing all old versions",

        SmbFileHandleImpl fh = target.ensureOpen();
        assertSame(fileHandle, fh);
        assertTrue(target.isOpen());
        assertFalse(target.isStale());

        // If handle becomes invalid, reflect stale
        when(fileHandle.isValid()).thenReturn(false);
        assertFalse(target.isOpen());
        assertTrue(target.isStale());
    }

    @Test

Properties of incubating features MUST start with `org.gradle.<feature-name>.`

The qualifier is absent for these properties, making the name more concise.

This property name SHOULD stay the same when the feature becomes stable.

Despite the incubation status of the feature, these properties MUST be stable.

    sendRequest(methodName, arguments);
    assertThat(getResponse(methodName).getThrowable()).isInstanceOf(expected);
  }

  /**
   * Causes this thread to call the named method, and asserts that this thread becomes blocked on
   * the lock-like object. The lock-like object must have a method equivalent to {@link
   * java.util.concurrent.locks.ReentrantLock#hasQueuedThread(Thread)}.
   */

        IntervalRule crossRule = new IntervalRule("22:00", "02:00", "1", 1000); // Sunday only
        // For cross-midnight rule, when checking early morning hours (1:30), it checks day+1
        // day=8 becomes day=1, so day+1=2, which is Monday (not Sunday)
        assertFalse(crossRule.isTarget(1, 30, 8)); // Should be treated as day 1 (Sunday), checking day+1=2 (Monday)
    }

    @Test

on the number of drives available, let's say for example if there are 32 servers and 32 drives which is a total of 1024 drives. In this scenario 16 becomes the erasure set size. This is decided based on the greatest common divisor (GCD) of acceptable erasure set sizes ranging from *4 to 16*.

- *If total drives has many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors....

		if !srcEOF && srcCtnt.Err != nil {
			log.Fatal(srcCtnt.Err)
		}

		if !tgtEOF && tgtCtnt.Err != nil {
			log.Fatal(tgtCtnt.Err)
		}

		// If source doesn't have objects anymore, comparison becomes obvious
		if srcEOF {
			fmt.Printf("only in target: %s\n", tgtCtnt.Key)
			tgtCtnt, tgtOk = <-tgtCh
			continue
		}

		// The same for target
		if tgtEOF {

            year = matcher.group(1).toInt()
          }
        }

        pos = dateCharacterOffset(s, end + 1, limit, false)
      }

      // Convert two-digit years into four-digit years. 99 becomes 1999, 15 becomes 2015.
      if (year in 70..99) year += 1900
      if (year in 0..69) year += 2000

      // If any partial is omitted or out of range, return -1. The date is impossible. Note that leap

	RetryInterval time.Duration
}

// GetLock tries to get a write lock on dm before the timeout elapses.
//
// If the lock is already in use, the calling go routine
// blocks until either the mutex becomes available and return success or
// more time has passed than the timeout value and return false.
func (dm *DRWMutex) GetLock(ctx context.Context, cancel context.CancelFunc, id, source string, opts Options) (locked bool) {

    void testHasMoreElements() {
        // Initially should have more elements if error code is 0
        assertTrue(response.hasMoreElements());

        // After calling nextElement once, isPrimary becomes false but hasMore is still true initially
        response.nextElement();

        // Can still have more elements
        assertTrue(response.hasMoreElements());
    }

    @Test