- Sort Score
- Result 10 results
- Languages All
Results 481 - 490 of 1,197 for needs (0.05 sec)
-
compat/maven-compat/src/test/projects/project-dependencies-resolver/it0063/jdk/jre/placeholder.txt
need it so that empty directory does not get deleted...
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 53 bytes - Viewed (0) -
src/main/resources/fess_indices/fess/nl/stopwords.txt
waren veel meer doen toen moet ben zonder kan hun dus alles onder ja eens hier wie werd altijd doch wordt wezen kunnen ons zelf tegen na reeds wil kon niets uw iemand geweest
Registered: Thu Oct 31 13:40:30 UTC 2024 - Last Modified: Mon Nov 27 12:59:36 UTC 2023 - 592 bytes - Viewed (0) -
src/test/java/jcifs/tests/KerberosTest.java
long start = System.currentTimeMillis() / 1000 * 1000; // this is not too great as it depends on timing/clockskew // first we need to obtain a ticket, therefor need valid credentials // then we need to wait until the ticket is expired int wait = 10 * 1000; long princExp = start + ( wait / 2 );
Registered: Sun Nov 03 00:10:13 UTC 2024 - Last Modified: Sun Mar 01 09:46:04 UTC 2020 - 11.5K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/concurrent/TaskRunner.kt
private var coordinatorWakeUpAt = 0L /** * When we need a new thread to run tasks, we call [Backend.execute]. A few microseconds later we * expect a newly-started thread to call [Runnable.run]. We shouldn't request new threads until * the already-requested ones are in service, otherwise we might create more threads than we need. *
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Apr 29 00:33:04 UTC 2024 - 10.6K bytes - Viewed (0) -
guava/src/com/google/common/graph/SuccessorsFunction.java
* href="https://en.wikipedia.org/wiki/Graph_(discrete_mathematics)">graph</a>-structured data. * * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * <pre>{@code
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 26 17:43:39 UTC 2021 - 4.3K bytes - Viewed (0) -
compat/maven-model-builder/src/main/java/org/apache/maven/model/building/DefaultModelProblem.java
* @param columnNumber The one-based index of the column containing the error or {@code -1} if unknown. * @param exception The exception that caused this problem, may be {@code null}. */ // mkleint: does this need to be public? public DefaultModelProblem( String message, Severity severity, Version version, Model source, int lineNumber, int columnNumber,
Registered: Sun Nov 03 03:35:11 UTC 2024 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 5.7K bytes - Viewed (0) -
docs/en/docs/reference/openapi/index.md
# OpenAPI There are several utilities to handle OpenAPI.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Oct 18 12:36:40 UTC 2023 - 158 bytes - Viewed (0) -
docs/en/docs/advanced/dataclasses.md
This works the same way as with Pydantic models. And it is actually achieved in the same way underneath, using Pydantic. /// info Keep in mind that dataclasses can't do everything Pydantic models can do. So, you might still need to use Pydantic models. But if you have a bunch of dataclasses laying around, this is a nice trick to use them to power a web API using FastAPI. 🤓 /// ## Dataclasses in `response_model`
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Oct 28 10:35:06 UTC 2024 - 4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/io/ByteSourceAsCharSourceReadBenchmark.java
// it is kind of lame that we need to construct a decoder to access this value. // if this is a concern we could add special cases for some known charsets (like utf8) // or we could avoid inputstreamreader and use the decoder api directly // TODO(lukes): in a real implementation we would need to handle overflow conditions
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
// exponent == floor(log2(abs(x))) if (exponent < Long.SIZE - 1) { return x.longValue(); } else if (exponent > MAX_EXPONENT) { return x.signum() * POSITIVE_INFINITY; } /* * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make rounding * easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us round up or
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 5.1K bytes - Viewed (0)