19 struct Node : ilist_node<Node> {  struct
22   Node() {}  in Node()  argument
23   Node(int Value) : Value(Value) {}  in Node()  argument
24   Node(const Node&) = default;
25   ~Node() { Value = -1; }  in ~Node()  argument
29   ilist<Node> List;  in TEST()
30   List.push_back(new Node(1));  in TEST()
35   List.push_back(new Node(2));  in TEST()
40   const ilist<Node> &ConstList = List;  in TEST()
47   Node L1Nodes[] = {Node(0), Node(1)};  in TEST()
48   Node L2Nodes[] = {Node(0), Node(1)};  in TEST()
49   ilist<Node> L1, L2, L3;  in TEST()
56   L2.cloneFrom(L1, [&](const Node &N) { return &L2Nodes[N.Value]; });  in TEST()
59   L3.push_back(new Node(7));  in TEST()
60   L3.cloneFrom(L1, [](const Node &N) { return new Node(N); });  in TEST()
78   ilist<Node> List;  in TEST()
79   List.push_back(new Node(1));  in TEST()
88   List.push_back(new Node(2));  in TEST()
89   List.push_back(new Node(3));  in TEST()
98   ilist<Node> L;  in TEST()
99   Node N0(0);  in TEST()
100   Node N1(1);  in TEST()
114   ilist<Node> L;  in TEST()
115   Node N0(0);  in TEST()
116   Node N1(1);  in TEST()
130   ilist<Node> List;  in TEST()
137   ilist<Node>::iterator E = List.end();  in TEST()
144   List.push_back(new Node(1));  in TEST()
146   Node *N = &*List.begin();  in TEST()
154   List.push_back(new Node(5));  in TEST()
155   List.push_back(new Node(6));  in TEST()
164   static_assert(!ilist_detail::HasObsoleteCustomization<Empty, Node>::value,  in TEST()
169   Node *getNext(Node *);
172   static_assert(ilist_detail::HasGetNext<GetNext, Node>::value,  in TEST()
174   static_assert(ilist_detail::HasObsoleteCustomization<GetNext, Node>::value,  in TEST()
178   static_assert(!ilist_detail::HasGetNext<Empty, Node>::value,  in TEST()
183   Node *createSentinel();
189       ilist_detail::HasObsoleteCustomization<CreateSentinel, Node>::value,  in TEST()