* This test creates a long random sequence of inputs, then a lot of differently configured sinks
   * process it; all should produce the same answer, the only difference should be the number of
   * process()/processRemaining() invocations, due to alignment.
   */
  @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android.
  public void testExhaustive() throws Exception {

//     Some of the Veeam products use Multi Delete operations. This setting can reduce how many objects are included in one
//     multi-delete operation. The same registry key setting overwrites the storage-defined setting.
//     Optional value, default 1000, range: 1-unlimited (S3 standard maximum is 1000 and should not be set higher)
//
//   - <StorageConcurrentTasksLimit>

        channelInfo.setPrimary(true);
        int primaryScore = channelInfo.getScore();
        assertTrue(primaryScore > baseScore);

        // High error rate should reduce score
        channelInfo.setState(ChannelState.ESTABLISHED);
        channelInfo.setPrimary(false);
        for (int i = 0; i < 20; i++) {
            channelInfo.incrementRequestsSent();

That way I could find the best ways to reduce code duplication as much as possible, to have completion everywhere, type and error checks, etc.

All in a way that provided the best development experience for all the developers.

## Requirements { #requirements }

   * Nearly all declarations in this class are package-private,
   * accessed directly by subclasses.
   *
   * Table entries are of class Cell; a variant of AtomicLong padded
   * to reduce cache contention on most processors. Padding is
   * overkill for most Atomics because they are usually irregularly
   * scattered in memory and thus don't interfere much with each

                 * so. We cannot just comment out this method and use readString of
                 * ServerMessageBlock.java because the arguments are different, however
                 * one might be able to reduce this.
                 */

                if (len > 0 && src[srcIndex + len - 1] == '\0') {
                    len--;
                }

    private DataIndexHelper dataIndexHelper;

    @Override
    public void setUp() throws Exception {
        super.setUp();
        dataIndexHelper = new DataIndexHelper();
        setupMockComponents();
        // Reduce default interval to minimize test execution time
        dataIndexHelper.setCrawlingExecutionInterval(1L); // 1ms instead of 5000ms
    }

    private void setupMockComponents() {

                .filter(q -> StringUtil.isNotBlank(q) && q.length() <= maxQueryLength)
                .forEach(oq -> split(oq, " ")
                        .get(s -> s.filter(StringUtil::isNotBlank).reduce((q1, q2) -> escape(q1, "(", ")") + OR + escape(q2, "(", ")")))
                        .ifPresent(q -> {
                            appendQuery(queryBuf, q);
                        })));

                windowStart = now;
            }

            recentAttempts.incrementAndGet();
            lastAttempt = now;
        }

        void recordSuccess() {
            // Reduce counter on success to allow recovery
            recentAttempts.updateAndGet(val -> Math.max(0, val - 1));
        }

        void reset() {
            recentAttempts.set(0);
            blocked.set(false);

   * following conditions:
   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,