| /freebsd-12.1/contrib/libstdc++/include/debug/ |
| H A D | deque | 1 // Debugging deque implementation -*- C++ -*- 31 /** @file debug/deque 38 #include <deque> 47 class deque 87 deque(const deque<_Tp,_Allocator>& __x) : _Base(__x), _Safe_base() { } 91 ~deque() { } 93 deque<_Tp,_Allocator>& 332 swap(deque<_Tp,_Allocator>& __x) 366 operator<(const deque<_Tp, _Alloc>& __lhs, const deque<_Tp, _Alloc>& __rhs) 383 operator>(const deque<_Tp, _Alloc>& __lhs, const deque<_Tp, _Alloc>& __rhs) [all …]
|
| /freebsd-12.1/contrib/libc++/include/ |
| H A D | deque | 21 class deque 51 deque(const deque& c); 52 deque(deque&& c) 56 deque(deque&& c, const allocator_type& a); 59 deque& operator=(const deque& c); 60 deque& operator=(deque&& c) 1244 deque(const deque& __c); 1261 deque& operator=(deque&& __c) 1543 deque<_Tp, _Allocator>::deque(const deque& __c) 1585 deque<_Tp, _Allocator>::deque(deque&& __c) [all …]
|
| H A D | version | 20 <deque> <forward_list> <list> 47 __cpp_lib_erase_if 201811L <string> <deque> <forward_list> 80 __cpp_lib_nonmember_container_access 201411L <iterator> <array> <deque>
|
| H A D | stack | 20 template <class T, class Container = deque<T>> 92 #include <deque> 100 template <class _Tp, class _Container = deque<_Tp> > class _LIBCPP_TEMPLATE_VIS stack; 112 template <class _Tp, class _Container /*= deque<_Tp>*/>
|
| H A D | module.modulemap | 266 module deque { 267 header "deque" 523 module deque { 524 header "experimental/deque"
|
| /freebsd-12.1/contrib/libc++/include/experimental/ |
| H A D | deque | 2 //===--------------------------- deque ------------------------------------===// 14 experimental/deque synopsis 23 using deque = std::deque<T,polymorphic_allocator<T>>; 33 #include <deque> 43 using deque = _VSTD::deque<_ValueT, polymorphic_allocator<_ValueT>>;
|
| /freebsd-12.1/contrib/libstdc++/include/bits/ |
| H A D | deque.tcc | 68 deque<_Tp, _Alloc>& in _GLIBCXX_BEGIN_NESTED_NAMESPACE() 69 deque<_Tp, _Alloc>:: in _GLIBCXX_BEGIN_NESTED_NAMESPACE() 90 deque<_Tp, _Alloc>:: 111 deque<_Tp, _Alloc>:: 134 deque<_Tp, _Alloc>:: 180 deque<_Tp, _Alloc>:: 222 deque<_Tp, _Alloc>:: 304 deque<_Tp, _Alloc>:: 327 deque<_Tp, _Alloc>:: 431 deque<_Tp, _Alloc>:: [all …]
|
| H A D | stl_deque.h | 691 deque() in deque() function 695 deque(const allocator_type& __a) in deque() function 718 deque(const deque& __x) in deque() function 753 ~deque() in ~deque() 763 deque& 764 operator=(const deque& __x); 1209 swap(deque& __x) in swap() 1580 const deque<_Tp, _Alloc>& __y) 1588 const deque<_Tp, _Alloc>& __y) 1595 const deque<_Tp, _Alloc>& __y) [all …]
|
| H A D | stl_stack.h | 97 template<typename _Tp, typename _Sequence = deque<_Tp> > in _GLIBCXX_BEGIN_NAMESPACE()
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | MachinePipeliner.h | 261 void fixupRegisterOverlaps(std::deque<SUnit *> &Instrs); 471 DenseMap<int, std::deque<SUnit *>> ScheduledInstrs; 537 using sched_iterator = DenseMap<int, std::deque<SUnit *>>::iterator; 539 DenseMap<int, std::deque<SUnit *>>::const_iterator; 591 std::deque<SUnit *> &getInstructions(int cycle) { in getInstructions() 598 std::deque<SUnit *> &Insts);
|
| /freebsd-12.1/contrib/libstdc++/include/backward/ |
| H A D | deque.h | 64 using std::deque;
|
| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.h | 523 std::deque<CodeGenSubRegIndex> SubRegIndices; 533 std::deque<CodeGenRegister> Registers; 618 const std::deque<CodeGenSubRegIndex> &getSubRegIndices() const { in getSubRegIndices() 634 const std::deque<CodeGenRegister> &getRegisters() { return Registers; } in getRegisters()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 58 std::deque<WorkListUnit> Queue; 93 std::deque<WorkListUnit> Queue;
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/AST/ |
| H A D | ASTStructuralEquivalence.h | 53 std::deque<Decl *> DeclsToCheck;
|
| /freebsd-12.1/contrib/llvm/lib/Target/Mips/ |
| H A D | Mips16ISelLowering.h | 48 std::deque< std::pair<unsigned, SDValue> > &RegsToPass,
|
| H A D | MipsSEISelLowering.h | 69 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | RegionPass.h | 90 std::deque<Region*> RQ;
|
| H A D | LoopPass.h | 155 std::deque<Loop *> LQ;
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/Utils/ |
| H A D | Evaluator.h | 103 std::deque<DenseMap<Value*, Constant*>> ValueStack;
|
| /freebsd-12.1/lib/libc++/ |
| H A D | Makefile | 145 STD_HEADERS+= deque 234 EXP_HEADERS+= deque
|
| /freebsd-12.1/contrib/llvm/include/llvm/Support/ |
| H A D | TaskQueue.h | 135 std::deque<std::function<void()>> Tasks;
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/ |
| H A D | Reassociate.h | 75 SetVector<AssertingVH<Instruction>, std::deque<AssertingVH<Instruction>>>;
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | FunctionSummary.h | 31 using SetOfDecls = std::deque<Decl *>;
|
| /freebsd-12.1/contrib/libstdc++/ |
| H A D | ChangeLog-2005 | 164 * testsuite/23_containers/deque/cons/assign/1.cc: New. 174 * testsuite/23_containers/deque/types/1.cc: Add. 222 * include/debug/deque 304 * include/bits/deque.tcc: Same. 368 * include/backward/deque.h: Same. 586 * include/bits/stl_deque.h (deque(const deque&)): Likewise. 591 * include/bits/stl_deque.h (deque<>::_M_erase_at_end, 595 (deque<>::~deque(), resize, clear, _M_assign_aux, _M_fill_assign): 597 * include/bits/deque.tcc (deque<>::operator=, _M_assign_aux): Same. 2734 * include/bits/stl_deque.h (deque::deque(size_type, value_type, [all …]
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Target/ |
| H A D | StackFrameRecognizer.cpp | 146 std::deque<RegisteredEntry> m_recognizers;
|