boostorg/intrusive
1
0
Fork 1
mirror of https://github.com/boostorg/intrusive.git synced 2025-07-30 04:27:34 +02:00
Code Issues Packages Projects Releases Wiki Activity

Sync from upstream.

Browse Source
This commit is contained in:
Rene Rivera
2024-07-18 09:28:51 -05:00
parent 4ef74b1e64 b9b83bd9e6
commit 11cee48fc0
3 changed files with 16 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
doc/intrusive.qbk
View File

@ -3902,6 +3902,13 @@ to be inserted in intrusive containers are allocated using `std::vector` or `std
[section:release_notes Release Notes] [section:release_notes Release Notes]
[section:release_notes_boost_1_86_00 Boost 1.86 Release]
* Fixed bugs:
* [@https://github.com/boostorg/intrusive/issues/86 GitHub #86: ['Invalid UTF-8 character in comment]]
[endsect]
[section:release_notes_boost_1_85_00 Boost 1.85 Release] [section:release_notes_boost_1_85_00 Boost 1.85 Release]
* Fixed bugs: * Fixed bugs:

16
include/boost/intrusive/detail/algorithm.hpp
View File

@ -26,15 +26,15 @@ namespace intrusive {
struct algo_pred_equal struct algo_pred_equal
{ {
template<class T> template<class T, class T2>
bool operator()(const T &x, const T &y) const bool operator()(const T &x, const T2 &y) const
{ return x == y; } { return x == y; }
}; };
struct algo_pred_less struct algo_pred_less
{ {
template<class T> template<class T, class T2>
bool operator()(const T &x, const T &y) const bool operator()(const T &x, const T2 &y) const
{ return x < y; } { return x < y; }
}; };
@ -49,10 +49,6 @@ bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, BinaryPredicat
return true; return true;
} }
template<class InputIt1, class InputIt2>
bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2)
{ return (algo_equal)(first1, last1, first2, algo_pred_equal()); }
template<class InputIt1, class InputIt2, class BinaryPredicate> template<class InputIt1, class InputIt2, class BinaryPredicate>
bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, BinaryPredicate pred) bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, BinaryPredicate pred)
{ {
@ -62,6 +58,10 @@ bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2
return first1 == last1 && first2 == last2; return first1 == last1 && first2 == last2;
} }
template<class InputIt1, class InputIt2>
bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2)
{ return (algo_equal)(first1, last1, first2, algo_pred_equal()); }
template<class InputIt1, class InputIt2> template<class InputIt1, class InputIt2>
bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2) bool algo_equal(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2)
{ return (algo_equal)(first1, last1, first2, last2, algo_pred_equal()); } { return (algo_equal)(first1, last1, first2, last2, algo_pred_equal()); }

2
include/boost/intrusive/detail/hash.hpp
View File

@ -2,7 +2,7 @@
// //
// Copyright 2005-2014 Daniel James. // Copyright 2005-2014 Daniel James.
// Copyright 2021, 2022 Peter Dimov. // Copyright 2021, 2022 Peter Dimov.
// Copyright 2024 Ion Gazta<EFBFBD>aga. // Copyright 2024 Ion Gaztanaga.
// Distributed under the Boost Software License, Version 1.0. // Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt // https://www.boost.org/LICENSE_1_0.txt
// //