Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for Caffeine (0.05 seconds)

  1. android/guava/src/com/google/common/cache/CacheBuilder.java

     * Cache}</a>, <a
     * href="https://www.javadoc.io/doc/com.github.ben-manes.caffeine/caffeine/latest/com.github.benmanes.caffeine/com/github/benmanes/caffeine/cache/LoadingCache.html">{@code
     * LoadingCache}</a>, <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Oct 08 18:55:33 GMT 2025
    - 51.9K bytes
    - Click Count (0)
  2. guava/src/com/google/common/cache/CacheBuilder.java

     * Cache}</a>, <a
     * href="https://www.javadoc.io/doc/com.github.ben-manes.caffeine/caffeine/latest/com.github.benmanes.caffeine/com/github/benmanes/caffeine/cache/LoadingCache.html">{@code
     * LoadingCache}</a>, <a
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Wed Oct 08 18:55:33 GMT 2025
    - 51.6K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/cache/package-info.java

     * the License.
     */
    
    /**
     * {@linkplain CacheBuilder Discouraged} (in favor of <a
     * href="https://github.com/ben-manes/caffeine/wiki">Caffeine</a>) caching utilities.
     *
     * <p>The core interface used to represent caches is {@link Cache}. In-memory caches can be
     * configured and created using {@link CacheBuilder}, with cache entries being loaded by {@link
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Jan 03 19:02:39 GMT 2025
    - 1.4K bytes
    - Click Count (0)
  4. compat/maven-model-builder/src/test/resources/dag.txt

    	quarkus/extensions/resteasy-classic/resteasy-mutiny/runtime/pom.xml
    	quarkus/extensions/grpc/deployment/pom.xml
    	quarkus/test-framework/junit5-internal/pom.xml
    quarkus/extensions/caffeine/deployment/pom.xml
    	quarkus/core/deployment/pom.xml
    	quarkus/extensions/caffeine/runtime/pom.xml
    	quarkus/extensions/vertx-http/dev-ui-spi/pom.xml
    quarkus/integration-tests/packaging/pom.xml
    	quarkus/extensions/resteasy-classic/resteasy/runtime/pom.xml
    Created: Sun Dec 28 03:35:09 GMT 2025
    - Last Modified: Fri Oct 25 12:31:46 GMT 2024
    - 224K bytes
    - Click Count (0)
  5. lib/fips140/v1.0.0-c2097c7c.zip

    t0 + t0 z3.Mul(t0, z3) // Z3 := t0 * Z3 x3.Sub(x3, z3) // X3 := X3 - Z3 z3.Mul(t0, t1) // Z3 := t0 * t1 z3.Add(z3, z3) // Z3 := Z3 + Z3 z3.Add(z3, z3) // Z3 := Z3 + Z3 q.x.Set(x3) q.y.Set(y3) q.z.Set(z3) return q } // p256AffinePoint is a point in affine coordinates (x, y). x and y are still // Montgomery domain elements. The point can't be the point at infinity. type p256AffinePoint struct { x, y fiat.P256Element } func (p *p256AffinePoint) Projective() *P256Point { pp := &P256Point{x: p.x, y: p.y}...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Sep 25 19:53:19 GMT 2025
    - 642.7K bytes
    - Click Count (0)
  6. lib/fips140/v1.1.0-rc1.zip

    t0 + t0 z3.Mul(t0, z3) // Z3 := t0 * Z3 x3.Sub(x3, z3) // X3 := X3 - Z3 z3.Mul(t0, t1) // Z3 := t0 * t1 z3.Add(z3, z3) // Z3 := Z3 + Z3 z3.Add(z3, z3) // Z3 := Z3 + Z3 q.x.Set(x3) q.y.Set(y3) q.z.Set(z3) return q } // p256AffinePoint is a point in affine coordinates (x, y). x and y are still // Montgomery domain elements. The point can't be the point at infinity. type p256AffinePoint struct { x, y fiat.P256Element } func (p *p256AffinePoint) Projective() *P256Point { pp := &P256Point{x: p.x, y: p.y}...
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Thu Dec 11 16:27:41 GMT 2025
    - 663K bytes
    - Click Count (0)
  7. RELEASE.md

        flexible and reproducible package, is available via the new
        `tf.contrib.data.Dataset.from_generator` method!
    *   Fix `tf.contrib.distributions.Affine` incorrectly computing
        log-det-jacobian.
    *   Fix `tf.random_gamma` incorrectly handling non-batch, scalar draws.
    *   Resolved a race condition in TensorForest TreePredictionsV4Op.
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Tue Oct 28 22:27:41 GMT 2025
    - 740.4K bytes
    - Click Count (3)
Back to Top