From 3b16af86705d98bb8989097e163ab4b9175481d2 Mon Sep 17 00:00:00 2001
From: NAKAMURA Takumi <geek4civic@gmail.com>
Date: Tue, 18 Nov 2014 12:23:19 +0000
Subject: [PATCH] CallGraphTest.cpp: Remove invalid tests. ++S might step over
 F if S == F.

MSVC Runtime detects "Assertion failed: vector iterator not incrementable"

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@222233 91177308-0d34-0410-b5e6-96231b3b80d8
---
 unittests/Analysis/CallGraphTest.cpp | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/unittests/Analysis/CallGraphTest.cpp b/unittests/Analysis/CallGraphTest.cpp
index 29e9aa63182..777907a55b1 100644
--- a/unittests/Analysis/CallGraphTest.cpp
+++ b/unittests/Analysis/CallGraphTest.cpp
@@ -35,15 +35,12 @@ template <typename Ty> void canSpecializeGraphTraitsIterators(Ty *G) {
 
   auto S = GraphTraits<NodeTy *>::child_begin(N);
   auto F = GraphTraits<NodeTy *>::child_end(N);
-  auto Y = ++S;
 
   // Should be able to iterate over immediate successors of a node.
   static_assert(std::is_same<decltype(*S), NodeTy *>::value,
                 "Node type does not match");
   static_assert(std::is_same<decltype(*F), NodeTy *>::value,
                 "Node type does not match");
-  static_assert(std::is_same<decltype(*Y), NodeTy *>::value,
-                "Node type does not match");
 }
 
 TEST(CallGraphTest, GraphTraitsSpecialization) {
-- 
2.34.1