/external/chromium_org/third_party/WebKit/Source/wtf/ |
DoubleBufferedDeque.h | 8 #include "wtf/Deque.h" 30 Deque<T>& swapBuffers() 39 Deque<T> m_queue[2];
|
Deque.h | 33 // FIXME: Could move what Vector and Deque share into a separate file. 34 // Deque doesn't actually use Vector. 46 class Deque : public VectorDestructorBase<Deque<T, inlineCapacity, Allocator>, T, (inlineCapacity > 0), Allocator::isGarbageCollected> { 47 WTF_USE_ALLOCATOR(Deque, Allocator); 56 Deque(); 57 Deque(const Deque<T, inlineCapacity, Allocator>&); 59 Deque<T, 0, Allocator>& operator=(const Deque&) [all...] |
DequeTest.cpp | 28 #include "wtf/Deque.h" 39 Deque<int> intDeque; 44 void checkNumberSequence(Deque<int>& deque, int from, int to, bool increment) 46 Deque<int>::iterator it = increment ? deque.begin() : deque.end(); 47 size_t index = increment ? 0 : deque.size(); 56 EXPECT_EQ(i, deque[index]); 63 EXPECT_EQ(increment ? deque.end() : deque.begin(), it) [all...] |
DoubleBufferedDequeTest.cpp | 40 Deque<int>& deque = queue.swapBuffers(); local 41 EXPECT_EQ(1, deque.takeFirst()); 42 EXPECT_EQ(10, deque.takeFirst()); 43 EXPECT_EQ(100, deque.takeFirst());
|
StreamBuffer.h | 34 #include "wtf/Deque.h" 110 Deque<OwnPtr<Block> > m_buffer;
|
/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/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/src/org/chromium/devtools/jsdoc/checks/ |
ContextTrackingState.java | 7 import java.util.Deque; 20 final Deque<TypeRecord> typeRecords = new LinkedList<>(); 21 final Deque<FunctionRecord> functionRecords = new LinkedList<>();
|
/external/chromium_org/third_party/WebKit/Source/platform/text/ |
SegmentedString.cpp | 34 Deque<SegmentedSubstring>::const_iterator it = m_substrings.begin(); 35 Deque<SegmentedSubstring>::const_iterator e = m_substrings.end(); 46 Deque<SegmentedSubstring>::iterator it = m_substrings.begin(); 47 Deque<SegmentedSubstring>::iterator e = m_substrings.end(); 132 Deque<SegmentedSubstring>::const_iterator it = s.m_substrings.begin(); 133 Deque<SegmentedSubstring>::const_iterator e = s.m_substrings.end(); 145 Deque<SegmentedSubstring>::const_reverse_iterator it = s.m_substrings.rbegin(); 146 Deque<SegmentedSubstring>::const_reverse_iterator e = s.m_substrings.rend(); 183 Deque<SegmentedSubstring>::const_iterator it = m_substrings.begin(); 184 Deque<SegmentedSubstring>::const_iterator e = m_substrings.end() [all...] |
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
SQLTransactionCoordinator.h | 36 #include "wtf/Deque.h" 56 typedef Deque<RefPtrWillBeMember<SQLTransactionBackend> > TransactionsQueue;
|
SQLTransactionBackend.h | 35 #include "wtf/Deque.h" 128 Deque<RefPtrWillBeMember<SQLStatementBackend> > m_statementQueue;
|
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/ |
Dispatcher.java | 20 import java.util.Deque; 42 private final Deque<Job> readyJobs = new ArrayDeque<Job>(); 45 private final Deque<Job> runningJobs = new ArrayDeque<Job>();
|
/external/chromium_org/tools/clang/blink_gc_plugin/tests/ |
trace_collections.h | 20 Deque<Member<HeapObject>, 0, HeapAllocator> m_wtfDeque;
|
/libcore/luni/src/main/java/java/util/ |
Deque.java | 15 * both ends. The name <i>deque</i> is short for "double ended queue" 16 * and is usually pronounced "deck". Most <tt>Deque</tt> 22 * ends of the deque. Methods are provided to insert, remove, and 28 * <tt>Deque</tt> implementations; in most implementations, insert 71 * <p>This interface extends the {@link Queue} interface. When a deque is 73 * added at the end of the deque and removed from the beginning. The methods 75 * <tt>Deque</tt> methods as indicated in the following table: 81 * <td ALIGN=CENTER> <b>Equivalent <tt>Deque</tt> Method</b></td> 111 * When a deque is used as a stack, elements are pushed and popped from the 112 * beginning of the deque. Stack methods are precisely equivalent t [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
HTMLScriptRunner.h | 32 #include "wtf/Deque.h" 91 Deque<PendingScript> m_scriptsToExecuteAfterParsing; // http://www.whatwg.org/specs/web-apps/current-work/#list-of-scripts-that-will-execute-when-the-document-has-finished-parsing
|
/external/chromium_org/third_party/WebKit/Source/platform/scheduler/ |
Scheduler.h | 92 bool executeHighPriorityTasks(Deque<TracedTask>&);
|
Scheduler.cpp | 229 // One the buffers have been swapped we can safely access the returned deque without having to lock. 231 Deque<TracedTask>& highPriorityTasks = m_pendingHighPriorityTasks.swapBuffers(); 242 // One the buffers have been swapped we can safely access the returned deque without having to lock. 244 Deque<TracedTask>& highPriorityTasks = m_pendingHighPriorityTasks.swapBuffers(); 261 bool Scheduler::executeHighPriorityTasks(Deque<TracedTask>& highPriorityTasks)
|
/libcore/luni/src/main/java/java/util/concurrent/ |
BlockingDeque.java | 11 * A {@link Deque} that additionally supports blocking operations that wait 12 * for the deque to become non-empty when retrieving an element, and wait for 13 * space to become available in the deque when storing an element. 171 public interface BlockingDeque<E> extends BlockingQueue<E>, Deque<E> { 180 * Inserts the specified element at the front of this deque if it is 183 * available. When using a capacity-restricted deque, it is generally 195 * Inserts the specified element at the end of this deque if it is 198 * available. When using a capacity-restricted deque, it is generally 210 * Inserts the specified element at the front of this deque if it is 214 * When using a capacity-restricted deque, this method is generall [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/heap/ |
Visitor.h | 37 #include "wtf/Deque.h" 308 void trace(const Deque<T, N>& deque) 310 OffHeapCollectionTraceTrait<Deque<T, N> >::trace(this, deque); 475 struct OffHeapCollectionTraceTrait<WTF::Deque<T, N> > { 476 typedef WTF::Deque<T, N> Deque; 478 static void trace(Visitor* visitor, const Deque& deque) [all...] |
/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,
|
/external/chromium_org/third_party/WebKit/Source/modules/websockets/ |
MainThreadWebSocketChannel.h | 44 #include "wtf/Deque.h" 229 Deque<OwnPtr<QueuedFrame> > m_outgoingFrameQueue; 231 Deque<FramingOverhead> m_framingOverheadQueue;
|
/external/okhttp/benchmarks/src/main/java/com/squareup/okhttp/benchmarks/ |
NettyHttpClient.java | 46 import java.util.Deque; 56 private final Deque<HttpChannel> freeChannels = new ArrayDeque<HttpChannel>(); 57 private final Deque<URL> backlog = new ArrayDeque<URL>();
|
/external/chromium_org/third_party/WebKit/Source/core/html/forms/ |
FormController.cpp | 28 #include "wtf/Deque.h" 192 typedef HashMap<FormElementKey, Deque<FormControlState>, FormElementKeyHash, FormElementKeyHashTraits> FormElementStateMap; 234 const Deque<FormControlState>& queue = it->value; 235 for (Deque<FormControlState>::const_iterator queIterator = queue.begin(); queIterator != queue.end(); ++queIterator) { 250 Deque<FormControlState> stateList; 279 const Deque<FormControlState>& queue = it->value; 280 for (Deque<FormControlState>::const_iterator queIterator = queue.begin(); queIterator != queue.end(); ++queIterator) {
|