}

// BucketUsageInfo - bucket usage info provides
// - total size of the bucket
// - total objects in a bucket
// - object size histogram per bucket
type BucketUsageInfo struct {
	Size uint64 `json:"size"`
	// Following five fields suffixed with V1 are here for backward compatibility
	// Total Size for objects that have not yet been replicated

    }

    // Test size assignment
    @Test
    public void test_sizeAssignment() {
        facetInfo.size = 100;
        assertEquals(Integer.valueOf(100), facetInfo.size);
    }

    // Test minDocCount assignment
    @Test
    public void test_minDocCountAssignment() {
        facetInfo.minDocCount = 10L;
        assertEquals(Long.valueOf(10), facetInfo.minDocCount);
    }

        assertTrue(result > 0);
        List<FileNotifyInformation> notifications = response.getNotifyInformation();
        assertEquals(1, notifications.size());

        FileNotifyInformation info = notifications.get(0);
        assertEquals("test.txt", info.getFileName());
        assertEquals(FileNotifyInformation.FILE_ACTION_ADDED, info.getAction());
    }

    private final boolean directory;
    private final long size;
    private final ZonedDateTime lastModified;
    private final String encodedId;

    /**
     * Creates a new StorageItem instance.
     *
     * @param name the name of the item
     * @param path the path of the item
     * @param directory true if this item is a directory
     * @param size the size of the item in bytes

    int size = this.size;
    if (size < requireEntries().length) {
      resizeEntries(size);
    }
    int minimumTableSize = CompactHashing.tableSize(size);
    int mask = hashTableMask();
    if (minimumTableSize < mask) { // smaller table size will always be less than current mask
      resizeTable(mask, minimumTableSize, UNSET, UNSET);
    }
  }

  @Override
  public void clear() {
    if (needsAllocArrays()) {

        header.previous = header;
        size = 0;
    }

    /**
     * Returns the entry at the specified position.
     *
     * @param index the index
     * @return the entry
     */
    public Entry getEntry(final int index) {
        assertIndex(0 <= index && index < size, "Index: " + index + ", Size: " + size);
        Entry e = header;
        if (index < size / 2) {

      }
    }
    return sb.append(']').toString();
  }

  /** Returns best-effort-sized StringBuilder based on the given collection size. */
  static StringBuilder newStringBuilderForCollection(int size) {
    checkNonnegative(size, "size");
    return new StringBuilder((int) min(size * 8L, Ints.MAX_POWER_OF_TWO));
  }

  /**
   * Returns a {@link Collection} of all the permutations of the specified {@link Iterable}.
   *

        // Write structure size (4) at offset
        SMBUtil.writeInt2(4, buffer, offset);
        SMBUtil.writeInt2(0, buffer, offset + 2); // Reserved field

        // When
        int bytesRead = response.readBytesWireFormat(buffer, offset);

        // Then
        assertEquals(4, bytesRead);
    }

    @DisplayName("Should throw exception for invalid structure size")
    @ParameterizedTest

    this.delegateMap = delegateMap;
    this.entries = entries;
    this.size = size;
  }

  @Override
  public int count(@Nullable Object element) {
    return delegateMap.getOrDefault(element, 0);
  }

  @LazyInit private transient @Nullable ImmutableSet<E> elementSet;

  @Override
  public ImmutableSet<E> elementSet() {

      return ImmutableList.of();
    }
    int[] stripes = new int[result.size()];
    for (int i = 0; i < result.size(); i++) {
      stripes[i] = indexFor(result.get(i));
    }
    Arrays.sort(stripes);
    // optimize for runs of identical stripes
    int previousStripe = stripes[0];
    result.set(0, getAt(previousStripe));
    for (int i = 1; i < result.size(); i++) {
      int currentStripe = stripes[i];