| /dports/net-im/tdlib/td-a53cb30e99f937cfd64e0266fa558785a184a553/td/telegram/ |
| H A D | InputDialogId.cpp | 117 auto rhs_it = rhs.begin(); in are_equivalent() local
118 while (lhs_it != lhs.end() || rhs_it != rhs.end()) { in are_equivalent()
122 while (rhs_it != rhs.end() && rhs_it->get_dialog_id().get_type() == DialogType::SecretChat) { in are_equivalent()
123 ++rhs_it; in are_equivalent()
125 if (lhs_it == lhs.end() || rhs_it == rhs.end()) { in are_equivalent()
128 if (lhs_it->get_dialog_id() != rhs_it->get_dialog_id()) { in are_equivalent()
132 ++rhs_it; in are_equivalent()
134 return lhs_it == lhs.end() && rhs_it == rhs.end(); in are_equivalent()
|
| /dports/graphics/scantailor/scantailor-advanced-1.0.16/filters/output/ |
| H A D | PictureZoneComparator.cpp | 25 ZoneSet::const_iterator rhs_it(rhs.begin()); in equal() local
28 for (; lhs_it != lhs_end && rhs_it != rhs_end; ++lhs_it, ++rhs_it) { in equal()
29 if (!equal(*lhs_it, *rhs_it)) { in equal()
34 return lhs_it == lhs_end && rhs_it == rhs_end; in equal()
|
| H A D | FillZoneComparator.cpp | 29 ZoneSet::const_iterator rhs_it(rhs.begin()); in equal() local
32 for (; lhs_it != lhs_end && rhs_it != rhs_end; ++lhs_it, ++rhs_it) { in equal()
33 if (!equal(*lhs_it, *rhs_it)) { in equal()
38 return lhs_it == lhs_end && rhs_it == rhs_end; in equal()
|
| /dports/devel/R-cran-Rcpp/Rcpp/inst/include/Rcpp/vector/ |
| H A D | SubMatrix.h | 62 iterator rhs_it ; in Matrix() local
64 rhs_it = sub.column_iterator(j) ; in Matrix()
66 *start = rhs_it[i] ; in Matrix()
79 iterator rhs_it ; variable
81 rhs_it = sub.column_iterator(j) ;
83 *start = rhs_it[i] ;
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/extensions/common/permissions/ |
| H A D | base_set_operators.h | 101 const_iterator rhs_it = rhs.begin(); in Equal() local
105 while (it != it_end && rhs_it != rhs_it_end) { in Equal()
106 if (it->id() > rhs_it->id()) in Equal()
108 else if (it->id() < rhs_it->id()) in Equal()
110 else if (!it->Equal(*rhs_it)) in Equal()
113 ++rhs_it; in Equal()
115 return it == it_end && rhs_it == rhs_it_end; in Equal()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/extensions/common/permissions/ |
| H A D | base_set_operators.h | 101 const_iterator rhs_it = rhs.begin(); in Equal() local
105 while (it != it_end && rhs_it != rhs_it_end) { in Equal()
106 if (it->id() > rhs_it->id()) in Equal()
108 else if (it->id() < rhs_it->id()) in Equal()
110 else if (!it->Equal(*rhs_it)) in Equal()
113 ++rhs_it; in Equal()
115 return it == it_end && rhs_it == rhs_it_end; in Equal()
|
| /dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/utility/containers/ |
| H A D | dictionary.cpp | 153 … StringMap::const_iterator it = impl->m_strings.begin(), rhs_it = rhs.impl->m_strings.begin(); in operator ==() local
155 ++it, ++rhs_it) in operator ==()
157 if (it->first != rhs_it->first || it->second != rhs_it->second) in operator ==()
434 …DictionaryMap::const_iterator it = impl->m_dictionaries.begin(), rhs_it = rhs.impl->m_dictionaries… in operator ==() local
436 ++it, ++rhs_it) in operator ==()
438 if (it->first != rhs_it->first || it->second != rhs_it->second) in operator ==()
|
| /dports/math/cadabra2/cadabra2-2.3.6.8/core/algorithms/ |
| H A D | meld.cc | 412 AdjformEx::const_iterator rhs_it = cur_adjform.begin(); in apply_tableaux() local
413 Adjform cur_term = rhs_it->first; in apply_tableaux()
441 if (rhs_it == cur_adjform.end() || rhs_it->first != cur_term) { in apply_tableaux()
445 rhs_sum = rhs_it->second; in apply_tableaux()
446 ++rhs_it; in apply_tableaux()
454 if (rhs_it != cur_adjform.end() && rhs_it->first < next_term) in apply_tableaux()
455 next_term = rhs_it->first; in apply_tableaux()
458 if (rhs_it != cur_adjform.end()) in apply_tableaux()
|
| /dports/math/polymake/polymake-4.5/lib/core/include/ |
| H A D | matrix_linalg.h | 80 auto rhs_it = rhs.begin(); in augmented_system() local
82 for (Int j = 0; j < e; ++j, ++rhs_it) { in augmented_system()
84 *rhs_it = B[i][j]; in augmented_system()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/heap/ |
| H A D | binomial_heap.hpp | 735 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
736 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
737 ++rhs_it; in merge_and_clear_nodes()
738 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/heap/ |
| H A D | binomial_heap.hpp | 735 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
736 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
737 ++rhs_it; in merge_and_clear_nodes()
738 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/heap/ |
| H A D | binomial_heap.hpp | 735 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
736 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
737 ++rhs_it; in merge_and_clear_nodes()
738 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/heap/ |
| H A D | binomial_heap.hpp | 732 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
733 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
734 ++rhs_it; in merge_and_clear_nodes()
735 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/heap/ |
| H A D | binomial_heap.hpp | 735 node_list_iterator rhs_it = rhs.trees.begin();
736 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count())
737 ++rhs_it;
738 rhs.insert_node(rhs_it, carry_node);
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/heap/ |
| H A D | binomial_heap.hpp | 728 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
729 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
730 ++rhs_it; in merge_and_clear_nodes()
731 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 767 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
768 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
769 ++rhs_it; in merge_and_clear_nodes()
770 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 767 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
768 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
769 ++rhs_it; in merge_and_clear_nodes()
770 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/heap/ |
| H A D | binomial_heap.hpp | 767 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
768 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
769 ++rhs_it; in merge_and_clear_nodes()
770 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/heap/ |
| H A D | binomial_heap.hpp | 767 node_list_iterator rhs_it = rhs.trees.begin(); in merge_and_clear_nodes() local
768 … while (static_cast<node_pointer>(&*rhs_it)->child_count() < carry_node->child_count()) in merge_and_clear_nodes()
769 ++rhs_it; in merge_and_clear_nodes()
770 rhs.insert_node(rhs_it, carry_node); in merge_and_clear_nodes()
|
| /dports/devel/R-cran-cpp11/cpp11/inst/include/cpp11/ |
| H A D | r_vector.hpp | 1011 auto rhs_it = rhs.begin(); in operator ==() local
1015 if (!(*lhs_it == *rhs_it)) { in operator ==()
1019 ++rhs_it; in operator ==()
|