| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node;
266 if(!(this_null | this_empty)){
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :…
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node;
266 if(!(this_null | this_empty)){
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :…
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | circular_slist_algorithms.hpp | 260 const bool this_empty = this_next == this_node; in swap_nodes() local
266 if(!(this_null | this_empty)){ in swap_nodes()
270 …NodeTraits::set_next(other_node, this_empty ? other_node : (this_next == other_node ? this_node :… in swap_nodes()
|
| /dports/devel/concurrentqueue/concurrentqueue-1.0.3-15-g0753496/benchmarks/tbb/internal/ |
| H A D | _flow_graph_node_impl.h | 470 static bool this_empty(P &p) { in this_empty() function
472 return reset_element<N-1>::this_empty(p); in this_empty()
484 static bool this_empty(P &p) {
549 …__TBB_ASSERT(!(f & rf_extract) || reset_element<N>::this_empty(my_output_ports), "multifunction_no…
|
| /dports/devel/onetbb/oneTBB-2021.4.0/include/oneapi/tbb/detail/ |
| H A D | _flow_graph_node_impl.h | 451 template<typename P> static bool this_empty(P &p) { in this_empty() function
453 return clear_element<N-1>::this_empty(p); in this_empty()
464 template<typename P> static bool this_empty(P &p) {
545 …__TBB_ASSERT(!(f & rf_clear_edges) || clear_element<N>::this_empty(my_output_ports), "multifunctio…
|
| /dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/ |
| H A D | Range.cpp | 959 bool this_empty = (mHead.mNext == &mHead); in swap() local
963 mHead.mNext->mPrev = (this_empty ? &mHead : &(range.mHead)); in swap()
964 mHead.mPrev->mNext = (this_empty ? &mHead : &(range.mHead)); in swap()
968 range.mHead.mNext = (this_empty ? &(range.mHead) : mHead.mNext); in swap()
969 range.mHead.mPrev = (this_empty ? &(range.mHead) : mHead.mPrev); in swap()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/tbb-2018_U2/include/tbb/internal/ |
| H A D | _flow_graph_node_impl.h | 478 template<typename P> static bool this_empty(P &p) { in this_empty() function
480 return clear_element<N-1>::this_empty(p); in this_empty()
489 template<typename P> static bool this_empty(P &p) {
580 …__TBB_ASSERT(!(f & rf_clear_edges) || clear_element<N>::this_empty(my_output_ports), "multifunctio…
|