Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for removeEntry (0.51 sec)

  1. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/cache/DiskLruCache.kt

        initialize()
    
        checkNotClosed()
        validateKey(key)
        val entry = lruEntries[key] ?: return false
        val removed = removeEntry(entry)
        if (removed && size <= maxSize) mostRecentTrimFailed = false
        return removed
      }
    
      @Throws(IOException::class)
      internal fun removeEntry(entry: Entry): Boolean {
        // If we can't delete files that are still open, mark this entry as a zombie so its files will
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed May 28 23:28:25 UTC 2025
    - 34.7K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/collect/HashBiMap.java

        }
      }
    
      /** Removes the entry at the specified index with no additional data. */
      void removeEntry(int entry) {
        removeEntryKeyHashKnown(entry, Hashing.smearedHash(keys[entry]));
      }
    
      /** Removes the entry at the specified index, given the hash of its key and value. */
      private void removeEntry(int entry, int keyHash, int valueHash) {
        checkArgument(entry != ABSENT);
        deleteFromTableKToV(entry, keyHash);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 36.2K bytes
    - Viewed (0)
  3. android/guava-tests/test/com/google/common/cache/LocalCacheTest.java

        // remove absent
        assertFalse(segment.removeEntry(entry, hash, RemovalCause.COLLECTED));
    
        // remove live
        segment.recordWrite(entry, 1, map.ticker.read());
        table.set(0, entry);
        segment.count = 1;
        assertTrue(segment.removeEntry(entry, hash, RemovalCause.COLLECTED));
        assertNotificationEnqueued(map, key, value);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Aug 11 19:31:30 UTC 2025
    - 110.5K bytes
    - Viewed (0)
Back to top