aboutsummaryrefslogtreecommitdiff
path: root/unittests/ADT/BreadthFirstIteratorTest.cpp
diff options
context:
space:
mode:
authorDimitry Andric <dim@FreeBSD.org>2017-04-16 16:01:22 +0000
committerDimitry Andric <dim@FreeBSD.org>2017-04-16 16:01:22 +0000
commit71d5a2540a98c81f5bcaeb48805e0e2881f530ef (patch)
tree5343938942df402b49ec7300a1c25a2d4ccd5821 /unittests/ADT/BreadthFirstIteratorTest.cpp
parent31bbf64f3a4974a2d6c8b3b27ad2f519caf74057 (diff)
Diffstat (limited to 'unittests/ADT/BreadthFirstIteratorTest.cpp')
-rw-r--r--unittests/ADT/BreadthFirstIteratorTest.cpp74
1 files changed, 74 insertions, 0 deletions
diff --git a/unittests/ADT/BreadthFirstIteratorTest.cpp b/unittests/ADT/BreadthFirstIteratorTest.cpp
new file mode 100644
index 000000000000..42a07bbe930b
--- /dev/null
+++ b/unittests/ADT/BreadthFirstIteratorTest.cpp
@@ -0,0 +1,74 @@
+//=== llvm/unittest/ADT/BreadthFirstIteratorTest.cpp - BFS iterator tests -===//
+//
+// The LLVM Compiler Infrastructure
+//
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
+//
+//===----------------------------------------------------------------------===//
+
+#include "llvm/ADT/BreadthFirstIterator.h"
+#include "TestGraph.h"
+#include "gtest/gtest.h"
+
+using namespace llvm;
+
+namespace llvm {
+
+TEST(BreadthFristIteratorTest, Basic) {
+ typedef bf_iterator<Graph<4>> BFIter;
+
+ Graph<4> G;
+ G.AddEdge(0, 1);
+ G.AddEdge(0, 2);
+ G.AddEdge(1, 3);
+
+ auto It = BFIter::begin(G);
+ auto End = BFIter::end(G);
+ EXPECT_EQ(It.getLevel(), 0U);
+ EXPECT_EQ(*It, G.AccessNode(0));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 1U);
+ EXPECT_EQ(*It, G.AccessNode(1));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 1U);
+ EXPECT_EQ(*It, G.AccessNode(2));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 2U);
+ EXPECT_EQ(*It, G.AccessNode(3));
+ ++It;
+ EXPECT_EQ(It, End);
+}
+
+TEST(BreadthFristIteratorTest, Cycle) {
+ typedef bf_iterator<Graph<4>> BFIter;
+
+ Graph<4> G;
+ G.AddEdge(0, 1);
+ G.AddEdge(1, 0);
+ G.AddEdge(1, 2);
+ G.AddEdge(2, 1);
+ G.AddEdge(2, 1);
+ G.AddEdge(2, 3);
+ G.AddEdge(3, 2);
+ G.AddEdge(3, 1);
+ G.AddEdge(3, 0);
+
+ auto It = BFIter::begin(G);
+ auto End = BFIter::end(G);
+ EXPECT_EQ(It.getLevel(), 0U);
+ EXPECT_EQ(*It, G.AccessNode(0));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 1U);
+ EXPECT_EQ(*It, G.AccessNode(1));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 2U);
+ EXPECT_EQ(*It, G.AccessNode(2));
+ ++It;
+ EXPECT_EQ(It.getLevel(), 3U);
+ EXPECT_EQ(*It, G.AccessNode(3));
+ ++It;
+ EXPECT_EQ(It, End);
+}
+
+} // end namespace llvm