- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 66 for touchMem (0.17 sec)
-
tensorflow/c/env.h
TF_Status* status); // Obtains statistics for the given path. If status is TF_OK, *stats is // updated, otherwise it is not touched. TF_CAPI_EXPORT extern void TF_FileStat(const char* filename, TF_FileStatistics* stats, TF_Status* status);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Jan 09 02:53:27 UTC 2021 - 9.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* @since 24.0 */ Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
guava/src/com/google/common/graph/BaseGraph.java
* @since 24.0 */ Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
internal/s3select/csv/reader.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Feb 22 06:26:06 UTC 2024 - 8.9K bytes - Viewed (0) -
src/net/http/cgi/host.go
} if statusCode == 0 { statusCode = http.StatusOK } // Copy headers to rw's headers, after we've decided not to // go into handleInternalRedirect, which won't want its rw // headers to have been touched. for k, vv := range headers { for _, v := range vv { rw.Header().Add(k, v) } } rw.WriteHeader(statusCode) _, err = io.Copy(rw, linebody) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 20:46:32 UTC 2024 - 10.4K bytes - Viewed (0) -
pkg/istio-agent/agent_test.go
}) sds := a.Check(t, security.WorkloadKeyCertResourceName, security.RootCertReqResourceName) // Ensure we output the certs checkCertsWritten(t, dir) // The provisioning certificates should not be touched go sds[security.WorkloadKeyCertResourceName].DrainResponses() expectFileChanged(t, filepath.Join(dir, "cert-chain.pem"), filepath.Join(dir, "key.pem")) })
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu May 16 22:12:28 UTC 2024 - 33.4K bytes - Viewed (0) -
platforms/core-configuration/kotlin-dsl/src/integTest/kotlin/org/gradle/kotlin/dsl/compile/BuildScriptCompileAvoidanceIntegrationTest.kt
@Test @UnsupportedWithConfigurationCache(because = "test rely on configuration phase output") fun `avoids buildscript recompilation when jar that can not be used for compile avoidance initially on buildsript classpath is touched`() { val (className, jarPath) = buildKotlinJarForBuildScriptClasspath( """ inline fun foo() { val sum: (Int, Int) -> Int = { x, y -> x + y }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sun Sep 24 17:45:42 UTC 2023 - 19.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
*/ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graph.java
*/ @Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0) -
src/image/draw/draw_test.go
// is only 1x2. The Draw call should affect dst's pixels at (1, 10) and (2, // 10) but the pixel at (0, 10) should be untouched. // // The src image is entirely transparent (and the Draw operator is Src) so // the two touched pixels should be set to transparent colors. // // In general, Go's color.Color type (and specifically the Color.RGBA // method) works in premultiplied alpha, where there's no difference
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 18:07:05 UTC 2023 - 26K bytes - Viewed (0)