- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 1,255 for iterations (0.15 sec)
-
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) -
android/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.5K bytes - Viewed (0) -
docs/en/docs/how-to/graphql.md
# GraphQL As **FastAPI** is based on the **ASGI** standard, it's very easy to integrate any **GraphQL** library also compatible with ASGI. You can combine normal FastAPI *path operations* with GraphQL on the same application. !!! tip **GraphQL** solves some very specific use cases. It has **advantages** and **disadvantages** when compared to common **web APIs**.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Aug 19 19:54:04 UTC 2023 - 3.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/pin_ops_with_side_effects.cc
}).wasInterrupted()) { fn.emitOpError("Can't have control ops in this pass."); signalPassFailure(); } llvm::SmallVector<Operation *, 4> ops_with_side_effects; // We're iterating over all operations at the top block level, excluding // the return operation (which otherwise would be recognized as being // susceptible to side effects when returning a resource variable.)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 7K bytes - Viewed (0) -
src/iter/iter.go
// Copyright 2023 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Package iter provides basic definitions and operations // related to iteration in Go. package iter import ( "internal/race" "runtime" "unsafe" ) // Seq is an iterator over sequences of individual values.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:09:28 UTC 2024 - 6.6K bytes - Viewed (0) -
src/runtime/tracemap.go
// - No deletion or rebalancing. // - Intentionally devolves into a linked list on hash collisions (the hash bits will all // get shifted out during iteration, and new nodes will just be appended to the 0th child). type traceMapNode struct { _ sys.NotInHeap children [4]atomic.UnsafePointer // *traceMapNode (can't use generics because it's notinheap) hash uintptr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:03:35 UTC 2024 - 4.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
/** * CompactLinkedHashMap is an implementation of a Map with insertion or LRU iteration order, * maintained with a doubly linked list through the entries. All optional operations (put and * remove) are supported. Null keys and values are supported. * * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and * amortized) constant time operations. Expected in the hashtable sense (depends on the hash
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0)