- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for traditional (0.22 sec)
-
android/guava/src/com/google/common/collect/ObjectCountLinkedHashMap.java
/** * {@code ObjectCountLinkedHashMap} is a subclass of {@code ObjectCountHashMap} with insertion * iteration order, and uses arrays to store key objects and count values. Comparing to using a * traditional {@code LinkedHashMap} implementation which stores keys and count values as map * entries, {@code ObjectCountLinkedHashMap} minimizes object allocation and reduces memory * footprint. */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/io/BaseEncoding.java
* <td>2.00 * <td>N/A * <td>Traditional hexadecimal. Defaults to upper case. * <tr> * <td>{@link #base32()} * <td>A-Z 2-7 * <td>1.60 * <td>= * <td>Human-readable; no possibility of mixing up 0/O or 1/I. Defaults to upper case. * <tr> * <td>{@link #base32Hex()} * <td>0-9 A-V * <td>1.60 * <td>= * <td>"Numerical" base 32; extended from the traditional hex alphabet. Defaults to upper case. * <tr>
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Mar 15 16:33:32 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
* <li>{@code ImmutableList.of(2, "A")} * <li>{@code ImmutableList.of(2, "B")} * <li>{@code ImmutableList.of(2, "C")} * </ul> * * <p>The result is guaranteed to be in the "traditional", lexicographical order for Cartesian * products that you would get from nesting for loops: * * <pre>{@code * for (B b0 : lists.get(0)) { * for (B b1 : lists.get(1)) { * ...
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* * <p>While {@code ReadWriteLock} instances have different properties and can form cycles without * potential deadlock, this class treats {@code ReadWriteLock} instances as equivalent to * traditional exclusive locks. Although this increases the false positives that the locks detect * (i.e. cycles that will not actually result in deadlock), it simplifies the algorithm and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/eventbus/EventBus.java
* <p>The EventBus allows publish-subscribe-style communication between components without requiring * the components to explicitly register with one another (and thus be aware of each other). It is * designed exclusively to replace traditional Java in-process event distribution using explicit * registration. It is not a general-purpose publish-subscribe system, nor is it intended * for interprocess communication. * * <h2>Receiving Events</h2> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Aug 25 16:37:57 GMT 2021 - 12.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * {@code ObjectCountHashMap} uses arrays to store key objects and count values. Comparing to using * a traditional {@code HashMap} implementation which stores keys and count values as map entries, * {@code ObjectCountHashMap} minimizes object allocation and reduces memory footprint. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* interrupted. * * Imagine a monitor with multiple guards. A thread enters the monitor, satisfies all the guards, * and leaves, calling signalNextWaiter. With traditional locks and conditions, all the conditions * need to be signalled because it is not known which if any of them have waiters (and hasWaiters
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) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
* href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al. * Unlike many other double-ended priority queues, it stores elements in a single array, as compact * as the traditional heap data structure used in {@link PriorityQueue}. * * <p>This class is not thread-safe, and does not accept null elements. * * <p><i>Performance notes:</i> * * <ul>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
* <li>{@code ImmutableList.of(2, "A")} * <li>{@code ImmutableList.of(2, "B")} * <li>{@code ImmutableList.of(2, "C")} * </ul> * * <p>The result is guaranteed to be in the "traditional", lexicographical order for Cartesian * products that you would get from nesting for loops: * * <pre>{@code * for (B b0 : sets.get(0)) { * for (B b1 : sets.get(1)) { * ...
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AtomicLongMap.java
import java.util.concurrent.atomic.AtomicLong; import javax.annotation.CheckForNull; /** * A map containing {@code long} values that can be atomically updated. While writes to a * traditional {@code Map} rely on {@code put(K, V)}, the typical mechanism for writing to this map * is {@code addAndGet(K, long)}, which adds a {@code long} to the value currently associated with
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 14.1K bytes - Viewed (0)