/dports/math/z3/z3-z3-4.8.13/src/util/ |
H A D | approx_set.h | 44 R m_set; 70 m_set(s.m_set) { in approx_set_tpl() 90 return r2s(s1.m_set | s2.m_set); in mk_union() 94 return r2s(s1.m_set & s2.m_set); in mk_intersection() 98 m_set |= other.m_set; 102 m_set &= other.m_set; 106 m_set &= ~(other.m_set); 181 m_set = m_set >> 1; in move_to_next() 197 m_set = m_set >> 1; 209 return m_set == it.m_set; [all …]
|
H A D | uint_set.h | 152 uint_set const* m_set; variable 241 svector<unsigned> m_set; variable 249 m_set.push_back(v); in insert() 259 m_set[i] = m_set.back(); in remove() 260 m_set.pop_back(); in remove() 269 return m_set.empty(); in empty() 276 m_set.pop_back(); in erase() 285 auto sz = m_set.size(); in reset() 287 m_set.reset(); in reset() 294 m_set[j] = m_set[i]; [all …]
|
H A D | backtrackable_set.h | 36 Set m_set; variable 49 m_set.insert(e); in insert() 52 m_set.insert(e); in insert() 59 m_set.insert(e); in erase() 61 else if (m_set.contains(e)) { in erase() 62 m_set.erase(e); in erase() 68 return m_set.contains(e); in contains() 72 return m_set.empty(); in empty() 101 m_set.reset(); in reset() 105 return m_set.begin(); in begin() [all …]
|
H A D | obj_pair_set.h | 35 set m_set; variable 37 void insert(T1 * t1, T2 * t2) { m_set.insert(obj_pair(t1, t2)); } in insert() 38 void insert(obj_pair const & p) { m_set.insert(p); } in insert() 41 void erase(T1 * t1, T2 * t2) { m_set.erase(obj_pair(t1, t2)); } in erase() 42 void erase(obj_pair const & p) { m_set.erase(p); } in erase() 44 bool contains(T1 * t1, T2 * t2) const { return m_set.contains(obj_pair(t1, t2)); } in contains() 45 bool contains(obj_pair const & p) const { return m_set.contains(p); } in contains() 46 void reset() { m_set.reset(); } in reset() 47 bool empty() const { return m_set.empty(); } in empty() 51 iterator begin() { return m_set.begin(); } in begin() [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/util/ |
H A D | approx_set.h | 44 R m_set; 70 m_set(s.m_set) { in approx_set_tpl() 86 return r2s(s1.m_set | s2.m_set); in mk_union() 90 return r2s(s1.m_set & s2.m_set); in mk_intersection() 94 m_set |= other.m_set; 98 m_set &= other.m_set; 102 m_set &= ~(other.m_set); 177 m_set = m_set >> 1; in move_to_next() 193 m_set = m_set >> 1; 205 return m_set == it.m_set; [all …]
|
H A D | uint_set.h | 152 uint_set const* m_set; variable 241 svector<unsigned> m_set; variable 249 m_set.push_back(v); in insert() 259 m_set[i] = m_set.back(); in remove() 260 m_set.pop_back(); in remove() 269 return m_set.empty(); in empty() 275 unsigned v = m_set.back(); in erase() 276 m_set.pop_back(); in erase() 287 m_set.reset(); in reset() 294 m_set[j] = m_set[i]; [all …]
|
H A D | backtrackable_set.h | 36 Set m_set; variable 49 m_set.insert(e); in insert() 52 m_set.insert(e); in insert() 59 m_set.insert(e); in erase() 61 else if (m_set.contains(e)) { in erase() 62 m_set.erase(e); in erase() 68 return m_set.contains(e); in contains() 72 return m_set.empty(); in empty() 101 m_set.reset(); in reset() 105 return m_set.begin(); in begin() [all …]
|
H A D | obj_pair_set.h | 35 set m_set; variable 38 void insert(T1 * t1, T2 * t2) { m_set.insert(obj_pair(t1, t2)); } in insert() 39 void insert(obj_pair const & p) { m_set.insert(p); } in insert() 42 void erase(T1 * t1, T2 * t2) { m_set.erase(obj_pair(t1, t2)); } in erase() 43 void erase(obj_pair const & p) { m_set.erase(p); } in erase() 45 bool contains(T1 * t1, T2 * t2) const { return m_set.contains(obj_pair(t1, t2)); } in contains() 46 bool contains(obj_pair const & p) const { return m_set.contains(p); } in contains() 47 void reset() { m_set.reset(); } in reset() 48 bool empty() const { return m_set.empty(); } in empty() 52 iterator begin() { return m_set.begin(); } in begin() [all …]
|
/dports/x11-toolkits/kproperty/kproperty-3.2.0/examples/ |
H A D | window.cpp | 46 , m_set(this) in Window() 149 m_set.addProperty(p, group); in Window() 173 m_set.addProperty( in Window() 193 m_set.addProperty( in Window() 200 m_set.addProperty( in Window() 207 m_set.addProperty( in Window() 313 m_set.addProperty(p, group); in Window() 320 m_set.addProperty(p, group); in Window() 346 m_set.addProperty( in Window() 356 m_editorView->changeSet(&m_set); in Window() [all …]
|
/dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/shell/workingsets/ |
H A D | workingsettoolbutton.cpp | 38 return m_set; in workingSet() 43 m_set = set; in setWorkingSet() 57 Q_ASSERT(m_set); in intersectSet() 59 m_set->setPersistent(true); in intersectSet() 66 Q_ASSERT(m_set); in subtractSet() 75 Q_ASSERT(m_set); in mergeSet() 85 Q_ASSERT(m_set); in duplicateSet() 97 Q_ASSERT(m_set); in loadSet() 108 Q_ASSERT(m_set); in closeSet() 132 Q_ASSERT(m_set); in showTooltip() [all …]
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | Small_unordered_set.h | 53 std::unique_ptr<Set> m_set; variable 63 if (other.m_set) in Small_unordered_set() 64 m_set = std::make_unique<Set>(*other.m_set); in Small_unordered_set() 72 if (other.m_set) in Small_unordered_set() 73 m_set = std::move(other.m_set); in Small_unordered_set() 81 if (other.m_set) 82 m_set = std::make_unique<Set>(*other.m_set); 90 if (other.m_set) 91 m_set = std::move(other.m_set); 107 if (!m_set) in insert() [all …]
|
/dports/science/axom/axom-0.6.1/src/axom/slam/ |
H A D | DynamicMap.hpp | 41 DynamicMap() : m_set(nullptr) { } in DynamicMap() 51 DynamicMap(SetType* theSet) : m_set(theSet) in DynamicMap() 53 if(m_set != nullptr) in DynamicMap() 55 m_data.resize(m_set->size()); in DynamicMap() 71 if(m_set != nullptr) in DynamicMap() 73 m_data.resize(m_set->size(), defaultValue); in DynamicMap() 81 const SetType* set() const { return m_set; } in set() 116 return (m_set != nullptr) ? m_set->numberOfValidEntries() : 0; in numberOfValidEntries() 126 return (m_set != nullptr) ? m_set->isValidEntry(pos) : false; in isValidEntry() 197 SetType* m_set; member in axom::slam::DynamicMap [all …]
|
/dports/devel/umbrello/umbrello-21.12.3/lib/cppparser/ |
H A D | cachemanager.cpp | 19 m_set.erase(node); in remove() 24 m_set.insert(node); in add() 41 SetType oldSet = m_set; in restart() 42 m_set = SetType(); in restart() 47 m_set.insert(*it); in restart() 54 m_set.erase(node); in access() 56 m_set.insert(node); in access() 73 if (m_set.size() > m_maxNodes) { in increaseFrame() 75 int mustErase = m_set.size() - m_maxNodes; in increaseFrame() 78 SetType::iterator it = m_set.begin(); in increaseFrame() [all …]
|
/dports/graphics/sane-epkowa/iscan-2.11.0/frontend/ |
H A D | pisa_view_manager.cc | 157 m_set.option = PISA_OP_FLATBED; in init() 158 m_set.film = PISA_FT_REFLECT; in init() 161 m_set.usm = 1; in init() 162 m_set.unit = PISA_UNIT_INCHES; in init() 205 m_set.delete_all ( ); in destroy() 389 switch ( m_set.destination ) in start_scan() 426 if (option == m_set.option && film == m_set.film) in change_document_source() 436 m_set.option = option; in change_document_source() 437 m_set.film = film; in change_document_source() 541 m_set.init ( & marq ); in init_img_info() [all …]
|
H A D | pisa_view_manager.h | 131 settings m_set; variable 151 return m_set; in get_settings() 157 return m_set.get_marquee (index); in get_marquee() 163 return m_set.get_marquee (index); in get_marquee() 169 return m_set.get_marquee_size (); in get_marquee_size() 175 m_set.add_marquee (m); in add_marquee() 181 m_set.del_marquee (index); in del_marquee() 187 m_set.destination = destination; in set_destination() 193 m_set.resolution = resolution; in set_resolution() 205 m_set.unit = unit; in set_unit() [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/sat/ |
H A D | sat_clause_set.cpp | 28 unsigned pos = m_set.size(); in insert() 30 m_set.push_back(&c); in insert() 44 unsigned last_pos = m_set.size() - 1; in erase() 46 clause * last_c = m_set[last_pos]; in erase() 47 m_set[pos] = last_c; in erase() 50 m_set.pop_back(); in erase() 56 clause & c = *m_set.back(); in erase() 58 SASSERT(m_id2pos[c.id()] == m_set.size()-1); in erase() 62 m_set.pop_back(); in erase() 84 SASSERT(pos < m_set.size()); in check_invariant() [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/ |
H A D | sat_clause_set.cpp | 28 unsigned pos = m_set.size(); in insert() 30 m_set.push_back(&c); in insert() 44 unsigned last_pos = m_set.size() - 1; in erase() 46 clause * last_c = m_set[last_pos]; in erase() 47 m_set[pos] = last_c; in erase() 50 m_set.pop_back(); in erase() 56 clause & c = *m_set.back(); in erase() 58 SASSERT(m_id2pos[c.id()] == m_set.size()-1); in erase() 62 m_set.pop_back(); in erase() 84 SASSERT(pos < m_set.size()); in check_invariant() [all …]
|
/dports/net/grive2/grive2-ffb744a/libgrive/src/base/ |
H A D | ResourceTree.cc | 35 m_set.insert( m_root ) ; in ResourceTree() 48 m_set.insert( c ) ; in ResourceTree() 65 m_set.clear() ; in Clear() 88 HrefMap& map = m_set.get<ByHref>() ; in FindByHref() 102 MD5Map& map = m_set.get<ByMD5>() ; in FindByMD5() 110 SizeMap& map = m_set.get<BySize>() ; in FindBySize() 117 Set& s = m_set.get<ByIdentity>() ; in ReInsert() 122 m_set.insert( coll ) ; in ReInsert() 131 m_set.insert( coll ) ; in Insert() 136 Set& s = m_set.get<ByIdentity>() ; in Erase() [all …]
|
/dports/devel/libassa/libassa-3.5.1/assa/ |
H A D | SigHandlersList.h | 163 set_t* m_set; 187 m_set = new set_t; in SigHandlersList() 197 delete m_set; in ~SigHandlersList() local 198 m_set = NULL; in ~SigHandlersList() 225 return m_set->empty (); in empty() 236 return m_set->size (); in size() 275 m_set->erase (key_); in erase() 285 m_set->erase (m_set->begin(), m_set->end()); in erase() 295 m_set->erase(it_); in erase() 304 return m_set->begin (); in begin() [all …]
|
/dports/net/arataga/oess-2.2.3/dev/test/stdsn/containers/ |
H A D | main.cpp | 354 m_set.insert("a"); in fill_in() 355 m_set.insert("g"); in fill_in() 356 m_set.insert("e"); in fill_in() 357 m_set.insert("d"); in fill_in() 358 m_set.insert("c"); in fill_in() 359 m_set.insert("f"); in fill_in() 360 m_set.insert("h"); in fill_in() 361 m_set.insert("b"); in fill_in() 422 m_set.insert("1"); in fill_in() 423 m_set.insert("2"); in fill_in() [all …]
|
/dports/devel/pire/pire-release-0.0.6/pire/ |
H A D | partition.h | 51 DoAppend(m_set, t); in Append() 57 return m_set.begin(); in Begin() 60 return m_set.begin(); in begin() 63 return m_set.end(); in End() 66 return m_set.end(); in end() 69 return m_set.size(); in Size() 72 return m_set.empty(); in Empty() 101 Y_ASSERT(it2 != m_set.end()); in Index() 116 bool operator == (const Partition& rhs) const { return m_set == rhs.m_set; } 127 for (auto&& element : m_set) in Split() [all …]
|
/dports/security/modsecurity3/modsecurity-v3.0.5/headers/modsecurity/ |
H A D | rules_set_properties.h | 70 bool m_set; variable 74 if (m_set == true || from->m_set == false) { in merge() 77 m_set = true; in merge() 87 bool m_set; variable 91 if (m_set == true || from->m_set == false) { in merge() 94 m_set = true; in merge() 104 bool m_set; variable 108 if (m_set == true || from->m_set == false) { in merge() 111 m_set = true; in merge() 121 bool m_set; variable [all …]
|
/dports/graphics/aseprite/aseprite-1.2.9/src/doc/ |
H A D | selected_layers.h | 27 iterator begin() { return m_set.begin(); } in begin() 28 iterator end() { return m_set.end(); } in end() 29 const_iterator begin() const { return m_set.begin(); } in begin() 30 const_iterator end() const { return m_set.end(); } in end() 32 bool empty() const { return m_set.empty(); } in empty() 33 layer_t size() const { return (layer_t)m_set.size(); } in size() 51 return m_set == o.m_set; 62 Set m_set;
|
/dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/shell/tests/ |
H A D | test_problemmodelset.cpp | 56 QScopedPointer<ProblemModelSet> m_set; member in TestProblemModelSet 66 m_set.reset(new ProblemModelSet()); in initTestCase() 86 QSignalSpy spy(m_set.data(), &ProblemModelSet::added); in testAddModel() 93 QCOMPARE(m_set->models().count(), c); in testAddModel() 102 model = m_set->findModel(m_testData[i].id); in testFindModel() 108 model = m_set->findModel(QString()); in testFindModel() 111 model = m_set->findModel(QStringLiteral("RandomName")); in testFindModel() 117 QVector<ModelData> models = m_set->models(); in testModelListing() 128 QSignalSpy spy(m_set.data(), &ProblemModelSet::removed); in testRemoveModel() 132 m_set->removeModel(data.id); in testRemoveModel() [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/math/automata/ |
H A D | symbolic_automata.h | 45 uint_set m_set; variable 53 m_set(s), in block() 60 m_set.insert(vs[i]); in block() 67 m_set = b.m_set; 75 uint_set::iterator it = m_set.begin(); in get_representative() 76 if (m_set.end() != it) { in get_representative() 84 void insert(unsigned i) { m_set.insert(i); } in insert() 86 bool is_empty() const { return m_set.empty(); } in is_empty() 87 unsigned size() const { return m_set.num_elems(); } in size() 89 void clear() { m_set.reset(); m_rep_chosen = false; } in clear() [all …]
|