Searched refs:deque (Results 1 - 25 of 549) sorted by path

1234567891011>>

/prebuilts/devtools/tools/lib/
H A Dguava-13.0.1.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/common/ com/google/common/collect/ ...
H A Dguava-17.0.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...
H A Dguava-18.0.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...
H A Djython-standalone-2.5.3.jarMETA-INF/MANIFEST.MF META-INF/LICENSE META-INF/NOTICE META-INF/maven/jline/ ...
/prebuilts/eclipse/maven/apache-maven-3.2.1/lib/
H A Dguava-14.0.1.jarMETA-INF/MANIFEST.MF META-INF/ META-INF/maven/ META-INF/maven/com. ...
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/
H A Dstl_deque.h53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra template
664 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
685 * the initial number of elements in the deque i
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
1957 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1975 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1983 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1990 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1997 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
2004 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_queue.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
84 * sequence/container. It defaults to std::deque, but it can be any type
92 template<typename _Tp, typename _Sequence = deque<_Tp> >
344 * and random-access iterators, such as std::deque or an
H A Dstl_stack.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
85 * sequence/container. It defaults to std::deque, but it can be
95 template<typename _Tp, typename _Sequence = deque<_Tp> >
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/
H A Dstl_deque.h53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra template
664 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
685 * the initial number of elements in the deque i
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
1957 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1975 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1983 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1990 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1997 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
2004 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_queue.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
84 * sequence/container. It defaults to std::deque, but it can be any type
92 template<typename _Tp, typename _Sequence = deque<_Tp> >
344 * and random-access iterators, such as std::deque or an
H A Dstl_stack.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
85 * sequence/container. It defaults to std::deque, but it can be
95 template<typename _Tp, typename _Sequence = deque<_Tp> >
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/bits/
H A Dstl_deque.h53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra template
664 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
685 * the initial number of elements in the deque i
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
1957 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1975 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1983 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1990 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1997 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
2004 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_queue.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
84 * sequence/container. It defaults to std::deque, but it can be any type
92 template<typename _Tp, typename _Sequence = deque<_Tp> >
344 * and random-access iterators, such as std::deque or an
H A Dstl_stack.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
85 * sequence/container. It defaults to std::deque, but it can be
95 template<typename _Tp, typename _Sequence = deque<_Tp> >
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/c++/4.8.3/x86_64-w64-mingw32/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/
H A Dstl_deque.h53 * Do not attempt to use it directly. @headername{deque}
95 * @brief A deque::iterator.
98 * deque is actually passed off to this class. A deque holds two
429 * Deque base class. This class provides the unified face for %deque's
485 //This struct encapsulates the implementation of the std::deque
659 * In previous HP/SGI versions of deque, there was an extra template
664 * Here's how a deque<Tp> manages memory. Each deque has 4 members:
685 * the initial number of elements in the deque i
730 class deque : protected _Deque_base<_Tp, _Alloc> class in inherits:_Deque_base
782 deque() function in class:deque
790 deque(const allocator_type& __a) function in class:deque
802 deque(size_type __n) function in class:deque
814 deque(size_type __n, const value_type& __value, function in class:deque
828 deque(size_type __n, const value_type& __value = value_type(), function in class:deque
841 deque(const deque& __x) function in class:deque
855 deque(deque&& __x) function in class:deque
869 deque(initializer_list<value_type> __l, function in class:deque
896 deque(_InputIterator __first, _InputIterator __last, function in class:deque
902 deque(_InputIterator __first, _InputIterator __last, function in class:deque
1957 operator ==(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1975 operator <(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1983 operator !=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1990 operator >(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
1997 operator <=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
2004 operator >=(const deque<_Tp, _Alloc>& __x, const deque<_Tp, _Alloc>& __y) argument
[all...]
H A Dstl_queue.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
84 * sequence/container. It defaults to std::deque, but it can be any type
92 template<typename _Tp, typename _Sequence = deque<_Tp> >
344 * and random-access iterators, such as std::deque or an
H A Dstl_stack.h72 * @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
85 * sequence/container. It defaults to std::deque, but it can be
95 template<typename _Tp, typename _Sequence = deque<_Tp> >
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/
H A Dstdc++.h67 #include <deque>
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/
H A Dstdc++.h67 #include <deque>

Completed in 822 milliseconds

1234567891011>>