Remove Activ libs and includes

This commit is contained in:
John Colvin committed 2023-12-15 13:15:08 -05:00
1 parent 28ed30c944
commit 4b718994be
10967 files changed
-2306716

No files matched your search

@@ -1,53 +0,0 @@
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_COPY_N_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_COPY_N_HPP_INCLUDED
#include <ActivBoost/assert.hpp>
#include <ActivBoost/concept_check.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/distance.hpp>
#include <ActivBoost/range/iterator.hpp>
#include <ActivBoost/range/iterator_range.hpp>
#include <algorithm>
namespace Boost
{
namespace range
{
/// \brief template function copy
///
/// range-based version of the copy std algorithm
///
/// \pre SinglePassRange is a model of the SinglePassRangeConcept
/// \pre OutputIterator is a model of the OutputIteratorConcept
/// \pre 0 <= n <= distance(rng)
template< class SinglePassRange, class Size, class OutputIterator >
inline OutputIterator copy_n(const SinglePassRange& rng, Size n, OutputIterator out)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange> ));
ACTIV_BOOST_ASSERT( n <= static_cast<Size>(::Boost::distance(rng)) );
ACTIV_BOOST_ASSERT( n >= static_cast<Size>(0) );
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type source = ::Boost::begin(rng);
for (Size i = 0; i < n; ++i, ++out, ++source)
*out = *source;
return out;
}
} // namespace range
using ::Boost::range::copy_n;
} // namespace Boost
#endif // include guard
@@ -1,82 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_ERASE_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_ERASE_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/iterator_range_core.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range
{
template< class Container >
inline Container& erase( Container& on,
iterator_range<ACTIV_BOOST_DEDUCED_TYPENAME Container::iterator> to_erase )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase( Boost::begin(to_erase), Boost::end(to_erase) );
return on;
}
template< class Container, class T >
inline Container& remove_erase( Container& on, const T& val )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::remove(Boost::begin(on), Boost::end(on), val),
Boost::end(on));
return on;
}
template< class Container, class Pred >
inline Container& remove_erase_if( Container& on, Pred pred )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::remove_if(Boost::begin(on), Boost::end(on), pred),
Boost::end(on));
return on;
}
template< class Container >
inline Container& unique_erase( Container& on)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::unique(Boost::begin(on), Boost::end(on)),
Boost::end(on));
return on;
}
template< class Container, class Pred >
inline Container& unique_erase( Container& on, Pred pred )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
on.erase(
std::unique(Boost::begin(on), Boost::end(on), pred),
Boost::end(on));
return on;
}
} // namespace range
using range::erase;
using range::remove_erase;
using range::remove_erase_if;
using range::unique_erase;
} // namespace Boost
#endif // include guard
@@ -1,86 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_FOR_EACH_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_FOR_EACH_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range_detail
{
template<class InputIterator1, class InputIterator2, class Fn2>
inline Fn2 for_each_impl(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Fn2 fn)
{
for (; first1 != last1 && first2 != last2; ++first1, ++first2)
{
fn(*first1, *first2);
}
return fn;
}
}
namespace range
{
template<class SinglePassRange1, class SinglePassRange2, class Fn2>
inline Fn2 for_each(const SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
return ::Boost::range_detail::for_each_impl(
::Boost::begin(rng1), ::Boost::end(rng1),
::Boost::begin(rng2), ::Boost::end(rng2), fn);
}
template<class SinglePassRange1, class SinglePassRange2, class Fn2>
inline Fn2 for_each(const SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
return ::Boost::range_detail::for_each_impl(
::Boost::begin(rng1), ::Boost::end(rng1),
::Boost::begin(rng2), ::Boost::end(rng2), fn);
}
template<class SinglePassRange1, class SinglePassRange2, class Fn2>
inline Fn2 for_each(SinglePassRange1& rng1, const SinglePassRange2& rng2, Fn2 fn)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
return ::Boost::range_detail::for_each_impl(
::Boost::begin(rng1), ::Boost::end(rng1),
::Boost::begin(rng2), ::Boost::end(rng2), fn);
}
template<class SinglePassRange1, class SinglePassRange2, class Fn2>
inline Fn2 for_each(SinglePassRange1& rng1, SinglePassRange2& rng2, Fn2 fn)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
return ::Boost::range_detail::for_each_impl(
::Boost::begin(rng1), ::Boost::end(rng1),
::Boost::begin(rng2), ::Boost::end(rng2), fn);
}
} // namespace range
using range::for_each;
} // namespace Boost
#endif // include guard
@@ -1,49 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_INSERT_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_INSERT_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range
{
template< class Container, class Range >
inline Container& insert( Container& on,
ACTIV_BOOST_DEDUCED_TYPENAME Container::iterator before,
const Range& from )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Range> ));
on.insert( before, Boost::begin(from), Boost::end(from) );
return on;
}
template< class Container, class Range >
inline Container& insert( Container& on, const Range& from )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( ForwardRangeConcept<Container> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Range> ));
on.insert(Boost::begin(from), Boost::end(from));
return on;
}
} // namespace range
using range::insert;
} // namespace Boost
#endif // include guard
@@ -1,54 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_IOTA_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_IOTA_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/iterator.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
namespace Boost
{
namespace range
{
template< class ForwardRange, class Value >
inline ForwardRange& iota( ForwardRange& rng, Value x )
{
ACTIV_BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<ForwardRange> ));
typedef ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type iterator_t;
iterator_t last_target = ::Boost::end(rng);
for (iterator_t target = ::Boost::begin(rng); target != last_target; ++target, ++x)
*target = x;
return rng;
}
template< class ForwardRange, class Value >
inline const ForwardRange& iota( const ForwardRange& rng, Value x )
{
ACTIV_BOOST_CONCEPT_ASSERT(( ForwardRangeConcept<const ForwardRange> ));
typedef ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type iterator_t;
iterator_t last_target = ::Boost::end(rng);
for (iterator_t target = ::Boost::begin(rng); target != last_target; ++target, ++x)
*target = x;
return rng;
}
} // namespace range
using range::iota;
} // namespace Boost
#endif // include guard
@@ -1,57 +0,0 @@
// Copyright Bryce Lelbach 2010
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_IS_SORTED_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_IS_SORTED_HPP_INCLUDED
#include <ActivBoost/concept_check.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/value_type.hpp>
#include <ActivBoost/detail/is_sorted.hpp>
#include <algorithm>
namespace Boost
{
namespace range
{
/// \brief template function is_sorted
///
/// range-based version of the is_sorted std algorithm
///
/// \pre SinglePassRange is a model of the SinglePassRangeConcept
template<class SinglePassRange>
inline bool is_sorted(const SinglePassRange& rng)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT((LessThanComparableConcept<ACTIV_BOOST_DEDUCED_TYPENAME
range_value<const SinglePassRange>::type>));
return ::Boost::detail::is_sorted(Boost::begin(rng), Boost::end(rng));
}
/// \overload
template<class SinglePassRange, class BinaryPredicate>
inline bool is_sorted(const SinglePassRange& rng, BinaryPredicate pred)
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT((SinglePassRangeConcept<const SinglePassRange>));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT((BinaryPredicateConcept<BinaryPredicate,
ACTIV_BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type,
ACTIV_BOOST_DEDUCED_TYPENAME range_value<const SinglePassRange>::type>));
return ::Boost::detail::is_sorted(Boost::begin(rng), Boost::end(rng), pred);
}
} // namespace range
using range::is_sorted;
} // namespace Boost
#endif // include guard
@@ -1,84 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_OVERWRITE_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_OVERWRITE_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/iterator.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range
{
template< class SinglePassRange1, class SinglePassRange2 >
inline void overwrite( const SinglePassRange1& from, SinglePassRange2& to )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<SinglePassRange2> ));
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
i = Boost::begin(from), e = Boost::end(from);
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type
out = Boost::begin(to);
#ifndef NDEBUG
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type
last_out = Boost::end(to);
#endif
for( ; i != e; ++out, ++i )
{
#ifndef NDEBUG
ACTIV_BOOST_ASSERT( out != last_out
&& "out of bounds in Boost::overwrite()" );
#endif
*out = *i;
}
}
template< class SinglePassRange1, class SinglePassRange2 >
inline void overwrite( const SinglePassRange1& from, const SinglePassRange2& to )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type
i = Boost::begin(from), e = Boost::end(from);
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type
out = Boost::begin(to);
#ifndef NDEBUG
ACTIV_BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type
last_out = Boost::end(to);
#endif
for( ; i != e; ++out, ++i )
{
#ifndef NDEBUG
ACTIV_BOOST_ASSERT( out != last_out
&& "out of bounds in Boost::overwrite()" );
#endif
*out = *i;
}
}
} // namespace range
using range::overwrite;
} // namespace Boost
#endif // include guard
@@ -1,41 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_PUSH_BACK_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_PUSH_BACK_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/range/detail/implementation_help.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range
{
template< class Container, class Range >
inline Container& push_back( Container& on, const Range& from )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
ACTIV_BOOST_ASSERT_MSG(!range_detail::is_same_object(on, from),
"cannot copy from a container to itself");
on.insert( on.end(), Boost::begin(from), Boost::end(from) );
return on;
}
} // namespace range
using range::push_back;
} // namespace Boost
#endif // include guard
@@ -1,41 +0,0 @@
// Boost.Range library
//
// Copyright Neil Groves 2009. Use, modification and
// distribution is subject to 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)
//
// For more information, see http://www.boost.org/libs/range/
//
#ifndef ACTIV_BOOST_RANGE_ALGORITHM_EXT_PUSH_FRONT_HPP_INCLUDED
#define ACTIV_BOOST_RANGE_ALGORITHM_EXT_PUSH_FRONT_HPP_INCLUDED
#include <ActivBoost/range/config.hpp>
#include <ActivBoost/range/concepts.hpp>
#include <ActivBoost/range/difference_type.hpp>
#include <ActivBoost/range/begin.hpp>
#include <ActivBoost/range/end.hpp>
#include <ActivBoost/range/detail/implementation_help.hpp>
#include <ActivBoost/assert.hpp>
namespace Boost
{
namespace range
{
template< class Container, class Range >
inline Container& push_front( Container& on, const Range& from )
{
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<Container> ));
ACTIV_BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const Range> ));
ACTIV_BOOST_ASSERT_MSG(!range_detail::is_same_object(on, from),
"cannot copy from a container to itself");
on.insert( on.begin(), Boost::begin(from), Boost::end(from) );
return on;
}
} // namespace range
using range::push_front;
} // namespace Boost
#endif // include guard