- Sort Score
- Num 10 results
- Language All
Results 211 - 220 of 494 for exactly (0.05 seconds)
-
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvn/MavenInvoker.java
* * @param mavenProjects Maven projects which are part of build execution. * @param firstFailedProject The first project which has failed. * @return Value for -rf flag to resume build exactly from place where it failed ({@code :artifactId} in general * and {@code groupId:artifactId} when there is a name clash). */Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Thu Sep 11 17:20:46 GMT 2025 - 28.2K bytes - Click Count (0) -
android/guava/src/com/google/common/primitives/Booleans.java
* {@code array}, or {@code -1} if there is no such occurrence. * * <p>More formally, returns the lowest index {@code i} such that {@code Arrays.copyOfRange(array, * i, i + target.length)} contains exactly the same elements as {@code target}. * * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Sep 25 15:01:23 GMT 2025 - 20.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
} public void testScale_indexes_largeVarargs_compute_doubleCollection() { int scale = Integer.MAX_VALUE; int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part // (1-5/Integer.MAX_VALUE).
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 05:21:26 GMT 2026 - 29.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/math/QuantilesTest.java
} public void testScale_indexes_largeVarargs_compute_doubleCollection() { int scale = Integer.MAX_VALUE; int otherIndex = (Integer.MAX_VALUE - 1) / 3; // this divides exactly // For the otherIndex calculation, we have q=Integer.MAX_VALUE, k=(Integer.MAX_VALUE-1)/3, and // N=16. Therefore k*(N-1)/q = 5-5/Integer.MAX_VALUE, which has floor 4 and fractional part // (1-5/Integer.MAX_VALUE).
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 03 05:21:26 GMT 2026 - 29.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
*/ interface Trusted<V extends @Nullable Object> extends ListenableFuture<V> {} /** * A less abstract subclass of AbstractFuture. This can be used to optimize setFuture by ensuring * that {@link #get} calls exactly the implementation of {@link AbstractFuture#get}. */ abstract static class TrustedFuture<V extends @Nullable Object> extends AbstractFuture<V> implements Trusted<V> { @CanIgnoreReturnValue @Override
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sat Mar 07 14:39:00 GMT 2026 - 43.6K bytes - Click Count (0) -
src/test/java/jcifs/internal/smb2/io/Smb2WriteRequestTest.java
} @Test @DisplayName("Should handle boundary conditions") void testBoundaryConditions() { // Test with exactly aligned data request.setData(new byte[8], 0, 8); // 8-byte aligned assertEquals(((Smb2Constants.SMB2_HEADER_LENGTH + 48 + 8 + 7) / 8) * 8, request.size()); // Test with unaligned dataCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 22.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/Queues.java
added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e; // written exactly once, by a successful (uninterrupted) invocation of #poll while (true) { try { e = q.poll(deadline - System.nanoTime(), NANOSECONDS); break;
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 23 19:19:10 GMT 2026 - 18K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/goals/InferenceStrategy.java
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Nov 18 18:03:26 GMT 2025 - 27.6K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
Alice had no idea what to do, and in despair she put her hand in her pocket, and pulled out a box of comfits, (luckily the salt water had not got into it), and handed them round as prizes. There was exactly one a-piece all round. `But she must have a prize herself, you know,' said the Mouse. `Of course,' the Dodo replied very gravely. `What else have you got in your pocket?' he went on, turning to Alice.
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Click Count (0) -
src/test/java/jcifs/internal/fscc/FileFsSizeInformationTest.java
// When int bytesConsumed = fileFsSizeInfo.decode(buffer, 0, buffer.length); // Then assertEquals(24, bytesConsumed); // Should always consume exactly 24 bytes } @Test @DisplayName("Should decode from middle of buffer correctly") void shouldDecodeFromMiddleOfBuffer() throws SMBProtocolDecodingException { // GivenCreated: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 25.9K bytes - Click Count (0)