- Sort Score
- Num 10 results
- Language All
Results 11 - 20 of 555 for butter (0.44 seconds)
-
guava/src/com/google/common/collect/TopKSelector.java
T pivotValue = uncheckedCastNullableTToT(buffer[pivotIndex]); buffer[pivotIndex] = buffer[right]; int pivotNewIndex = left; for (int i = left; i < right; i++) { if (comparator.compare(uncheckedCastNullableTToT(buffer[i]), pivotValue) < 0) { swap(pivotNewIndex, i); pivotNewIndex++; } } buffer[right] = buffer[pivotNewIndex]; buffer[pivotNewIndex] = pivotValue;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Aug 31 13:15:26 GMT 2025 - 11.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/EvictingQueue.java
* attempting to add new elements onto the queue and it is full. This queue orders elements FIFO * (first-in-first-out). This data structure is logically equivalent to a circular buffer (i.e., * cyclic buffer or ring buffer). * * <p>An evicting queue must be configured with a maximum size. Each time an element is added to a * full queue, the queue automatically removes its head element. This is different from conventional
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Feb 13 17:34:21 GMT 2025 - 4.6K bytes - Click Count (0) -
okhttp-logging-interceptor/src/main/kotlin/okhttp3/logging/HttpLoggingInterceptor.kt
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Nov 07 02:57:33 GMT 2025 - 11.5K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
T pivotValue = uncheckedCastNullableTToT(buffer[pivotIndex]); buffer[pivotIndex] = buffer[right]; int pivotNewIndex = left; for (int i = left; i < right; i++) { if (comparator.compare(uncheckedCastNullableTToT(buffer[i]), pivotValue) < 0) { swap(pivotNewIndex, i); pivotNewIndex++; } } buffer[right] = buffer[pivotNewIndex]; buffer[pivotNewIndex] = pivotValue;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Aug 31 13:15:26 GMT 2025 - 11.3K bytes - Click Count (0) -
src/main/webapp/css/bootstrap.min.css.map
-11 {\n margin-left: 91.66666667%;\n}\n\n.g-0,\n.gx-0 {\n --bs-gutter-x: 0;\n}\n\n.g-0,\n.gy-0 {\n --bs-gutter-y: 0;\n}\n\n.g-1,\n.gx-1 {\n --bs-gutter-x: 0.25rem;\n}\n\n.g-1,\n.gy-1 {\n --bs-gutter-y: 0.25rem;\n}\n\n.g-2,\n.gx-2 {\n --bs-gutter-x: 0.5rem;\n}\n\n.g-2,\n.gy-2 {\n --bs-gutter-y: 0.5rem;\n}\n\n.g-3,\n.gx-3 {\n --bs-gutter-x: 1rem;\n}\n\n.g-3,\n.gy-3 {\n --bs-gutter-y: 1rem;\n}\n\n.g-4,\n.gx-4 {\n --bs-gutter-x: 1.5rem;\n}\n\n.g-4,\n.gy-4 {\n --bs-gutter-y: 1.5rem;\n}\n\n.g-5,\n.gx-5...Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Jan 12 06:14:02 GMT 2025 - 575.5K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt
import okhttp3.internal.http2.Header.Companion.TARGET_PATH import okhttp3.internal.http2.Header.Companion.TARGET_SCHEME import okhttp3.internal.unmodifiable import okio.Buffer import okio.BufferedSource import okio.ByteString import okio.Source import okio.buffer /** * Read and write HPACK v10. * * http://tools.ietf.org/html/draft-ietf-httpbis-header-compression-12 *
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Mar 15 09:02:18 GMT 2026 - 23.2K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* {@code long} value, interpreted in little-endian byte order. The implementation <i>might</i> * perform better than its longhand equivalent, but should not perform worse. */ HashCode hashLong(long input); /** * Shortcut for {@code newHasher().putBytes(input).hash()}. The implementation <i>might</i> * perform better than its longhand equivalent, but should not perform worse. */ HashCode hashBytes(byte[] input);Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 10.9K bytes - Click Count (0) -
guava/src/com/google/common/collect/ImmutableSortedSet.java
* enough. Consider, for example, the case where we have a buffer of size (n+1), add n * distinct elements, and add the last element over again many times over. We don't want a * situation where we re-sort the entire buffer every time the last element is re-added. * * <p>The solution is to ensure there are O(n) spaces left over in the buffer after
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Sep 23 17:50:58 GMT 2025 - 39.1K bytes - Click Count (0) -
okhttp/src/jvmTest/resources/okhttp3/internal/publicsuffix/public_suffix_list.dat
wpmucdn.com tempurl.host wpmudev.host // Individual Network Berlin e.V. : https://www.in-berlin.de/ // Submitted by Christian Seitz <******@****.***> dyn-berlin.de in-berlin.de in-brb.de in-butter.de in-dsl.de in-vpn.de in-dsl.net in-vpn.net in-dsl.org in-vpn.org // info.at : http://www.info.at/ biz.at info.at // info.cx : http://info.cx
Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Dec 27 13:39:56 GMT 2024 - 309.7K bytes - Click Count (1) -
docs/changelogs/changelog_2x.md
* Fix: Handle null fragments. * Fix: Don’t crash on interceptors that throw `IOException` before a connection is attempted. * New: Support [WebDAV][webdav] HTTP methods. * New: Buffer WebSocket frames for better performance. * New: Drop support for `TLS_DHE_DSS_WITH_AES_128_CBC_SHA`, our only remaining DSS cipher suite. This is consistent with Firefox and Chrome which have also dropped these cipher suite.Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Sun Feb 06 02:19:09 GMT 2022 - 26.6K bytes - Click Count (0)