static final int DEFAULT_SIZE = 3;

  /**
   * Minimum size of the hash table of a compact hash-based collection. Because small hash tables
   * use a byte[], any smaller size uses the same amount of memory due to object padding.
   */
  private static final int MIN_HASH_TABLE_SIZE = 4;

  private static final int BYTE_MAX_SIZE = 1 << Byte.SIZE; // 2^8 = 256

	for i := 1; i < len(totalSizes); i++ {
		result = gcd(result, totalSizes[i])
	}
	return result
}

// isValidSetSize - checks whether given count is a valid set size for erasure coding.
var isValidSetSize = func(count uint64) bool {
	return (count >= setSizes[0] && count <= setSizes[len(setSizes)-1])
}

func commonSetDriveCount(divisibleSize uint64, setCounts []uint64) (setSize uint64) {

	b.ResetTimer()
	b.ReportAllocs()

	// This benchmark models a situation where spinning in the mutex should be
	// profitable. To achieve this we create a goroutine per-proc.
	// These goroutines access considerable amount of local data so that
	// unnecessary rescheduling is penalized by cache misses.
	m := NewDRWMutex(ds, "")
	var acc0, acc1 uint64
	b.RunParallel(func(pb *testing.PB) {
		var data [16 << 10]uint64

        assertThrows(IllegalArgumentException.class,
                () -> InputValidator.validateSmb2BufferSize(InputValidator.MAX_SMB2_BUFFER_SIZE + 1, "test"));
    }

    @Test
    @DisplayName("Test array bounds validation")
    void testArrayBounds() {
        byte[] src = new byte[100];
        byte[] dst = new byte[100];

        assertDoesNotThrow(() -> InputValidator.validateArrayBounds(src, 0, dst, 0, 100));

  private static class Counter<N extends Number> {
    @Keep List<N> counts;
  }

  public void testWildcardCaptured_typeVariableDeclaresTypeBound_wildcardHasNoExplicitUpperBound()
      throws Exception {
    TypeToken<Counter<?>> type = new TypeToken<Counter<?>>() {};
    TypeToken<?> fieldType =
        type.resolveType(Counter.class.getDeclaredField("counts").getGenericType());

//
//msgp:tuple VolInfo
type VolInfo struct {
	// Name of the volume.
	Name string

	// Date and time when the volume was created.
	Created time.Time

	// total VolInfo counts
	count int

	// Date and time when the volume was deleted, if Deleted
	Deleted time.Time
}

// FilesInfo represent a list of files, additionally
// indicates if the list is last.
//

            when(mockReferral.getNode()).thenReturn("\\server\\share\\path");

            String reqPath = "\\\\server\\share\\path\\file";
            // Ensure consumed is within bounds to avoid StringIndexOutOfBoundsException
            consumed = Math.min(consumed, reqPath.length());

    void testMethodsWithIndicesBeyondBuffer() {
        // Arrange
        byte[] buffer = new byte[10];
        int beyondIndex = 20;

        // Act & Assert
        // These methods don't validate buffer bounds, so they return 0
        assertEquals(0, response.writeSetupWireFormat(buffer, beyondIndex));
        assertEquals(0, response.writeParametersWireFormat(buffer, beyondIndex));

    }

    @Test
    void testResolveSidsWithOffsetAndLength_OutOfBounds() throws CIFSException {
        doThrow(new CIFSException("Array index out of bounds")).when(sidResolver)
                .resolveSids(any(CIFSContext.class), anyString(), any(SID[].class), eq(5), anyInt());

		Avg:  a.Avg,
		Max:  a.Max,
	}
	return w
}

// QStat holds queue stats for replication
type QStat struct {
	Count float64 `json:"count"`
	Bytes float64 `json:"bytes"`
}

func (q *QStat) add(o QStat) QStat {
	return QStat{Bytes: q.Bytes + o.Bytes, Count: q.Count + o.Count}
}

// InQueueMetric holds queue stats for replication
type InQueueMetric struct {
	Curr QStat `json:"curr" msg:"cq"`