- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 194 for prea (0.2 sec)
-
android/guava/src/com/google/common/collect/Comparators.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 10.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
private void setPredecessor(int entry, int pred) { long predMask = ~0L << 32; setLink(entry, (link(entry) & ~predMask) | ((long) (pred + 1) << 32)); } private void setSucceeds(int pred, int succ) { if (pred == ENDPOINT) { firstEntry = succ; } else { setSuccessor(pred, succ); } if (succ == ENDPOINT) { lastEntry = pred; } else {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) { pred.setSuccessorInValueSet(succ); succ.setPredecessorInValueSet(pred); } private static <K extends @Nullable Object, V extends @Nullable Object> void succeedsInMultimap( ValueEntry<K, V> pred, ValueEntry<K, V> succ) { pred.setSuccessorInMultimap(succ); succ.setPredecessorInMultimap(pred); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimap.java
* * <p>The following code: * * <pre>{@code * ListMultimap<String, String> multimap = ArrayListMultimap.create(); * for (President pres : US_PRESIDENTS_IN_ORDER) { * multimap.put(pres.firstName(), pres.lastName()); * } * for (String firstName : multimap.keySet()) { * List<String> lastNames = multimap.get(firstName); * out.println(firstName + ": " + lastNames); * } * }</pre> * * ... produces output such as: *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Sat Jun 17 14:40:53 GMT 2023 - 15.1K bytes - Viewed (0) -
maven-artifact/src/main/java/org/apache/maven/artifact/versioning/ComparableVersion.java
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 08:39:32 GMT 2023 - 26K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AtomicDoubleTest.java
public void testCompareAndSet() { double prev = Math.E; double unused = Math.E + Math.PI; AtomicDouble at = new AtomicDouble(prev); for (double x : VALUES) { assertBitEquals(prev, at.get()); assertFalse(at.compareAndSet(unused, x)); assertBitEquals(prev, at.get()); assertTrue(at.compareAndSet(prev, x)); assertBitEquals(x, at.get()); prev = x; } }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Feb 09 22:57:07 GMT 2022 - 10.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheTesting.java
ReferenceEntry<?, ?> prev = null; for (ReferenceEntry<?, ?> current : segment.writeQueue) { assertTrue(entries.add(current)); if (prev != null) { assertSame(prev, current.getPreviousInWriteQueue()); assertSame(prev.getNextInWriteQueue(), current); assertThat(prev.getWriteTime()).isAtMost(current.getWriteTime()); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 16.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* * If we pick a function that goes /below/ that horizontal line, it means that we reduce the area * of the function, thus time. Thus, the RateLimiter becomes /faster/ after a period of * underutilization. If, on the other hand, we pick a function that goes /above/ that horizontal * line, then it means that the area (time) is increased, thus storedPermits are more costly than
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/cache/CacheTesting.java
ReferenceEntry<?, ?> prev = null; for (ReferenceEntry<?, ?> current : segment.writeQueue) { assertTrue(entries.add(current)); if (prev != null) { assertSame(prev, current.getPreviousInWriteQueue()); assertSame(prev.getNextInWriteQueue(), current); assertThat(prev.getWriteTime()).isAtMost(current.getWriteTime()); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 16.7K bytes - Viewed (0)