- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 101 for east (0.1 sec)
-
src/crypto/tls/conn.go
} return c.readRecordOrCCS(expectChangeCipherSpec) } // atLeastReader reads from R, stopping with EOF once at least N bytes have been // read. It is different from an io.LimitedReader in that it doesn't cut short // the last Read call, and in that it considers an early EOF an error. type atLeastReader struct { R io.Reader N int64 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 51.8K bytes - Viewed (0) -
staging/src/k8s.io/api/admissionregistration/v1beta1/generated.proto
// Allowed values are "Never" and "IfNeeded". // // Never: the webhook will not be called more than once in a single admission evaluation. // // IfNeeded: the webhook will be called at least one additional time as part of the admission evaluation // if the object being admitted is modified by other admission plugins after the initial webhook call.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 28 15:34:11 UTC 2024 - 50.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Futures.java
* that accepts zero or more arguments, all of type {@code String} or {@code Throwable} * (preferring constructors with at least one {@code String}, then preferring constructors with at * least one {@code Throwable}) and calling the constructor via reflection. If the exception did * not already have a cause, one is set by calling {@link Throwable#initCause(Throwable)} on it.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 59.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/ARM64Ops.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 58.8K bytes - Viewed (0) -
pkg/proxy/endpointschangetracker_test.go
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Dec 21 14:44:08 UTC 2023 - 79.9K bytes - Viewed (0) -
src/runtime/traceback.go
// for the first frame. u.initAt(^uintptr(0), ^uintptr(0), ^uintptr(0), gp, flags) } func (u *unwinder) initAt(pc0, sp0, lr0 uintptr, gp *g, flags unwindFlags) { // Don't call this "g"; it's too easy get "g" and "gp" confused. if ourg := getg(); ourg == gp && ourg == ourg.m.curg { // The starting sp has been passed in as a uintptr, and the caller may // have other uintptr-typed stack references as well.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 55.1K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/Futures.java
* that accepts zero or more arguments, all of type {@code String} or {@code Throwable} * (preferring constructors with at least one {@code String}, then preferring constructors with at * least one {@code Throwable}) and calling the constructor via reflection. If the exception did * not already have a cause, one is set by calling {@link Throwable#initCause(Throwable)} on it.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 64.1K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// Finds a path in `cycles_graph_` from `from` to `to` that is not a direct // edge from `from` to `to`. // // Tries to find a path that contains at least one unclusterable node. std::vector<int> FindAlternatePathForDebugging(int from, int to); // Returns a string representing `cycles_graph_node_id`. If the node is
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
return Iterators.find(unfiltered.iterator(), predicate); } @Override @ParametricNullness public E last() { SortedSet<E> sortedUnfiltered = (SortedSet<E>) unfiltered; while (true) { E element = sortedUnfiltered.last(); if (predicate.apply(element)) { return element; } sortedUnfiltered = sortedUnfiltered.headSet(element);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 77.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* be read without locking. Next fields of nodes are immutable (final). All list additions are * performed at the front of each bin. This makes it easy to check changes, and also fast to * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This * works well for hash tables since the bin lists tend to be short. (The average length is less
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0)