Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 31 - 37 of 37 for complexity (0.06 seconds)

  1. guava/src/com/google/common/cache/LocalCache.java

       * its capacity threshold.
       *
       * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
       * rate, and ability to be implemented with O(1) time complexity. The initial LRU implementation
       * operates per-segment rather than globally for increased implementation simplicity. We expect
       * the cache hit rate to be similar to that of a global LRU algorithm.
       */
    
    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)
  2. src/main/webapp/js/admin/bootstrap.min.js.map

    lement) {\n    let parent\n    const selector = Util.getSelectorFromElement(element)\n\n    if (selector) {\n      parent = document.querySelector(selector)\n    }\n\n    return parent || element.parentNode\n  }\n\n  // eslint-disable-next-line complexity\n  static _dataApiKeydownHandler(event) {\n    // If not input/textarea:\n    //  - And not a key in REGEXP_KEYDOWN => not a dropdown command\n    // If input/textarea:\n    //  - If space key => not a dropdown command\n    //  - If key is other...
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Sat Oct 26 01:49:09 GMT 2024
    - 180.9K bytes
    - Click Count (0)
  3. RELEASE.md

        *   Reduce `tfp.layers` boilerplate via programmable docstrings.
        *   Add `auc_with_confidence_intervals`, a method for computing the AUC and
            confidence interval with linearithmic time complexity.
        *   `regression_head` now accepts customized link function, to satisfy the
            usage that user can define their own link function if the
            `array_ops.identity` does not meet the requirement.
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Mon Mar 30 18:31:38 GMT 2026
    - 746.5K bytes
    - Click Count (3)
  4. doc/go_spec.html

    <code>real</code> and <code>imag</code>
    extract the real and imaginary parts of a complex value.
    </p>
    
    <pre class="grammar">
    complex(realPart, imaginaryPart floatT) complexT
    real(complexT) floatT
    imag(complexT) floatT
    </pre>
    
    <p>
    The type of the arguments and return value correspond.
    For <code>complex</code>, the two arguments must be of the same
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Wed Apr 01 23:39:18 GMT 2026
    - 287.8K bytes
    - Click Count (1)
  5. src/test/java/org/codelibs/fess/entity/DataStoreParamsTest.java

            Map<String, String> complexObject = new HashMap<>();
            complexObject.put("nested", "value");
    
            dataStoreParams.put("complexKey", complexObject);
            assertEquals(complexObject, dataStoreParams.get("complexKey"));
    
            String asString = dataStoreParams.getAsString("complexKey");
            assertNotNull(asString);
            assertTrue(asString.contains("nested"));
        }
    
        // Test overwriting existing values
    Created: Tue Mar 31 13:07:34 GMT 2026
    - Last Modified: Fri Mar 13 23:01:26 GMT 2026
    - 10.9K bytes
    - Click Count (0)
  6. docs/en/docs/release-notes.md

    * đź”§ Fix Ruff configuration unintentionally enabling and re-disabling mccabe complexity check. PR [#10893](https://github.com/tiangolo/fastapi/pull/10893) by [@jiridanek](https://github.com/jiridanek).
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Fri Apr 03 12:07:04 GMT 2026
    - 631K bytes
    - Click Count (0)
  7. docs/fr/docs/deployment/docker.md

    Avoir un autre gestionnaire de processus à l'intérieur du conteneur (comme ce serait le cas avec plusieurs workers) n'ajouterait que de la **complexité inutile** que vous gérez très probablement déjà avec votre système de cluster.
    
    ### Conteneurs avec plusieurs processus et cas particuliers { #containers-with-multiple-processes-and-special-cases }
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 32.3K bytes
    - Click Count (0)
Back to Top