- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 461 for computer (0.17 sec)
-
docs/en/docs/async.md
Asynchronous code just means that the language 💬 has a way to tell the computer / program 🤖 that at some point in the code, it 🤖 will have to wait for *something else* to finish somewhere else. Let's say that *something else* is called "slow-file" 📝. So, during that time, the computer can go and do some other work, while "slow-file" 📝 finishes.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Aug 28 23:33:37 UTC 2024 - 23.5K 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: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 23 16:45:30 UTC 2024 - 24.9K 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: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 22.8K bytes - Viewed (0) -
guava/src/com/google/common/math/PairedStatsAccumulator.java
private double sumOfProductsOfDeltas = 0.0; /** Adds the given pair of values to the dataset. */ public void add(double x, double y) { // We extend the recursive expression for the one-variable case at Art of Computer Programming // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i. // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 10.3K bytes - Viewed (0) -
apache-maven/src/main/appended-resources/licenses/CDDL+GPLv2-with-classpath-exception.txt
of computer software code that is originally released under this License. 1.11. "Patent Claims" means any patent claim(s), now owned or hereafter acquired, including without limitation, method, process, and apparatus claims, in any patent Licensable by grantor. 1.12. "Source Code" means (a) the common form of computer software
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri May 17 19:14:22 UTC 2024 - 38.5K bytes - Viewed (0) -
docs/de/docs/deployment/manually.md
## Servermaschine und Serverprogramm Bei den Benennungen gibt es ein kleines Detail, das Sie beachten sollten. 💡 Das Wort „**Server**“ bezieht sich häufig sowohl auf den entfernten-/Cloud-Computer (die physische oder virtuelle Maschine) als auch auf das Programm, das auf dieser Maschine ausgeführt wird (z. B. Uvicorn).
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Tue Aug 06 04:48:30 UTC 2024 - 5.3K 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: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 18 20:24:49 UTC 2024 - 23.1K bytes - Viewed (0) -
docs/en/docs/virtual-environments.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sat Aug 24 03:16:23 UTC 2024 - 21.7K bytes - Viewed (0) -
api/maven-api-toolchain/src/main/mdo/toolchains.mdo
<p>The <a href="/plugins/maven-toolchains-plugin/">toolchains-plugin</a> can read available toolchains on the user's computer and match them against the toolchain requirements of the project (as configured in {@code pom.xml}): if match is found, the toolchain instance is made available to other Maven plugins.</p>
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Thu Aug 22 14:47:43 UTC 2024 - 9.7K bytes - Viewed (0) -
LICENSES/third_party/forked/cgroups/LICENSE
result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages.
Registered: Fri Nov 01 09:05:11 UTC 2024 - Last Modified: Thu Oct 31 17:42:39 UTC 2024 - 11.1K bytes - Viewed (0)