Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for heuristics (0.07 seconds)

  1. src/bytes/bytes.go

    // shouldUseASCIISet returns whether to use the lookup table optimization.
    // The threshold of 8 bytes balances initialization cost against per-byte
    // search cost, performing well across all charset sizes.
    //
    // More complex heuristics (e.g., different thresholds per charset size)
    // add branching overhead that eats away any theoretical improvements.
    func shouldUseASCIISet(bufLen int) bool {
    	return bufLen > 8
    }
    
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Thu Mar 12 17:56:55 GMT 2026
    - 36.3K bytes
    - Click Count (0)
  2. RELEASE.md

    * The `experimental_relax_shapes` heuristic for `tf.function` has been deprecated and replaced with `reduce_retracing` which encompasses broader heuristics to reduce the number of retraces (see below)
    
    ## Major Features and Improvements
    
    *   `tf.keras`:
    
    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)
  3. okhttp/src/jvmTest/kotlin/okhttp3/CacheTest.kt

        val response = get(server.url("/"))
        assertThat(response.body.string()).isEqualTo("A")
        assertThat(response.header("Warning")).isEqualTo(
          "113 HttpURLConnection \"Heuristic expiration\"",
        )
      }
    
      @Test
      fun noDefaultExpirationForUrlsWithQueryString() {
        server.enqueue(
          MockResponse
            .Builder()
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Mar 20 09:13:37 GMT 2026
    - 121K bytes
    - Click Count (0)
Back to Top