29   ilist<Node> List;  in TEST()  local
30   List.push_back(Node(1));  in TEST()
31   EXPECT_EQ(1, List.back().Value);  in TEST()
32   EXPECT_EQ(0, List.back().getPrevNode());  in TEST()
33   EXPECT_EQ(0, List.back().getNextNode());  in TEST()
35   List.push_back(Node(2));  in TEST()
36   EXPECT_EQ(2, List.back().Value);  in TEST()
37   EXPECT_EQ(2, List.front().getNextNode()->Value);  in TEST()
38   EXPECT_EQ(1, List.back().getPrevNode()->Value);  in TEST()
40   const ilist<Node> &ConstList = List;  in TEST()
47   ilist<Node> List;  in TEST()  local
48   List.push_back(1);  in TEST()
51   List.splice(List.begin(), List, List.begin());  in TEST()
52   EXPECT_EQ(1u, List.size());  in TEST()
53   EXPECT_EQ(1, List.front().Value);  in TEST()
54   EXPECT_TRUE(llvm::next(List.begin()) == List.end());  in TEST()
57   List.push_back(2);  in TEST()
58   List.push_back(3);  in TEST()
59   List.splice(llvm::next(List.begin()), List, List.begin());  in TEST()
60   EXPECT_EQ(3u, List.size());  in TEST()
61   EXPECT_EQ(1, List.front().Value);  in TEST()
62   EXPECT_EQ(2, llvm::next(List.begin())->Value);  in TEST()
63   EXPECT_EQ(3, List.back().Value);  in TEST()
67   ilist<Node> List;  in TEST()  local
70   List.clearAndLeakNodesUnsafely();  in TEST()
71   EXPECT_EQ(0u, List.size());  in TEST()
74   ilist<Node>::iterator E = List.end();  in TEST()
75   List.clearAndLeakNodesUnsafely();  in TEST()
76   EXPECT_EQ(0u, List.size());  in TEST()
78   EXPECT_TRUE(E == List.end());  in TEST()
81   List.push_back(1);  in TEST()
82   ASSERT_EQ(1u, List.size());  in TEST()
83   Node *N = List.begin();  in TEST()
85   List.clearAndLeakNodesUnsafely();  in TEST()
86   EXPECT_EQ(0u, List.size());  in TEST()
91   List.push_back(5);  in TEST()
92   List.push_back(6);  in TEST()
93   ASSERT_EQ(2u, List.size());  in TEST()
94   EXPECT_EQ(5, List.front().Value);  in TEST()
95   EXPECT_EQ(6, List.back().Value);  in TEST()