/dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
H A D | linear_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & prev_init_node, con… in get_previous_node() function in boost::intrusive::linear_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 261 old_last = base_t::get_previous_node(first, node_ptr()); in move_first_n_backwards()
|
/dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
H A D | linear_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & prev_init_node, con… in get_previous_node() function in boost::intrusive::linear_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 261 old_last = base_t::get_previous_node(first, node_ptr()); in move_first_n_backwards()
|
/dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) BOOST_NO… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 152 static node_ptr get_previous_node(node_ptr prev_init_node, node_ptr this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 153 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 162 static node_ptr get_previous_node(node_ptr this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 163 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 226 base_t::unlink_after(get_previous_node(this_node)); in unlink() 237 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 node_ptr prev_this (get_previous_node(this_node)); in swap_nodes() 265 node_ptr prev_other(get_previous_node(other_node)); in swap_nodes() 342 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
H A D | linear_slist_algorithms.hpp | 151 static node_ptr get_previous_node(node_ptr prev_init_node, node_ptr this_node) in get_previous_node() function in boost::intrusive::linear_slist_algorithms 152 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 256 old_last = base_t::get_previous_node(first, node_ptr(0)); in move_first_n_backwards()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… 157 { return base_t::get_previous_node(prev_init_node, this_node); } in unlink() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) 167 { return base_t::get_previous_node(this_node, this_node); } 229 base_t::unlink_after(get_previous_node(this_node)); 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… 333 base_t::unlink_after(base_t::get_previous_node(first, p));
|
/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 | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… 157 { return base_t::get_previous_node(prev_init_node, this_node); } 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) 167 { return base_t::get_previous_node(this_node, this_node); } 229 base_t::unlink_after(get_previous_node(this_node)); 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… 333 base_t::unlink_after(base_t::get_previous_node(first, p));
|
/dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
H A D | circular_slist_algorithms.hpp | 156 static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node() 166 static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms 167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node() 229 base_t::unlink_after(get_previous_node(this_node)); in unlink() 240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before() 264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes() 267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes() 333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
|