- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 1,936 for There (0.08 sec)
-
docs_src/app_testing/app_b_py310/test_main.py
response = client.get("/items/foo", headers={"X-Token": "coneofsilence"}) assert response.status_code == 200 assert response.json() == { "id": "foo", "title": "Foo", "description": "There goes my hero", } def test_read_item_bad_token(): response = client.get("/items/foo", headers={"X-Token": "hailhydra"}) assert response.status_code == 400
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Mar 13 19:07:10 UTC 2024 - 1.8K bytes - Viewed (0) -
docs/distributed/DESIGN.md
### There are no limits on how many server pools can be combined ``` minio server http://host{1...32}/export{1...32} http://host{1...12}/export{1...12} ``` In above example there are two server pools - 32 * 32 = 1024 drives pool1 - 12 * 12 = 144 drives pool2
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* to pass it in here. Instead, simply subclass {@code Ordering} and implement its {@code compare} * method directly. * * <p>The returned object is serializable if {@code comparator} is serializable. * * <p><b>Java 8+ users:</b> this class is now obsolete as explained in the class documentation, so * there is no need to use this method. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.4K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/cache2/FileOperator.kt
mutableByteCount -= bytesWritten } } /** * Copy [byteCount] bytes from the file at [pos] into `sink`. It is the * caller's responsibility to make sure there are sufficient bytes to read: if there aren't this * method throws an `EOFException`. */ fun read( pos: Long, sink: Buffer, byteCount: Long, ) { if (byteCount < 0L) {
Registered: Fri Nov 01 11:42:11 UTC 2024 - Last Modified: Mon Jan 08 01:13:22 UTC 2024 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Ordering.java
* to pass it in here. Instead, simply subclass {@code Ordering} and implement its {@code compare} * method directly. * * <p>The returned object is serializable if {@code comparator} is serializable. * * <p><b>Java 8+ users:</b> this class is now obsolete as explained in the class documentation, so * there is no need to use this method. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 39.4K bytes - Viewed (0) -
docs/en/docs/advanced/generate-clients.md
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 06 20:36:54 UTC 2024 - 10.7K bytes - Viewed (0) -
architecture/networking/pilot.md
Translation turns the above inputs into the actual types consumed by the connected XDS clients (typically Envoy). This is done by `Generators`, which register a function to build a given type. For example, there is a `RouteGenerator` responsible for building `Routes`. Along with the core Envoy XDS types, there are a few custom Istio types, such as our `NameTable` type used for DNS, as well as debug interfaces. `Generators` get as input the `Proxy` (a representation of the current client), the current...
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Feb 07 17:53:24 UTC 2024 - 19.1K bytes - Viewed (0) -
docs/kms/IAM.md
change unified the key-management aspect within MinIO. The unified KMS-based approach has several advantages: - Key management is now centralized. There is one way to change or rotate encryption keys. There used to be two different mechanisms - one for regular S3 objects and one for IAM data. - Reduced server startup time. For IAM encryption with the root credentials, MinIO had
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Thu Jan 18 07:03:17 UTC 2024 - 5.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
*/ @CheckForNull @VisibleForTesting transient long[] links; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry; /** Pointer to the last node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int lastEntry; private final boolean accessOrder; CompactLinkedHashMap() {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 8.5K bytes - Viewed (0) -
docs/en/docs/history-design-future.md
**FastAPI** wouldn't exist if not for the previous work of others. There have been many tools created before that have helped inspire its creation. I have been avoiding the creation of a new framework for several years. First I tried to solve all the features covered by **FastAPI** using many different frameworks, plug-ins, and tools.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Mon Jul 29 23:35:07 UTC 2024 - 4.1K bytes - Viewed (0)