| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | linear_slist_algorithms.hpp | 63 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::linear_slist_algorithms
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
167 static std::size_t count(const const_node_ptr & this_node) in count()
170 const_node_ptr p = this_node; in count()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/intrusive/example/ |
| H A D | doc_treap_algorithms.cpp | 32 typedef const my_node * const_node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr &this_node) in inited()
109 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr &this_node) in inited()
109 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr &this_node) BOOST_NOEXCEPT in inited()
108 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr &this_node) BOOST_NOEXCEPT in unique()
122 static std::size_t count(const const_node_ptr &this_node) BOOST_NOEXCEPT in count()
125 const_node_ptr p = this_node; in count()
361 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) BOOST_NOEXCEPT in distance()
363 const_node_ptr i(f); in distance()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 static bool inited(const const_node_ptr &this_node) in inited()
109 static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 static bool inited(const const_node_ptr &this_node) in inited()
109 static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 static bool inited(const const_node_ptr &this_node) in inited()
109 static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr &this_node) in inited()
109 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 61 typedef typename NodeTraits::const_node_ptr const_node_ptr; typedef in boost::intrusive::circular_list_algorithms
83 static bool inited(const const_node_ptr &this_node) in inited()
109 static bool unique(const const_node_ptr &this_node) in unique()
123 static std::size_t count(const const_node_ptr &this_node) in count()
126 const_node_ptr p = this_node; in count()
362 static std::size_t distance(const const_node_ptr &f, const const_node_ptr &l) in distance()
364 const_node_ptr i(f); in distance()
|