mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-02 14:04:20 +00:00
add copyright
This commit is contained in:
parent
d663ca160b
commit
cb1077d247
1844 changed files with 13073 additions and 165 deletions
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ADJACENT_FIND_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.8 Adjacent find
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ALL_OF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ALL_OF_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.1 All of
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ALL_OF_EQUAL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ALL_OF_EQUAL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ANY_OF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ANY_OF_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.2 Any of
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ALL_OF_EQUAL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ALL_OF_EQUAL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_BINARY_SEARCH_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_BINARY_SEARCH_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.3.4 binary_search
|
||||
template<typename ForwardRange, typename T>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_CLAMP_RANGE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_CLAMP_RANGE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COPY_BACKWARD_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COPY_BACKWARD_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COPY_UNTIL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COPY_UNTIL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COPY_WHILE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COPY_WHILE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COUNT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COUNT_HPP
|
||||
|
||||
|
@ -8,7 +16,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.9 Count
|
||||
template<typename InputRange, typename T>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_COUNT_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_COUNT_IF_HPP
|
||||
|
||||
|
@ -8,7 +16,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.9 Count
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_EQUAL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_EQUAL_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.11 Equal
|
||||
template<typename InputRange1, typename InputRange2>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_EQUAL_RANGE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_EQUAL_RANGE_HPP
|
||||
|
||||
|
@ -17,7 +25,6 @@ namespace sprout {
|
|||
}
|
||||
} // namespace detail
|
||||
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.3.3 equal_range
|
||||
template<typename ForwardRange, typename T>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.5 Find
|
||||
template<typename InputRange, typename T>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_END_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_END_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.6 Find end
|
||||
template<typename ForwardRange1, typename ForwardRange2>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_FIRST_OF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_FIRST_OF_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.7 Find first
|
||||
template<typename InputRange1, typename InputRange2>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_IF_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.5 Find
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_IF_NOT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_IF_NOT_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.5 Find
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_INTERSECTION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIND_SYMMETRIC_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIND_SYMMETRIC_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_CLAMP_RANGE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_CLAMP_RANGE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_COPY_BACKWARD_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_COPY_BACKWARD_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_COPY_UNTIL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_COPY_UNTIL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_COPY_WHILE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_COPY_WHILE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_MERGE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_MERGE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_PARTITION_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_PARTITION_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_REMOVE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_REMOVE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_REMOVE_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_REMOVE_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_REPLACE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_REPLACE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_REPLACE_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_REPLACE_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_REVERSE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_REVERSE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_ROTATE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_ROTATE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_SET_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_SET_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_SET_INTERSECTION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_SET_SYMMETRIC_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_SET_SYMMETRIC_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_SET_UNION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_SET_UNION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_STABLE_PARTITION_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_STABLE_PARTITION_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_SWAP_ELEMENT_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_SWAP_ELEMENT_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_TRANSFORM_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_TRANSFORM_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIT_UNIQUE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIT_UNIQUE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_CLAMP_RANGE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_CLAMP_RANGE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_COPY_BACKWARD_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_COPY_BACKWARD_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_COPY_UNTIL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_COPY_UNTIL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_COPY_WHILE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_COPY_WHILE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_MERGE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_MERGE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_PARTITION_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_PARTITION_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_REMOVE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_REMOVE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_REMOVE_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_REMOVE_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_REPLACE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_REPLACE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_REPLACE_COPY_IF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_REPLACE_COPY_IF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_REVERSE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_REVERSE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_ROTATE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_ROTATE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_INTERSECTION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_INTERSECTION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_SYMMETRIC_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_SYMMETRIC_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SET_UNION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_SET_UNION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_STABLE_PARTITION_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_STABLE_PARTITION_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_SWAP_ELEMENT_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_TRANSFORM_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_TRANSFORM_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_FIXED_UNIQUE_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_FIXED_UNIQUE_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_INCLUDES_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_INCLUDES_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.5.1 includes
|
||||
template<typename InputRange1, typename InputRange2>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_DECREASING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_DECREASING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_HEAP_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_HEAP_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.6.5 is_heap
|
||||
template<typename RandomAccessRange>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_HEAP_UNTIL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_HEAP_UNTIL_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.6.5 is_heap
|
||||
template<typename RandomAccessRange>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_INCREASING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_INCREASING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_PARTITIONED_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_PARTITIONED_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.3.13 partitions
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_PERMUTATION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_PERMUTATION_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.12 Is permutation
|
||||
template<typename ForwardRange1, typename ForwardRange2>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_SORTED_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_SORTED_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.1.5 is_sorted
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_SORTED_UNTIL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_SORTED_UNTIL_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.1.5 is_sorted
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_STRICTLY_DECREASING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_STRICTLY_DECREASING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_IS_STRICTLY_INCREASING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_IS_STRICTLY_INCREASING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_LEXICOGRAPHICAL_COMPARE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_LEXICOGRAPHICAL_COMPARE_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.8 Lexicographical comparison
|
||||
template<typename InputRange1, typename InputRange2>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_LOWER_BOUND_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_LOWER_BOUND_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.3.1 lower_bound
|
||||
template<typename ForwardRange, typename T>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MAX_ELEMENT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MAX_ELEMENT_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.7 Minimum and maximum
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MERGE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MERGE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MIN_ELEMENT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MIN_ELEMENT_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.7 Minimum and maximum
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MINMAX_ELEMENT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MINMAX_ELEMENT_HPP
|
||||
|
||||
|
@ -36,7 +44,6 @@ namespace sprout {
|
|||
}
|
||||
} // namespace detail
|
||||
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.7 Minimum and maximum
|
||||
template<typename ForwardRange>
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MISMATCH_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MISMATCH_HPP
|
||||
|
||||
|
@ -10,7 +18,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.10 Mismatch
|
||||
template<typename InputRange1, typename InputRange2>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_MODIFYIING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_MODIFYIING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NEXT_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_INTERSECTION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NEXT_INTERSECTION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_SYMMETRIC_DIFFERENCE_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NEXT_SYMMETRIC_DIFFERENCE_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NEXT_UNION_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NON_MODIFYIING_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NON_MODIFYIING_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NONE_OF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NONE_OF_HPP
|
||||
|
||||
|
@ -7,7 +15,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.2.3 None of
|
||||
template<typename InputRange, typename Predicate>
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_NONE_OF_EQUAL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_NONE_OF_EQUAL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ONE_OF_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ONE_OF_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_ONE_OF_EQUAL_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_ONE_OF_EQUAL_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,10 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_PARTITION_COPY_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_PARTITION_COPY_HPP
|
||||
|
||||
|
|
|
@ -1,3 +1,11 @@
|
|||
/*=============================================================================
|
||||
Copyright (c) 2011-2013 Bolero MURAKAMI
|
||||
Copyright (C) 2011 RiSK (sscrisk)
|
||||
https://github.com/bolero-MURAKAMI/Sprout
|
||||
|
||||
Distributed under the Boost Software License, Version 1.0. (See accompanying
|
||||
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
=============================================================================*/
|
||||
#ifndef SPROUT_RANGE_ALGORITHM_PARTITION_POINT_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_PARTITION_POINT_HPP
|
||||
|
||||
|
@ -9,7 +17,6 @@
|
|||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.3.13 partitions
|
||||
template<typename ForwardRange, typename Predicate>
|
||||
|
|
Some files were not shown because too many files have changed in this diff Show more
Loading…
Add table
Add a link
Reference in a new issue