bgirgis/cpp-thirdparty
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update boost

Browse Source
This commit is contained in:
Bassem Girgis
2023-11-24 12:56:13 -06:00
parent cfc99971af
commit 19d727037a
9260 changed files with 849256 additions and 299957 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
linx64/include/boost/sort/common/util/algorithm.hpp
View File

@@ -13,6 +13,7 @@
#ifndef __BOOST_SORT_COMMON_UTIL_ALGORITHM_HPP
#define __BOOST_SORT_COMMON_UTIL_ALGORITHM_HPP
#include <ciso646>
#include <algorithm>
#include <functional>
#include <iterator>

1
linx64/include/boost/sort/common/util/atomic.hpp
View File

@@ -12,6 +12,7 @@
#ifndef __BOOST_SORT_PARALLEL_DETAIL_UTIL_ATOMIC_HPP
#define __BOOST_SORT_PARALLEL_DETAIL_UTIL_ATOMIC_HPP
#include <ciso646>
#include <atomic>
#include <cassert>
#include <type_traits>

5
linx64/include/boost/sort/common/util/circular_buffer.hpp
View File

@@ -13,6 +13,7 @@
#ifndef __BOOST_SORT_COMMON_UTIL_CIRCULAR_BUFFER_HPP
#define __BOOST_SORT_COMMON_UTIL_CIRCULAR_BUFFER_HPP
#include <ciso646>
#include <memory>
#include <cassert>
#include <exception>
@@ -70,7 +71,7 @@ struct circular_buffer
circular_buffer(void)
: ptr(nullptr), nelem(0), first_pos(0), initialized(false)
{
ptr = std::get_temporary_buffer < Value_t > (NMAX).first;
ptr = static_cast <Value_t*> (std::malloc (NMAX * sizeof(Value_t)));
if (ptr == nullptr) throw std::bad_alloc();
};
//
@@ -84,7 +85,7 @@ struct circular_buffer
{ for (size_t i = 0; i < NMAX; ++i) (ptr + i)->~Value_t();
initialized = false;
};
std::return_temporary_buffer(ptr);
std::free(static_cast <void*> (ptr));
}
;
//

9
linx64/include/boost/sort/common/util/insert.hpp
View File

@@ -13,10 +13,8 @@
#ifndef __BOOST_SORT_COMMON_UTIL_INSERT_HPP
#define __BOOST_SORT_COMMON_UTIL_INSERT_HPP
//#include <boost/sort/spinsort/util/indirect.hpp>
#include <boost/sort/common/util/insert.hpp>
#include <boost/sort/common/util/traits.hpp>
#include <boost/sort/common/util/algorithm.hpp>
#include <ciso646>
#include <cstdlib>
#include <functional>
#include <iterator>
@@ -24,6 +22,9 @@
#include <type_traits>
#include <vector>
#include <cstddef>
#include <boost/sort/common/util/insert.hpp>
#include <boost/sort/common/util/traits.hpp>
#include <boost/sort/common/util/algorithm.hpp>
namespace boost
{

1
linx64/include/boost/sort/common/util/merge.hpp
View File

@@ -13,6 +13,7 @@
#ifndef __BOOST_SORT_COMMON_UTIL_MERGE_HPP
#define __BOOST_SORT_COMMON_UTIL_MERGE_HPP
#include <ciso646>
#include <algorithm>
#include <functional>
#include <iterator>

4
linx64/include/boost/sort/common/util/search.hpp
View File

@@ -9,8 +9,10 @@
#ifndef __BOOST_SORT_COMMON_SEARCH_HPP
#define __BOOST_SORT_COMMON_SEARCH_HPP
#include <boost/sort/common/util/traits.hpp>
#include <ciso646>
#include <cassert>
#include <boost/sort/common/util/traits.hpp>
namespace boost
{

1
linx64/include/boost/sort/common/util/traits.hpp
View File

@@ -12,6 +12,7 @@
#ifndef __BOOST_SORT_COMMON_UTIL_TRAITS_HPP
#define __BOOST_SORT_COMMON_UTIL_TRAITS_HPP
#include <ciso646>
#include <functional>
#include <iterator>
#include <type_traits>