}

  private static final int ENDPOINT = -2;

  /**
   * Contains the link pointers corresponding with the entries, in the range of [0, size()). The
   * high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer
   * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are
   * all "null" (UNSET).
   *

        // Test getEntries returns correct SmbShareInfo objects
        FileEntry[] entries = dfsRootEnum.getEntries();
        assertNotNull(entries);
        assertEquals(3, entries.length);

        // Verify each entry
        for (int i = 0; i < 3; i++) {
            assertInstanceOf(SmbShareInfo.class, entries[i]);
            assertEquals(rootNames[i], entries[i].getName());

        byte[] salt = storage.getSalt();
        assertNotNull(salt, "Salt should not be null");
        assertEquals(32, salt.length, "Salt should be 32 bytes");

        // Salt should be different for each instance
        SecureCredentialStorage storage2 = new SecureCredentialStorage(masterPassword.clone());
        try {
            byte[] salt2 = storage2.getSalt();

        FessTimeResourceProvider provider3 = new FessTimeResourceProvider(mockConfig);

        assertNotNull(provider1);
        assertNotNull(provider2);
        assertNotNull(provider3);

        // Each should be a different instance
        assertNotSame(provider1, provider2);
        assertNotSame(provider2, provider3);
        assertNotSame(provider1, provider3);
    }

	for k, v := range s.stats {
		bucketStats[k] = inOutBytes{
			In:  v.s3InputBytes,
			Out: v.s3OutputBytes,
		}
	}
	return bucketStats
}

// Return S3 total input/output bytes for each
func (s *bucketConnStats) getBucketS3InOutBytes(buckets []string) map[string]inOutBytes {
	s.RLock()
	defer s.RUnlock()

	if len(s.stats) == 0 || len(buckets) == 0 {
		return nil
	}

    public <T extends @Nullable Object> T[] toArray(T[] array) {
      return Lists.newArrayList(iterator()).toArray(array);
    }
  }

  /**
   * Returns a collection that applies {@code function} to each element of {@code fromCollection}.
   * The returned collection is a live view of {@code fromCollection}; changes to one affect the
   * other.
   *

        DfsReferralDataInternal dr = null;
        final long now = System.currentTimeMillis();
        synchronized (this.domainsLock) {
            /*
             * domains that can contain DFS points to maps of roots for each
             */
            final Map<String, Map<String, CacheEntry<DfsReferralDataInternal>>> domains = getTrustedDomains(tf);
            if (domains != null) {
                if (log.isTraceEnabled()) {

    result.addAll(rangeSet);
    return result;
  }

  /**
   * Returns a {@code TreeRangeSet} representing the union of the specified ranges.
   *
   * <p>This is the smallest {@code RangeSet} which encloses each of the specified ranges. An
   * element will be contained in this {@code RangeSet} if and only if it is contained in at least
   * one {@code Range} in {@code ranges}.
   *
   * @since 21.0
   */

 // Generate palettes for full colors, grays, and theme colors.\n\n  @each $color, $value in $colors {\n    --#{$prefix}#{$color}: #{$value};\n  }\n\n  @each $color, $value in $grays {\n    --#{$prefix}gray-#{$color}: #{$value};\n  }\n\n  @each $color, $value in $theme-colors {\n    --#{$prefix}#{$color}: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-rgb {\n    --#{$prefix}#{$color}-rgb: #{$value};\n  }\n\n  @each $color, $value in $theme-colors-text {\n    --#{$prefix}#{$color}-text-emphasis:...

      backingMap.clear();
    }
  }

  /**
   * {@inheritDoc}
   *
   * <p>The set's iterator traverses the mappings for the first row, the mappings for the second
   * row, and so on.
   *
   * <p>Each cell is an immutable snapshot of a row key / column key / value mapping, taken at the
   * time the cell is returned by a method call to the set or its iterator.
   */
  @Override
  public Set<Cell<R, C, V>> cellSet() {