[llvm] [ADT][NFCI]: Fix iterator category for graph iterators with external … (PR #116403)

[via llvm-commits]

github-actions[bot] wrote:

<!--LLVM CODE FORMAT COMMENT: {clang-format}-->


:warning: C/C++ code formatter, clang-format found issues in your code. :warning:

<details>
<summary>
You can test this locally with the following command:
</summary>

``````````bash
git-clang-format --diff af3295bd3dccd91c102d6a9b0d30c30844967e02 281bdffcffa97b0174c0b90c2bdfc6cdc49ebd32 --extensions h,cpp -- llvm/include/llvm/ADT/DepthFirstIterator.h llvm/include/llvm/ADT/PostOrderIterator.h llvm/unittests/ADT/BreadthFirstIteratorTest.cpp llvm/unittests/ADT/DepthFirstIteratorTest.cpp llvm/unittests/ADT/PostOrderIteratorTest.cpp
``````````

</details>

<details>
<summary>
View the diff from clang-format here.
</summary>

``````````diff
diff --git a/llvm/unittests/ADT/BreadthFirstIteratorTest.cpp b/llvm/unittests/ADT/BreadthFirstIteratorTest.cpp
index 096b357226..0cd7fd3f70 100644
--- a/llvm/unittests/ADT/BreadthFirstIteratorTest.cpp
+++ b/llvm/unittests/ADT/BreadthFirstIteratorTest.cpp
@@ -93,7 +93,7 @@ TEST(BreadthFristIteratorTest, MultiPassSafeWithInternalSet) {
   std::array<decltype(G)::NodeType *, 4> NodesFirstPass, NodesSecondPass;
 
   auto B = bf_begin(G), E = bf_end(G);
-  
+
   std::size_t I = 0;
   for (auto It = B; It != E; ++It)
     NodesFirstPass[I++] = *It;
diff --git a/llvm/unittests/ADT/DepthFirstIteratorTest.cpp b/llvm/unittests/ADT/DepthFirstIteratorTest.cpp
index d8ed4a232f..95923b8100 100644
--- a/llvm/unittests/ADT/DepthFirstIteratorTest.cpp
+++ b/llvm/unittests/ADT/DepthFirstIteratorTest.cpp
@@ -79,7 +79,7 @@ TEST(DepthFirstIteratorTest, MultiPassSafeWithInternalSet) {
   std::array<decltype(G)::NodeType *, 4> NodesFirstPass, NodesSecondPass;
 
   auto B = df_begin(G), E = df_end(G);
-  
+
   std::size_t I = 0;
   for (auto It = B; It != E; ++It)
     NodesFirstPass[I++] = *It;
@@ -90,5 +90,4 @@ TEST(DepthFirstIteratorTest, MultiPassSafeWithInternalSet) {
 
   EXPECT_EQ(NodesFirstPass, NodesSecondPass);
 }
-
 }
diff --git a/llvm/unittests/ADT/PostOrderIteratorTest.cpp b/llvm/unittests/ADT/PostOrderIteratorTest.cpp
index a52f8d4490..4c2a66e8d5 100644
--- a/llvm/unittests/ADT/PostOrderIteratorTest.cpp
+++ b/llvm/unittests/ADT/PostOrderIteratorTest.cpp
@@ -100,7 +100,7 @@ TEST(PostOrderIteratorTest, MultiPassSafeWithInternalSet) {
   std::array<decltype(G)::NodeType *, 4> NodesFirstPass, NodesSecondPass;
 
   auto B = po_begin(G), E = po_end(G);
-  
+
   std::size_t I = 0;
   for (auto It = B; It != E; ++It)
     NodesFirstPass[I++] = *It;
@@ -111,5 +111,4 @@ TEST(PostOrderIteratorTest, MultiPassSafeWithInternalSet) {
 
   EXPECT_EQ(NodesFirstPass, NodesSecondPass);
 }
-
 }

``````````

</details>


https://github.com/llvm/llvm-project/pull/116403