|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/ilist_node.h 150 typename ilist_detail::compute_node_options<T, Options...>::type> {
include/llvm/ADT/ilist_node_options.h 108 typedef T value_type;
109 typedef T *pointer;
110 typedef T &reference;
111 typedef const T *const_pointer;
112 typedef const T &const_reference;
122 typedef node_options<T, extract_sentinel_tracking<Options...>::value,
include/llvm/ADT/simple_ilist.h 79 : ilist_detail::compute_node_options<T, Options...>::type::list_base_type,
81 typename ilist_detail::compute_node_options<T, Options...>::type> {
85 typename ilist_detail::compute_node_options<T, Options...>::type;
unittests/ADT/SimpleIListTest.cpp 16 struct Node : ilist_node<Node> {};
17 bool operator<(const Node &L, const Node &R) { return &L < &R; }
17 bool operator<(const Node &L, const Node &R) { return &L < &R; }
18 bool makeFalse(const Node &, const Node &) { return false; }
18 bool makeFalse(const Node &, const Node &) { return false; }
20 struct deleteNode : std::default_delete<Node> {};
21 void doNothing(Node *) {}
24 simple_ilist<Node> L;
31 simple_ilist<Node> L;
32 Node A, B;
50 simple_ilist<Node> L;
51 Node A, B;
69 simple_ilist<Node> L1, L2;
70 Node A, B;
83 simple_ilist<Node> L;
84 Node A, B;
94 simple_ilist<Node> L;
95 Node A, B;
105 simple_ilist<Node> L;
106 Node A, B, C;
129 simple_ilist<Node> L;
130 Node A, C;
131 Node *B = new Node;
131 Node *B = new Node;
147 simple_ilist<Node> L;
148 Node A, B, C;
164 simple_ilist<Node> L;
165 Node A, B, C;
181 simple_ilist<Node> L;
182 Node A, B, C;
198 simple_ilist<Node> L;
199 Node A, C;
200 Node *B = new Node;
200 Node *B = new Node;
216 simple_ilist<Node> L;
217 Node A, B, C;
233 simple_ilist<Node> L;
234 Node A, B, C, D, E;
257 simple_ilist<Node> L;
258 Node A, *B = new Node, *C = new Node, *D = new Node, E;
258 Node A, *B = new Node, *C = new Node, *D = new Node, E;
258 Node A, *B = new Node, *C = new Node, *D = new Node, E;
258 Node A, *B = new Node, *C = new Node, *D = new Node, E;
282 simple_ilist<Node> L;
283 Node A, B, C, D, E;
307 simple_ilist<Node> L;
308 Node A, B;
317 simple_ilist<Node> L;
318 Node *A = new Node;
318 Node *A = new Node;
319 Node *B = new Node;
319 Node *B = new Node;
328 simple_ilist<Node> L;
329 Node A, B;
338 simple_ilist<Node> L1, L2;
339 Node A, B, C, D;
362 simple_ilist<Node> L1, L2;
363 Node A, B, C, D, E;
389 simple_ilist<Node> L1, L2;
390 Node A, B, C, D, E, F;
419 simple_ilist<Node> L1, L2;
420 Node Ns[10];
450 for (Node &N : Ns)
457 simple_ilist<Node> L1, L2;
458 Node Ns[5];
512 simple_ilist<Node> L1, L2;
513 Node Ns[4];
534 for (Node &N : Ns)
541 simple_ilist<Node> L1, L2;
548 simple_ilist<Node> L;
549 Node Ns[10];
563 for (Node &N : Ns)
569 simple_ilist<Node> L;
570 Node Ns[10];
598 simple_ilist<Node> L;
usr/include/c++/7.4.0/bits/stl_function.h 121 typedef _Arg1 first_argument_type;
124 typedef _Arg2 second_argument_type;
381 struct less : public binary_function<_Tp, _Tp, bool>
381 struct less : public binary_function<_Tp, _Tp, bool>
385 operator()(const _Tp& __x, const _Tp& __y) const
385 operator()(const _Tp& __x, const _Tp& __y) const
usr/include/c++/7.4.0/bits/unique_ptr.h 68 default_delete(const default_delete<_Up>&) noexcept { }
72 operator()(_Tp* __ptr) const
74 static_assert(!is_void<_Tp>::value,
76 static_assert(sizeof(_Tp)>0,
usr/include/c++/7.4.0/type_traits 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
utils/unittest/googletest/include/gtest/gtest-printers.h 407 T* p, ::std::ostream* os) {
416 if (IsTrue(ImplicitlyConvertible<T*, const void*>::value)) {