- Sort Score
- Num 10 results
- Language All
Results 121 - 130 of 485 for hints (0.05 seconds)
-
src/test/java/jcifs/internal/smb2/session/Smb2LogoffResponseTest.java
assertNotNull(resp, "Response instance should be created"); } @Nested @DisplayName("writeBytesWireFormat") class WriteBytesWireFormat { @ParameterizedTest @ValueSource(ints = { -10, -1, 0, 1, 42 }) @DisplayName("Returns 0 regardless of dst and index") void returnsZero_forVariousIndexes(int index) { // Arrange Smb2LogoffResponse resp = newResponse();
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 4.7K bytes - Click Count (0) -
src/main/java/jcifs/internal/smb2/lock/Smb2LeaseBreakNotification.java
return flags; } /** * Gets the access mask hint for optimizing lease handling * @return the access mask hint */ public int getAccessMaskHint() { return accessMaskHint; } /** * Gets the share access hint for optimizing lease handling * @return the share access hint */ public int getShareAccessHint() { return shareAccessHint;Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 23 02:21:31 GMT 2025 - 4.8K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java
private static final int[] nonzero = new int[ARRAY_SIZE]; private static final int[] ints = new int[ARRAY_SIZE]; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { positive[i] = randomPositiveBigInteger(Integer.SIZE - 2).intValue(); nonzero[i] = randomNonZeroBigInteger(Integer.SIZE - 2).intValue(); ints[i] = RANDOM_SOURCE.nextInt(); } }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Dec 19 18:03:30 GMT 2024 - 2.6K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
for details. case 1024 / _W: const n = 1024 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1024(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 1536 / _W: const n = 1536 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW1536(&T[i], &xLimbs[0], yLimbs[i]) } return x.Mod(&Nat{limbs: T}, m) case 2048 / _W: const n = 2048 / _W // compiler hint T := make([]uint, n*2) for i := 0; i < n; i++ { T[n+i] = addMulVVW2048(&T[i],...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
android/guava-testlib/src/com/google/common/collect/testing/TestIntegerSetGenerator.java
* limitations under the License. */ package com.google.common.collect.testing; import com.google.common.annotations.GwtCompatible; import com.google.common.collect.testing.SampleElements.Ints; import java.util.List; import java.util.Set; import org.jspecify.annotations.NullMarked; /** * Create integer sets for collection tests. * * @author Gregory Kick */ @GwtCompatible @NullMarked
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Dec 21 14:50:24 GMT 2024 - 2.1K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
public void testIteratorMinAndMax() { List<Integer> ints = Lists.newArrayList(5, 3, 0, 9); assertEquals(9, (int) numberOrdering.max(ints.iterator())); assertEquals(0, (int) numberOrdering.min(ints.iterator())); // when the values are the same, the first argument should be returned Integer a = new Integer(4); Integer b = new Integer(4); ints = Lists.newArrayList(a, b, b);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 43.2K bytes - Click Count (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
public void testIteratorMinAndMax() { List<Integer> ints = Lists.newArrayList(5, 3, 0, 9); assertEquals(9, (int) numberOrdering.max(ints.iterator())); assertEquals(0, (int) numberOrdering.min(ints.iterator())); // when the values are the same, the first argument should be returned Integer a = new Integer(4); Integer b = new Integer(4); ints = Lists.newArrayList(a, b, b);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 43.2K bytes - Click Count (0) -
guava/src/com/google/common/collect/Hashing.java
import com.google.common.primitives.Ints; import org.jspecify.annotations.Nullable; /** * Static methods for implementing hash-based collections. * * @author Kevin Bourrillion * @author Jesse Wilson * @author Austin Appleby */ @GwtCompatible final class Hashing { private Hashing() {} /* * These should be ints, but we need to use longs to force GWT to do the multiplications withCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.5K bytes - Click Count (0) -
okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/BasicDerAdapter.kt
* limitations under the License. */ package okhttp3.tls.internal.der import java.net.ProtocolException /** * Handles basic types that always use the same tag. This supports optional types and may set a type * hint for further adapters to process. * * Types like ANY and CHOICE that don't have a consistent tag cannot use this. */ internal data class BasicDerAdapter<T>( private val name: String,
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 4.4K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/math/IntMathBenchmark.java
private static final int[] binomial = new int[ARRAY_SIZE]; private static final int[] positive = new int[ARRAY_SIZE]; private static final int[] nonnegative = new int[ARRAY_SIZE]; private static final int[] ints = new int[ARRAY_SIZE]; @BeforeExperiment void setUp() { for (int i = 0; i < ARRAY_SIZE; i++) { exponent[i] = randomExponent(); factorial[i] = RANDOM_SOURCE.nextInt(50);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 3.3K bytes - Click Count (0)