- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 86 for mid2 (0.05 seconds)
-
src/test/java/jcifs/SIDTest.java
*/ @Test void testEquals() throws SmbException { SID sid1 = new SID(adminSidString); SID sid2 = new SID(adminSidBytes, 0); SID sid3 = new SID("S-1-1-0"); // Everyone assertEquals(sid1, sid1); assertEquals(sid1, sid2); assertNotEquals(sid1, sid3); assertNotEquals(sid1, null); assertNotEquals(sid1, new Object()); }Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 13.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/CommonServerMessageBlockResponseTest.java
response.setDigest(digest); assertEquals(digest, response.getDigest()); // Test mid methods long mid = 123456L; doNothing().when(response).setMid(mid); when(response.getMid()).thenReturn(mid); response.setMid(mid); assertEquals(mid, response.getMid()); // Test command methods int command = 0x25;
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 20.3K bytes - Click Count (0) -
android/guava/src/com/google/common/math/Quantiles.java
boolean midLessThanFrom = (array[mid] < array[from]); boolean toLessThanFrom = (array[to] < array[from]); if (toLessThanMid == midLessThanFrom) { // Either array[to] < array[mid] < array[from] or array[from] <= array[mid] <= array[to]. swap(array, mid, from); } else if (toLessThanMid != toLessThanFrom) {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/trans/nt/SmbComNtCancelTest.java
} @ParameterizedTest @ValueSource(ints = { 0, 1, 100, 255, 65535 }) @DisplayName("Should handle different MID values") void testConstructorWithVariousMids(int mid) throws Exception { // Given Configuration config = mock(Configuration.class); when(config.getPid()).thenReturn(12345); // WhenCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 07:14:38 GMT 2025 - 12.8K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb1/trans/nt/SmbComNtCancel.java
/** * Constructs an NT cancel command. * * @param config the configuration * @param mid the message ID to cancel */ protected SmbComNtCancel(final Configuration config, final int mid) { super(config, SMB_COM_NT_CANCEL); setMid(mid); } /** * {@inheritDoc} * * @see jcifs.internal.smb1.ServerMessageBlock#isCancel() */Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 2.6K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb2/ServerMessageBlock2.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sun Aug 31 08:00:57 GMT 2025 - 24K bytes - Click Count (0) -
build-tools-internal/src/main/resources/fips_java_oracle.security
ssl.KeyManagerFactory.algorithm=PKIX ssl.TrustManagerFactory.algorithm=PKIX networkaddress.cache.negative.ttl=10 krb5.kdc.bad.policy = tryLast jdk.certpath.disabledAlgorithms=MD2, MD5, SHA1 jdkCA & usage TLSServer, \ RSA keySize < 1024, DSA keySize < 1024, EC keySize < 224 jdk.jar.disabledAlgorithms=MD2, MD5, RSA keySize < 1024, \ DSA keySize < 1024 jdk.tls.disabledAlgorithms=SSLv3, RC4, MD5withRSA, DH keySize < 1024, \
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Jun 01 09:19:30 GMT 2021 - 2.2K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/trans/nt/SmbComNtTransactionTest.java
@DisplayName("Test createCancel with maximum MID value") void testCreateCancelWithMaxMid() { // Set MID to maximum value int maxMid = 0xFFFF; transaction.setMid(maxMid); // Create cancel request CommonServerMessageBlockRequest cancelRequest = transaction.createCancel(); // Verify it creates a valid cancel request with max MID assertNotNull(cancelRequest);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) -
src/main/java/jcifs/internal/smb1/ServerMessageBlock.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 38.9K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
/* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 3.5K bytes - Click Count (0)