* and access mask are considered. If the ACE is a "deny"
 * ACE and <i>any</i> of the desired access bits match bits in the access
 * mask of the ACE, the whole access check fails. If the ACE is an "allow"
 * ACE and <i>all</i> of the bits in the desired access bits match bits in
 * the access mask of the ACE, the access check is successful. Otherwise,
 * more ACEs are evaluated until all desired access bits (combined)

    /**
     * Constructs a Trans2FindFirst2 request for finding files.
     *
     * @param config the configuration to use
     * @param filename the path to search in
     * @param wildcard the wildcard pattern to match
     * @param searchAttributes the file attributes to search for
     * @param batchCount the number of entries to return
     * @param batchSize the maximum size of the response buffer
     */

        assertEquals(3, encodedLen, "Encoded length should be equal to the specified length");

        // Verify content
        assertArrayEquals(new byte[] { 0x02, 0x03, 0x04, 0x00, 0x00 }, dest, "Encoded bytes should match the expected subset");
    }

    @Test
    void testEncodeWithOffset() {
        // Test encoding with a destination offset
        byte[] data = { 0x01, 0x02, 0x03, 0x04, 0x05 };

        }
        assertSame(cause, ex.getCause(), "Cause should be stored and retrievable");
        assertSame(cause, ex.getRootCause(), "Deprecated getRootCause should match getCause");
        assertEquals(NtStatus.NT_STATUS_UNSUCCESSFUL, ex.getNtStatus(), "Status should default to unsuccessful for message+cause ctor");
    }

		t.Fatalf("Failed, got error: %v", err)
	}

	if result.ID != user.ID {
		t.Fatalf("result's id, %d, doesn't match user's id, %d", result.ID, user.ID)
	}
	// should find company
	if result.Company.ID != *user.CompanyID {
		t.Fatalf("result's id, %d, doesn't match user's company id, %d", result.Company.ID, *user.CompanyID)
	}
}

func TestJoinWithSoftDeleted(t *testing.T) {

	i := copy(b2, b)
	return b2[:i]
}

// WriteTo writes data to w until the buffer is drained or an error occurs.
// The return value n is the number of bytes written; it always fits into an
// int, but it is int64 to match the [io.WriterTo] interface. Any error
// encountered during the write is also returned.
func (b *Buffer) WriteTo(w io.Writer) (n int64, err error) {
	b.lastRead = opInvalid
	if nBytes := b.Len(); nBytes > 0 {

                    conflictResolvers);
        } catch (CyclicDependencyException e) {
            logger.debug("While recursing: " + e.getMessage(), e);
            result.addCircularDependencyException(e);
        } catch (OverConstrainedVersionException e) {
            logger.debug("While recursing: " + e.getMessage(), e);
            result.addVersionRangeViolation(e);
        } catch (ArtifactResolutionException e) {

,c=(parseInt(b,10)%97).toString()+c.slice(b.length);return parseInt(c,10)%97===1},d=function(a){a=a.toUpperCase(),a=a.replace(/\s+/g,"");var c=a.slice(0,2),d=0,e="";for(d=0;d<b.length;++d)if(b[d][0]===c){e=b[d][2];break}if(""===e)return!1;var f=e.match(/(.{3})/g).map(function(a){var b,c=a.slice(0,1),d=parseInt(a.slice(1),10);switch(c){case"A":b="0-9A-Za-z";break;case"B":b="0-9A-Z";break;case"C":b="A-Za-z";break;case"F":b="0-9";break;case"L":b="a-z";break;case"U":b="A-Z";break;case"W":b="0-9a-z"}...

        // Reset index to read back
        buf.reset();
        NdrShort decoded = new NdrShort(0); // placeholder value
        decoded.decode(buf);
        assertEquals(expected, decoded.value, "decoded value should match original after masking");
    }

    /**
     * Verify that encode writes the correct little-endian sequence
     * to the buffer and that alignment is respected.
     */
    @Test

        // setup condition
        cb.query().addOrderBy_LastAccessTime_Desc();

        buildSearchCondition(failureUrlPager, cb);
    }

    /**
     * Deletes all failure URLs that match the criteria specified in the pager.
     *
     * @param failureUrlPager the pager containing deletion criteria
     */
    public void deleteAll(final FailureUrlPager failureUrlPager) {