Searched refs:deque (Results 1 - 25 of 27) sorted by relevance

12

/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/backward/
H A Ddeque.h62 #include <deque>
64 using std::deque;
/macosx-10.9.5/swig-10/Lib/ruby/
H A Dstd_deque.i9 struct traits_asptr<std::deque<T> > {
10 static int asptr(VALUE obj, std::deque<T> **vec) {
11 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
16 struct traits_from<std::deque<T> > {
17 static VALUE from(const std::deque<T> & vec) {
18 return traits_from_stdseq<std::deque<T> >::from(vec);
24 %ignore std::deque::push_back;
25 %ignore std::deque::pop_back;
H A Drubycontainer_extended.swg137 %__swig_container_extend_primtypes( std::deque );
/macosx-10.9.5/swig-10/Lib/ocaml/
H A Dstd_deque.i12 %rename(__getitem__) std::deque::getitem;
13 %rename(__setitem__) std::deque::setitem;
14 %rename(__delitem__) std::deque::delitem;
15 %rename(__getslice__) std::deque::getslice;
16 %rename(__setslice__) std::deque::setslice;
17 %rename(__delslice__) std::deque::delslice;
19 %extend std::deque {
/macosx-10.9.5/swig-10/Lib/std/
H A Dstd_deque.i2 // std::deque
8 %define %std_deque_methods(deque...)
9 %std_sequence_methods(deque)
15 %define %std_deque_methods_val(deque...)
16 %std_sequence_methods_val(deque)
23 // std::deque
28 // -- f(std::deque<T>), f(const std::deque<T>&):
30 // previously wrapped std::deque<T> can be passed.
31 // -- f(std::deque<
[all...]
H A D_std_deque.i7 * This file contains a generic definition of std::deque along with
15 #include <deque>
20 /* This macro defines all of the standard methods for a deque. This
24 template<> class deque<int> {
34 deque();
35 deque(unsigned int size, const T& value=T());
36 deque(const deque<T> &);
37 ~deque();
40 void swap(deque<
[all...]
H A DREADME10 std_deque.i deque
H A Dstd_container.i105 %feature("ignore") std::deque<Type >::deque(size_type size);
106 %feature("ignore") std::deque<Type >::resize(size_type size);
H A Dstd_queue.i60 template<class _Tp, class _Sequence = std::deque<_Tp> >
H A Dstd_stack.i59 template<class _Tp, class _Sequence = std::deque<_Tp> >
/macosx-10.9.5/swig-10/Lib/octave/
H A Dstd_deque.i7 struct traits_asptr<std::deque<T> > {
8 static int asptr(octave_value obj, std::deque<T> **vec) {
9 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
14 struct traits_from<std::deque<T> > {
15 static octave_value from(const std::deque<T> & vec) {
16 return traits_from_stdseq<std::deque<T> >::from(vec);
/macosx-10.9.5/swig-10/Lib/python/
H A Dstd_deque.i9 struct traits_asptr<std::deque<T> > {
10 static int asptr(PyObject *obj, std::deque<T> **vec) {
11 return traits_asptr_stdseq<std::deque<T> >::asptr(obj, vec);
16 struct traits_from<std::deque<T> > {
17 static PyObject *from(const std::deque<T> & vec) {
18 return traits_from_stdseq<std::deque<T> >::from(vec);
H A DREADME31 std_deque.i deque
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/
H A DRegionPass.h25 #include <deque>
83 std::deque<Region*> RQ;
H A DLoopPass.h22 #include <deque>
149 std::deque<Loop *> LQ;
/macosx-10.9.5/CF-855.17/
H A DCFArray.c120 /* Only applies to immutable and mutable-deque-using arrays;
127 struct __CFArrayDeque *deque = (struct __CFArrayDeque *)array->_store; local
128 return (struct __CFArrayBucket *)((uint8_t *)deque + sizeof(struct __CFArrayDeque) + deque->_leftIdx * sizeof(struct __CFArrayBucket));
215 struct __CFArrayDeque *deque = (struct __CFArrayDeque *)array->_store; local
216 if (0 < range.length && NULL != deque && !hasBeenFinalized(array)) {
232 if (NULL != deque) if (!CF_IS_COLLECTABLE_ALLOCATOR(allocator)) CFAllocatorDeallocate(allocator, deque);
714 __CFAssignWithWriteBarrier((void **)&bucket->_item, (void *)value); // GC: handles deque/CFStorage cases.
775 // may move deque storag
778 struct __CFArrayDeque *deque = (struct __CFArrayDeque *)array->_store; local
884 struct __CFArrayDeque *deque = (struct __CFArrayDeque *)array->_store; local
905 if (collectableMemory) auto_zone_release(objc_collectableZone(), deque); local
965 struct __CFArrayDeque *deque; local
973 if (CF_IS_COLLECTABLE_ALLOCATOR(allocator)) auto_zone_release(objc_collectableZone(), deque); // GC: now safe to unroot the array body. local
986 struct __CFArrayDeque *deque = (struct __CFArrayDeque *)array->_store; local
[all...]
/macosx-10.9.5/libstdcxx-60/include/c++/4.2.1/bits/
H A Dstl_deque.h89 * @brief A deque::iterator.
92 * deque is actually passed off to this class. A deque holds two
360 * Deque base class. This class provides the unified face for %deque's
394 //This struct encapsulates the implementation of the std::deque
556 * In previous HP/SGI versions of deque, there was an extra template
562 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
583 * the initial number of elements in the deque is small, the
601 * means that an empty deque mus
629 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
683 deque(const allocator_type& __a = allocator_type()) function in class:deque
694 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
706 deque(const deque& __x) function in class:deque
727 deque(_InputIterator __first, _InputIterator __last, function in class:deque
1549 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1567 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1575 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1582 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1589 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1596 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_stack.h87 * sequence/container. It defaults to std::deque, but it can be
97 template<typename _Tp, typename _Sequence = deque<_Tp> >
H A Dstl_queue.h86 * sequence/container. It defaults to std::deque, but it can be any type
94 template<typename _Tp, typename _Sequence = deque<_Tp> >
299 * and random-access iterators, such as std::deque or an
/macosx-10.9.5/Security-55471.14.18/libsecurity_codesigning/antlr2/antlr/
H A DTokenStreamSelector.hpp43 typedef ANTLR_USE_NAMESPACE(std)stack<TokenStream*, ANTLR_USE_NAMESPACE(std)deque<TokenStream*> > streamStack_coll;
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/
H A DLoopPass.cpp84 for (std::deque<Loop *>::iterator I = LQ.begin(),
116 for (std::deque<Loop *>::iterator I = LQ.begin(),
119 // deque does not support insert after.
163 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
198 for (std::deque<Loop *>::const_iterator I = LQ.begin(), E = LQ.end();
H A DRegionPass.cpp39 static void addRegionIntoQueue(Region *R, std::deque<Region *> &RQ) {
66 for (std::deque<Region *>::const_iterator I = RQ.begin(), E = RQ.end();
/macosx-10.9.5/llvmCore-3425.0.33/unittests/ADT/
H A DHashingTest.cpp17 #include <deque>
148 const std::deque<int> deque(begin(arr1), end(arr1));
149 EXPECT_EQ(arr1_hash, hash_combine_range(deque.begin(), deque.end()));
/macosx-10.9.5/Security-55471.14.18/libsecurity_codesigning/antlr2/src/
H A Ddll.cpp119 template class ANTLR_API ANTLR_USE_NAMESPACE(std)deque< TokenStream*, ANTLR_USE_NAMESPACE(std)allocator< TokenStream* > >; member in namespace:antlr
120 template class ANTLR_API ANTLR_USE_NAMESPACE(std)stack< TokenStream*, ANTLR_USE_NAMESPACE(std)deque<TokenStream*> >;
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/
H A DEarlyCSE.cpp28 #include <deque>
509 std::deque<StackNode *> nodesToProcess;

Completed in 211 milliseconds

12