- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,127 for equivalentTo (0.15 sec)
-
guava/src/com/google/common/cache/LongAdder.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 15 18:00:07 UTC 2021 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LongAdder.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Jun 15 18:00:07 UTC 2021 - 5.5K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/running-builds/introduction/command_line_interface_basics.adoc
---- gradle [...] --build-cache gradle [...] --no-build-cache ---- Many long-form options have short-option equivalents. The following are equivalent: ---- gradle --help gradle -h ---- == Command-line usage The following sections describe the use of the Gradle command-line interface.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Feb 05 18:33:11 UTC 2024 - 2.7K 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)}. *
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)}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 8.8K bytes - Viewed (0) -
docs/fr/docs/benchmarks.md
## Tests de performance et rapidité Lorsque vous vérifiez les tests de performance, il est commun de voir plusieurs outils de différents types comparés comme équivalents. En particulier, on voit Uvicorn, Starlette et FastAPI comparés (parmi de nombreux autres outils).
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Jul 27 18:49:56 UTC 2023 - 3.9K bytes - Viewed (0) -
src/image/color/ycbcr.go
// to 257*Y', which ranges over [0, 1<<16-1] as Y' ranges over [0, 255]. // YY1 is then defined as: // YY1 = 65536*Y' + 257*Y' // or equivalently: // YY1 = Y' * 0x10101 yy1 := int32(y) * 0x10101 cb1 := int32(cb) - 128 cr1 := int32(cr) - 128 // The bit twiddling below is equivalent to // // r := (yy1 + 91881*cr1) >> 16 // if r < 0 { // r = 0 // } else if r > 0xff { // r = ^int32(0) // }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 10.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Splitter.java
return new Splitter(strategy, omitEmptyStrings, trimmer, maxItems); } /** * Returns a splitter that behaves equivalently to {@code this} splitter, but automatically * removes leading and trailing {@linkplain CharMatcher#whitespace whitespace} from each returned * substring; equivalent to {@code trimResults(CharMatcher.whitespace())}. For example, {@code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Feb 09 15:49:48 UTC 2024 - 23.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.java
* @since 24.0 */ @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)}. *
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
* @since 24.0 */ @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)}. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 13.6K bytes - Viewed (0)