- Sort Score
- Num 10 results
- Language All
Results 41 - 50 of 63 for answered (0.06 seconds)
-
src/test/java/jcifs/dcerpc/msrpc/LsaPolicyHandleTest.java
@Mock private DcerpcHandle mockDcerpcHandle; // Mocking MsrpcLsarOpenPolicy2 and MsrpcLsarClose is tricky because they are created inside the constructor/method. // We need to use ArgumentCaptor or a custom Answer to control their behavior. // For now, let's assume we can mock their behavior through the sendrecv method of DcerpcHandle. @BeforeEach void setUp() {Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 8.9K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/AbstractStreamingHasherTest.java
} /** * This test creates a long random sequence of inputs, then a lot of differently configured sinks * process it; all should produce the same answer, the only difference should be the number of * process()/processRemaining() invocations, due to alignment. */ @AndroidIncompatible // slow. TODO(cpovirk): Maybe just reduce iterations under Android.
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 8.6K bytes - Click Count (0) -
CONTRIBUTING.md
For any non-trivial change, we need to be able to answer these questions: * Why is this change done? What's the use case? * For user-facing features, what will the API look like? * What test cases should it have? What could go wrong? * How will it roughly be implemented? We'll happily provide code pointers to save you time.
Created: Wed Dec 31 11:36:14 GMT 2025 - Last Modified: Tue Nov 25 06:57:22 GMT 2025 - 19K bytes - Click Count (0) -
src/test/java/jcifs/smb/DirFileEntryEnumIterator1Test.java
batches.add(new String[] { "c" }); // second batch batches.add(new String[] {}); // last -> NO_MORE_FILES // send() answer that mutates the provided response when(tree.send(any(Trans2FindFirst2.class), any(Trans2FindFirst2Response.class))).thenAnswer((InvocationOnMock inv) -> { Trans2FindFirst2Response resp = inv.getArgument(1);
Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Thu Aug 14 05:31:44 GMT 2025 - 12.7K bytes - Click Count (0) -
docs/es/docs/help-fastapi.md
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 10:15:01 GMT 2025 - 14.8K bytes - Click Count (0) -
docs/pt/docs/help-fastapi.md
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Nov 12 16:23:57 GMT 2025 - 15.1K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/AbstractService.java
} }); } /** * An immutable snapshot of the current state of the service. This class represents a consistent * snapshot of the state and therefore it can be used to answer simple queries without needing to * grab a lock. */ // @Immutable except that Throwable is mutable (initCause(), setStackTrace(), mutable subclasses). private static final class StateSnapshot { /**Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Feb 19 21:24:11 GMT 2025 - 20.7K bytes - Click Count (0) -
docs/de/docs/help-fastapi.md
* <a href="https://github.com/fastapi/fastapi/issues?q=is%3Aissue+is%3Aopen+sort%3Aupdated-desc+label%3Aquestion+-label%3Aanswered+" class="external-link" target="_blank">GitHub-Issues</a> In vielen Fällen kennen Sie möglicherweise bereits die Antwort auf diese Fragen. 🤓
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Sat Sep 20 15:10:09 GMT 2025 - 16.2K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* We already know how much time it takes to serve 3 fresh permits: if the rate is * "1 token per second", then this will take 3 seconds. But what does it mean to serve 7 stored * permits? As explained above, there is no unique answer. If we are primarily interested to deal * with underutilization, then we want stored permits to be given out /faster/ than fresh ones, * because underutilization = free resources for the taking. If we are primarily interested to
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 19.3K bytes - Click Count (0) -
android/guava-tests/test/com/google/common/collect/OrderingTest.java
} Ordering<Object> arbitrary = Ordering.arbitrary(); sort(list, arbitrary); // Now we don't care what order it's put the list in, only that // comparing any pair of elements gives the answer we expect. testComparator(arbitrary, list); assertEquals("Ordering.arbitrary()", arbitrary.toString()); } @J2ktIncompatible // ArbitraryOrdering public void testArbitrary_withCollisions() {Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Oct 10 23:13:45 GMT 2025 - 42.8K bytes - Click Count (0)