2 * InspIRCd -- Internet Relay Chat Daemon
4 * Copyright (C) 2014 Attila Molnar <attilamolnar@hush.com>
6 * This file is part of InspIRCd. InspIRCd is free software: you can
7 * redistribute it and/or modify it under the terms of the GNU General Public
8 * License as published by the Free Software Foundation, version 2.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
12 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
27 * Erase a single element from a vector by overwriting it with a copy of the last element,
28 * which is then removed. This, in contrast to vector::erase(), does not result in all
29 * elements after the erased element being moved.
30 * @param vect Vector to remove the element from
31 * @param it Iterator to the element to remove
32 * @return Nothing, but all iterators, references and pointers to the erased element and the
33 * last element are invalidated
36 inline void swaperase(typename std::vector<T>& vect, const typename std::vector<T>::iterator& it)
43 * Find and if exists, erase a single element from a vector by overwriting it with a
44 * copy of the last element, which is then removed. This, in contrast to vector::erase(),
45 * does not result in all elements after the erased element being moved.
46 * If the given value occurs multiple times, the one with the lowest index is removed.
47 * Individual elements are compared to the given value using operator==().
48 * @param vect Vector to remove the element from
49 * @param val Value of the element to look for and remove
50 * @return True if the element was found and removed, false if it wasn't found.
51 * If true, all iterators, references and pointers pointing to either the first element that
52 * is equal to val or to the last element are invalidated.
55 inline bool swaperase(typename std::vector<T>& vect, const T& val)
57 const typename std::vector<T>::iterator it = std::find(vect.begin(), vect.end(), val);
68 * Deleter that uses operator delete to delete the item
80 * Deleter that adds the item to the cull list, that is, queues it for
81 * deletion at the end of the current mainloop iteration
85 void operator()(classbase* item);
89 * Deletes all elements in a container using operator delete
90 * @param cont The container containing the elements to delete
92 template <template<typename, typename> class Cont, typename T, typename Alloc>
93 inline void delete_all(const Cont<T*, Alloc>& cont)
95 std::for_each(cont.begin(), cont.end(), defaultdeleter<T>());
99 * Remove an element from a container
100 * @param cont Container to remove the element from
101 * @param val Value of the element to look for and remove
102 * @return True if the element was found and removed, false otherwise
104 template <template<typename, typename> class Cont, typename T, typename Alloc>
105 inline bool erase(Cont<T, Alloc>& cont, const T& val)
107 const typename Cont<T, Alloc>::iterator it = std::find(cont.begin(), cont.end(), val);
108 if (it != cont.end())
117 * Check if an element with the given value is in a container. Equivalent to (std::find(cont.begin(), cont.end(), val) != cont.end()).
118 * @param cont Container to find the element in
119 * @param val Value of the element to look for
120 * @return True if the element was found in the container, false otherwise
122 template <template<typename, typename> class Cont, typename T, typename Alloc>
123 inline bool isin(const Cont<T, Alloc>& cont, const T& val)
125 return (std::find(cont.begin(), cont.end(), val) != cont.end());