| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | slist.hpp | 1995 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
1997 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1999 this->set_last_node(before_l_n); in priv_splice_after()
2001 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2005 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2008 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2012 this->set_last_node(before_l_n); in priv_incorporate_after()
2015 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | slist.hpp | 1994 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
1996 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1998 this->set_last_node(before_l_n); in priv_splice_after()
2000 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2004 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2007 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2011 this->set_last_node(before_l_n); in priv_incorporate_after()
2014 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | slist.hpp | 1995 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
1997 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1999 this->set_last_node(before_l_n); in priv_splice_after()
2001 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2005 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2008 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2012 this->set_last_node(before_l_n); in priv_incorporate_after()
2015 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | slist.hpp | 1991 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1993 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1995 this->set_last_node(before_l_n); in priv_splice_after()
1997 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2001 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2004 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2008 this->set_last_node(before_l_n); in priv_incorporate_after()
2011 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | slist.hpp | 1995 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
1997 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1999 this->set_last_node(before_l_n); in priv_splice_after()
2001 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2005 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2008 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2012 this->set_last_node(before_l_n); in priv_incorporate_after()
2015 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | slist.hpp | 1998 …oid priv_splice_after(node_ptr prev_pos_n, slist_impl &x, node_ptr before_f_n, node_ptr before_l_n) in priv_splice_after() argument
2000 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
2002 this->set_last_node(before_l_n); in priv_splice_after()
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2011 void priv_incorporate_after(node_ptr prev_pos_n, node_ptr first_n, node_ptr before_l_n) in priv_incorporate_after() argument
2015 this->set_last_node(before_l_n); in priv_incorporate_after()
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | slist.hpp | 1998 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n)
2000 if (cache_last && (before_f_n != before_l_n)){
2002 this->set_last_node(before_l_n);
2004 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){
2008 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n);
2011 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n)
2015 this->set_last_node(before_l_n);
2018 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n);
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | slist.hpp | 1991 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1993 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1995 this->set_last_node(before_l_n); in priv_splice_after()
1997 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
2001 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
2004 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2008 this->set_last_node(before_l_n); in priv_incorporate_after()
2011 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | slist.hpp | 1986 …nst node_ptr & prev_pos_n, slist_impl &x, const node_ptr & before_f_n, const node_ptr & before_l_n) in priv_splice_after() argument
1988 if (cache_last && (before_f_n != before_l_n)){ in priv_splice_after()
1990 this->set_last_node(before_l_n); in priv_splice_after()
1992 if(&x != this && node_traits::get_next(before_l_n) == x.get_end_node()){ in priv_splice_after()
1996 node_algorithms::transfer_after(prev_pos_n, before_f_n, before_l_n); in priv_splice_after()
1999 …corporate_after(const node_ptr & prev_pos_n, const node_ptr & first_n, const node_ptr & before_l_n) in priv_incorporate_after() argument
2003 this->set_last_node(before_l_n); in priv_incorporate_after()
2006 node_algorithms::incorporate_after(prev_pos_n, first_n, before_l_n); in priv_incorporate_after()
|