| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 158 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
173 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
248 node_ptr temp(NodeTraits::get_previous(this_node)); in swap_prev()
304 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
305 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
306 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
330 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
331 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
371 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
389 node_ptr last = NodeTraits::get_previous(p); in move_forward()
[all …]
|
| /dports/science/smoldyn/smoldyn-2.67/source/NextSubVolume/boost_include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 158 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
173 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
254 node_ptr temp(NodeTraits::get_previous(this_node)); in swap_prev()
310 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
311 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
312 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
336 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
337 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
377 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
395 node_ptr last = NodeTraits::get_previous(p); in move_forward()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 159 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
174 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
257 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
258 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
259 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
283 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
284 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
324 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
342 node_ptr last = NodeTraits::get_previous(p); in move_forward()
349 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in insert_commit_data_t()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in insert_commit_data_t()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in insert_commit_data_t()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in insert_commit_data_t()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in insert_commit_data_t()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in insert_commit_data_t()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in insert_commit_data_t()
325 if(first == NodeTraits::get_previous(p)) return; in insert_commit_data_t()
343 node_ptr last = NodeTraits::get_previous(p); in insert_commit_data_t()
350 last = NodeTraits::get_previous(last); in insert_commit_data_t()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b));
175 node_ptr prev(NodeTraits::get_previous(nxt_node));
258 node_ptr prev_p(NodeTraits::get_previous(p));
259 node_ptr prev_b(NodeTraits::get_previous(b));
260 node_ptr prev_e(NodeTraits::get_previous(e));
284 node_ptr prev_p(NodeTraits::get_previous(p));
285 node_ptr prev_i(NodeTraits::get_previous(i));
325 if(first == NodeTraits::get_previous(p)) return;
343 node_ptr last = NodeTraits::get_previous(p);
350 last = NodeTraits::get_previous(last);
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b));
175 node_ptr prev(NodeTraits::get_previous(nxt_node));
258 node_ptr prev_p(NodeTraits::get_previous(p));
259 node_ptr prev_b(NodeTraits::get_previous(b));
260 node_ptr prev_e(NodeTraits::get_previous(e));
284 node_ptr prev_p(NodeTraits::get_previous(p));
285 node_ptr prev_i(NodeTraits::get_previous(i));
325 if(first == NodeTraits::get_previous(p)) return;
343 node_ptr last = NodeTraits::get_previous(p);
350 last = NodeTraits::get_previous(last);
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | circular_list_algorithms.hpp | 160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
175 node_ptr prev(NodeTraits::get_previous(nxt_node)); in link_before()
258 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
259 node_ptr prev_b(NodeTraits::get_previous(b)); in transfer()
260 node_ptr prev_e(NodeTraits::get_previous(e)); in transfer()
284 node_ptr prev_p(NodeTraits::get_previous(p)); in transfer()
285 node_ptr prev_i(NodeTraits::get_previous(i)); in transfer()
325 if(first == NodeTraits::get_previous(p)) return; in move_backwards()
343 node_ptr last = NodeTraits::get_previous(p); in move_forward()
350 last = NodeTraits::get_previous(last); in move_forward()
[all …]
|
| /dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/ |
| H A D | gtklistlistmodel.c | 39 gpointer (* get_previous) (gpointer, gpointer); member
84 result = self->get_previous (result, self->data); in gtk_list_list_model_get_item()
142 gpointer (* get_previous) (gpointer, gpointer), in gtk_list_list_model_new()
160 get_previous, in gtk_list_list_model_new()
171 gpointer (* get_previous) (gpointer, gpointer), in gtk_list_list_model_new_with_size()
181 g_return_val_if_fail (get_previous != NULL, NULL); in gtk_list_list_model_new_with_size()
189 result->get_previous = get_previous; in gtk_list_list_model_new_with_size()
|
| /dports/net-im/fractal/fractal-4.4.0/vendor/gstreamer-pbutils/src/ |
| H A D | discoverer_stream_info.rs | 30 c.get_previous() in next()
49 stream_info: self.get_previous(), in previous_iter()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/detail/ |
| H A D | list_node.hpp | 49 static node_ptr get_previous(const const_node_ptr & n) in get_previous() function
52 static node_ptr get_previous(const node_ptr & n) in get_previous() function
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/detail/ |
| H A D | list_node.hpp | 49 static node_ptr get_previous(const const_node_ptr & n) in get_previous() function
52 static node_ptr get_previous(const node_ptr & n) in get_previous() function
|