Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 2341 - 2350 of 4,454 for getA (0.02 seconds)

  1. docs_src/configure_swagger_ui/tutorial002_py310.py

    from fastapi import FastAPI
    
    app = FastAPI(swagger_ui_parameters={"syntaxHighlight": {"theme": "obsidian"}})
    
    
    @app.get("/users/{username}")
    async def read_user(username: str):
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Feb 12 13:19:43 GMT 2026
    - 221 bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/ForwardingMap.java

      }
    
      @Override
      public boolean containsValue(@Nullable Object value) {
        return delegate().containsValue(value);
      }
    
      @Override
      public @Nullable V get(@Nullable Object key) {
        return delegate().get(key);
      }
    
      @CanIgnoreReturnValue
      @Override
      public @Nullable V put(@ParametricNullness K key, @ParametricNullness V value) {
        return delegate().put(key, value);
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Aug 06 17:32:30 GMT 2025
    - 9.8K bytes
    - Click Count (0)
  3. src/test/java/jcifs/internal/smb2/tree/Smb2TreeDisconnectRequestTest.java

            Smb2TreeDisconnectRequest req2 = new Smb2TreeDisconnectRequest(mockConfig);
    
            // Then - all should have same command
            int cmd1 = (int) commandField.get(req1);
            int cmd2 = (int) commandField.get(req2);
    
            assertEquals(cmd1, cmd2);
            assertEquals(SMB2_TREE_DISCONNECT, cmd1);
        }
    
        @Test
        @DisplayName("Should properly implement wire format protocol")
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 14.1K bytes
    - Click Count (0)
  4. docs/distributed/DESIGN.md

    many common divisors the algorithm chooses the minimum amounts of erasure sets possible for a erasure set size of any N*.  In the example with 1024 drives - 4, 8, 16 are GCD factors. With 16 drives we get a total of 64 possible sets, with 8 drives we get a total of 128 possible sets, with 4 drives we get a total of 256 possible sets. So algorithm automatically chooses 64 sets, which is *16* 64 = 1024* drives in total.
    
    - *If total number of nodes are of odd number then GCD algorithm provides...
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Wed Feb 26 09:25:50 GMT 2025
    - 8K bytes
    - Click Count (2)
  5. docs_src/using_request_directly/tutorial001_py310.py

    from fastapi import FastAPI, Request
    
    app = FastAPI()
    
    
    @app.get("/items/{item_id}")
    def read_root(item_id: str, request: Request):
        client_host = request.client.host
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Feb 12 13:19:43 GMT 2026
    - 230 bytes
    - Click Count (0)
  6. docs_src/advanced_middleware/tutorial003_py310.py

    from fastapi import FastAPI
    from fastapi.middleware.gzip import GZipMiddleware
    
    app = FastAPI()
    
    app.add_middleware(GZipMiddleware, minimum_size=1000, compresslevel=5)
    
    
    @app.get("/")
    async def main():
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Feb 12 13:19:43 GMT 2026
    - 230 bytes
    - Click Count (0)
  7. docs_src/query_params_str_validations/tutorial013_an_py310.py

    from typing import Annotated
    
    from fastapi import FastAPI, Query
    
    app = FastAPI()
    
    
    @app.get("/items/")
    async def read_items(q: Annotated[list, Query()] = []):
        query_items = {"q": q}
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Feb 12 13:19:43 GMT 2026
    - 210 bytes
    - Click Count (0)
  8. CONTRIBUTING.md

    The [Kubernetes community repo](https://github.com/kubernetes/community) contains information about how to get started, how the community organizes, and more.
    
    ## Sign the CLA
    
    Created: Fri Apr 03 09:05:14 GMT 2026
    - Last Modified: Wed Nov 18 13:04:48 GMT 2020
    - 525 bytes
    - Click Count (0)
  9. docs_src/dependencies/tutorial003_an_py310.py

    
    class CommonQueryParams:
        def __init__(self, q: str | None = None, skip: int = 0, limit: int = 100):
            self.q = q
            self.skip = skip
            self.limit = limit
    
    
    @app.get("/items/")
    async def read_items(commons: Annotated[Any, Depends(CommonQueryParams)]):
        response = {}
        if commons.q:
            response.update({"q": commons.q})
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Mar 18 12:29:59 GMT 2023
    - 655 bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/Sets.java

       * </ul>
       *
       * <p>The result is guaranteed to be in the "traditional", lexicographical order for Cartesian
       * products that you would get from nesting for loops:
       *
       * {@snippet :
       * for (B b0 : sets.get(0)) {
       *   for (B b1 : sets.get(1)) {
       *     ...
       *     ImmutableList<B> tuple = ImmutableList.of(b0, b1, ...);
       *     // operate on tuple
       *   }
       * }
       * }
       *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 81.4K bytes
    - Click Count (0)
Back to Top