/dports/math/armadillo/armadillo-10.7.1/include/armadillo_bits/ |
H A D | MapMat_meat.hpp | 1102 : s_parent(in_s_parent) in SpMat_MapMat_val() 1187 s_parent.cache_mutex.lock(); in operator =() 1222 s_parent.cache_mutex.lock(); in operator +=() 1257 s_parent.cache_mutex.lock(); in operator -=() 1290 s_parent.cache_mutex.lock(); in operator *=() 1323 s_parent.cache_mutex.lock(); in operator /=() 1415 s_parent.sync_state = 1; in set() 1446 s_parent.sync_state = 1; in add() 1477 s_parent.sync_state = 1; in sub() 1520 s_parent.sync_state = 1; in mul() [all …]
|
/dports/math/R-cran-RcppArmadillo/RcppArmadillo/inst/include/armadillo_bits/ |
H A D | MapMat_meat.hpp | 1102 : s_parent(in_s_parent) in SpMat_MapMat_val() 1187 s_parent.cache_mutex.lock(); in operator =() 1222 s_parent.cache_mutex.lock(); in operator +=() 1257 s_parent.cache_mutex.lock(); in operator -=() 1290 s_parent.cache_mutex.lock(); in operator *=() 1323 s_parent.cache_mutex.lock(); in operator /=() 1415 s_parent.sync_state = 1; in set() 1446 s_parent.sync_state = 1; in add() 1477 s_parent.sync_state = 1; in sub() 1520 s_parent.sync_state = 1; in mul() [all …]
|
/dports/audio/polyphone/polyphone-75a5e88/sources/editor/tools/ |
H A D | abstracttool.cpp | 33 QWidget * AbstractTool::s_parent = nullptr; member in AbstractTool 51 s_parent = parent; in initialize() 89 _toolDialog = new ToolDialog(_toolGui, this, s_parent); in run() 114 runInternal(s_sm, s_parent, _currentIds, _toolParameters); in onParametersValidated() 122 QMessageBox::warning(s_parent, tr("Warning"), warning); in onFinished() 127 QMessageBox::information(s_parent, tr("Information"), info); in onFinished()
|
/dports/sysutils/lnav/lnav-0.10.1/src/base/ |
H A D | isc.cc | 85 : s_service_list(std::move(servs)), s_parent(parent) { in supervisor() 115 if (this->s_parent != nullptr) { in cleanup_children() 116 this->s_parent->child_finished(child); in cleanup_children()
|
/dports/net/nng/nng-1.5.2/src/core/ |
H A D | stats.c | 22 nni_stat * s_parent; member 248 stat->s_parent = NULL; in stat_make_tree() 258 cs->s_parent = stat; in stat_make_tree() 364 return (stat->s_parent); in nng_stat_parent() 370 if (stat->s_parent == NULL) { in nng_stat_next() 373 return (nni_list_next(&stat->s_parent->s_children, stat)); in nng_stat_next() 521 if (stat->s_parent != NULL) { in stat_sprint_scope() 522 stat_sprint_scope(stat->s_parent, scope, lenp); in stat_sprint_scope()
|
/dports/sysutils/webmin/webmin-1.981/dhcpd/ |
H A D | edit_subnet.cgi | 34 $s_parent = $s; 80 print &ui_select("parent", $s_parent ? $s_parent->{'index'} : "", \@shn); 85 print "<td>".&ui_hidden("parent",$s_parent->{'index'})." </td><td> </td>\n";
|
/dports/devel/py-pytools/pytools-2018.5/pytools/ |
H A D | prefork.py | 196 s_parent, s_child = socketpair() 203 s_parent.close() 208 forker = IndirectForker(fork_res, s_parent)
|
/dports/databases/py-gdbm/Python-3.8.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 113 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 127 n = s->s_top->s_parent; in push() 191 node *n = ps->p_stack.s_top->s_parent;
|
/dports/databases/py-sqlite3/Python-3.8.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 113 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 127 n = s->s_top->s_parent; in push() 191 node *n = ps->p_stack.s_top->s_parent;
|
/dports/lang/python-legacy/Python-2.7.18/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
|
/dports/lang/python37/Python-3.7.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 187 node *n = ps->p_stack.s_top->s_parent;
|
/dports/lang/python27/Python-2.7.18/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
|
/dports/lang/python-tools/Python-3.8.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 113 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 127 n = s->s_top->s_parent; in push() 191 node *n = ps->p_stack.s_top->s_parent;
|
/dports/lang/python39/Python-3.9.9/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 114 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 128 n = s->s_top->s_parent; in push() 192 node *n = ps->p_stack.s_top->s_parent;
|
/dports/lang/python38/Python-3.8.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 113 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 127 n = s->s_top->s_parent; in push() 191 node *n = ps->p_stack.s_top->s_parent;
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast27/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = Ta27Node_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
|
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast3/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = Ta3Node_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 187 node *n = ps->p_stack.s_top->s_parent;
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 112 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset); in shift() 124 n = s->s_top->s_parent; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack()
|
/dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
H A D | sgtree_algorithms.hpp | 336 const node_ptr s_parent = NodeTraits::get_parent(s); in rebalance_after_insertion() local 337 const node_ptr s_parent_left = NodeTraits::get_left(s_parent); in rebalance_after_insertion() 339 … const node_ptr s_sibling = s_parent_left == s ? NodeTraits::get_right(s_parent) : s_parent_left; in rebalance_after_insertion() 341 s = s_parent; in rebalance_after_insertion()
|
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Parser/ |
H A D | parser.c | 47 top->s_parent = parent; in s_push() 113 err = PyNode_AddChild(s->s_top->s_parent, type, str, lineno, col_offset, in shift() 127 n = s->s_top->s_parent; in push() 191 node *n = ps->p_stack.s_top->s_parent;
|