- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 559 for takes (0.02 sec)
-
guava/src/com/google/common/collect/HashBasedTable.java
* a {@code Map<R, Map<C, V>>}. A method call like {@code column(columnKey).get(rowKey)} still runs * quickly, since the row key is provided. However, {@code column(columnKey).size()} takes longer, * since an iteration across all row keys occurs. * * <p>Note that this implementation is not synchronized. If multiple threads access this table
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 4.1K bytes - Viewed (0) -
guava/src/com/google/common/hash/Fingerprint2011.java
/** * Implementation of Geoff Pike's fingerprint2011 hash function. See {@link Hashing#fingerprint2011} * for information on the behaviour of the algorithm. * * <p>On Intel Core2 2.66, on 1000 bytes, fingerprint2011 takes 0.9 microseconds compared to * fingerprint at 4.0 microseconds and md5 at 4.5 microseconds. * * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 6.5K bytes - Viewed (0) -
docs/bucket/lifecycle/DESIGN.md
Lifecycle transition rules can be applied to buckets (both versioned and un-versioned) by specifying the tier name defined above as the transition storage class for the lifecycle rule. ## Implementation
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* and the arithmetic mean is always higher than the geometric mean. * * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles * with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/MoreCollectors.java
Object result = state.getElement(); return (result == NULL_PLACEHOLDER) ? null : result; }, Collector.Characteristics.UNORDERED); /** * A collector that takes a stream containing exactly one element and returns that element. The * returned collector throws an {@code IllegalArgumentException} if the stream consists of two or
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Apr 12 15:07:59 UTC 2025 - 5.4K bytes - Viewed (0) -
docs/debugging/README.md
Example: ```sh minio server /data{1...4} ``` The command takes no flags ```sh mc support diagnostics myminio/ ``` The output printed will be of the form
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 8.6K bytes - Viewed (0) -
docs/en/docs/advanced/events.md
In our code example above, we don't use it directly, but we pass it to FastAPI for it to use it. The `lifespan` parameter of the `FastAPI` app takes an **async context manager**, so we can pass our new `lifespan` async context manager to it. {* ../../docs_src/events/tutorial003.py hl[22] *} ## Alternative Events (deprecated) { #alternative-events-deprecated }
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 7.9K bytes - Viewed (0) -
docs/en/docs/fastapi-cli.md
<span style="background-color:#007166"><font color="#D3D7CF"> INFO </font></span> Application startup complete. ``` </div> The command line program called `fastapi` is **FastAPI CLI**. FastAPI CLI takes the path to your Python program (e.g. `main.py`) and automatically detects the `FastAPI` instance (commonly named `app`), determines the correct import process, and then serves it. For production you would use `fastapi run` instead. 🚀
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 4.8K bytes - Viewed (0) -
src/test/java/org/codelibs/fess/util/PrunedTagTest.java
wrongTag.addAttribute("target", "_blank"); assertFalse(tag.matches(wrongTag)); } public void test_matches_complexCombinations() { // Test tag with both id and css (id takes precedence) PrunedTag tagWithIdAndCss = new PrunedTag("div"); tagWithIdAndCss.setId("main"); tagWithIdAndCss.setCss("container"); MockNode nodeWithBothIdAndClass = new MockNode("div");
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jul 12 07:34:10 UTC 2025 - 21K bytes - Viewed (0) -
docs/erasure/README.md
 ## What is Bit Rot protection?
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 4.2K bytes - Viewed (0)