bucketCh := make(chan BucketInfo, len(buckets))

	// Shuffle buckets to ensure total randomness of buckets, being scanned.
	// Otherwise same set of buckets get scanned across erasure sets always.
	// at any given point in time. This allows different buckets to be scanned
	// in different order per erasure set, this wider spread is needed when
	// there are lots of buckets with different order of objects in them.

            assertEquals(0, size % 8, "Size should be aligned to 8-byte boundary");
        }

        @ParameterizedTest
        @DisplayName("Should calculate size for various lock counts")
        @ValueSource(ints = { 0, 1, 2, 5, 10, 20, 50, 100 })
        void testSizeWithVariousLockCounts(int lockCount) {
            Smb2Lock[] locks = new Smb2Lock[lockCount];
            for (int i = 0; i < lockCount; i++) {

        verify(transport, times(3)).isSMB2();
    }

    // Inflight requests count including edge values
    @ParameterizedTest
    @DisplayName("getInflightRequests returns various counts")
    @ValueSource(ints = { 0, 1, 42, 1000 })
    void getInflightRequests_counts(int count) {
        when(transport.getInflightRequests()).thenReturn(count);
        assertEquals(count, transport.getInflightRequests());

///

## Sub Applications { #sub-applications }

          shift += 24;
          len += 3;
        } else {
          int codePoint = Character.codePointAt(input, i);
          if (codePoint == c) {
            // not a valid code point; let the JDK handle invalid Unicode
            return hashBytes(input.toString().getBytes(charset));
          }
          i++;
          buffer |= codePointToFourUtf8Bytes(codePoint) << shift;

      @Override
      public int resultIndex(int higherIndex) {
        return higherIndex;
      }
    },
    /**
     * Return {@code ~insertionIndex}, where {@code insertionIndex} is defined as the point at which
     * the key would be inserted into the list: the index of the next higher element in the list, or
     * {@code list.size()} if there is no such element.
     *

        String result = StringUtil.join(",", str, builder, buffer);
        assertEquals("string,builder,buffer", result);
    }

    @ParameterizedTest
    @DisplayName("Should handle various element counts")
    @ValueSource(ints = { 1, 2, 5, 10, 20, 50, 100 })
    void testJoinWithVariousElementCounts(int count) {
        CharSequence[] elements = new CharSequence[count];
        for (int i = 0; i < count; i++) {

Lembre-se de como nossa estrutura app/file se parece:

<img src="/img/tutorial/bigger-applications/package.drawio.svg">

---

Os dois pontos `..`, como em:

```Python
from ..dependencies import get_token_header
```

significa:

   * operation is required.
   *
   * This is invoked at most once, even if [Call.cancel] is invoked multiple times. It may be
   * invoked at any point in a call's life, including before [callStart] and after [callEnd].
   */
  open fun canceled(call: Call) {
  }

  /**
   * Invoked when a call fails due to cache rules.

                    }
                },
                PROJECT_PREFIXES,
                false);

        List<ValueSource> valueSources = new ArrayList<>(9);

        // NOTE: Order counts here!
        valueSources.add(basedirValueSource);
        valueSources.add(baseUriValueSource);
        valueSources.add(new BuildTimestampValueSource(config.getBuildStartTime(), timestampFormat));