- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 53 for art (0.07 sec)
-
.github/PULL_REQUEST_TEMPLATE
+ No trailing period + Keep the title as short as possible. ideally under 76 characters or shorter + No Markdown + The first PR comment (this one) is wrapped at 76 characters, unless it's really needed (ASCII art, table, or long link) + If there is a corresponding issue, add either `Fixes #1234` or `Updates #1234` (the latter if this is not a complete fix) to this comment + If referring to a repo other than `golang/go` you can use the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 02:07:46 UTC 2018 - 1.2K bytes - Viewed (0) -
docs/de/docs/deployment/index.md
Ich zeige Ihnen einige der wichtigsten Konzepte, die Sie beim Deployment einer **FastAPI**-Anwendung wahrscheinlich berücksichtigen sollten (obwohl das meiste davon auch für jede andere Art von Webanwendung gilt).
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Sat Mar 30 20:16:56 UTC 2024 - 1.4K bytes - Viewed (0) -
maven-compat/src/test/java/org/apache/maven/repository/legacy/DefaultWagonManagerTest.java
Artifact artifact = new DefaultArtifact( "sample.group", "sample-art", VersionRange.createFromVersion("1.0"), "scope", "jar", "classifier", null); artifact.setFile(getTestFile("target/sample-art")); StringWagon wagon = (StringWagon) wagonManager.getWagon("string");
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Apr 25 05:46:50 UTC 2024 - 13.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Stats.java
double mean = values.next().doubleValue(); while (values.hasNext()) { double value = values.next().doubleValue(); count++; if (isFinite(value) && isFinite(mean)) { // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (value - mean) / count; } else { mean = calculateNewMeanNonFinite(mean, value); } } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 22K bytes - Viewed (0) -
guava/src/com/google/common/math/Stats.java
double mean = values.next().doubleValue(); while (values.hasNext()) { double value = values.next().doubleValue(); count++; if (isFinite(value) && isFinite(mean)) { // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (value - mean) / count; } else { mean = calculateNewMeanNonFinite(mean, value); } } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 15 16:12:13 UTC 2024 - 24.7K bytes - Viewed (0) -
subprojects/diagnostics/src/main/java/org/gradle/api/tasks/diagnostics/internal/configurations/renderer/ConsoleConfigurationReportRenderer.java
private void writeArtifacts(List<ReportArtifact> artifacts) { if (!artifacts.isEmpty()) { printSection("Artifacts", () -> { artifacts.forEach(art -> { indent(true); writeArtifact(art); newLine(); }); }); } } private void writeArtifact(ReportArtifact artifact) {
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Dec 12 16:17:12 UTC 2022 - 18.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
long count = 1; double mean = checkFinite(values[0]); for (int index = 1; index < values.length; ++index) { checkFinite(values[index]); count++; // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (values[index] - mean) / count; } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/DoubleMath.java
long count = 1; double mean = checkFinite(values[0]); for (int index = 1; index < values.length; ++index) { checkFinite(values[index]); count++; // Art of Computer Programming vol. 2, Knuth, 4.2.2, (15) mean += (values[index] - mean) / count; } return mean; } /**
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 23.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 22.8K bytes - Viewed (0)