| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/boost-1.60.0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
273 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in erase()
434 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
445 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
456 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
552 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
562 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/emulators/citra-qt5/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/emulators/citra/citra-ac98458e0/externals/boost/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[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 | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p));
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p));
200 balance c = NodeTraits::get_balance(node1);
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2));
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z));
583 if (NodeTraits::get_balance(x) == NodeTraits::negative())
593 if (NodeTraits::get_balance(x) == NodeTraits::positive())
[all …]
|
| /dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/boost/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in hstore_to_plperl()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in hstore_to_plperl()
200 balance c = NodeTraits::get_balance(node1); in hstore_to_plperl()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in hstore_to_plperl()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in hstore_to_plperl()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in hstore_to_plperl()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in hstore_to_plperl()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in hstore_to_plperl()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in hstore_to_plperl()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in hstore_to_plperl()
[all …]
|
| /dports/graphics/povray37/povray-3.7.0.10/libraries/boost/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 52 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
59 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
200 balance c = NodeTraits::get_balance(node1); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
455 if(NodeTraits::get_balance(n) != NodeTraits::zero()){ in verify_recursion()
466 else if(NodeTraits::get_balance(n) != NodeTraits::positive()){ in verify_recursion()
477 else if(NodeTraits::get_balance(n) != NodeTraits::negative()){ in verify_recursion()
489 NodeTraits::set_balance(info.y, NodeTraits::get_balance(z)); in rebalance_after_erasure()
583 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
593 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/intrusive/ |
| H A D | avltree_algorithms.hpp | 94 NodeTraits::set_balance(n, NodeTraits::get_balance(p)); in operator ()()
179 balance c = NodeTraits::get_balance(node1); in swap_nodes()
180 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
745 if (NodeTraits::get_balance(a) == NodeTraits::positive()) { in rebalance_after_erasure()
759 if (NodeTraits::get_balance(x) == NodeTraits::positive()){ in rebalance_after_erasure()
789 if (NodeTraits::get_balance(x) == NodeTraits::negative()){ in rebalance_after_erasure()
821 if (NodeTraits::get_balance(x) == NodeTraits::negative()) in rebalance_after_insertion()
831 if (NodeTraits::get_balance(x) == NodeTraits::positive()) in rebalance_after_insertion()
849 const balance c_balance = NodeTraits::get_balance(c); in left_right_balancing()
909 if (NodeTraits::get_balance(y) == NodeTraits::positive()) { in rotate_left()
[all …]
|
| /dports/security/snort/snort-2.9.18/src/dynamic-preprocessors/appid/util/ |
| H A D | fw_avltree.c | 27 static inline int get_balance(struct FwAvlNode* node) { return node->balance; } in get_balance() function
181 if(get_balance(node) != 0) in do_lookup()
287 switch(get_balance(unbalanced)) in fwAvlInsert()
298 if(get_balance(right) == 1) in fwAvlInsert()
305 switch(get_balance(right->left)) in fwAvlInsert()
328 if(get_balance(left) == -1) in fwAvlInsert()
335 switch(get_balance(left->right)) in fwAvlInsert()
|
| /dports/finance/frontaccounting/frontaccounting/gl/inquiry/ |
| H A D | gl_trial_balance.php | 104 …$open = get_balance($account["account_code"], $_POST['Dimension'], $_POST['Dimension2'], $begin, …
109 …$prev = get_balance($account["account_code"], $_POST['Dimension'], $_POST['Dimension2'], $begin, $…
110 …$curr = get_balance($account["account_code"], $_POST['Dimension'], $_POST['Dimension2'], $_POST['T…
111 …$tot = get_balance($account["account_code"], $_POST['Dimension'], $_POST['Dimension2'], $begin, $_…
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | ggc-common.c | 835 return (get_balance () == second.get_balance ()
847 return (get_balance () == second.get_balance () ?
850 : get_balance () < second.get_balance ());
885 size_t balance = get_balance (); in dump()
892 SIZE_AMOUNT (balance), get_percent (balance, total.get_balance ()), in dump()
918 get_balance () const in get_balance() function
932 return s.second->get_balance () - f.second->get_balance (); in compare()
|