Searched defs:deque (Results 1 - 25 of 62) sorted by relevance

123

/external/python/cpython2/Lib/
H A Dmutex.py18 from collections import deque namespace
24 self.queue = deque()
H A Dast.py209 from collections import deque namespace
210 todo = deque([node])
H A DQueue.py8 from collections import deque namespace
198 self.queue = deque()
H A Dshlex.py12 from collections import deque namespace
49 self.pushback = deque()
53 self.filestack = deque()
H A Dasynchat.py52 from collections import deque namespace
82 # a pure deque, which the original fifo was a wrapping of
83 self.producer_fifo = deque()
280 self.list = deque()
282 self.list = deque(list)
H A Dcollections.py6 * deque list-like container with fast appends and pops on either end
13 __all__ = ['Counter', 'deque', 'defaultdict', 'namedtuple', 'OrderedDict']
20 from _collections import deque, defaultdict namespace
/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h18 * std::deque such that for data types with alignment issues the correct allocator
25 class deque<__VA_ARGS__, std::allocator<__VA_ARGS__> > \
26 : public deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
28 typedef deque<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > deque_base; \
34 explicit deque(const allocator_type& a = allocator_type()) : deque_base(a) {} \
36 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
37 deque(const deque& c) : deque_base(c) {} \
38 explicit deque(size_type num, const value_type& val = value_type()) : deque_base(num, val) {} \
39 deque(iterato
72 class deque<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std
[all...]
/external/python/cpython3/Lib/
H A Dast.py221 from collections import deque namespace
222 todo = deque([node])
H A Dasynchat.py49 from collections import deque namespace
77 # a pure deque, which the original fifo was a wrapping of
78 self.producer_fifo = deque()
H A Dqueue.py7 from collections import deque namespace
200 self.queue = deque()
H A Dshlex.py13 from collections import deque namespace
48 self.pushback = deque()
52 self.filestack = deque()
61 self._pushback_chars = deque()
H A Dcontextlib.py4 from collections import deque namespace
272 self._exit_callbacks = deque()
278 self._exit_callbacks = deque()
/external/autotest/client/site_tests/platform_CrosDisksArchive/
H A Dplatform_CrosDisksArchive.py15 from collections import deque namespace
37 dirs_to_explore = deque([''])
/external/chromium-trace/catapult/systrace/profile_chrome/third_party/
H A Dperf_to_tracing.py10 from collections import deque namespace
158 chain = deque()
/external/guava/guava/src/com/google/common/collect/
H A DQueues.java75 ArrayDeque<E> deque = new ArrayDeque<E>();
76 Iterables.addAll(deque, elements);
77 return deque;
135 LinkedBlockingDeque<E> deque = new LinkedBlockingDeque<E>();
136 Iterables.addAll(deque, elements);
137 return deque;
368 * Returns a synchronized (thread-safe) deque backed by the specified deque. In order to
369 * guarantee serial access, it is critical that <b>all</b> access to the backing deque is
370 * accomplished through the returned deque
394 synchronizedDeque(Deque<E> deque) argument
[all...]
/external/python/cpython3/Lib/test/
H A Dtest_contains.py1 from collections import deque namespace
79 constructors = list, tuple, dict.fromkeys, set, frozenset, deque
H A Dtest_iterlen.py22 dicts, sets, and collections.deque. Their implementation is equally simple
46 from collections import deque namespace
104 d = deque(range(n))
111 d = deque(range(n))
/external/libchrome/base/trace_event/
H A Dmemory_usage_estimator_unittest.cc229 std::deque<Data> deque; local
232 // for deque's blocks is small compared to usage of all items.
235 deque.push_back(Data(kDataSize));
239 size_t min_expected_usage = deque.size() * (sizeof(Data) + kDataSize);
240 EXPECT_LE(min_expected_usage, EstimateMemoryUsage(deque));
H A Dmemory_usage_estimator.h11 #include <deque>
143 size_t EstimateMemoryUsage(const std::deque<T, A>& deque);
478 // std::deque
481 size_t EstimateMemoryUsage(const std::deque<T, A>& deque) { argument
482 // Since std::deque implementations are wildly different
506 size_t blocks = (deque.size() + block_length - 1) / block_length;
509 // libstdc++: deque always has at least one block
515 // libc++: deque keep
[all...]
/external/python/cpython2/Lib/test/
H A Dtest_iterlen.py22 dicts, sets, and collections.deque. Their implementation is equally simple
47 from collections import deque namespace
119 d = deque(xrange(n))
126 d = deque(xrange(n))
/external/python/cpython3/Lib/email/
H A Dfeedparser.py28 from collections import deque namespace
58 # A deque of full, pushed lines
59 self._lines = deque()
/external/fonttools/Lib/fontTools/ttLib/tables/
H A DE_B_L_C_.py9 from collections import deque namespace
455 idQueue = deque(glyphIds)
456 locQueue = deque(self.locations)
/external/fonttools/Tools/fontTools/ttLib/tables/
H A DE_B_L_C_.py9 from collections import deque namespace
455 idQueue = deque(glyphIds)
456 locQueue = deque(self.locations)
/external/libmojo/third_party/jinja2/
H A Dsandbox.py46 from collections import deque namespace
89 (deque, frozenset([
154 (list, dict, set or deque) would modify it if called. It also supports
/external/nanopb-c/generator/google/protobuf/
H A Dtext_format.py38 from collections import deque namespace
321 self._lines = deque(text_message.split('\n'))

Completed in 552 milliseconds

123