merged

dlib/graph_utils/edge_list_graphs.h

@@ -286,7 +286,7 @@ namespace dlib
         // Hold the length for the longest edge for each node.  Initially they are all infinity.
         std::vector<double> worst_dists(samples.size(), std::numeric_limits<double>::infinity());
 
-        std::vector<sample_pair>::iterator begin_i, end_i, begin_j, end_j, itr;
+        std::vector<sample_pair>::iterator begin_i, end_i, begin_j, end_j;
         begin_i = edges.begin();
         end_i = begin_i + k;
 

dlib/image_processing/scan_fhog_pyramid.h

@@ -1306,7 +1306,6 @@ namespace dlib
 
 
         // Do non-max suppression
-        dets.clear();
         if (detectors.size() > 1)
             std::sort(dets_accum.rbegin(), dets_accum.rend());
         for (unsigned long i = 0; i < dets_accum.size(); ++i)