Used non-sized delete for dynamically sized memory.

src/processor/static_map_unittest.cc

 // Copyright (c) 2010 Google Inc.
 // All rights reserved.
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 // notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
@@ skipping 162 matching lines @@
     unsigned int size_per_node =
         sizeof(uint32_t) + sizeof(KeyType) + sizeof(ValueType);
     for (testcase = 0; testcase < kNumberTestCases; ++testcase) {
       correct_size[testcase] =
           sizeof(uint32_t) + std_map[testcase].size() * size_per_node;
     }
   }
 
   void TearDown() {
     for (int i = 0;i < kNumberTestCases; ++i)
-      delete map_data[i];
+      ::operator delete(map_data[i]);

[Mark Mentovai, 2016/03/11 04:34:23]

The use of operator new didn’t have ::, why does this?

[ivanpe, 2016/03/12 00:30:04]

The intention is to use the default new operator, but explicitly request the
non-sized delete operator.  I added some more details to the description.

   }
 
 
   void IteratorTester(int test_case) {
     // scan through:
     iter_test = test_map[test_case].begin();
     iter_std = std_map[test_case].begin();
 
     for (; iter_test != test_map[test_case].end() &&
            iter_std != std_map[test_case].end();
@@ skipping 183 matching lines @@
 
   // Test lookup operations.
   LookupTester(test_case);
 }
 
 int main(int argc, char *argv[]) {
   ::testing::InitGoogleTest(&argc, argv);
 
   return RUN_ALL_TESTS();
 }