mirrors/linphone-iphone
1
0
Fork 1
mirror of https://gitlab.linphone.org/BC/public/linphone-iphone.git synced 2026-01-26 23:58:17 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

feat(Utils): add a algorithm file to centralize generic algorithm

Browse source
This commit is contained in:
Ronan Abhamon 2018-01-31 17:20:43 +01:00
parent a64dc54e7a
commit 890117f2d4
2 changed files with 66 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
include/CMakeLists.txt
View file

@ -98,6 +98,7 @@ set(ENUMS_HEADER_FILES
)
set(UTILS_HEADER_FILES
algorithm.h
enum-generator.h
enum-mask.h
fs.h

65
include/linphone/utils/algorithm.h Normal file
View file

@ -0,0 +1,65 @@
/*
* algorithm.h
* Copyright (C) 2010-2018 Belledonne Communications SARL
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef _L_ALGORITHM_H_
#define _L_ALGORITHM_H_
#include <algorithm>
#include "general.h"
// =============================================================================
// NOTE: Maybe use https://github.com/ericniebler/range-v3 one day?
LINPHONE_BEGIN_NAMESPACE
template<typename T, typename Value>
inline typename T::const_iterator find (const T &container, const Value &value) {
return std::find(container.cbegin(), container.cend(), value);
}
template<typename T, typename Value>
inline typename T::iterator find (T &container, const Value &value) {
return std::find(container.begin(), container.end(), value);
}
template<typename T, typename Predicate>
inline typename T::const_iterator findIf (const T &container, Predicate predicate) {
return std::find_if(container.cbegin(), container.cend(), predicate);
}
template<typename T, typename Predicate>
inline typename T::iterator findIf (T &container, Predicate predicate) {
return std::find_if(container.begin(), container.end(), predicate);
}
template<typename T, typename Value>
inline bool removeFirst (T &container, const Value &value) {
auto it = find(container, value);
if (it != container.end()) {
container.erase(it);
return true;
}
return false;
}
LINPHONE_END_NAMESPACE
#endif // ifndef _L_ALGORITHM_H_