- Sort Score
- Num 10 results
- Language All
Results 11 - 20 of 67 for mycomputer (0.07 seconds)
-
src/main/java/jcifs/internal/witness/WitnessRegisterMessage.java
} /** * Sets the client computer name. * * @param clientComputerName the client computer name */ public void setClientComputerName(String clientComputerName) { this.clientComputerName = clientComputerName; } /** * Gets the client computer name. * * @return the client computer name */ public String getClientComputerName() {Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 23 09:06:40 GMT 2025 - 8.6K bytes - Click Count (0) -
src/test/java/jcifs/netbios/NodeStatusResponseTest.java
addressArrayField.setAccessible(true); NbtAddress[] addresses = (NbtAddress[]) addressArrayField.get(response); // The name should be trimmed to "COMPUTER" without trailing spaces assertEquals("COMPUTER", addresses[0].hostName.name); } @Test void toString_shouldReturnFormattedString() { String result = response.toString(); assertNotNull(result);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 07:14:38 GMT 2025 - 19.3K bytes - Click Count (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; } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 25.1K bytes - Click Count (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; } /**Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 19.3K bytes - Click Count (0) -
.mailmap
Etienne Studer <******@****.***> <******@****.***> Etienne Studer <******@****.***> <******@****.***> Etienne Studer <******@****.***> <log> Gary Hale <******@****.***> <ghhale@computer.org> Hans Dockter <******@****.***> Hans Dockter <******@****.***> <******@****.***> Hans Dockter <******@****.***> <******@****.***> Hans Dockter <******@****.***> <******@****.***>
Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Tue Oct 03 06:34:28 GMT 2017 - 3.3K bytes - Click Count (0) -
docs/de/docs/async.md
Asynchroner Code bedeutet lediglich, dass die Sprache 💬 eine Möglichkeit hat, dem Computer / Programm 🤖 mitzuteilen, dass es 🤖 an einem bestimmten Punkt im Code darauf warten muss, dass *etwas anderes* irgendwo anders fertig wird. Nehmen wir an, *etwas anderes* ist hier „Langsam-Datei“ 📝. Während der Zeit, die „Langsam-Datei“ 📝 benötigt, kann das System also andere Aufgaben erledigen.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 19 17:58:09 GMT 2026 - 27.3K bytes - Click Count (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. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Aug 09 01:14:59 GMT 2025 - 22.6K bytes - Click Count (0) -
compat/maven-model/src/test/java/org/apache/maven/model/merge/MavenMergerTest.java
import static org.junit.jupiter.api.Assertions.assertEquals; import static org.junit.jupiter.api.Assertions.assertTrue; /** * MavenMerger is based on same instances, subclasses should override KeyComputer per type */ class MavenMergerTest { private MavenMerger mavenMerger = new MavenMerger(); @Test void mergeArtifactId() { Model target = Model.newBuilder().artifactId("TARGET").build();Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Wed Sep 17 10:01:14 GMT 2025 - 3.6K bytes - Click Count (0) -
LICENSE
infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying.
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (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 softwareCreated: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri May 17 19:14:22 GMT 2024 - 38.5K bytes - Click Count (0)