}

func newBucketReplicationStats() *BucketReplicationStats {
	return &BucketReplicationStats{
		Stats: make(map[string]*BucketReplicationStat),
	}
}

// Empty returns true if there are no target stats
func (brs *BucketReplicationStats) Empty() bool {
	return len(brs.Stats) == 0 && brs.ReplicaSize == 0
}

// Clone creates a new BucketReplicationStats copy

          entry.zombie = true // We can't delete it until the current edit completes.
        }
      }
    }

    /**
     * Returns an unbuffered input stream to read the last committed value, or null if no value has
     * been committed.
     */
    fun newSource(index: Int): Source? {
      synchronized(this@DiskLruCache) {
        check(!done)

            final int totalCount = process(options);
            if (totalCount != 0) {
                logger.info("Processed {} thumbnail task(s).", totalCount);
            } else {
                logger.info("No new thumbnails found.");
            }
            exitCode = 0;
        } catch (final ContainerNotAvailableException e) {
            if (logger.isDebugEnabled()) {

        assertNotNull(r2);
        assertEquals("bar/", r2.getName(), "Second child name should match with trailing slash");

        // End of iteration behavior
        assertFalse(it.hasNext(), "No more elements expected");
        assertNull(it.next(), "next() returns null when exhausted in this implementation");
    }

    @Test

    checkNotNull(rowFunction, "rowFunction");
    checkNotNull(columnFunction, "columnFunction");
    checkNotNull(valueFunction, "valueFunction");
    checkNotNull(mergeFunction, "mergeFunction");

    /*
     * No mutable Table exactly matches the insertion order behavior of ImmutableTable.Builder, but
     * the Builder can't efficiently support merging of duplicate values.  Getting around this
     * requires some work.
     */

                "1000, 500, 64, 512", // Large allocation units
                "1000, 500, 8, 4096", // 4K sectors
                "1000, 500, 16, 4096", // Large sectors and allocation
                "1000, 0, 8, 512", // No free space
                "1000, 1000, 8, 512" // All space free
        })
        void shouldDecodeVariousSectorConfigurations(long alloc, long free, int sectPerAlloc, int bytesPerSect)

	configFile := path.Join(bucketMetaPrefix, name, bucketMetadataFile)
	data, err := readConfig(ctx, api, configFile)
	if err != nil {
		return b, err
	}
	if len(data) <= 4 {
		return b, fmt.Errorf("loadBucketMetadata: no data")
	}
	// Read header
	switch binary.LittleEndian.Uint16(data[0:2]) {
	case bucketMetadataFormat:
	default:
		return b, fmt.Errorf("loadBucketMetadata: unknown format: %d", binary.LittleEndian.Uint16(data[0:2]))

    protected String sortPrefix = "sort:";

    /** Additional query string to be appended to all search queries */
    protected String additionalQuery;

    /** Default sort builders to be applied when no explicit sorting is specified */
    protected SortBuilder<?>[] defaultSortBuilders;

    /** Prefix used for highlight field names in search results */
    protected String highlightPrefix = "hl_";

     */
    public OptionalEntity<WebConfig> getWebConfig() {
        return OptionalUtil.ofNullable(webConfig);
    }

    /**
     * Gets the file crawling configuration generated from the parsed GSA config.
     *
     * @return an optional containing the file configuration, or empty if no file URLs were found
     */

    // quadruple in size until they reach 8k, to minimize the number of small reads for longer
    // streams. Buffers are retained in a deque so that there's no copying between buffers while
    // reading and so all of the bytes in each new allocated buffer are available for reading from
    // the stream.
    for (int bufSize = initialBufferSize;
        totalLen < MAX_ARRAY_LEN;