- Sort Score
- Result 10 results
- Languages All
Results 1991 - 2000 of 2,188 for Fess (0.04 sec)
-
LICENSE
Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Mon Jan 18 20:25:38 UTC 2016 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
throw new ArithmeticException("ceilingPowerOfTwo(" + x + ") is not representable as a long"); } return 1L << -Long.numberOfLeadingZeros(x - 1); } /** * Returns the largest power of two less than or equal to {@code x}. This is equivalent to {@code * checkedPow(2, log2(x, FLOOR))}. * * @throws IllegalArgumentException if {@code x <= 0} * @since 20.0 */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 29 16:20:07 UTC 2025 - 46.8K bytes - Viewed (0) -
docs/en/docs/tutorial/dependencies/dependencies-with-yield.md
## Execution of dependencies with `yield` { #execution-of-dependencies-with-yield } The sequence of execution is more or less like this diagram. Time flows from top to bottom. And each column is one of the parts interacting or executing code. ```mermaid sequenceDiagram participant client as Client participant handler as Exception handlerRegistered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 12.7K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
TF_DeleteGraph); TF_SessionOptions* opts = TF_NewSessionOptions(); TF_Session* sess = TF_NewSession(graph.get(), opts, s); TF_DeleteSessionOptions(opts); const string gpu_device_name = GPUDeviceName(sess); TF_DeleteSession(sess, s); CHECK_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s); return gpu_device_name; }
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Dec 27 12:18:10 UTC 2024 - 97K bytes - Viewed (0) -
docs/en/docs/benchmarks.md
* **Uvicorn**: * Will have the best performance, as it doesn't have much extra code apart from the server itself. * You wouldn't write an application in Uvicorn directly. That would mean that your code would have to include more or less, at least, all the code provided by Starlette (or **FastAPI**). And if you did that, your final application would have the same overhead as having used a framework and minimizing your app code and bugs.Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 3.5K bytes - Viewed (0) -
src/test/java/jcifs/internal/smb1/com/SmbComNTCreateAndXTest.java
assertEquals(expected, actual, "createDisposition should match"); } } @Test @DisplayName("CreateOptions default padding") void createOptionsAddedWhenLow() { // createOptions less than 0x0001 (i.e., 0) should be padded with 0x0040 SmbComNTCreateAndX req = createRequest(0, 0); int actual = (int) getPrivateField(req, "createOptions");
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 5.6K bytes - Viewed (0) -
.github/DISCUSSION_TEMPLATE/questions.yml
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Aug 03 15:59:41 UTC 2023 - 5.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/Queues.java
return new LinkedBlockingDeque<>(); } /** * Creates an empty {@code LinkedBlockingDeque} with the given (fixed) capacity. * * @throws IllegalArgumentException if {@code capacity} is less than 1 * @since 12.0 */ @J2ktIncompatible @GwtIncompatible // LinkedBlockingDeque public static <E> LinkedBlockingDeque<E> newLinkedBlockingDeque(int capacity) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.1K bytes - Viewed (0) -
internal/lru/lru.go
} // Contains checks if a key is in the cache, without updating the recent-ness // or deleting it for being stale. func (c *LRU[K, V]) Contains(key K) (ok bool) { c.mu.Lock() defer c.mu.Unlock() _, ok = c.items[key] return ok } // Peek returns the key value (or undefined if not found) without updating // the "recently used"-ness of the key. func (c *LRU[K, V]) Peek(key K) (value V, ok bool) { c.mu.Lock()
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Fri Apr 25 08:22:26 UTC 2025 - 12.5K bytes - Viewed (0) -
src/bytes/example_test.go
// abc // abc // dbc } func ExampleCompare() { // Interpret Compare's result by comparing it to zero. var a, b []byte if bytes.Compare(a, b) < 0 { // a less b } if bytes.Compare(a, b) <= 0 { // a less or equal b } if bytes.Compare(a, b) > 0 { // a greater b } if bytes.Compare(a, b) >= 0 { // a greater or equal b }
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon May 12 16:07:54 UTC 2025 - 16.5K bytes - Viewed (0)