srvsvc.ShareInfo502 info502 = new srvsvc.ShareInfo502();
        info502.security_descriptor = new byte[] { 1, 2, 3, 4 };
        info502.sd_size = 100; // Mismatched size - SecurityDescriptor will try to read beyond array bounds

        // Replace info field
        Field infoField = msrpcShareGetInfo.getClass().getSuperclass().getDeclaredField("info");
        infoField.setAccessible(true);
        infoField.set(msrpcShareGetInfo, info502);

    }

    @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());

    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));

//
// If index is out of bounds, an error code will be set in the status object,
// and -1 will be returned.
TF_CAPI_EXPORT extern int64_t TF_DeviceListMemoryBytes(
    const TF_DeviceList* list, int index, TF_Status* status);

// Retrieve the incarnation number of a given device.
//
// If index is out of bounds, an error code will be set in the status object,
// and 0 will be returned.

            assertThrows(ArrayIndexOutOfBoundsException.class, () -> response.readBytesWireFormat(buffer, 0));
        }

        @Test
        @DisplayName("Should throw exception when buffer index out of bounds")
        void testReadBytesWireFormatBufferIndexOutOfBounds() {
            // Given
            byte[] buffer = new byte[10];

            // When & Then

        protwordsFile.reload(null);
        boolean found = false;
        PagingList<ProtwordsItem> list = protwordsFile.selectList(0, 100);
        for (ProtwordsItem item : list) {
            if ("newWord".equals(item.getInput())) {
                found = true;
                break;
            }
        }
        assertTrue(found);
    }

    @Test
    public void test_update() {

        stopwordsFile.insert(newItem);

        // Verify the item was added
        boolean found = false;
        for (StopwordsItem item : stopwordsFile.stopwordsItemList) {
            if ("test".equals(item.getInput())) {
                found = true;
                break;
            }
        }
        assertTrue(found);
    }

    // Test update method
    @Test
    public void test_update() {

  /**
   * Returns the element at the specified position in an iterable.
   *
   * <p><b>{@code Stream} equivalent:</b> {@code stream.skip(position).findFirst().get()} (throws
   * {@code NoSuchElementException} if out of bounds)
   *
   * @param position position of the element to return
   * @return the element at the specified position in {@code iterable}

pkg image, func NewNYCbCrA(Rectangle, YCbCrSubsampleRatio) *NYCbCrA
pkg image, method (*NYCbCrA) AOffset(int, int) int
pkg image, method (*NYCbCrA) At(int, int) color.Color
pkg image, method (*NYCbCrA) Bounds() Rectangle
pkg image, method (*NYCbCrA) COffset(int, int) int
pkg image, method (*NYCbCrA) ColorModel() color.Model
pkg image, method (*NYCbCrA) NYCbCrAAt(int, int) color.NYCbCrA
pkg image, method (*NYCbCrA) Opaque() bool

//   - [128]bool with explicit bounds check (if c >= 128): introduces branches
//     that cause pipeline stalls, resulting in ~70% slower performance
//   - [128]bool with masking (c&0x7f): eliminates bounds checks but the AND
//     operation still costs ~10% performance compared to direct indexing
//
// The 256-element array allows direct indexing with no bounds checks, no branches,