29   ilist<Node> List;  in TEST()  local
30   List.push_back(new Node(1));  in TEST()
31   EXPECT_EQ(1, List.back().Value);  in TEST()
32   EXPECT_EQ(nullptr, List.getPrevNode(List.back()));  in TEST()
33   EXPECT_EQ(nullptr, List.getNextNode(List.back()));  in TEST()
35   List.push_back(new Node(2));  in TEST()
36   EXPECT_EQ(2, List.back().Value);  in TEST()
37   EXPECT_EQ(2, List.getNextNode(List.front())->Value);  in TEST()
38   EXPECT_EQ(1, List.getPrevNode(List.back())->Value);  in TEST()
40   const ilist<Node> &ConstList = List;  in TEST()
78   ilist<Node> List;  in TEST()  local
79   List.push_back(new Node(1));  in TEST()
82   List.splice(List.begin(), List, List.begin());  in TEST()
83   EXPECT_EQ(1u, List.size());  in TEST()
84   EXPECT_EQ(1, List.front().Value);  in TEST()
85   EXPECT_TRUE(std::next(List.begin()) == List.end());  in TEST()
88   List.push_back(new Node(2));  in TEST()
89   List.push_back(new Node(3));  in TEST()
90   List.splice(std::next(List.begin()), List, List.begin());  in TEST()
91   EXPECT_EQ(3u, List.size());  in TEST()
92   EXPECT_EQ(1, List.front().Value);  in TEST()
93   EXPECT_EQ(2, std::next(List.begin())->Value);  in TEST()
94   EXPECT_EQ(3, List.back().Value);  in TEST()
130   ilist<Node> List;  in TEST()  local
133   List.clearAndLeakNodesUnsafely();  in TEST()
134   EXPECT_EQ(0u, List.size());  in TEST()
137   ilist<Node>::iterator E = List.end();  in TEST()
138   List.clearAndLeakNodesUnsafely();  in TEST()
139   EXPECT_EQ(0u, List.size());  in TEST()
141   EXPECT_TRUE(E == List.end());  in TEST()
144   List.push_back(new Node(1));  in TEST()
145   ASSERT_EQ(1u, List.size());  in TEST()
146   Node *N = &*List.begin();  in TEST()
148   List.clearAndLeakNodesUnsafely();  in TEST()
149   EXPECT_EQ(0u, List.size());  in TEST()
154   List.push_back(new Node(5));  in TEST()
155   List.push_back(new Node(6));  in TEST()
156   ASSERT_EQ(2u, List.size());  in TEST()
157   EXPECT_EQ(5, List.front().Value);  in TEST()
158   EXPECT_EQ(6, List.back().Value);  in TEST()