Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 11 - 20 of 23 for hitCount (0.05 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. android/guava-tests/test/com/google/common/cache/CacheLoadingTest.java

        assertThat(stats.hitCount()).isEqualTo(0);
    
        Object key = new Object();
        assertThat(cache.get(key)).isSameInstanceAs(key);
        stats = cache.stats();
        assertThat(stats.missCount()).isEqualTo(1);
        assertThat(stats.loadSuccessCount()).isEqualTo(1);
        assertThat(stats.loadExceptionCount()).isEqualTo(0);
        assertThat(stats.hitCount()).isEqualTo(0);
    
        key = new Object();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 18 18:06:14 GMT 2026
    - 91K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/cache/CacheLoadingTest.java

        assertThat(stats.hitCount()).isEqualTo(0);
    
        Object key = new Object();
        assertThat(cache.get(key)).isSameInstanceAs(key);
        stats = cache.stats();
        assertThat(stats.missCount()).isEqualTo(1);
        assertThat(stats.loadSuccessCount()).isEqualTo(1);
        assertThat(stats.loadExceptionCount()).isEqualTo(0);
        assertThat(stats.hitCount()).isEqualTo(0);
    
        key = new Object();
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 18 18:06:14 GMT 2026
    - 91K bytes
    - Click Count (0)
  3. okhttp/src/jvmTest/kotlin/okhttp3/KotlinSourceModernTest.kt

        val maxSize: Long = cache.maxSize()
        cache.flush()
        cache.close()
        val directory: File = cache.directory
        val networkCount: Int = cache.networkCount()
        val hitCount: Int = cache.hitCount()
        val requestCount: Int = cache.requestCount()
      }
    
      @Test
      fun cacheControl() {
        val cacheControl: CacheControl = CacheControl.Builder().build()
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Mar 10 21:47:20 GMT 2026
    - 49.7K bytes
    - Click Count (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/CacheCorruptionTest.kt

            }
          }
    
        assertThat(response.body.string()).isEqualTo("ABC.1") // cached
        assertThat(cache.requestCount()).isEqualTo(2)
        assertThat(cache.networkCount()).isEqualTo(1)
        assertThat(cache.hitCount()).isEqualTo(1)
    
        assertThat(response.handshake!!.cipherSuite.javaName).startsWith("SLT_")
      }
    
      @Test
      fun truncatedMetadataEntry() {
        val response =
          testCorruptingCache {
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Jun 18 12:28:21 GMT 2025
    - 6K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/cache/AbstractCacheTest.java

      }
    
      public void testEmptySimpleStats() {
        StatsCounter counter = new SimpleStatsCounter();
        CacheStats stats = counter.snapshot();
        assertThat(stats.requestCount()).isEqualTo(0);
        assertThat(stats.hitCount()).isEqualTo(0);
        assertThat(stats.hitRate()).isEqualTo(1.0);
        assertThat(stats.missCount()).isEqualTo(0);
        assertThat(stats.missRate()).isEqualTo(0.0);
        assertThat(stats.loadSuccessCount()).isEqualTo(0);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 30 22:03:28 GMT 2025
    - 6.4K bytes
    - Click Count (0)
  6. okhttp/api/jvm/okhttp.api

    	public fun close ()V
    	public final fun delete ()V
    	public final fun directory ()Ljava/io/File;
    	public final fun directoryPath ()Lokio/Path;
    	public final fun evictAll ()V
    	public fun flush ()V
    	public final fun hitCount ()I
    	public final fun initialize ()V
    	public final fun isClosed ()Z
    	public static final fun key (Lokhttp3/HttpUrl;)Ljava/lang/String;
    	public final fun maxSize ()J
    	public final fun networkCount ()I
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Tue Mar 10 21:47:20 GMT 2026
    - 72.3K bytes
    - Click Count (0)
  7. src/test/java/jcifs/dcerpc/DcerpcConstantsTest.java

                assertEquals(1, Integer.bitCount(DcerpcConstants.DCERPC_CONC_MPX), "DCERPC_CONC_MPX should be a single bit");
                assertEquals(1, Integer.bitCount(DcerpcConstants.DCERPC_DID_NOT_EXECUTE), "DCERPC_DID_NOT_EXECUTE should be a single bit");
                assertEquals(1, Integer.bitCount(DcerpcConstants.DCERPC_MAYBE), "DCERPC_MAYBE should be a single bit");
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 13.5K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/hash/BloomFilterStrategies.java

          this.bitCount = LongAddables.create();
        }
    
        // Used by serialization
        LockFreeBitArray(long[] data) {
          checkArgument(data.length > 0, "data length is zero!");
          this.data = new AtomicLongArray(data);
          this.bitCount = LongAddables.create();
          long bitCount = 0;
          for (long value : data) {
            bitCount += Long.bitCount(value);
          }
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 19 18:53:45 GMT 2026
    - 10.7K bytes
    - Click Count (0)
  9. okhttp-tls/src/main/kotlin/okhttp3/tls/internal/der/DerWriter.kt

          writeVariableLengthLong(vN)
        }
      }
    
      /** Used for tags and subidentifiers. */
      private fun writeVariableLengthLong(v: Long) {
        val sink = sink()
        val bitCount = 64 - java.lang.Long.numberOfLeadingZeros(v)
        val byteCount = (bitCount + 6) / 7
        for (shift in (byteCount - 1) * 7 downTo 0 step 7) {
          val lastBit = if (shift == 0) 0 else 0b1000_0000
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Wed Mar 19 19:25:20 GMT 2025
    - 5.7K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/hash/BloomFilter.java

       *
       * @since 22.0
       */
      public long approximateElementCount() {
        long bitSize = bits.bitSize();
        long bitCount = bits.bitCount();
    
        /*
         * Each insertion is expected to reduce the # of clear bits by a factor of
         * `numHashFunctions/bitSize`. So, after n insertions, expected bitCount is `bitSize * (1 - (1 -
         * numHashFunctions/bitSize)^n)`. Solving that for n, and approximating `ln x` as `x - 1` when x
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 10 22:28:12 GMT 2026
    - 27.6K bytes
    - Click Count (0)
Back to Top