From 2fae253c6210adfb343d522256aea8b9f7176f6d Mon Sep 17 00:00:00 2001 From: Dennis Luxen Date: Thu, 19 Jun 2014 11:14:28 +0200 Subject: [PATCH] use std::size_t consistently and avoid possible loss of data --- DataStructures/DeallocatingVector.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/DataStructures/DeallocatingVector.h b/DataStructures/DeallocatingVector.h index ab5726d2f..013cc1dc3 100644 --- a/DataStructures/DeallocatingVector.h +++ b/DataStructures/DeallocatingVector.h @@ -338,7 +338,7 @@ class DeallocatingVector { const std::size_t number_of_necessary_buckets = 1 + (new_size / bucketSizeC); - for (unsigned i = number_of_necessary_buckets; i < bucket_list.size(); ++i) + for (std::size_t i = number_of_necessary_buckets; i < bucket_list.size(); ++i) { delete[] bucket_list[i]; }