- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 787 for iterations (0.45 sec)
-
src/runtime/coro.go
// It is important not to add more atomic operations or other // expensive operations to the fast path. func coroswitch_m(gp *g) { c := gp.coroarg gp.coroarg = nil exit := gp.coroexit gp.coroexit = false mp := gp.m // Track and validate thread-lock interactions. // // The rules with thread-lock interactions are simple. When a coro goroutine is switched to,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:09:18 UTC 2024 - 7.4K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
* variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i> * possible sequences of these operations, up to a given number of steps. So, if the caller * specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are actually performed. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 4.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/IteratorTester.java
* variety of sequences of the {@link Iterator#next}, {@link Iterator#hasNext} and {@link * Iterator#remove} operations. This utility takes the brute-force approach of trying <i>all</i> * possible sequences of these operations, up to a given number of steps. So, if the caller * specifies to use <i>n</i> steps, a total of <i>3^n</i> tests are actually performed. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 21 16:49:06 UTC 2024 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeTraverser.java
* That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration * is in progress or when the iterators generated by {@link #children} are advanced. * * @deprecated Use {@link com.google.common.graph.Traverser#depthFirstPreOrder} instead, which has * the same behavior. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/TreeTraverser.java
* That is, each node's subtrees are traversed after the node itself is returned. * * <p>No guarantees are made about the behavior of the traversal when nodes change while iteration * is in progress or when the iterators generated by {@link #children} are advanced. * * @deprecated Use {@link com.google.common.graph.Traverser#depthFirstPreOrder} instead, which has * the same behavior. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.8K bytes - Viewed (0) -
platforms/core-runtime/base-services/src/main/java/org/gradle/api/specs/CompositeSpec.java
this.specs = uncheckedCast(Iterators.toArray(iterator, Spec.class)); } } } @SuppressWarnings({"unchecked", "TypeParameterUnusedInFormals"}) static <T> T uncheckedCast(Object object) { return (T) object; } // Not public. Evaluation of these specs is a major hot spot for large builds, so use an array for iteration Spec<? super T>[] getSpecsArray() {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed May 29 06:47:40 UTC 2024 - 3.1K bytes - Viewed (0) -
tensorflow/compiler/jit/device_util.h
// Picks the device for which XLA should compile a cluster that contains // operations placed in devices in `devices`. For instance a cluster that // contains operations solely placed on the CPU will be compiled into a CPU // executable by XLA, whereas a cluster that contains operations placed on the // CPU and also operations placed on the GPU will be compiled into a GPU // executable. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 15 17:18:31 UTC 2024 - 7.1K bytes - Viewed (0) -
guava/src/com/google/common/graph/AbstractBaseGraph.java
if (graph.isDirected()) { return Iterators.unmodifiableIterator( Iterators.concat( Iterators.transform( graph.predecessors(node).iterator(), (N predecessor) -> EndpointPair.ordered(predecessor, node)), Iterators.transform(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
if (graph.isDirected()) { return Iterators.unmodifiableIterator( Iterators.concat( Iterators.transform( graph.predecessors(node).iterator(), (N predecessor) -> EndpointPair.ordered(predecessor, node)), Iterators.transform(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 7.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
/** * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that * matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Feb 05 21:38:59 UTC 2024 - 9.7K bytes - Viewed (0)