30   ilist<Node> List;  in TEST()  local
31   List.push_back(Node(1));  in TEST()
32   EXPECT_EQ(1, List.back().Value);  in TEST()
33   EXPECT_EQ(nullptr, List.getPrevNode(List.back()));  in TEST()
34   EXPECT_EQ(nullptr, List.getNextNode(List.back()));  in TEST()
36   List.push_back(Node(2));  in TEST()
37   EXPECT_EQ(2, List.back().Value);  in TEST()
38   EXPECT_EQ(2, List.getNextNode(List.front())->Value);  in TEST()
39   EXPECT_EQ(1, List.getPrevNode(List.back())->Value);  in TEST()
41   const ilist<Node> &ConstList = List;  in TEST()
48   ilist<Node> List;  in TEST()  local
49   List.push_back(1);  in TEST()
52   List.splice(List.begin(), List, List.begin());  in TEST()
53   EXPECT_EQ(1u, List.size());  in TEST()
54   EXPECT_EQ(1, List.front().Value);  in TEST()
55   EXPECT_TRUE(std::next(List.begin()) == List.end());  in TEST()
58   List.push_back(2);  in TEST()
59   List.push_back(3);  in TEST()
60   List.splice(std::next(List.begin()), List, List.begin());  in TEST()
61   EXPECT_EQ(3u, List.size());  in TEST()
62   EXPECT_EQ(1, List.front().Value);  in TEST()
63   EXPECT_EQ(2, std::next(List.begin())->Value);  in TEST()
64   EXPECT_EQ(3, List.back().Value);  in TEST()
68   ilist<Node> List;  in TEST()  local
71   List.clearAndLeakNodesUnsafely();  in TEST()
72   EXPECT_EQ(0u, List.size());  in TEST()
75   ilist<Node>::iterator E = List.end();  in TEST()
76   List.clearAndLeakNodesUnsafely();  in TEST()
77   EXPECT_EQ(0u, List.size());  in TEST()
79   EXPECT_TRUE(E == List.end());  in TEST()
82   List.push_back(1);  in TEST()
83   ASSERT_EQ(1u, List.size());  in TEST()
84   Node *N = &*List.begin();  in TEST()
86   List.clearAndLeakNodesUnsafely();  in TEST()
87   EXPECT_EQ(0u, List.size());  in TEST()
92   List.push_back(5);  in TEST()
93   List.push_back(6);  in TEST()
94   ASSERT_EQ(2u, List.size());  in TEST()
95   EXPECT_EQ(5, List.front().Value);  in TEST()
96   EXPECT_EQ(6, List.back().Value);  in TEST()