- Sort Score
- Result 10 results
- Languages All
Results 1201 - 1210 of 3,731 for qint (0.05 sec)
-
cmd/background-heal-ops.go
type healRoutine struct { tasks chan healTask workers int } func activeListeners() int { // Bucket notification and http trace are not costly, it is okay to ignore them // while counting the number of concurrent connections return int(globalHTTPListen.Subscribers()) + int(globalTrace.Subscribers()) } func waitForLowIO(maxIO int, maxWait time.Duration, currentIO func() int) { // No need to wait run at full speed. if maxIO <= 0 {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 4.6K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/ArrayUtil.java
} /** * {@literal int}配列の末尾に{@literal int}の値を追加した配列を返します。 * * @param array * 配列。{@literal null}であってはいけません * @param value * 値 * @return 値が追加された結果の配列 */ public static int[] add(final int[] array, final int value) { assertArgumentNotNull("array", array); final int[] newArray = (int[]) Array.newInstance(int.class, array.length + 1);
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 42.6K bytes - Viewed (0) -
internal/hash/checksum.go
ChecksumNone ChecksumType = 0 ) // Checksum is a type and base 64 encoded value. type Checksum struct { Type ChecksumType Encoded string Raw []byte WantParts int } // Is returns if c is all of t. func (c ChecksumType) Is(t ChecksumType) bool { if t == ChecksumNone { return c == ChecksumNone } return c&t == t } // Key returns the header key.
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Sep 19 12:59:07 UTC 2024 - 12.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/LongAdder.java
* * @return the sum */ @Override public long longValue() { return sum(); } /** Returns the {@link #sum} as an {@code int} after a narrowing primitive conversion. */ @Override public int intValue() { return (int) sum(); } /** Returns the {@link #sum} as a {@code float} after a widening primitive conversion. */ @Override public float floatValue() {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Jun 15 18:00:07 UTC 2021 - 5.5K bytes - Viewed (0) -
src/main/java/jcifs/Config.java
SingletonContext.registerSmbURLHandler(); } /** * Retrieve an <code>int</code>. If the key does not exist or * cannot be converted to an <code>int</code>, the provided default * argument will be returned. */ public static int getInt ( Properties props, String key, int def ) { String s = props.getProperty(key); if ( s != null ) { try {
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 6.3K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/Interceptor.kt
fun call(): Call fun connectTimeoutMillis(): Int fun withConnectTimeout( timeout: Int, unit: TimeUnit, ): Chain fun readTimeoutMillis(): Int fun withReadTimeout( timeout: Int, unit: TimeUnit, ): Chain fun writeTimeoutMillis(): Int fun withWriteTimeout( timeout: Int, unit: TimeUnit, ): Chain }
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 09 16:39:37 UTC 2024 - 45.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
private final ByteBuffer buffer; /** Number of bytes to be filled before process() invocation(s). */ private final int bufferSize; /** Number of bytes processed per process() invocation. */ private final int chunkSize; /** * Constructor for use by subclasses. This hasher instance will process chunks of the specified * size. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Jun 15 20:59:00 UTC 2022 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
/** An {@code Iterator} over all nodes. */ private class NodeIterator implements ListIterator<Entry<K, V>> { int nextIndex; @CheckForNull Node<K, V> next; @CheckForNull Node<K, V> current; @CheckForNull Node<K, V> previous; int expectedModCount = modCount; NodeIterator(int index) { int size = size(); checkPositionIndex(index, size); if (index >= (size / 2)) { previous = tail;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 13 14:11:58 UTC 2023 - 27.5K bytes - Viewed (0) -
tests/test_application.py
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Thu Apr 18 21:56:59 UTC 2024 - 52.2K bytes - Viewed (0)