- Sort Score
- Num 10 results
- Language All
Results 21 - 30 of 38 for highway (0.44 seconds)
The search processing time has exceeded the limit. The displayed results may be partial.
-
android/guava/src/com/google/common/collect/ConcurrentHashMultiset.java
} /** * Creates a new {@code ConcurrentHashMultiset} containing the specified elements, using the * default initial capacity, load factor, and concurrency settings. * * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. * * @param elements the elements that the multiset should contain */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 22.3K bytes - Click Count (0) -
docs/en/docs/tutorial/first-steps.md
You can also return Pydantic models (you'll see more about that later). There are many other objects and models that will be automatically converted to JSON (including ORMs, etc). Try using your favorite ones, it's highly probable that they are already supported. ### Step 6: Deploy it { #step-6-deploy-it } Deploy your app to **[FastAPI Cloud](https://fastapicloud.com)** with one command: `fastapi deploy`. 🎉
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Sat Mar 07 09:29:03 GMT 2026 - 13.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
} /** * Creates a new {@code ConcurrentHashMultiset} containing the specified elements, using the * default initial capacity, load factor, and concurrency settings. * * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. * * @param elements the elements that the multiset should contain */Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Dec 26 20:08:09 GMT 2025 - 22.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
: new TreeMultiset<E>(comparator); } /** * Creates an empty multiset containing the given initial elements, sorted according to the * elements' natural order. * * <p>This implementation is highly efficient when {@code elements} is itself a {@link Multiset}. * * <p>The type specification is {@code <E extends Comparable>}, instead of the more specific
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Mar 16 13:11:08 GMT 2026 - 34K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/indexer/IndexUpdater.java
} ComponentUtil.getLanguageHelper().updateDocument(map); } /** * Adds a boost value to the document for search relevance scoring. * The boost value affects how highly the document will rank in search results. * * @param map the document data map to add the boost value to * @param documentBoost the boost value to apply to the document */Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Nov 28 16:29:12 GMT 2025 - 32.9K bytes - Click Count (0) -
tensorflow/c/eager/c_api_experimental.h
// the device is not usable. In case of a bad status, `device.delete_device` is // still called on `device_info` (i.e. the caller does not retain ownership). // // This API is highly experimental, and in particular is expected to change when // it starts supporting operations with attributes and when tf.function support // is added. TF_CAPI_EXPORT extern void TFE_RegisterCustomDevice(TFE_Context* ctx,
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Wed Feb 21 22:37:46 GMT 2024 - 39.5K bytes - Click Count (1) -
docs/en/docs/async.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 23.4K bytes - Click Count (0) -
cmd/peer-rest-server.go
if objAPI == nil { return np, grid.NewRemoteErr(errServerNotInitialized) } pools, ok := objAPI.(*erasureServerPools) if !ok { return np, nerr } // No need to return errors, this is not a highly strict operation. uploadID := mss.Get(peerRESTUploadID) if uploadID != "" { pools.ClearUploadID(uploadID) } return np, nerr }Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 53.6K bytes - Click Count (0) -
guava/src/com/google/common/cache/LocalCache.java
* * <p>The benefits of creating our own queue are that (1) we can replace elements in the middle of * the queue as part of copyWriteEntry, and (2) the contains method is highly optimized for the * current model. */ static final class WriteQueue<K, V> extends AbstractQueue<ReferenceEntry<K, V>> { final ReferenceEntry<K, V> head = new AbstractReferenceEntry<K, V>() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 148.9K bytes - Click Count (0) -
android/guava/src/com/google/common/cache/LocalCache.java
* * <p>The benefits of creating our own queue are that (1) we can replace elements in the middle of * the queue as part of copyWriteEntry, and (2) the contains method is highly optimized for the * current model. */ static final class WriteQueue<K, V> extends AbstractQueue<ReferenceEntry<K, V>> { final ReferenceEntry<K, V> head = new AbstractReferenceEntry<K, V>() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 143.5K bytes - Click Count (0)