| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/detail/ |
| H A D | slist_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, const node>::type const_node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | sgtree.hpp | 242 <node_ptr, const node>::type const_node_ptr; typedef in boost::intrusive::sgtree_impl
312 static node_ptr uncast(const_node_ptr ptr) in uncast()
454 { return const_iterator (uncast(const_node_ptr(&priv_header())), this); } in cend()
568 { return node_algorithms::unique(const_node_ptr(&priv_header())); } in empty()
581 return (size_type)node_algorithms::size(const_node_ptr(&priv_header())); in size()
1211 (const_node_ptr(&priv_header()), key, key_node_comp), this); in lower_bound()
1226 (const_node_ptr(&priv_header()), key, key_node_comp), this); in lower_bound()
1251 (const_node_ptr(&priv_header()), key, key_node_comp), this); in upper_bound()
1276 (const_node_ptr(&priv_header()), key, key_node_comp), this); in upper_bound()
1300 (node_algorithms::find(const_node_ptr(&priv_header()), key, key_node_comp), this); in find()
[all …]
|
| H A D | splaytree.hpp | 114 <node_ptr, const node>::type const_node_ptr; typedef in boost::intrusive::splaytree_impl
167 static node_ptr uncast(const_node_ptr ptr) in uncast()
300 { return const_iterator (uncast(const_node_ptr(&priv_header())), this); } in cend()
428 return (size_type)node_algorithms::size(const_node_ptr(&priv_header())); in size()
977 (const_node_ptr(&priv_header()), key, key_node_comp), this); in lower_bound()
992 (const_node_ptr(&priv_header()), key, key_node_comp, false), this); in lower_bound_dont_splay()
1017 (const_node_ptr(&priv_header()), key, key_node_comp), this); in upper_bound()
1042 (const_node_ptr(&priv_header()), key, key_node_comp, false), this); in upper_bound_dont_splay()
1066 (node_algorithms::find(const_node_ptr(&priv_header()), key, key_node_comp), this); in find()
1116 (node_algorithms::equal_range(const_node_ptr(&priv_header()), key, key_node_comp)); in equal_range()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/intrusive/example/ |
| H A D | doc_slist_algorithms.cpp | 27 typedef const my_node * const_node_ptr; typedef
28 static node_ptr get_next(const_node_ptr n) { return n->next_; } in get_next()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/detail/ |
| H A D | list_node.hpp | 45 <VoidPointer, const node>::type const_node_ptr; typedef
47 static node_ptr get_previous(const_node_ptr n) in get_previous()
53 static node_ptr get_next(const_node_ptr n) in get_next()
|
| /dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/boost_include/boost/intrusive/detail/ |
| H A D | list_node.hpp | 45 <VoidPointer>:: template rebind_pointer<const node>::type const_node_ptr; typedef
47 static const node_ptr &get_previous(const const_node_ptr & n) in get_previous()
53 static const node_ptr &get_next(const const_node_ptr & n) in get_next()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/sw/inc/ |
| H A D | ring.hxx | 105 typedef const Ring* const_node_ptr; typedef
106 … static node_ptr get_next(const_node_ptr n) { return const_cast<node_ptr>(n)->m_pNext; }; in get_next()
108 … static node_ptr get_previous(const_node_ptr n) { return const_cast<node_ptr>(n)->m_pPrev; }; in get_previous()
|