Search Options

Results per page
Sort
Preferred Languages
Advance

Results 2461 - 2470 of 4,067 for getZ (0.02 sec)

  1. 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...
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Wed Feb 26 09:25:50 UTC 2025
    - 8K bytes
    - Viewed (2)
  2. docs_src/dependencies/tutorial004_py39.py

    
    class CommonQueryParams:
        def __init__(self, q: Union[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: CommonQueryParams = Depends()):
        response = {}
        if commons.q:
            response.update({"q": commons.q})
        items = fake_items_db[commons.skip : commons.skip + commons.limit]
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Dec 17 20:41:43 UTC 2025
    - 639 bytes
    - Viewed (0)
  3. tests/test_tutorial/test_settings/test_tutorial001.py

        mod = importlib.import_module(f"docs_src.settings.{request.param}")
        return mod.app
    
    
    def test_settings(app):
        client = TestClient(app)
        response = client.get("/info")
        assert response.status_code == 200, response.text
        assert response.json() == {
            "app_name": "Awesome API",
            "admin_email": "******@****.***",
            "items_per_user": 50,
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat Dec 27 12:54:56 UTC 2025
    - 690 bytes
    - Viewed (0)
  4. docs_src/response_model/tutorial004_py39.py

        "bar": {"name": "Bar", "description": "The bartenders", "price": 62, "tax": 20.2},
        "baz": {"name": "Baz", "description": None, "price": 50.2, "tax": 10.5, "tags": []},
    }
    
    
    @app.get("/items/{item_id}", response_model=Item, response_model_exclude_unset=True)
    async def read_item(item_id: str):
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Sat May 14 11:59:59 UTC 2022
    - 627 bytes
    - Viewed (0)
  5. okhttp/src/commonJvmAndroid/kotlin/okhttp3/Response.kt

       *   challenge. In this case the request URL may be different than the initial request URL.
       *
       * Use the `request` of the [networkResponse] field to get the wire-level request that was
       * transmitted. In the case of follow-ups and redirects, also look at the `request` of the
       * [priorResponse] objects, which have its own [priorResponse].
       */
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Mon Jul 28 14:39:28 UTC 2025
    - 18.1K bytes
    - Viewed (0)
  6. samples/tlssurvey/src/main/kotlin/okhttp3/survey/types/Client.kt

    data class Client(
      val userAgent: String,
      val version: String,
      val platform: String? = null,
      val enabled: List<SuiteId> = listOf(),
      val supported: List<SuiteId> = listOf(),
    ) {
      val nameAndVersion: String
        get() = "$userAgent/$version"
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Tue Apr 02 01:44:15 UTC 2024
    - 883 bytes
    - Viewed (0)
  7. scripts/playwright/sql_databases/image02.py

        context.close()
        browser.close()
    
    
    process = subprocess.Popen(
        ["fastapi", "run", "docs_src/sql_databases/tutorial002.py"],
    )
    try:
        for _ in range(3):
            try:
                response = httpx.get("http://localhost:8000/docs")
            except httpx.ConnectError:
                time.sleep(1)
                break
        with sync_playwright() as playwright:
            run(playwright)
    finally:
    Registered: Sun Dec 28 07:19:09 UTC 2025
    - Last Modified: Wed Oct 09 19:44:42 UTC 2024
    - 1.1K bytes
    - Viewed (0)
  8. src/main/java/org/codelibs/fess/opensearch/config/allcommon/EsAbstractBehavior.java

                return parent.equals(o);
            }
    
            public int hashCode() {
                return parent.hashCode();
            }
    
            public E get(final int index) {
                return parent.get(index);
            }
    
            public E set(final int index, final E element) {
                return parent.set(index, element);
            }
    
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Thu Nov 27 07:01:25 UTC 2025
    - 26.4K bytes
    - Viewed (0)
  9. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/ConnectInterceptor.kt

    /**
     * Opens a connection to the target server and proceeds to the next interceptor. The network might
     * be used for the returned response, or to validate a cached response with a conditional GET.
     */
    object ConnectInterceptor : Interceptor {
      @Throws(IOException::class)
      override fun intercept(chain: Interceptor.Chain): Response {
        val realChain = chain as RealInterceptorChain
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 1.5K bytes
    - Viewed (0)
  10. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RouteDatabase.kt

     * preferred.
     */
    class RouteDatabase {
      private val _failedRoutes = mutableSetOf<Route>()
    
      val failedRoutes: Set<Route>
        @Synchronized get() = _failedRoutes.toSet()
    
      /** Records a failure connecting to [failedRoute]. */
      @Synchronized fun failed(failedRoute: Route) {
        _failedRoutes.add(failedRoute)
      }
    
      /** Records success connecting to [route]. */
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Fri Dec 27 13:39:56 UTC 2024
    - 1.5K bytes
    - Viewed (0)
Back to top