- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for incCounter (0.06 seconds)
-
android/guava/src/com/google/common/collect/Maps.java
* resulting implementation is specialized for enum key types. The returned map and its views will * iterate over keys in their enum definition order, not encounter order. * * <p>If the mapped keys contain duplicates, an {@code IllegalArgumentException} is thrown when * the collection operation is performed. (This differs from the {@code Collector} returned byCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 157.6K bytes - Click Count (0) -
guava/src/com/google/common/collect/Maps.java
* resulting implementation is specialized for enum key types. The returned map and its views will * iterate over keys in their enum definition order, not encounter order. * * <p>If the mapped keys contain duplicates, an {@code IllegalArgumentException} is thrown when * the collection operation is performed. (This differs from the {@code Collector} returned byCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 163.4K bytes - Click Count (0) -
okhttp/src/jvmTest/kotlin/okhttp3/CacheTest.kt
} } server.enqueue(builder.build()) if (responseCode == HttpURLConnection.HTTP_CLIENT_TIMEOUT) { // 408's are a bit of an outlier because we may repeat the request if we encounter this // response code. In this scenario, there are 2 responses: the initial 408 and then the 200 // because of the retry. We just want to ensure the initial 408 isn't cached. expectedResponseCode = 200Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Mar 20 09:13:37 GMT 2026 - 121K bytes - Click Count (0) -
android/guava/src/com/google/common/cache/LocalCache.java
* Applies a supplemental hash function to a given hash code, which defends against poor quality * hash functions. This is critical when the concurrent hash map uses power-of-two length hash * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper * bits. * * @param h hash code */ static int rehash(int h) { // Spread bits to regularize both segment and index locations,
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 143.5K bytes - Click Count (0) -
guava/src/com/google/common/cache/LocalCache.java
* Applies a supplemental hash function to a given hash code, which defends against poor quality * hash functions. This is critical when the concurrent hash map uses power-of-two length hash * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper * bits. * * @param h hash code */ static int rehash(int h) { // Spread bits to regularize both segment and index locations,
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)