- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 355 for SECOND (0.03 sec)
-
src/main/java/jcifs/dcerpc/msrpc/srvsvc.java
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 01:32:48 UTC 2025 - 27K bytes - Viewed (0) -
src/main/java/jcifs/util/ServerResponseValidator.java
throw new SmbException("Buffer access out of bounds"); } } /** * Safely add integers checking for overflow * * @param a first value * @param b second value * @return sum * @throws SmbException if overflow would occur */ public int safeAdd(int a, int b) throws SmbException { totalValidations.incrementAndGet();
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 16.6K bytes - Viewed (0) -
src/test/java/jcifs/smb1/smb1/Trans2QueryPathInformationTest.java
assertEquals(2, bytesWritten, "Should write 2 bytes."); assertEquals(SmbComTransaction.TRANS2_QUERY_PATH_INFORMATION, dst[0], "The first byte should be the subCommand."); assertEquals((byte) 0x00, dst[1], "The second byte should be 0."); } /** * Tests the writeParametersWireFormat method. */ @Test void testWriteParametersWireFormat() { // Given
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.8K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/lock/Smb2OplockBreakNotificationTest.java
notification.readBytesWireFormat(buffer1, 0); // Second read with different values byte[] fileId2 = new byte[16]; Arrays.fill(fileId2, (byte) 0x99); byte[] buffer2 = createValidOplockBreakBuffer((byte) 0x08, fileId2); notification.readBytesWireFormat(buffer2, 0); // Verify second read overwrote first read values
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 17.6K bytes - Viewed (0) -
src/test/java/jcifs/smb/SIDCacheImplTest.java
names.names[0].sid_type = (short) jcifs.SID.SID_TYPE_USER; names.names[0].name = new UnicodeString("alice", false); names.names[0].sid_index = 0; // Second is a domain group names.names[1] = new lsarpc.LsarTranslatedName(); names.names[1].sid_type = (short) jcifs.SID.SID_TYPE_DOM_GRP; names.names[1].name = new UnicodeString("Domain Users", false);
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 14K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AtomicLongMap.java
* {@code key} (or zero, if there is none) is passed as the first argument to {@code * accumulatorFunction}, and {@code x} is passed as the second argument. * * @since 21.0 */ @CanIgnoreReturnValue public long accumulateAndGet(K key, long x, LongBinaryOperator accumulatorFunction) { checkNotNull(accumulatorFunction);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Oct 10 23:13:45 UTC 2025 - 11.7K bytes - Viewed (0) -
src/test/java/jcifs/BufferCacheTest.java
byte[] buffer1 = testCache.getBuffer(); byte[] buffer2 = testCache.getBuffer(); // Then assertNotNull(buffer1, "First buffer should not be null"); assertNotNull(buffer2, "Second buffer should not be null"); assertEquals(1024, buffer1.length, "Buffer should have expected size"); assertEquals(1024, buffer2.length, "Buffer should have expected size");
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 4.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/MinimalIterable.java
* #iterator()} method after the first, and whose iterator is always unmodifiable. * * <p>The {@code Iterable} specification does not make it absolutely clear what should happen on a * second invocation, so implementors have made various choices, including: * * <ul> * <li>returning the same iterator again * <li>throwing an exception of some kindRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 3.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ArrayTable.java
* * <p><b>Warning:</b> {@code ArrayTable} is rarely the {@link Table} implementation you want. First, * it requires that the complete universe of rows and columns be specified at construction time. * Second, it is always backed by an array large enough to hold a value for every possible * combination of row and column keys. (This is rarely optimal unless the table is extremely dense.)Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Nov 17 22:50:48 UTC 2025 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/SipHashFunction.java
/** * @param c the number of compression rounds (must be positive) * @param d the number of finalization rounds (must be positive) * @param k0 the first half of the key * @param k1 the second half of the key */ SipHashFunction(int c, int d, long k0, long k1) { checkArgument( c > 0, "The number of SipRound iterations (c=%s) during Compression must be positive.", c); checkArgument(
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 17:34:21 UTC 2025 - 5.3K bytes - Viewed (0)