- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 157 for whereas (0.18 sec)
-
tensorflow/compiler/jit/deadness_analysis.cc
// instances, i.e., it ensures there at most one instance of Not(predicate) // for any given predicate whereas `make_not_predicate_cache_` simply caches // the result of the `MakeNotPredicate` function. The values in // `interned_not_instances_` are always instance of `NotPredicate` whereas the // values in `make_not_predicate_cache_` may not be (for instance it will map // Not(Not(A)) to A).
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
tensorflow/compiler/jit/encapsulate_subgraphs_pass.cc
Node* call_node_; // Maps from source (producer node/slot) and destination // (consumer node/slot) tensors in the input graph to _Arg numbers in // the subgraph. The source map is one-to-one, whereas the dest map may be // many-to-one. absl::flat_hash_map<OutputTensor, int, OutputTensor::Hash> args_by_src_; absl::flat_hash_map<InputTensor, int, InputTensor::Hash> args_by_dst_;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 08:47:20 UTC 2024 - 51K bytes - Viewed (0) -
src/runtime/mprof.go
// If len(p) < n, MemProfile does not change p and returns n, false. // // If inuseZero is true, the profile includes allocation records // where r.AllocBytes > 0 but r.AllocBytes == r.FreeBytes. // These are sites where memory was allocated, but it has all // been released back to the runtime. // // The returned profile may be up to two garbage collection cycles old.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
src/net/http/request.go
// call from salvaging an invalid IDN, when possible. As a result it may be // possible to have two IDNs that appear identical to the user where the // ASCII-only version causes an error downstream whereas the non-ASCII // version does not. // Note that for correct ASCII IDNs ToASCII will only do considerably more // work, but it will not cause an allocation. if ascii.Is(v) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 49.4K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// important edges then make decisions on all other edges, causing the highest // chance of all most important edges to be contracted. // // An example of where this might occur is with a digraph: // {A -> B, B -> C, A -> X, X -> C} where B is a Size operation and X is // not-compilable. In this case, the valid clusterings are {A,B} or {B,C}. B // should be clustered with A because it will prevent a potentially large
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/incremental_build.adoc
include::{snippetsPath}/tasks/incrementalBuild-incrementalBuildAdvanced/tests/incrementalBuildInputFilesConfigUsingTask.out[] ---- ==== Remember that `files()`, `layout.files()` and `objects.fileCollection()` can take tasks as arguments, whereas `fileTree()` cannot.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Jan 24 23:14:04 UTC 2024 - 63.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* href="http://goo.gl/iz2Wi">"diamond" syntax</a>. One caveat to this is that the {@code TreeSet} * constructor uses a null {@code Comparator} to mean "natural ordering," whereas this factory * rejects null. Clean your code accordingly. * * @param comparator the comparator to use to sort the set * @return a new, empty {@code TreeSet}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 77.3K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/releases/upgrading/upgrading_version_4.adoc
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Feb 22 03:01:48 UTC 2024 - 60.1K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbFile.java
* character matches any number of characters in part of a name. If * the expression begins with one or more '?'s then exactly that * many characters will be matched whereas if it ends with '?'s * it will match that many characters <i>or less</i>. * <p> * Wildcard expressions will not filter workgroup names or server names. * * <blockquote> *
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Thu May 23 01:50:13 UTC 2024 - 82.3K bytes - Viewed (1) -
CHANGELOG/CHANGELOG-1.31.md
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 20:34:14 UTC 2024 - 60.3K bytes - Viewed (0)