/packages/apps/UnifiedEmail/src/com/android/mail/utils/ |
DequeMap.java | 23 import java.util.Deque; 27 * A Map of Deques. Each entry at key K has a deque of values V. 36 private final Map<K, Deque<V>> mMap = Maps.newHashMap(); 39 * Add a value V to the deque stored under key K. 43 Deque<V> pile = mMap.get(key); 52 * Removes and returns the first value V from the deque of Vs for key K, or null if no such Vs 55 * @see Deque#poll() 61 final Deque<V> pile = mMap.get(key); 69 * Returns, but does not remove, the first value V from the deque of Vs for key K, or null if 72 * @see Deque#peek( [all...] |
ObjectCache.java | 22 import java.util.Deque; 35 private final Deque<T> mDataStore = Lists.newLinkedList();
|
InputSmoother.java | 8 import java.util.Deque; 37 private final Deque<Sample> mRecentSamples = Lists.newLinkedList();
|
/libcore/support/src/test/java/tests/io/ |
MockOs.java | 26 import java.util.Deque; 37 private final InheritableThreadLocal<Map<String, Deque<InvocationHandler>>> handlers 38 = new InheritableThreadLocal<Map<String, Deque<InvocationHandler>>>() { 39 @Override protected Map<String, Deque<InvocationHandler>> initialValue() { 40 return new HashMap<String, Deque<InvocationHandler>>(); 88 public Deque<InvocationHandler> getHandlers(String methodName) { 89 Map<String, Deque<InvocationHandler>> threadFaults = handlers.get(); 90 Deque<InvocationHandler> result = threadFaults.get(methodName); 103 Deque<InvocationHandler> handlers = getHandlers(methodName);
|
/external/dagger2/compiler/src/main/java/dagger/internal/codegen/ |
MissingBindingSuggestions.java | 20 import java.util.Deque; 35 Deque<BindingGraph> graphsToTry = new ArrayDeque<>();
|
BindingGraphValidator.java | 48 import java.util.Deque; 241 Deque<ResolvedRequest> bindingPath, 279 Deque<ResolvedRequest> path, ResolvedBindings resolvedBinding) { 375 Deque<ResolvedRequest> path, Set<ContributionBinding> mapBindings) { 392 Deque<ResolvedRequest> path, Set<ContributionBinding> contributionBindings) { 407 Binding binding, final Deque<ResolvedRequest> path) { 531 Deque<TypeElement> componentStack) { 674 Deque<Scope> scopeStack, 675 Deque<TypeElement> scopedDependencyStack) { [all...] |
/frameworks/opt/telephony/src/java/com/android/internal/telephony/metrics/ |
InProgressCallSession.java | 24 import java.util.Deque; 36 public final Deque<TelephonyCallSession.Event> events;
|
InProgressSmsSession.java | 24 import java.util.Deque; 37 public final Deque<SmsSession.Event> events;
|
/external/guava/guava/src/com/google/common/collect/ |
ForwardingDeque.java | 19 import java.util.Deque; 23 * A deque which forwards all its method calls to another deque. Subclasses 25 * deque as desired per the <a 38 implements Deque<E> { 43 @Override protected abstract Deque<E> delegate();
|
BinaryTreeTraverser.java | 27 import java.util.Deque; 100 private final Deque<T> stack; 135 private final Deque<T> stack; 180 private final Deque<T> stack; 207 private static <T> void pushIfPresent(Deque<T> stack, Optional<T> node) {
|
TreeTraverser.java | 25 import java.util.Deque; 85 private final Deque<Iterator<T>> stack;
|
Queues.java | 22 import java.util.Deque; 35 * Static utility methods pertaining to {@link Queue} and {@link Deque} instances. 75 ArrayDeque<E> deque = new ArrayDeque<E>(); local 76 Iterables.addAll(deque, elements); 77 return deque; 135 LinkedBlockingDeque<E> deque = new LinkedBlockingDeque<E>(); local 136 Iterables.addAll(deque, elements); 137 return deque; 368 * Returns a synchronized (thread-safe) deque backed by the specified deque. In order t [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
ForwardingDequeTest.java | 20 import java.util.Deque; 28 private Deque<String> forward; 38 final Deque<String> deque = createProxyInstance(Deque.class); local 40 @Override protected Deque<String> delegate() { 41 return deque;
|
SynchronizedDequeTest.java | 22 import java.util.Deque; 26 * Tests for {@link Synchronized#deque} and {@link Queues#synchronizedDeque}. 32 protected Deque<String> create() { 34 Deque<String> outer = Synchronized.deque(inner, inner.mutex); 39 private static final class TestDeque<E> implements Deque<E> { 40 private final Deque<E> delegate = Lists.newLinkedList();
|
/libcore/luni/src/main/java/java/util/concurrent/ |
BlockingDeque.java | 9 import java.util.Deque; 18 * A {@link Deque} that additionally supports blocking operations that wait 19 * for the deque to become non-empty when retrieving an element, and wait for 20 * space to become available in the deque when storing an element. 176 * @param <E> the type of elements held in this deque 178 public interface BlockingDeque<E> extends BlockingQueue<E>, Deque<E> { 187 * Inserts the specified element at the front of this deque if it is 190 * available. When using a capacity-restricted deque, it is generally 202 * Inserts the specified element at the end of this deque if it is 205 * available. When using a capacity-restricted deque, it is generall [all...] |
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/ |
Dispatcher.java | 22 import java.util.Deque; 44 private final Deque<AsyncCall> readyCalls = new ArrayDeque<>(); 47 private final Deque<AsyncCall> runningCalls = new ArrayDeque<>(); 50 private final Deque<Call> executedCalls = new ArrayDeque<>();
|
/libcore/ojluni/src/main/java/java/util/ |
Deque.java | 43 * both ends. The name <i>deque</i> is short for "double ended queue" 44 * and is usually pronounced "deck". Most {@code Deque} 50 * ends of the deque. Methods are provided to insert, remove, and 56 * {@code Deque} implementations; in most implementations, insert 63 * <caption>Summary of Deque methods</caption> 78 * <td>{@link Deque#addFirst addFirst(e)}</td> 79 * <td>{@link Deque#offerFirst offerFirst(e)}</td> 80 * <td>{@link Deque#addLast addLast(e)}</td> 81 * <td>{@link Deque#offerLast offerLast(e)}</td> 85 * <td>{@link Deque#removeFirst removeFirst()}</td [all...] |
/packages/apps/TV/src/com/android/tv/recommendation/ |
ChannelRecord.java | 29 import java.util.Deque; 35 private final Deque<WatchedProgram> mWatchHistory;
|
/external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
Chain.java | 23 import java.util.Deque; 121 Deque<Chain> reverse() { 122 Deque<Chain> reverseChain = new ArrayDeque<Chain>(8);
|
ObjectExplorer.java | 29 import java.util.Deque; 100 Deque<Chain> stack = new ArrayDeque<Chain>(32);
|
/cts/tools/tradefed-host/src/com/android/cts/tradefed/result/ |
TestCase.java | 27 import java.util.Deque; 129 * @param parentSuiteNames a {@link Deque} of parent suite names. Used to 133 void addTestsWithStatus(Collection<TestIdentifier> tests, Deque<String> parentSuiteNames,
|
TestPackageResult.java | 32 import java.util.Deque; 222 Deque<String> suiteNames = new LinkedList<String>();
|
TestSuite.java | 26 import java.util.Deque; 204 * @param parentSuiteNames a {@link Deque} of parent suite names. Used to construct the full 208 void addTestsWithStatus(Collection<TestIdentifier> tests, Deque<String> parentSuiteNames,
|
/external/guava/guava/src/com/google/common/io/ |
Closer.java | 29 import java.util.Deque; 110 private final Deque<Closeable> stack = new ArrayDeque<Closeable>(4);
|
/external/okhttp/benchmarks/src/main/java/com/squareup/okhttp/benchmarks/ |
NettyHttpClient.java | 45 import java.util.Deque; 55 private final Deque<HttpChannel> freeChannels = new ArrayDeque<>(); 56 private final Deque<HttpUrl> backlog = new ArrayDeque<>();
|