| /dports/math/openturns/openturns-1.18/lib/src/Base/Func/ |
| H A D | ComposedFunction.cxx | 46 const Implementation & p_right) in ComposedFunction() argument
47 …: FunctionImplementation(new ComposedEvaluation(p_left->getEvaluation(), p_right->getEvaluation()), in ComposedFunction()
51 , p_rightFunction_(p_right) in ComposedFunction()
55 …setGradient(new ComposedGradient(p_left->getGradient(), p_right->getEvaluation(), p_right->getGrad… in ComposedFunction()
56 …setUseDefaultGradientImplementation(p_left->getUseDefaultGradientImplementation() || p_right->getU… in ComposedFunction()
64 …an(p_left->getGradient(), p_left->getHessian(), p_right->getEvaluation(), p_right->getGradient(), … in ComposedFunction()
65 …setUseDefaultHessianImplementation(p_left->getUseDefaultHessianImplementation() || p_right->getUse… in ComposedFunction()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 114 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
115 ;p_right in maximum()
116 ;p_right = NodeTraits::get_right(node)){ in maximum()
117 node = p_right; in maximum()
132 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
134 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
135 (p_left == p_right || //Header condition when only node in is_header()
137 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in scavenger_sig_term_handler()
116 ;p_right in scavenger_sig_term_handler()
117 ;p_right = NodeTraits::get_right(node)){ in scavenger_sig_term_handler()
118 node = p_right; in scavenger_sig_term_handler()
133 node_ptr p_right(NodeTraits::get_right(p)); in smbd_scavenger_running()
135 (p_left && p_right && //Header always has leftmost and rightmost in smbd_scavenger_running()
136 (p_left == p_right || //Header condition when only node in smbd_scavenger_running()
138 NodeTraits::get_parent(p_right) != p )) in smbd_scavenger_running()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /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 | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 115 for(node_ptr p_right = NodeTraits::get_right(node) in maximum() local
116 ;p_right in maximum()
117 ;p_right = NodeTraits::get_right(node)){ in maximum()
118 node = p_right; in maximum()
133 node_ptr p_right(NodeTraits::get_right(p)); in is_header() local
135 (p_left && p_right && //Header always has leftmost and rightmost in is_header()
136 (p_left == p_right || //Header condition when only node in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
|
| /dports/devel/godot2-tools/godot-2.1.6-stable/core/math/ |
| H A D | triangle_mesh.h | 60 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
62 return p_left->center.x < p_right->center.x; in operator()
68 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
70 return p_left->center.y < p_right->center.y; in operator()
75 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
77 return p_left->center.z < p_right->center.z; in operator()
|
| /dports/devel/godot2/godot-2.1.6-stable/core/math/ |
| H A D | triangle_mesh.h | 60 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
62 return p_left->center.x < p_right->center.x; in operator()
68 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
70 return p_left->center.y < p_right->center.y; in operator()
75 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
77 return p_left->center.z < p_right->center.z; in operator()
|
| /dports/devel/godot/godot-3.2.3-stable/core/math/ |
| H A D | triangle_mesh.h | 62 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
64 return p_left->center.x < p_right->center.x; in operator()
70 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
72 return p_left->center.y < p_right->center.y; in operator()
77 bool operator()(const BVH *p_left, const BVH *p_right) const { in operator()
79 return p_left->center.z < p_right->center.z; in operator()
|