forked from qt-creator/qt-creator
Utils: Move set algorithms to Utils
So it can be used in other plugins which does not depend on clang. Change-Id: I80b9f44609921951444e13c5fd35476c047ad579 Reviewed-by: hjk <hjk@qt.io> Reviewed-by: Eike Ziller <eike.ziller@qt.io>
This commit is contained in:
120
src/libs/utils/set_algorithm.h
Normal file
120
src/libs/utils/set_algorithm.h
Normal file
@@ -0,0 +1,120 @@
|
||||
/****************************************************************************
|
||||
**
|
||||
** Copyright (C) 2019 The Qt Company Ltd.
|
||||
** Contact: https://www.qt.io/licensing/
|
||||
**
|
||||
** This file is part of Qt Creator.
|
||||
**
|
||||
** Commercial License Usage
|
||||
** Licensees holding valid commercial Qt licenses may use this file in
|
||||
** accordance with the commercial license agreement provided with the
|
||||
** Software or, alternatively, in accordance with the terms contained in
|
||||
** a written agreement between you and The Qt Company. For licensing terms
|
||||
** and conditions see https://www.qt.io/terms-conditions. For further
|
||||
** information use the contact form at https://www.qt.io/contact-us.
|
||||
**
|
||||
** GNU General Public License Usage
|
||||
** Alternatively, this file may be used under the terms of the GNU
|
||||
** General Public License version 3 as published by the Free Software
|
||||
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
|
||||
** included in the packaging of this file. Please review the following
|
||||
** information to ensure the GNU General Public License requirements will
|
||||
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
|
||||
**
|
||||
****************************************************************************/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <algorithm>
|
||||
|
||||
namespace Utils {
|
||||
|
||||
template<class Callable>
|
||||
class function_output_iterator
|
||||
{
|
||||
public:
|
||||
typedef std::output_iterator_tag iterator_category;
|
||||
typedef void value_type;
|
||||
typedef void difference_type;
|
||||
typedef void pointer;
|
||||
typedef void reference;
|
||||
|
||||
explicit function_output_iterator() {}
|
||||
|
||||
explicit function_output_iterator(const Callable &callable)
|
||||
: m_callable(&callable)
|
||||
{}
|
||||
|
||||
function_output_iterator &operator=(const function_output_iterator &iterator)
|
||||
{
|
||||
m_callable = iterator.m_callable;
|
||||
|
||||
return *this;
|
||||
}
|
||||
|
||||
struct helper
|
||||
{
|
||||
helper(const Callable *callable)
|
||||
: m_callable(callable)
|
||||
{}
|
||||
template<class T>
|
||||
helper &operator=(T &&value)
|
||||
{
|
||||
(*m_callable)(std::forward<T>(value));
|
||||
return *this;
|
||||
}
|
||||
const Callable *m_callable;
|
||||
};
|
||||
|
||||
helper operator*() { return helper(m_callable); }
|
||||
function_output_iterator &operator++() { return *this; }
|
||||
function_output_iterator &operator++(int) { return *this; }
|
||||
|
||||
private:
|
||||
const Callable *m_callable;
|
||||
};
|
||||
|
||||
template<typename Callable>
|
||||
function_output_iterator<Callable> make_iterator(const Callable &callable)
|
||||
{
|
||||
return function_output_iterator<Callable>(callable);
|
||||
}
|
||||
|
||||
template<class InputIt1, class InputIt2, class Callable, class Compare>
|
||||
bool set_intersection_compare(
|
||||
InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, Callable call, Compare comp)
|
||||
{
|
||||
while (first1 != last1 && first2 != last2) {
|
||||
if (comp(*first1, *first2)) {
|
||||
++first1;
|
||||
} else {
|
||||
if (!comp(*first2, *first1)) {
|
||||
if (call(*first1++, *first2))
|
||||
return true;
|
||||
}
|
||||
++first2;
|
||||
}
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
template<typename InputIt1, typename InputIt2, typename BinaryPredicate, typename Callable, typename Value>
|
||||
Value mismatch_collect(InputIt1 first1,
|
||||
InputIt1 last1,
|
||||
InputIt2 first2,
|
||||
InputIt2 last2,
|
||||
Value value,
|
||||
BinaryPredicate predicate,
|
||||
Callable callable)
|
||||
{
|
||||
while (first1 != last1 && first2 != last2) {
|
||||
if (predicate(*first1, *first2))
|
||||
value = callable(*first1, *first2, value);
|
||||
++first1, ++first2;
|
||||
}
|
||||
|
||||
return value;
|
||||
}
|
||||
|
||||
} // namespace Utils
|
||||
Reference in New Issue
Block a user