| /dports/devel/py-gevent/gevent-21.8.0/src/gevent/_generated_include/ |
| H A D | UnicodeConcatInPlace_impl_4409899bcbaf445d48b0aa2c080841cce586d50d.h | 13 static CYTHON_INLINE PyObject *__Pyx_PyUnicode_ConcatInPlaceImpl(PyObject **p_left, PyObject *right in __Pyx_PyUnicode_ConcatInPlaceImpl() argument
18 PyObject *left = *p_left; in __Pyx_PyUnicode_ConcatInPlaceImpl()
44 __Pyx_GIVEREF(*p_left); in __Pyx_PyUnicode_ConcatInPlaceImpl()
45 if (unlikely(PyUnicode_Resize(p_left, new_len) != 0)) { in __Pyx_PyUnicode_ConcatInPlaceImpl()
46 __Pyx_GOTREF(*p_left); in __Pyx_PyUnicode_ConcatInPlaceImpl()
49 __Pyx_INCREF(*p_left); in __Pyx_PyUnicode_ConcatInPlaceImpl()
50 _PyUnicode_FastCopyCharacters(*p_left, left_len, right, 0, right_len); in __Pyx_PyUnicode_ConcatInPlaceImpl()
51 return *p_left; in __Pyx_PyUnicode_ConcatInPlaceImpl()
|
| /dports/devel/libzvbi/zvbi-0.2.35/src/ |
| H A D | dvb_mux.c | 155 p_left -= du_size; in encode_stuffing()
158 if (p_left > 0) { in encode_stuffing()
161 if (p_left >= 2) { in encode_stuffing()
163 p[1] = p_left - 2; in encode_stuffing()
506 p_left -= du_size; in insert_sliced_data_units()
609 unsigned int p_left; in vbi_dvb_multiplex_sliced() local
1003 unsigned int p_left; in vbi_dvb_multiplex_raw() local
1570 p_left = 0; in generate_pes_packet()
1579 size += p_left; in generate_pes_packet()
1826 p_left -= size; in vbi_dvb_mux_cor()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 97 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
98 ;p_left in minimum()
99 ;p_left = NodeTraits::get_left(node)){ in minimum()
100 node = p_left; in minimum()
131 node_ptr p_left (NodeTraits::get_left(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()
136 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in smbd_scavenger_parent_dead()
99 ;p_left in smbd_scavenger_parent_dead()
100 ;p_left = NodeTraits::get_left(node)){ in smbd_scavenger_parent_dead()
101 node = p_left; in smbd_scavenger_parent_dead()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in smbd_scavenger_running()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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 | 98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum() local
99 ;p_left in minimum()
100 ;p_left = NodeTraits::get_left(node)){ in minimum()
101 node = p_left; in minimum()
132 node_ptr p_left (NodeTraits::get_left(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()
137 (NodeTraits::get_parent(p_left) != 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()
|