- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 19 for slowest (0.1 seconds)
-
.github/workflows/test.yml
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Mon Mar 23 12:36:49 GMT 2026 - 6.4K bytes - Click Count (0) -
android/guava/src/com/google/common/math/Quantiles.java
// all values are lower or higher than centerFloor, in which case we find the two highest or // lowest respectively). If centerFloor is in allRequired, we will definitely find it. If not, // but centerFloor + 1 is, we'll definitely find that. The closest value to the true (unrounded) // center will be at either low or high. int low = requiredFrom; int high = requiredTo;Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 23 21:06:42 GMT 2026 - 30.1K bytes - Click Count (0) -
src/main/webapp/js/chat.js
} updateGroupBadge(checkbox.closest('.dropdown')); updateFilterBadge(); }); // Filter search input handler $(document).on('input', '.filter-search-input', function() { var query = $(this).val().toLowerCase(); $(this).closest('.filter-dropdown-menu').find('.filter-check-item').each(function() {Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Thu Mar 19 01:36:02 GMT 2026 - 30.6K bytes - Click Count (0) -
guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
assertInterrupted(); } public void testAwaitTimeoutMultiInterruptExpired() { /* * We don't "need" to schedule a countDown() call at all here, but by doing * so, we come the closest we can to testing that the wait time is * appropriately decreased on each progressive await() call. */ TimedLatch latch = new TimedLatch(/* countdownInMillis= */ LONG_DELAY_MS);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 38.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Hpack.kt
private val source: BufferedSource = source.buffer() // Visible for testing. @JvmField var dynamicTable = arrayOfNulls<Header>(8) // Array is populated back to front, so new entries always have lowest index. private var nextHeaderIndex = dynamicTable.size - 1 @JvmField var headerCount = 0 @JvmField var dynamicTableByteCount = 0 fun getAndResetHeaderList(): List<Header> {
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/LittleEndianByteArray.java
} /** * Similar to load64, but allows offset + 8 > input.length, padding the result with zeroes. This * has to explicitly reverse the order of the bytes as it packs them into the result which makes * it slower than the native version. * * @param input the input bytes * @param offset the offset into the array at which to start reading * @param length the number of bytes from the input to read
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 10.1K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/UninterruptiblesTest.java
assertInterrupted(); } public void testAwaitTimeoutMultiInterruptExpired() { /* * We don't "need" to schedule a countDown() call at all here, but by doing * so, we come the closest we can to testing that the wait time is * appropriately decreased on each progressive await() call. */ TimedLatch latch = new TimedLatch(/* countdownInMillis= */ LONG_DELAY_MS);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 38.1K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
/** * Fills the hole at {@code index} by moving in the least of its grandchildren to this position, * then recursively filling the new hole created. * * @return the position of the new hole (where the lowest grandchild moved from, that had no * grandchild to replace it) */ int fillHoleAt(int index) { int minGrandchildIndex; while ((minGrandchildIndex = findMinGrandChild(index)) > 0) {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
guava/src/com/google/common/collect/MinMaxPriorityQueue.java
/** * Fills the hole at {@code index} by moving in the least of its grandchildren to this position, * then recursively filling the new hole created. * * @return the position of the new hole (where the lowest grandchild moved from, that had no * grandchild to replace it) */ int fillHoleAt(int index) { int minGrandchildIndex; while ((minGrandchildIndex = findMinGrandChild(index)) > 0) {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
schema/schema.go
} namerColumnName := schema.namer.ColumnName(schema.Table, name) if field, ok := schema.FieldsByDBName[namerColumnName]; ok { return field } return nil } // LookUpFieldByBindName looks for the closest field in the embedded struct. // // type Struct struct { // Embedded struct { // ID string // is selected by LookUpFieldByBindName([]string{"Embedded", "ID"}, "ID") // }
Created: Sun Apr 05 09:35:12 GMT 2026 - Last Modified: Sat Mar 21 11:35:55 GMT 2026 - 13.3K bytes - Click Count (0)