stabilize build system: depends, installer, boost/bdb fixes, cross targets groundwork

depends/x86_64-pc-linux-gnu/include/boost/unordered/detail/fwd.hpp

@@ -0,0 +1,57 @@
+
+// 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 BOOST_UNORDERED_FWD_HPP_INCLUDED
+#define BOOST_UNORDERED_FWD_HPP_INCLUDED
+
+#include <boost/config.hpp>
+#if defined(BOOST_HAS_PRAGMA_ONCE)
+#pragma once
+#endif
+
+#if defined(BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT)
+// Already defined.
+#elif defined(BOOST_LIBSTDCXX11)
+// https://github.com/gcc-mirror/gcc/blob/gcc-4_6-branch/libstdc++-v3/include/bits/stl_pair.h#L70
+#if BOOST_LIBSTDCXX_VERSION > 40600
+#define BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
+#endif
+#elif defined(_LIBCPP_VERSION)
+// https://github.com/llvm-mirror/libcxx/blob/release_30/include/utility#L206
+#if LIBCPP_VERSION >= 3000
+#define BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
+#endif
+#elif defined(BOOST_MSVC)
+// Apparently C++11 standard supported in Visual Studio 2012
+// https://msdn.microsoft.com/en-us/library/hh567368.aspx#stl
+// 2012 = VC+11 = BOOST_MSVC 1700 Hopefully!
+#if BOOST_MSVC >= 1700
+#define BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 1
+#endif
+#endif
+
+#if !defined(BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT)
+#define BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT 0
+#endif
+
+#if BOOST_UNORDERED_HAVE_PIECEWISE_CONSTRUCT
+#include <utility>
+#endif
+
+namespace boost {
+namespace unordered {
+#if 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

depends/x86_64-pc-linux-gnu/include/boost/unordered/detail/map.hpp

@@ -0,0 +1,107 @@
+
+// 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 <boost/unordered/detail/implementation.hpp>
+#include <boost/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 typename pick::node_algo node_algo;
+
+    typedef boost::unordered::detail::table_impl<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, policy>
+        l_iterator;
+    typedef boost::unordered::iterator_detail::cl_iterator<node, policy>
+        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 A, typename K, typename M, typename H, typename P>
+struct multimap
+{
+    typedef boost::unordered::detail::multimap<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;
+
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+    typedef boost::unordered::detail::pick_node<A, value_type> pick;
+#else
+    typedef boost::unordered::detail::pick_grouped_node<A, value_type> pick;
+#endif
+    typedef typename pick::node node;
+    typedef typename pick::bucket bucket;
+    typedef typename pick::link_pointer link_pointer;
+    typedef typename pick::node_algo node_algo;
+
+    typedef boost::unordered::detail::grouped_table_impl<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, policy>
+        l_iterator;
+    typedef boost::unordered::iterator_detail::cl_iterator<node, policy>
+        cl_iterator;
+
+    typedef boost::unordered::node_handle_map<node, K, M, A> node_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;
+};
+}
+}
+}

depends/x86_64-pc-linux-gnu/include/boost/unordered/detail/set.hpp

@@ -0,0 +1,105 @@
+
+// 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 <boost/unordered/detail/implementation.hpp>
+#include <boost/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 typename pick::node_algo node_algo;
+
+    typedef boost::unordered::detail::table_impl<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, policy>
+        l_iterator;
+    typedef boost::unordered::iterator_detail::cl_iterator<node, policy>
+        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 A, typename T, typename H, typename P> struct multiset
+{
+    typedef boost::unordered::detail::multiset<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;
+
+#if BOOST_UNORDERED_INTEROPERABLE_NODES
+    typedef boost::unordered::detail::pick_node<A, value_type> pick;
+#else
+    typedef boost::unordered::detail::pick_grouped_node<A, value_type> pick;
+#endif
+    typedef typename pick::node node;
+    typedef typename pick::bucket bucket;
+    typedef typename pick::link_pointer link_pointer;
+    typedef typename pick::node_algo node_algo;
+
+    typedef boost::unordered::detail::grouped_table_impl<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, policy>
+        l_iterator;
+    typedef boost::unordered::iterator_detail::cl_iterator<node, policy>
+        cl_iterator;
+
+    typedef boost::unordered::node_handle_set<node, T, A> node_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;
+};
+}
+}
+}

depends/x86_64-pc-linux-gnu/include/boost/unordered/unordered_map_fwd.hpp

@@ -0,0 +1,61 @@
+
+// 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 BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
+#define BOOST_UNORDERED_MAP_FWD_HPP_INCLUDED
+
+#include <boost/config.hpp>
+#if defined(BOOST_HAS_PRAGMA_ONCE)
+#pragma once
+#endif
+
+#include <boost/functional/hash_fwd.hpp>
+#include <boost/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>&, unordered_map<K, T, H, P, A>&);
+
+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>&, unordered_multimap<K, T, H, P, A>&);
+
+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

depends/x86_64-pc-linux-gnu/include/boost/unordered/unordered_set_fwd.hpp

@@ -0,0 +1,59 @@
+
+// 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 BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
+#define BOOST_UNORDERED_SET_FWD_HPP_INCLUDED
+
+#include <boost/config.hpp>
+#if defined(BOOST_HAS_PRAGMA_ONCE)
+#pragma once
+#endif
+
+#include <boost/functional/hash_fwd.hpp>
+#include <boost/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);
+
+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);
+
+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