Home
last modified time | relevance | path

Searched refs:get_value_traits (Results 1 – 25 of 505) sorted by relevance

12345678910>>...21

/dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dlist_iterator.hpp71 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
75 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
87 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::list_iterator
131 { return list_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
138 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dlist_iterator.hpp71 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
75 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
87 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::list_iterator
131 { return list_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
138 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dlist_iterator.hpp71 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
75 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
87 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::list_iterator
131 { return list_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
138 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/
H A Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
H A Dlist_iterator.hpp71 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
75 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
87 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::list_iterator
131 { return list_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
138 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/
H A Dtree_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
136 const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
141 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
145 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
152 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()

12345678910>>...21