- Sort Score
- Num 10 results
- Language All
Results 91 - 100 of 130 for achieves (0.06 seconds)
-
apache-maven/src/main/appended-resources/licenses/Apache-2.0.txt
file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright [yyyy] [name of copyright owner] Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License.Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Tue Jan 28 11:47:17 GMT 2020 - 11.1K bytes - Click Count (0) -
.teamcity/performance-tests-ci.json
} } ] }, { "testId" : "org.gradle.performance.regression.java.JavaIncrementalExecutionPerformanceTest.assemble for non-abi change with file system sensitive archives", "groups" : [ { "testProject" : "largeJavaMultiProject", "coverage" : { "per_commit" : [ "linux", "windows", "macOs" ] } }, {Created: Wed Apr 01 11:36:16 GMT 2026 - Last Modified: Tue Feb 03 21:56:33 GMT 2026 - 32.5K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* request, and ensure that (1/QPS) seconds have elapsed since then. For example, for a rate of * QPS=5 (5 tokens per second), if we ensure that a request isn't granted earlier than 200ms after * the last one, then we achieve the intended rate. If a request comes and the last request was * granted only 100ms ago, then we wait for another 100ms. At this rate, serving 15 fresh permits * (i.e. for an acquire(15) request) naturally takes 3 seconds. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed May 14 19:40:47 GMT 2025 - 19.3K bytes - Click Count (0) -
docs/en/docs/advanced/behind-a-proxy.md
### Providing the `root_path` { #providing-the-root-path } To achieve this, you can use the command line option `--root-path` like: <div class="termy"> ```console $ fastapi run main.py --forwarded-allow-ips="*" --root-path /api/v1Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 15.8K bytes - Click Count (0) -
docs/en/docs/tutorial/sql-databases.md
Don't worry, with the way the code is structured, we'll make sure we use **a single SQLModel *session* per request** later, this is actually what the `check_same_thread` is trying to achieve. ### Create the Tables { #create-the-tables } We then add a function that uses `SQLModel.metadata.create_all(engine)` to **create the tables** for all the *table models*.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sat Mar 07 09:29:03 GMT 2026 - 15.3K bytes - Click Count (0) -
android/guava/src/com/google/common/math/IntMath.java
* </ul> * * <p>Note that if your only goal is to turn a well-distributed {@code int} (such as a random * number or hash code) into a well-distributed nonnegative number, the most even distribution is * achieved not by this method or other absolute value methods, but by {@code x & * Integer.MAX_VALUE}. * * @since 33.5.0 */ public static int saturatedAbs(int x) {Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 26.1K bytes - Click Count (0) -
guava/src/com/google/common/base/Ascii.java
/** * Synchronous Idle: A communication control character used by a synchronous transmission system * in the absence of any other character to provide a signal from which synchronism may be * achieved or retained. * * @since 8.0 */ public static final byte SYN = 22; /** * End of Transmission Block: A communication control character used to indicate the end of a
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 21.7K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/BloomFilter.java
// -log(p) / log(2), ensuring the result is rounded to avoid truncation. return max(1, (int) Math.round(-Math.log(p) / LOG_TWO)); } /** * Computes m (total bits of Bloom filter) which is expected to achieve, for the specified * expected insertions, the required false positive probability. * * <p>See http://en.wikipedia.org/wiki/Bloom_filter#Probability_of_false_positives for the * formula. *
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Tue Mar 10 22:28:12 GMT 2026 - 27.6K bytes - Click Count (0) -
LICENSE
special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free
Created: Sun Apr 05 00:10:12 GMT 2026 - Last Modified: Mon Jan 18 20:25:38 GMT 2016 - 25.8K bytes - Click Count (0) -
LICENSE
How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safestCreated: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Apr 23 18:58:53 GMT 2021 - 33.7K bytes - Click Count (0)