- Sort Score
- Result 10 results
- Languages All
Results 301 - 310 of 4,508 for intA (1.46 sec)
-
src/main/java/org/codelibs/fess/util/IpAddressUtil.java
normalized[i] = "0"; } } // Find longest sequence of consecutive zeros int longestStart = -1; int longestLength = 0; int currentStart = -1; int currentLength = 0; for (int i = 0; i < 8; i++) { if ("0".equals(normalized[i])) { if (currentStart == -1) { currentStart = i;
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Nov 06 08:31:03 UTC 2025 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/MoreExecutors.java
private MoreExecutors() {} /** * Converts the given ThreadPoolExecutor into an ExecutorService that exits when the application * is complete. It does so by using daemon threads and adding a shutdown hook to wait for their * completion. * * <p>This is mainly for fixed thread pools. See {@link Executors#newFixedThreadPool(int)}. *
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Wed Oct 08 18:55:33 UTC 2025 - 45.2K bytes - Viewed (0) -
compat/maven-artifact/src/main/java/org/apache/maven/artifact/versioning/ComparableVersion.java
private static final int MAX_INTITEM_LENGTH = 9; private static final int MAX_LONGITEM_LENGTH = 18; private String value; private String canonical; private ListItem items; private interface Item { int INT_ITEM = 3; int LONG_ITEM = 4; int BIGINTEGER_ITEM = 0; int STRING_ITEM = 1; int LIST_ITEM = 2; int COMBINATION_ITEM = 5;Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Wed Jul 23 17:27:08 UTC 2025 - 26.4K bytes - Viewed (0) -
cmd/data-usage-cache.go
if err != nil { return err } return nil } // deserialize the supplied byte slice into the cache. func (d *dataUsageCache) deserialize(r io.Reader) error { var b [1]byte n, _ := r.Read(b[:]) if n != 1 { return io.ErrUnexpectedEOF } ver := int(b[0]) switch ver { case dataUsageCacheVerV1: return errors.New("cache version deprecated (will autoupdate)")Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 34.7K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/Punycode.kt
} private fun String.requiresEncode( pos: Int, limit: Int, ): Boolean { for (i in pos until limit) { if (this[i].code >= INITIAL_N) return true } return false } private fun String.codePoints( pos: Int, limit: Int, ): List<Int> { val result = mutableListOf<Int>() var i = pos while (i < limit) { val c = this[i]
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 8.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/IteratorsTest.java
@SuppressWarnings("JdkObsolete") private static Enumeration<Integer> enumerate(int... ints) { Vector<Integer> vector = new Vector<>(Ints.asList(ints)); return vector.elements(); } public void testToString() { Iterator<String> iterator = Lists.newArrayList("yam", "bam", "jam", "ham").iterator(); assertEquals("[yam, bam, jam, ham]", Iterators.toString(iterator)); }Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Oct 28 18:44:53 UTC 2025 - 56.7K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb2/info/Smb2QueryDirectoryResponseTest.java
} @ParameterizedTest @ValueSource(ints = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 100, 255, 256, 65535 }) @DisplayName("Test readBytesWireFormat with various invalid structure sizes") void testReadBytesWireFormatVariousInvalidSizes(int invalidSize) { response = new Smb2QueryDirectoryResponse(mockConfig, (byte) 0x03); byte[] buffer = new byte[1024]; int bufferIndex = 0;Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 23.5K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/ParameterUtil.java
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 7.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/dfs/DfsReferralResponseBufferTest.java
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 15.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
return; } int newThreshold = 1 + (int) (newCapacity * loadFactor); int[] newTable = newTable(newCapacity); long[] entries = this.entries; int mask = newTable.length - 1; for (int i = 0; i < size; i++) { long oldEntry = entries[i]; int hash = getHash(oldEntry); int tableIndex = hash & mask; int next = newTable[tableIndex];Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 14.5K bytes - Viewed (0)