- Sort Score
- Num 10 results
- Language All
Results 151 - 160 of 329 for MAX_VALUE (0.05 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/escape/Escapers.java
* * <p>The initial state of the builder is such that: * * <ul> * <li>There are no replacement mappings * <li>{@code safeMin == Character.MIN_VALUE} * <li>{@code safeMax == Character.MAX_VALUE} * <li>{@code unsafeReplacement == null} * </ul> * * <p>For performance reasons escapers created by this builder are not Unicode aware and will not * validate the well-formedness of their input. */
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 6.9K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/RegularContiguousSet.java
}; } else { return super.createAsList(); } } @Override public int size() { long distance = domain.distance(first(), last()); return (distance >= Integer.MAX_VALUE) ? Integer.MAX_VALUE : (int) distance + 1; } @Override public boolean contains(@Nullable Object object) { if (object == null) { return false; } try {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 8.3K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/concurrent/TaskRunner.kt
assertLockHeld() while (true) { if (readyQueues.isEmpty()) { return null // Nothing to do. } val now = backend.nanoTime() var minDelayNanos = Long.MAX_VALUE var readyTask: Task? = null var multipleReadyTasks = false // Decide what to run. This loop's goal wants to: // * Find out what this thread should do (either run a task or sleep)
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sat Aug 30 11:30:11 GMT 2025 - 10.4K bytes - Click Count (0) -
android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java
if (safeMax < safeMin) { // If the safe range is empty, set the range limits to opposite extremes // to ensure the first test of either value will fail. safeMax = -1; safeMin = Integer.MAX_VALUE; } this.safeMin = safeMin; this.safeMax = safeMax; // This is a bit of a hack but lets us do quicker per-character checks in
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Feb 13 15:45:16 GMT 2025 - 8.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/fscc/FileStandardInfoTest.java
void testDecodeWithMaxValues() throws SMBProtocolDecodingException { // Prepare test data with maximum values byte[] buffer = new byte[22]; long maxLong = Long.MAX_VALUE; int maxInt = Integer.MAX_VALUE; // Encode test data int offset = 0; SMBUtil.writeInt8(maxLong, buffer, offset); offset += 8; SMBUtil.writeInt8(maxLong, buffer, offset);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 13.1K bytes - Click Count (0) -
src/test/java/jcifs/internal/fscc/SmbInfoAllocationTest.java
// Prepare test data with maximum int values byte[] buffer = new byte[22]; int idFileSystem = Integer.MAX_VALUE; int sectPerAlloc = 100; int alloc = Integer.MAX_VALUE / 200; int free = Integer.MAX_VALUE / 200; int bytesPerSect = 512; // Encode test data int offset = 0; SMBUtil.writeInt4(idFileSystem, buffer, offset);Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 14.2K bytes - Click Count (0) -
samples/tlssurvey/src/main/kotlin/okhttp3/survey/CipherSuiteSurvey.kt
} println() val sortedSuites = ianaSuites.suites.sortedBy { ianaSuite -> val index = orderBy.indexOfFirst { it.matches(ianaSuite) } if (index == -1) Integer.MAX_VALUE else index } for (suiteId in sortedSuites) { print(suiteId.name) for (client in clients) { print("\t") val index = client.enabled.indexOfFirst { it.matches(suiteId) }Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Tue Apr 02 01:44:15 GMT 2024 - 1.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/base/CharMatcherTest.java
} for (int c = 0; c <= Character.MAX_VALUE; c++) { assertFalse(positive.contains(Character.valueOf((char) c)) ^ m.matches((char) c)); } } static char[] randomChars(Random rand, int size) { Set<Character> chars = new HashSet<>(size); for (int i = 0; i < size; i++) { char c; do { c = (char) rand.nextInt(Character.MAX_VALUE - Character.MIN_VALUE + 1);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 32.4K bytes - Click Count (0) -
mockwebserver/src/main/kotlin/mockwebserver3/MockResponse.kt
this.headers_ = Headers .Builder() .add("Content-Length", "0") this.trailers_ = Headers.Builder() this.throttleBytesPerPeriod = Long.MAX_VALUE this.throttlePeriodNanos = 0L this.failHandshake = false this.onRequestStart = null this.doNotReadRequestBody = false this.onRequestBody = null this.onResponseStart = nullCreated: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Jun 20 11:46:46 GMT 2025 - 17.8K bytes - Click Count (0) -
benchmarks/src/main/java/org/elasticsearch/common/bytes/BytesArrayReadVLongBenchmark.java
for (int i = 0; i < entries / 2; i++) { tmp.writeVLong(i); } for (int i = 0; i < entries / 2; i++) { tmp.writeVLong(Long.MAX_VALUE - i); } BytesReference bytesArray = tmp.copyBytes(); if (bytesArray instanceof BytesArray == false) { throw new AssertionError("expected BytesArray but saw [" + bytesArray.getClass() + "]");
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Mon Apr 12 20:25:06 GMT 2021 - 2.2K bytes - Click Count (0)