- Sort Score
- Result 10 results
- Languages All
Results 461 - 470 of 511 for utimes (0.04 sec)
-
src/main/webapp/css/font-awesome.min.css
ore{content:"\f2c8"}.fa-think-peaks:before{content:"\f731"}.fa-thumbs-down:before{content:"\f165"}.fa-thumbs-up:before{content:"\f164"}.fa-thumbtack:before{content:"\f08d"}.fa-ticket-alt:before{content:"\f3ff"}.fa-times:before{content:"\f00d"}.fa-times-circle:before{content:"\f057"}.fa-tint:before{content:"\f043"}.fa-tint-slash:before{content:"\f5c7"}.fa-tired:before{content:"\f5c8"}.fa-toggle-off:before{content:"\f204"}.fa-toggle-on:before{content:"\f205"}.fa-toilet:before{content:"\f7d8"}.fa-t...Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (2) -
cmd/data-scanner.go
d.mu.RUnlock() // Don't sleep for really small amount of time wantSleep := time.Duration(float64(base) * factor) if wantSleep <= minWait { return } if maxWait > 0 && wantSleep > maxWait { wantSleep = maxWait } timer := time.NewTimer(wantSleep) select { case <-ctx.Done(): if !timer.Stop() { <-timer.C if d.isScanner {
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 45.5K bytes - Viewed (0) -
src/main/webapp/js/admin/adminlte.min.js.map
$element = $element.parent()\n if ($element[0].nodeName !== 'TR') {\n $element = $element.parent()\n }\n }\n\n const time = 500\n const $type = $element.attr(SELECTOR_ARIA_ATTR)\n const $body = $element.next(SELECTOR_EXPANDABLE_BODY).children().first().children()\n\n $body.stop()\n if ($type === 'true') {\n $body.slideUp(time, () => {\n $element.next(SELECTOR_EXPANDABLE_BODY).addClass('d-none')\n })\n $element.attr(SELECTOR_ARIA_ATTR, 'false')\n...
Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Oct 26 01:49:09 UTC 2024 - 132.4K bytes - Viewed (0) -
cmd/xl-storage.go
} } return err } // readsMetadata and returns disk mTime information for xl.meta func (s *xlStorage) readMetadataWithDMTime(ctx context.Context, itemPath string) ([]byte, time.Time, error) { if contextCanceled(ctx) { return nil, time.Time{}, ctx.Err() } if err := checkPathLength(itemPath); err != nil { return nil, time.Time{}, err } f, err := OpenFile(itemPath, readMode, 0o666)
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 91.7K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.32.md
- Fixed the reporting of elapsed times during evaluation of `ValidatingAdmissionPolicy` decisions and annotations. The apiserver_validating_admission_policy_check_duration metrics will now show elapsed times and no longer be zero. ([#128463](https://github.com/kubernetes/kubernetes/pull/128463), [@knrc](https://github.com/knrc))
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Tue Dec 16 18:27:41 UTC 2025 - 448.1K bytes - Viewed (0) -
android/guava/src/com/google/common/net/MediaType.java
* PLAIN_TEXT_UTF_8.is(ANY_TEXT_TYPE.withCharset(UTF_16)) // false * } * * <p>Note that while it is possible to have the same parameter declared multiple times within a * media type this method does not consider the number of occurrences of a parameter. For example, * {@code "text/plain; charset=UTF-8"} satisfies {@code "text/plain; charset=UTF-8; * charset=UTF-8"}. */
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Oct 02 01:46:40 UTC 2025 - 48K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* * <p>For <i>small</i> immutable sorted maps, the {@code ImmutableSortedMap.of()} methods are even * more convenient. * * <p>Builder instances can be reused - it is safe to call {@link #buildOrThrow} multiple times to * build multiple maps in series. Each map is a superset of the maps created before it. * * @since 2.0 */ public static class Builder<K, V> extends ImmutableMap.Builder<K, V> {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 21:07:18 UTC 2025 - 52.9K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
*/ @GwtIncompatible // TODO public static boolean isPrime(long n) { if (n < 2) { checkNonNegative("n", n); return false; } if (n < 66) { // Encode all primes less than 66 into mask without 0 and 1. long mask = (1L << (2 - 2)) | (1L << (3 - 2)) | (1L << (5 - 2)) | (1L << (7 - 2))
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Nov 03 21:01:09 UTC 2025 - 46.8K bytes - Viewed (0) -
src/main/webapp/css/admin/font-awesome.min.css
ore{content:"\f2c8"}.fa-think-peaks:before{content:"\f731"}.fa-thumbs-down:before{content:"\f165"}.fa-thumbs-up:before{content:"\f164"}.fa-thumbtack:before{content:"\f08d"}.fa-ticket-alt:before{content:"\f3ff"}.fa-times:before{content:"\f00d"}.fa-times-circle:before{content:"\f057"}.fa-tint:before{content:"\f043"}.fa-tint-slash:before{content:"\f5c7"}.fa-tired:before{content:"\f5c8"}.fa-toggle-off:before{content:"\f204"}.fa-toggle-on:before{content:"\f205"}.fa-toilet:before{content:"\f7d8"}.fa-t...Registered: Sat Dec 20 09:19:18 UTC 2025 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
} @Override public int hashCode() { /* * The sum of the sums of the hash codes in each subset is just the sum of * each input element's hash code times the number of sets that element * appears in. Each element appears in exactly half of the 2^n sets, so: */ return inputSet.keySet().hashCode() << (inputSet.size() - 1); } @OverrideRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 81.6K bytes - Viewed (0)