- **Collections** (`org.codelibs.core.collection`) - Enhanced collection utilities, array operations, and specialized map/set implementations including LRU caches and case-insensitive collections

        @DisplayName("Should return correct tflags value")
        void testGetTflags() {
            assertEquals(25, buffer.getTflags());
        }

        @Test
        @DisplayName("Should return referrals array")
        void testGetReferrals() {
            assertNotNull(buffer.getReferrals());
            assertEquals(3, buffer.getReferrals().length);
        }
    }

    @Nested

 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.collect.testing;

import static java.lang.Math.max;
import static java.util.Arrays.asList;
import static java.util.Collections.singletonMap;
import static java.util.Collections.sort;
import static junit.framework.Assert.assertEquals;
import static junit.framework.Assert.assertFalse;

        // Then - always returns 0 as this is a request, not response
        assertEquals(0, emptyRead);
        assertEquals(0, fullRead);
    }

    /**
     * Create a test byte array with specified size and pattern
     */
    private byte[] createTestData(int size) {
        byte[] data = new byte[size];
        for (int i = 0; i < size; i++) {
            data[i] = (byte) (i % 256);
        }

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.J2ktIncompatible;
import com.google.common.collect.Sets;
import com.google.common.testing.NullPointerTester;
import java.util.Arrays;
import java.util.BitSet;
import java.util.HashSet;
import java.util.Random;
import java.util.Set;
import junit.framework.AssertionFailedError;
import junit.framework.TestCase;

		This    string `json:"this"`    // This field carries assigned disk uuid.
		// Sets field carries the input disk order generated the first
		// time when fresh disks were supplied, it is a two dimensional
		// array second dimension represents list of disks used per set.
		Sets [][]string `json:"sets"`
		// Distribution algorithm represents the hashing algorithm
		// to pick the right set index for an object.

        assertDoesNotThrow(() -> {
            new MsrpcLookupSids(null, testSids);
        });
    }

    @Test
    void constructor_shouldThrowExceptionWithNullSids() {
        // Act & Assert - Null SID array causes NPE when accessing length
        assertThrows(NullPointerException.class, () -> {
            new MsrpcLookupSids(mockPolicyHandle, null);
        });
    }

    @Test

            assertEquals((time / 1000L) * 1000L, readTime);
        }
    }

    @Test
    void testBoundaryConditions() {
        byte[] buffer = new byte[16];

        // Test edge of array
        SMBUtil.writeInt2(0xFFFF, buffer, 14);
        assertEquals(0xFFFF, SMBUtil.readInt2(buffer, 14));

        // Test different offsets
        for (int offset = 0; offset <= 8; offset++) {

// Code generated by "stringer -type=APIErrorCode -trimprefix=Err api-errors.go"; DO NOT EDIT.

package cmd

import "strconv"

func _() {
	// An "invalid array index" compiler error signifies that the constant values have changed.
	// Re-run the stringer command to generate them again.
	var x [1]struct{}
	_ = x[ErrNone-0]
	_ = x[ErrAccessDenied-1]
	_ = x[ErrBadDigest-2]
	_ = x[ErrEntityTooSmall-3]
	_ = x[ErrEntityTooLarge-4]

// returns false if one of the following check fails
// - erasure algorithm is different
// - data blocks are different
// - parity blocks are different
// - block size is different
// - distribution array size is different
// - distribution indexes are different
func (ei ErasureInfo) Equal(nei ErasureInfo) bool {
	if ei.Algorithm != nei.Algorithm {
		return false
	}
	if ei.DataBlocks != nei.DataBlocks {