- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 158 for calculations (0.14 seconds)
-
android/guava/src/com/google/common/math/DoubleMath.java
checkArgument(x > 0.0 && isFinite(x), "x must be positive and finite"); int exponent = getExponent(x); if (!isNormal(x)) { return log2(x * IMPLICIT_BIT, mode) - SIGNIFICAND_BITS; // Do the calculation on a normal value. } // x is positive, finite, and normal boolean increment; switch (mode) { case UNNECESSARY: checkRoundingUnnecessary(isPowerOfTwo(x)); // fall through
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) -
src/test/java/jcifs/netbios/NameTest.java
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 19.4K bytes - Click Count (0) -
src/main/java/jcifs/util/SmbCircuitBreaker.java
if (maxResponseTime.compareAndSet(currentMax, responseTimeMs)) { break; } currentMax = maxResponseTime.get(); } // Add to history for percentile calculation responseTimeHistory.addLast(responseTimeMs); if (responseTimeHistory.size() > 1000) { // Keep last 1000 measurements responseTimeHistory.removeFirst(); }
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 33.4K bytes - Click Count (0) -
cmd/config-current.go
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 28.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/info/Smb2QueryInfoResponseTest.java
assertArrayEquals(bufferCopy, buffer, "Buffer content should not be modified"); } @Test @DisplayName("Test readBytesWireFormat with offset calculation") void testReadBytesWireFormatOffsetCalculation() throws Exception { response = new Smb2QueryInfoResponse(mockConfig, Smb2Constants.SMB2_0_INFO_FILE, FileInformation.FILE_INTERNAL_INFO);
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 24.5K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb1/net/NetServerEnum2ResponseTest.java
} @Test @DisplayName("Test readDataWireFormat with converter offset") void testReadDataWireFormatWithConverter() throws Exception { // Set converter to test offset calculation int converterValue = 100; setConverter(response, converterValue); setNumEntries(response, 1); String serverName = "TEST"; String comment = "Test comment";Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 25.4K bytes - Click Count (0) -
compat/maven-plugin-api/src/main/java/org/apache/maven/plugin/descriptor/MojoDescriptor.java
} /** * Gets the scope of (transitive) dependencies that should be collected. Dependency collection refers to the process * of calculating the complete dependency tree in terms of artifact coordinates. In contrast to dependency * resolution, this does not include the download of the files for the dependency artifacts. It is meant for mojosCreated: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 21.7K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/ServerMessageBlock2Test.java
assertEquals(0, testMessage.getSessionId()); assertEquals(0, testMessage.getTreeId()); } } @Nested @DisplayName("Size Calculation Tests") class SizeCalculationTests { @Test @DisplayName("Should calculate size8 without alignment") void testSize8NoAlignment() {
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 39.5K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
AbstractFuture<Object> testFuture = new AbstractFuture<Object>() { @Override public String pendingToString() { // Complete ourselves during the toString calculation this.set(true); return "cause=[Because this test isn't done]"; } }; assertThat(testFuture.toString())
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 22:45:21 GMT 2026 - 45.2K bytes - Click Count (0) -
guava/src/com/google/common/collect/Collections2.java
calculateNextPermutation(); return next; } void calculateNextPermutation() { j = list.size() - 1; int s = 0; // Handle the special case of an empty list. Skip the calculation of the // next permutation. if (j == -1) { return; } while (true) { int q = c[j] + o[j]; if (q < 0) { switchDirection();
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Mar 08 16:16:42 GMT 2026 - 23K bytes - Click Count (0)