#
#
# patch "rcs_import.cc"
#  from [f0c87dedca589ae16cfc868f76877a0829d507b2]
#    to [8446a0d1e6c4d5967db20d1e4f2252c23180335f]
#
============================================================
--- rcs_import.cc	f0c87dedca589ae16cfc868f76877a0829d507b2
+++ rcs_import.cc	8446a0d1e6c4d5967db20d1e4f2252c23180335f
@@ -3499,7 +3499,6 @@ split_cycle(cvs_history & cvs, vector<cv
 
   // For now, we simply collect blobs we cannot split by timestamp, but
   // which could also be split somehow to resolve the cycle.
-  set<cvs_blob_index> blob_without_type1_events;
   vector<cvs_blob_index> splittable_blobs;
 
 
@@ -3551,12 +3550,6 @@ split_cycle(cvs_history & cvs, vector<cv
       // this blob is potentionally splittable...
       splittable_blobs.push_back(*cc);
 
-      // Remember blobs which consist of only events of type 2 or 3, and
-      // no type 1 events. Those are easier to split, because we don't
-      // need to decide on where to put the remaining type 1 events.
-      if (type2events.size() + type3events.size() == blob_events.size())
-        safe_insert(blob_without_type1_events, *cc);
-
       // Calculate the lower and upper bounds for both kind of events. If
       // we are going to split this blob, we need to split it between any
       // of these two bounds to resolve the cycle.