- Sort Score
- Num 10 results
- Language All
Results 101 - 110 of 572 for ints (0.02 seconds)
-
src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.4K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/net/NetShareEnumTest.java
@ValueSource(ints = { 1024, 2048, 4096, 8192, 16384, 32768, 65535 }) void testMaxDataCountValues(int maxDataCount) throws Exception { netShareEnum = new NetShareEnum(realConfig); // Set maxDataCount using reflection setFieldValue(netShareEnum, "maxDataCount", maxDataCount); byte[] dst = new byte[256];Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.8K bytes - Click Count (0) -
src/test/java/jcifs/dcerpc/msrpc/MsrpcLookupSidsTest.java
assertTrue(namesObj instanceof lsarpc.LsarTransNameArray); } @ParameterizedTest @ValueSource(ints = { 1, 5, 10, 20, 50 }) void constructor_shouldHandleVariousSidArraySizes(int size) { // Arrange testSids = new jcifs.SID[size]; for (int i = 0; i < size; i++) { testSids[i] = mock(jcifs.SID.class);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 12.6K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/trans2/Trans2GetDfsReferralResponseTest.java
buffer[6] = 0; buffer[7] = 0; return buffer; } private byte[] createDfsReferralBufferWithMultipleReferrals(int numReferrals) { // Each referral structure needs 20 bytes, plus string data int referralSize = 20; int referralsDataSize = numReferrals * referralSize; // Add space for string data for each referral String testPath = "\\server\\share";
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 19.4K bytes - Click Count (0) -
src/test/java/jcifs/internal/fscc/FileSystemInformationTest.java
@ParameterizedTest @ValueSource(ints = { 24, 32, 100, 1000, 10000 }) @DisplayName("Should handle various buffer sizes correctly") void testVariousBufferSizes(int bufferSize) throws SMBProtocolDecodingException { byte[] buffer = new byte[bufferSize]; FileFsSizeInformation info = new FileFsSizeInformation(); int decoded = info.decode(buffer, 0, Math.min(bufferSize, 24));Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 18.1K bytes - Click Count (0) -
android/guava/src/com/google/common/math/IntMath.java
* <p><b>Note:</b> this method is now unnecessary and should be treated as deprecated; use {@link * Math#addExact(int, int)} instead. * * @throws ArithmeticException if {@code a + b} overflows in signed {@code int} arithmetic */ @InlineMe(replacement = "Math.addExact(a, b)") public static int checkedAdd(int a, int b) { return Math.addExact(a, b); } /**Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 26.1K bytes - Click Count (0) -
src/test/java/jcifs/netbios/SessionServicePacketTest.java
private static class TestSessionServicePacket extends SessionServicePacket { int trailerLength = 10; // Default trailer length for testing int trailerBytesRead = 0; @Override int writeTrailerWireFormat(byte[] dst, int dstIndex) { // Simple mock implementation for (int i = 0; i < trailerLength && dstIndex + i < dst.length; i++) { dst[dstIndex + i] = (byte) i;Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 15.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/ioctl/SrvCopychunkTest.java
@DisplayName("Should encode at various buffer positions") @ValueSource(ints = { 0, 1, 10, 50, 70 }) void testEncodeAtDifferentPositions(int position) { // Given byte[] largeBuffer = new byte[200]; long sourceOffset = 12345L; long targetOffset = 67890L; int length = 99999; SrvCopychunk chunk = new SrvCopychunk(sourceOffset, targetOffset, length);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 12.4K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
*/ Hasher newHasher(int expectedInputSize); /** * Shortcut for {@code newHasher().putInt(input).hash()}; returns the hash code for the given * {@code int} value, interpreted in little-endian byte order. The implementation <i>might</i> * perform better than its longhand equivalent, but should not perform worse. * * @since 12.0 */ HashCode hashInt(int input); /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
src/test/java/jcifs/spnego/NegTokenInitTest.java
@ParameterizedTest @ValueSource(ints = { NegTokenInit.DELEGATION, NegTokenInit.MUTUAL_AUTHENTICATION, NegTokenInit.REPLAY_DETECTION, NegTokenInit.SEQUENCE_CHECKING, NegTokenInit.ANONYMITY, NegTokenInit.CONFIDENTIALITY, NegTokenInit.INTEGRITY }) @DisplayName("Individual flag values are correctly set and retrieved") void testIndividualFlagValues(int flag) { NegTokenInit init = new NegTokenInit();Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 21K bytes - Click Count (0)