- Sort Score
- Result 10 results
- Languages All
Results 11 - 17 of 17 for linkedin (0.17 sec)
-
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
private ExecutionSequencer() {} /** Creates a new instance. */ public static ExecutionSequencer create() { return new ExecutionSequencer(); } /** This reference acts as a pointer tracking the head of a linked list of ListenableFutures. */ private final AtomicReference<ListenableFuture<@Nullable Void>> ref = new AtomicReference<>(immediateVoidFuture());
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 22.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
// linked list starting from `newTable`. In general, each element from the old linked list // belongs to a different linked list from `newTable`. We insert each element in turn at the // head of its appropriate `newTable` linked list. while (oldNext != UNSET) { int entryIndex = oldNext - 1; int oldEntry = entries[entryIndex];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMultiset.java
if (count == 0 && !isLinkedHash) { contents = new ObjectCountLinkedHashMap<E>(contents); isLinkedHash = true; // to preserve insertion order through deletions, we have to switch to an actual linked // implementation at least for now, but this should be a super rare case } else if (buildInvoked) { contents = new ObjectCountHashMap<E>(contents); isLinkedHash = false; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
* in that case, getProperty *will* return null. * * TODO(b/192002623): Handle that case: Either: * * - Skip non-string keys and values entirely, as proposed in the linked bug. * * - Throw ClassCastException instead of NullPointerException, as documented in the current * Javadoc. (Note that we can't necessarily "just" change our call to `getProperty` to `get`
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* high 32 bits of each long is the "prev" pointer, whereas the low 32 bits is the "succ" pointer * (pointing to the next entry in the linked list). The pointers in [size(), entries.length) are * all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */
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) -
guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
* implementations. Forked from {@link SetContainsBenchmark}. * * @author Nicholaus Shupe */ public class MapBenchmark { @Param({"Hash", "LinkedHM", "MapMaker1", "Immutable"}) private Impl impl; public enum Impl { Hash { @Override Map<Element, Element> create(Collection<Element> keys) { Map<Element, Element> map = Maps.newHashMap();
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 7.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// linked list starting from `newTable`. In general, each element from the old linked list // belongs to a different linked list from `newTable`. We insert each element in turn at the // head of its appropriate `newTable` linked list. while (oldNext != UNSET) { int entryIndex = oldNext - 1; int oldEntry = entries[entryIndex];
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0)