| /dports/games/minilens/minilens-1.2/main/ |
| H A D | resize_to_parent.gd | 7 if get_parent() extends Control:
8 get_parent().connect("resized", self, "resize_to_parnet_control")
10 elif get_parent() extends CanvasItem:
11 get_parent().connect("item_rect_changed", self, "resize_to_parnet_canvasitem")
15 if get_parent() extends Control:
16 get_parent().disconnect("resized", self, "resize_to_parnet_control")
17 elif get_parent() extends CanvasItem:
18 get_parent().disconnect("item_rect_changed", self, "resize_to_parnet_canvasitem")
29 resize_to(get_parent().get_size())
32 resize_to(get_parent().get_item_rect())
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in smbd_scavenger_main()
56 p = NodeTraits::get_parent(p); in smbd_scavenger_main()
73 return maximum(NodeTraits::get_parent(node));
80 node_ptr x = NodeTraits::get_parent(p); in smbd_scavenger_done()
83 x = NodeTraits::get_parent(x); in smbd_scavenger_done()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in smbd_scavenger_running()
137 (NodeTraits::get_parent(p_left) != p || in smbd_scavenger_running()
138 NodeTraits::get_parent(p_right) != p )) in smbd_scavenger_running()
157 node_ptr p(NodeTraits::get_parent(node));
161 node_ptr pp(NodeTraits::get_parent(p));
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /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 | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
73 return maximum(NodeTraits::get_parent(node)); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
[all …]
|
| /dports/devel/godot-tools/godot-3.2.3-stable/scene/2d/ |
| H A D | visibility_notifier_2d.cpp | 163 if (enabler[ENABLER_PARENT_PHYSICS_PROCESS] && get_parent()) in _screen_enter()
164 get_parent()->set_physics_process(true); in _screen_enter()
165 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) in _screen_enter()
166 get_parent()->set_process(true); in _screen_enter()
178 if (enabler[ENABLER_PARENT_PHYSICS_PROCESS] && get_parent()) in _screen_exit()
179 get_parent()->set_physics_process(false); in _screen_exit()
180 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) in _screen_exit()
181 get_parent()->set_process(false); in _screen_exit()
247 from = from->get_parent(); in _notification()
260 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) { in _notification()
[all …]
|
| /dports/devel/godot/godot-3.2.3-stable/scene/2d/ |
| H A D | visibility_notifier_2d.cpp | 163 if (enabler[ENABLER_PARENT_PHYSICS_PROCESS] && get_parent()) in _screen_enter()
164 get_parent()->set_physics_process(true); in _screen_enter()
165 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) in _screen_enter()
166 get_parent()->set_process(true); in _screen_enter()
178 if (enabler[ENABLER_PARENT_PHYSICS_PROCESS] && get_parent()) in _screen_exit()
179 get_parent()->set_physics_process(false); in _screen_exit()
180 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) in _screen_exit()
181 get_parent()->set_process(false); in _screen_exit()
247 from = from->get_parent(); in _notification()
260 if (enabler[ENABLER_PARENT_PROCESS] && get_parent()) { in _notification()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
79 node_ptr x = NodeTraits::get_parent(p); in prev_node()
82 x = NodeTraits::get_parent(x); in prev_node()
133 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
136 (NodeTraits::get_parent(p_left) != p || in is_header()
137 NodeTraits::get_parent(p_right) != p )) in is_header()
156 node_ptr p(NodeTraits::get_parent(node)); in get_header()
160 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
167 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/detail/ |
| H A D | bstree_algorithms_base.hpp | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_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 | 53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
56 p = NodeTraits::get_parent(p); in next_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
83 x = NodeTraits::get_parent(x); in prev_node()
134 if(!NodeTraits::get_parent(p) || //Header condition when empty tree in is_header()
137 (NodeTraits::get_parent(p_left) != p || in is_header()
138 NodeTraits::get_parent(p_right) != p )) in is_header()
157 node_ptr p(NodeTraits::get_parent(node)); in get_header()
161 node_ptr pp(NodeTraits::get_parent(p)); in get_header()
168 pp = NodeTraits::get_parent(pp); in get_header()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/detail/ |
| H A D | tree_algorithms.hpp | 165 { return !NodeTraits::get_parent(node); } in unique()
170 if(NodeTraits::get_parent(node)){ in get_header()
171 h = NodeTraits::get_parent(node); in get_header()
173 h = NodeTraits::get_parent(h); in get_header()
310 temp = NodeTraits::get_parent(node1); in swap_nodes()
449 x = NodeTraits::get_parent(x); in next_node()
475 x = NodeTraits::get_parent(x); in prev_node()
693 tmp = NodeTraits::get_parent(header1); in swap_tree()
1160 while(p != NodeTraits::get_parent(p_parent = NodeTraits::get_parent(p))){ in depth()
1413 x = NodeTraits::get_parent(x); in unlink()
[all …]
|