| /dports/devel/R-cran-Rcpp/Rcpp/inst/include/Rcpp/sugar/functions/ |
| H A D | setdiff.h | 48 lhs_set( get_const_begin(lhs), get_const_end(lhs) ), in SetDiff()
56 R_xlen_t n = lhs_set.size() ; in get()
58 std::copy( lhs_set.begin(), lhs_set.end(), out.begin() ) ; in get()
65 SET lhs_set ; variable
76 lhs_set( get_const_begin(lhs), get_const_end(lhs) ), in SetEqual()
82 if( lhs_set.size() != rhs_set.size() ) return false ; in get()
84 ITERATOR it = lhs_set.begin(), end = lhs_set.end(), rhs_end = rhs_set.end() ; in get()
94 SET lhs_set ; variable
108 SET lhs_set( get_const_begin(lhs), get_const_end(lhs) ) ; in Intersect()
111 ITERATOR end = lhs_set.end() ; in Intersect()
[all …]
|
| /dports/textproc/p5-CSS-Sass/CSS-Sass-3.6.4/patches/ |
| H A D | 0003-Remove-reserve-call-for-hash-maps.patch | 31 std::unordered_set<const Complex_Selector *, HashPtr, ComparePtrs> lhs_set;
32 - lhs_set.reserve(length());
34 lhs_set.insert(element.ptr());
39 std::unordered_set<const Simple_Selector *, HashPtr, ComparePtrs> lhs_set;
40 - lhs_set.reserve(length());
42 lhs_set.insert(element.ptr());
|
| /dports/www/py-libsass/libsass-0.21.0/libsass/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/www/gohugo/hugo-0.91.2/vendor/github.com/bep/golibsass/libsass_src/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/textproc/libsass/libsass-3.6.4/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/textproc/p5-CSS-Sass/CSS-Sass-3.6.4/libsass/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/www/zola/zola-0.15.2/cargo-crates/sass-sys-0.4.22/libsass/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/textproc/R-cran-sass/sass/src/libsass/src/ |
| H A D | ast_sel_cmp.cpp | 74 std::unordered_set<const ComplexSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
75 lhs_set.reserve(length()); in operator ==()
77 lhs_set.insert(element.ptr()); in operator ==()
80 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
210 std::unordered_set<const SimpleSelector*, PtrObjHash, PtrObjEquality> lhs_set; in operator ==() local
211 lhs_set.reserve(length()); in operator ==()
213 lhs_set.insert(element.ptr()); in operator ==()
217 if (lhs_set.find(element.ptr()) == lhs_set.end()) return false; in operator ==()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/xml/ |
| H A D | xpath_predicate.cc | 106 const NodeSet& lhs_set = lhs.ToNodeSet(&context); in Compare() local
114 for (const auto& left_node : lhs_set) { in Compare()
129 for (const auto& left_node : lhs_set) { in Compare()
141 for (const auto& left_node : lhs_set) { in Compare()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/xml/ |
| H A D | xpath_predicate.cc | 106 const NodeSet& lhs_set = lhs.ToNodeSet(&context); in Compare() local
114 for (const auto& left_node : lhs_set) { in Compare()
129 for (const auto& left_node : lhs_set) { in Compare()
141 for (const auto& left_node : lhs_set) { in Compare()
|
| /dports/cad/openroad/OpenROAD-2.0/src/OpenDB/src/db/ |
| H A D | dbDiff.hpp | 147 dbSet<T> lhs_set(lhs_owner, lhs_itr); in diff_set() local
150 for (itr = lhs_set.begin(); itr != lhs_set.end(); ++itr) in diff_set()
|
| H A D | dbNet.cpp | 368 dbSet<_dbBTerm> lhs_set((dbObject*) this, lhs_block->_net_bterm_itr); in differences() local
371 for (itr = lhs_set.begin(); itr != lhs_set.end(); ++itr) in differences()
388 dbSet<_dbITerm> lhs_set((dbObject*) this, lhs_block->_net_iterm_itr); in differences() local
391 for (itr = lhs_set.begin(); itr != lhs_set.end(); ++itr) in differences()
|
| H A D | dbInst.cpp | 343 dbSet<_dbITerm> lhs_set((dbObject*) this, lhs_blk->_inst_iterm_itr); in differences() local
346 for (itr = lhs_set.begin(); itr != lhs_set.end(); ++itr) in differences()
|
| /dports/science/dynare/dynare-4.6.4/preprocessor/src/ |
| H A D | DynamicModel.cc | 4066 set<pair<int, int>> lhs_set, lhs_tmp_set, rhs_set; in fillVarModelTable() local
4081 equations[eqn]->arg1->collectDynamicVariables(SymbolType::endogenous, lhs_set); in fillVarModelTable()
4085 if (lhs_set.size() != 1 || !lhs_tmp_set.empty()) in fillVarModelTable()
4092 auto itlhs = lhs_set.begin(); in fillVarModelTable()
4103 lhs_set.clear(); in fillVarModelTable()
4265 set<pair<int, int>> lhs_set, lhs_tmp_set, rhs_set; in fillTrendComponentModelTable() local
4280 equations[eqn]->arg1->collectDynamicVariables(SymbolType::endogenous, lhs_set); in fillTrendComponentModelTable()
4284 if (lhs_set.size() != 1 || !lhs_tmp_set.empty()) in fillTrendComponentModelTable()
4291 auto itlhs = lhs_set.begin(); in fillTrendComponentModelTable()
4302 lhs_set.clear(); in fillTrendComponentModelTable()
|
| /dports/lang/zig/zig-0.9.0/src/ |
| H A D | Sema.zig | 4574 const lhs_set = lhs_ty.castTag(.error_set).?.data;
4575 try set.ensureUnusedCapacity(sema.gpa, lhs_set.names_len);
4576 for (lhs_set.names_ptr[0..lhs_set.names_len]) |name| {
|
| /dports/lang/zig-devel/zig-0.9.0/src/ |
| H A D | Sema.zig | 4574 const lhs_set = lhs_ty.castTag(.error_set).?.data;
4575 try set.ensureUnusedCapacity(sema.gpa, lhs_set.names_len);
4576 for (lhs_set.names_ptr[0..lhs_set.names_len]) |name| {
|