2 Copyright (C) 2012 Intel Corporation
4 This library is free software; you can redistribute it and/or
5 modify it under the terms of the GNU Lesser General Public
6 License as published by the Free Software Foundation; either
7 version 2.1 of the License, or (at your option) any later version.
9 This library is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 Lesser General Public License for more details.
14 You should have received a copy of the GNU Lesser General Public
15 License along with this library; if not, write to the Free Software
16 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 #ifndef LISTPLUSPLUS_H
21 #define LISTPLUSPLUS_H
27 template <class T, class V, class Predicate>
28 bool contains(const T & iteratable, V value, Predicate comparator )
30 return std::any_of(iteratable.begin(), iteratable.end(), [value, &comparator](auto i) { return comparator(value, i); });
33 template <class T, class V>
34 bool contains(const T & iteratable, V value)
36 return contains(iteratable, value, [](auto a, auto b) { return a == b; });
40 template <class T, class V>
41 void removeOne(T * iteratable, V value)
43 typename T::iterator itr = std::find(iteratable->begin(), iteratable->end(), value);
45 if (itr != iteratable->end())
47 iteratable->erase(itr);
53 template <class T, class Key>
54 bool containsKey(const T & map, const Key & key)
56 return map.find(key) != map.end();
59 std::string::size_type count(const std::string & t, const std::string & toFind, const std::string & before = "");
61 int findNth(const std::string & t, const std::string &toFind, std::string::size_type n);
65 #endif // LISTPLUSPLUS_H