- Sort Score
- Result 10 results
- Languages All
Results 701 - 710 of 913 for least (1.2 sec)
-
src/main/java/org/codelibs/fess/crawler/transformer/AbstractFessFileTransformer.java
} return processFieldConfigs(dataMap, fieldConfigs); } /** * Get the last modified date. * @param dataMap The data map. * @param responseData The response data. * @return The last modified date. */ protected Date getLastModified(final Map<String, Object> dataMap, final ResponseData responseData) {
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 25.6K bytes - Viewed (0) -
tests/hooks_test.go
t.Errorf("invalid price for product #%v, expects: %v, got %v", idx, value, products[idx].Price) } } DB.Model(&products).Update("Name", "product-name") // will set all product's price to last product's price + 10 for idx, value := range []int64{410, 410, 410} { if products[idx].Price != value { t.Errorf("invalid price for product #%v, expects: %v, got %v", idx, value, products[idx].Price) } }
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Mon Jun 17 03:59:06 UTC 2024 - 16.7K bytes - Viewed (0) -
src/test/resources/plugin/repo2/index.html
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Tue Aug 13 07:34:14 UTC 2019 - 10.5K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java
private final char[][] replacements; // The number of elements in the replacement array. private final int replacementsLength; // The first code point in the safe range. private final int safeMin; // The last code point in the safe range. private final int safeMax; // Cropped values used in the fast path range checks. private final char safeMinChar; private final char safeMaxChar; /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Feb 13 15:45:16 UTC 2025 - 8.5K bytes - Viewed (0) -
internal/lru/lru.go
// Next and previous pointers in the doubly-linked list of elements. // To simplify the implementation, internally a list l is implemented // as a ring, such that &l.root is both the next element of the last // list element (l.Back()) and the previous element of the first list // element (l.Front()). next, prev *Entry[K, V] // The list to which this element belongs. list *LruList[K, V]
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Fri Apr 25 08:22:26 UTC 2025 - 12.5K bytes - Viewed (0) -
android/guava/src/com/google/common/net/HttpHeaders.java
/** The HTTP {@code If-Unmodified-Since} header field name. */ public static final String IF_UNMODIFIED_SINCE = "If-Unmodified-Since"; /** The HTTP {@code Last-Event-ID} header field name. */ public static final String LAST_EVENT_ID = "Last-Event-ID"; /** The HTTP {@code Max-Forwards} header field name. */ public static final String MAX_FORWARDS = "Max-Forwards";
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Mar 27 20:37:16 UTC 2025 - 35.4K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/CookieTest.kt
} /** If a cookie incorrectly defines multiple 'Max-Age' attributes, the last one defined wins. */ @Test fun lastMaxAgeWins() { assertThat(parseCookie(0L, url, "a=b; Max-Age=2; Max-Age=4; Max-Age=1; Max-Age=3")!!.expiresAt) .isEqualTo(3000L) } /** If a cookie incorrectly defines multiple 'Expires' attributes, the last one defined wins. */ @Test fun lastExpiresAtWins() { assertThat(
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Wed Mar 19 19:25:20 UTC 2025 - 24.4K bytes - Viewed (0) -
android/guava-testlib/test/com/google/common/collect/testing/IteratorTesterTest.java
* when hasNext() is false, so that next() throws a NoSuchElementException, then subsequent calls * to remove() will incorrectly throw an IllegalStateException, instead of removing the last * element returned. * * <p>See <a href="https://bugs.openjdk.org/browse/JDK-6529795">JDK-6529795</a> */ static class IteratorWithJdkBug6529795<T> implements Iterator<T> { Iterator<T> iterator;
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 18:32:41 UTC 2025 - 10.3K bytes - Viewed (0) -
cmd/metacache-bucket.go
for id, cache := range caches { if _, ok := remove[id]; ok { continue } remainCaches = append(remainCaches, cache) } if len(remainCaches) > metacacheMaxEntries { // Sort oldest last... sort.Slice(remainCaches, func(i, j int) bool { return remainCaches[i].lastHandout.Before(remainCaches[j].lastHandout) }) // Keep first metacacheMaxEntries...
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 6.6K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
return splitDomain(domain).asSequence().drop(firstLabelOffset).joinToString(".") } private fun splitDomain(domain: String): List<String> { val domainLabels = domain.split('.') if (domainLabels.last() == "") { // allow for domain name trailing dot return domainLabels.dropLast(1) } return domainLabels } private fun findMatchingRule(domainLabels: List<String>): List<String> {
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 8.5K bytes - Viewed (0)