Add Activ libs and includes (gcc123)

This commit is contained in:
John Colvin committed 2023-12-15 13:15:09 -05:00
1 parent 4b718994be
commit 7086753a10
10971 files changed
+2291714

No files matched your search

@@ -0,0 +1,63 @@
// Copyright (C) 2008-2016 Daniel James.
// 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 ACTIV_BOOST_UNORDERED_FWD_HPP_INCLUDED
#define ACTIV_BOOST_UNORDERED_FWD_HPP_INCLUDED
#include <ActivBoost/config.hpp>
#if defined(ACTIV_BOOST_HAS_PRAGMA_ONCE)
#pragma once
#endif
#include <ActivBoost/predef.h>
#if defined(ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT)
// Already defined.
#elif defined(ACTIV_BOOST_LIBSTDCXX11)
// https://github.com/gcc-mirror/gcc/blob/gcc-4_6-branch/libstdc++-v3/include/bits/stl_pair.h#L70
#if ACTIV_BOOST_LIBSTDCXX_VERSION > 40600
#define ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
#endif
#elif ACTIV_BOOST_LIB_STD_CXX
// https://github.com/llvm-mirror/libcxx/blob/release_30/include/utility#L206
#if ACTIV_BOOST_LIB_STD_CXX >= ACTIV_BOOST_VERSION_NUMBER(3, 0, 0)
#define ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
#endif
#elif defined(ACTIV_BOOST_LIB_STD_DINKUMWARE)
// Apparently C++11 standard supported in Visual Studio 2012
// https://msdn.microsoft.com/en-us/library/hh567368.aspx#stl
// 2012 = VC+11 = ACTIV_BOOST_MSVC 1700 Hopefully!
// I have no idea when Dinkumware added it, probably a lot
// earlier than this check.
#if ACTIV_BOOST_LIB_STD_DINKUMWARE >= ACTIV_BOOST_VERSION_NUMBER(6, 50, 0) || \
ACTIV_BOOST_COMP_MSVC >= ACTIV_BOOST_VERSION_NUMBER(17, 0, 0)
#define ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
#endif
#endif
// Assume that an unknown library does not support piecewise construction.
#if !defined(ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT)
#define ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 0
#endif
#if ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT
#include <utility>
#endif
namespace Boost {
namespace unordered {
#if ACTIV_BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT
using std::piecewise_construct_t;
using std::piecewise_construct;
#else
struct piecewise_construct_t
{
};
const piecewise_construct_t piecewise_construct = piecewise_construct_t();
#endif
}
}
#endif
File diff suppressed because it is too large. Load diff
@@ -0,0 +1,67 @@
// Copyright (C) 2005-2016 Daniel James
// 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)
#include <ActivBoost/unordered/detail/implementation.hpp>
#include <ActivBoost/unordered/unordered_map_fwd.hpp>
namespace Boost {
namespace unordered {
namespace detail {
template <typename A, typename K, typename M, typename H, typename P>
struct map
{
typedef Boost::unordered::detail::map<A, K, M, H, P> types;
typedef std::pair<K const, M> value_type;
typedef H hasher;
typedef P key_equal;
typedef K const const_key_type;
typedef
typename ::Boost::unordered::detail::rebind_wrap<A, value_type>::type
value_allocator;
typedef Boost::unordered::detail::allocator_traits<value_allocator>
value_allocator_traits;
typedef Boost::unordered::detail::pick_node<A, value_type> pick;
typedef typename pick::node node;
typedef typename pick::bucket bucket;
typedef typename pick::link_pointer link_pointer;
typedef Boost::unordered::detail::table<types> table;
typedef Boost::unordered::detail::map_extractor<value_type> extractor;
typedef typename Boost::unordered::detail::pick_policy<K>::type policy;
typedef Boost::unordered::iterator_detail::iterator<node> iterator;
typedef Boost::unordered::iterator_detail::c_iterator<node> c_iterator;
typedef Boost::unordered::iterator_detail::l_iterator<node> l_iterator;
typedef Boost::unordered::iterator_detail::cl_iterator<node>
cl_iterator;
typedef Boost::unordered::node_handle_map<node, K, M, A> node_type;
typedef Boost::unordered::insert_return_type_map<node, K, M, A>
insert_return_type;
};
template <typename K, typename M, typename H, typename P, typename A>
class instantiate_map
{
typedef Boost::unordered_map<K, M, H, P, A> container;
container x;
typename container::node_type node_type;
typename container::insert_return_type insert_return_type;
};
template <typename K, typename M, typename H, typename P, typename A>
class instantiate_multimap
{
typedef Boost::unordered_multimap<K, M, H, P, A> container;
container x;
typename container::node_type node_type;
};
}
}
}
@@ -0,0 +1,66 @@
// Copyright (C) 2005-2016 Daniel James
// 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)
#include <ActivBoost/unordered/detail/implementation.hpp>
#include <ActivBoost/unordered/unordered_set_fwd.hpp>
namespace Boost {
namespace unordered {
namespace detail {
template <typename A, typename T, typename H, typename P> struct set
{
typedef Boost::unordered::detail::set<A, T, H, P> types;
typedef T value_type;
typedef H hasher;
typedef P key_equal;
typedef T const const_key_type;
typedef
typename ::Boost::unordered::detail::rebind_wrap<A, value_type>::type
value_allocator;
typedef Boost::unordered::detail::allocator_traits<value_allocator>
value_allocator_traits;
typedef Boost::unordered::detail::pick_node<A, value_type> pick;
typedef typename pick::node node;
typedef typename pick::bucket bucket;
typedef typename pick::link_pointer link_pointer;
typedef Boost::unordered::detail::table<types> table;
typedef Boost::unordered::detail::set_extractor<value_type> extractor;
typedef typename Boost::unordered::detail::pick_policy<T>::type policy;
typedef Boost::unordered::iterator_detail::c_iterator<node> iterator;
typedef Boost::unordered::iterator_detail::c_iterator<node> c_iterator;
typedef Boost::unordered::iterator_detail::cl_iterator<node> l_iterator;
typedef Boost::unordered::iterator_detail::cl_iterator<node>
cl_iterator;
typedef Boost::unordered::node_handle_set<node, T, A> node_type;
typedef Boost::unordered::insert_return_type_set<node, T, A>
insert_return_type;
};
template <typename T, typename H, typename P, typename A>
class instantiate_set
{
typedef Boost::unordered_set<T, H, P, A> container;
container x;
typename container::node_type node_type;
typename container::insert_return_type insert_return_type;
};
template <typename T, typename H, typename P, typename A>
class instantiate_multiset
{
typedef Boost::unordered_multiset<T, H, P, A> container;
container x;
typename container::node_type node_type;
};
}
}
}
File diff suppressed because it is too large. Load diff
@@ -0,0 +1,64 @@
// Copyright (C) 2008-2011 Daniel James.
// 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 ACTIV_BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
#define ACTIV_BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
#include <ActivBoost/config.hpp>
#if defined(ACTIV_BOOST_HAS_PRAGMA_ONCE)
#pragma once
#endif
#include <ActivBoost/functional/hash_fwd.hpp>
#include <ActivBoost/unordered/detail/fwd.hpp>
#include <functional>
#include <memory>
namespace Boost {
namespace unordered {
template <class K, class T, class H = Boost::hash<K>,
class P = std::equal_to<K>,
class A = std::allocator<std::pair<const K, T> > >
class unordered_map;
template <class K, class T, class H, class P, class A>
inline bool operator==(
unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
template <class K, class T, class H, class P, class A>
inline bool operator!=(
unordered_map<K, T, H, P, A> const&, unordered_map<K, T, H, P, A> const&);
template <class K, class T, class H, class P, class A>
inline void swap(
unordered_map<K, T, H, P, A>& m1, unordered_map<K, T, H, P, A>& m2)
ACTIV_BOOST_NOEXCEPT_IF(ACTIV_BOOST_NOEXCEPT_EXPR(m1.swap(m2)));
template <class K, class T, class H = Boost::hash<K>,
class P = std::equal_to<K>,
class A = std::allocator<std::pair<const K, T> > >
class unordered_multimap;
template <class K, class T, class H, class P, class A>
inline bool operator==(unordered_multimap<K, T, H, P, A> const&,
unordered_multimap<K, T, H, P, A> const&);
template <class K, class T, class H, class P, class A>
inline bool operator!=(unordered_multimap<K, T, H, P, A> const&,
unordered_multimap<K, T, H, P, A> const&);
template <class K, class T, class H, class P, class A>
inline void swap(unordered_multimap<K, T, H, P, A>& m1,
unordered_multimap<K, T, H, P, A>& m2)
ACTIV_BOOST_NOEXCEPT_IF(ACTIV_BOOST_NOEXCEPT_EXPR(m1.swap(m2)));
template <class N, class K, class T, class A> class node_handle_map;
template <class N, class K, class T, class A> struct insert_return_type_map;
}
using Boost::unordered::unordered_map;
using Boost::unordered::unordered_multimap;
using Boost::unordered::swap;
using Boost::unordered::operator==;
using Boost::unordered::operator!=;
}
#endif
File diff suppressed because it is too large. Load diff
@@ -0,0 +1,62 @@
// Copyright (C) 2008-2011 Daniel James.
// 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 ACTIV_BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
#define ACTIV_BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
#include <ActivBoost/config.hpp>
#if defined(ACTIV_BOOST_HAS_PRAGMA_ONCE)
#pragma once
#endif
#include <ActivBoost/functional/hash_fwd.hpp>
#include <ActivBoost/unordered/detail/fwd.hpp>
#include <functional>
#include <memory>
namespace Boost {
namespace unordered {
template <class T, class H = Boost::hash<T>, class P = std::equal_to<T>,
class A = std::allocator<T> >
class unordered_set;
template <class T, class H, class P, class A>
inline bool operator==(
unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
template <class T, class H, class P, class A>
inline bool operator!=(
unordered_set<T, H, P, A> const&, unordered_set<T, H, P, A> const&);
template <class T, class H, class P, class A>
inline void swap(
unordered_set<T, H, P, A>& m1, unordered_set<T, H, P, A>& m2)
ACTIV_BOOST_NOEXCEPT_IF(ACTIV_BOOST_NOEXCEPT_EXPR(m1.swap(m2)));
template <class T, class H = Boost::hash<T>, class P = std::equal_to<T>,
class A = std::allocator<T> >
class unordered_multiset;
template <class T, class H, class P, class A>
inline bool operator==(unordered_multiset<T, H, P, A> const&,
unordered_multiset<T, H, P, A> const&);
template <class T, class H, class P, class A>
inline bool operator!=(unordered_multiset<T, H, P, A> const&,
unordered_multiset<T, H, P, A> const&);
template <class T, class H, class P, class A>
inline void swap(
unordered_multiset<T, H, P, A>& m1, unordered_multiset<T, H, P, A>& m2)
ACTIV_BOOST_NOEXCEPT_IF(ACTIV_BOOST_NOEXCEPT_EXPR(m1.swap(m2)));
template <class N, class T, class A> class node_handle_set;
template <class N, class T, class A> struct insert_return_type_set;
}
using Boost::unordered::unordered_set;
using Boost::unordered::unordered_multiset;
using Boost::unordered::swap;
using Boost::unordered::operator==;
using Boost::unordered::operator!=;
}
#endif