1 // Ceres Solver - A fast non-linear least squares minimizer
2 // Copyright 2010, 2011, 2012 Google Inc. All rights reserved.
3 // http://code.google.com/p/ceres-solver/
4 //
5 // Redistribution and use in source and binary forms, with or without
6 // modification, are permitted provided that the following conditions are met:
7 //
8 // * Redistributions of source code must retain the above copyright notice,
9 // this list of conditions and the following disclaimer.
10 // * Redistributions in binary form must reproduce the above copyright notice,
11 // this list of conditions and the following disclaimer in the documentation
12 // and/or other materials provided with the distribution.
13 // * Neither the name of Google Inc. nor the names of its contributors may be
14 // used to endorse or promote products derived from this software without
15 // specific prior written permission.
16 //
17 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
18 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
21 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
24 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
25 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
26 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
27 // POSSIBILITY OF SUCH DAMAGE.
28 //
29 // Author: keir@google.com (Keir Mierle)
30
31 #ifndef CERES_INTERNAL_STL_UTIL_H_
32 #define CERES_INTERNAL_STL_UTIL_H_
33
34 namespace ceres {
35
36 // STLDeleteContainerPointers()
37 // For a range within a container of pointers, calls delete
38 // (non-array version) on these pointers.
39 // NOTE: for these three functions, we could just implement a DeleteObject
40 // functor and then call for_each() on the range and functor, but this
41 // requires us to pull in all of algorithm.h, which seems expensive.
42 // For hash_[multi]set, it is important that this deletes behind the iterator
43 // because the hash_set may call the hash function on the iterator when it is
44 // advanced, which could result in the hash function trying to deference a
45 // stale pointer.
46 template <class ForwardIterator>
STLDeleteContainerPointers(ForwardIterator begin,ForwardIterator end)47 void STLDeleteContainerPointers(ForwardIterator begin,
48 ForwardIterator end) {
49 while (begin != end) {
50 ForwardIterator temp = begin;
51 ++begin;
52 delete *temp;
53 }
54 }
55
56 // STLDeleteElements() deletes all the elements in an STL container and clears
57 // the container. This function is suitable for use with a vector, set,
58 // hash_set, or any other STL container which defines sensible begin(), end(),
59 // and clear() methods.
60 //
61 // If container is NULL, this function is a no-op.
62 //
63 // As an alternative to calling STLDeleteElements() directly, consider
64 // ElementDeleter (defined below), which ensures that your container's elements
65 // are deleted when the ElementDeleter goes out of scope.
66 template <class T>
STLDeleteElements(T * container)67 void STLDeleteElements(T *container) {
68 if (!container) return;
69 STLDeleteContainerPointers(container->begin(), container->end());
70 container->clear();
71 }
72
73 } // namespace ceres
74
75 #endif // CERES_INTERNAL_STL_UTIL_H_
76