| /dports/math/cvc4/CVC4-1.7/src/context/ |
| H A D | cdhashmap.h | 139 if(d_map != NULL) { in restore()
141 Assert(d_map->d_map.find(getKey()) != d_map->d_map.end() in restore()
142 && (*d_map->d_map.find(getKey())).second == this); in restore()
144 d_map->d_map.erase(getKey()); in restore()
182 d_map(other.d_map), in CDOhash_map()
212 d_map = map; in ContextObj()
274 table_type d_map; variable
313 d_map.clear(); in clear()
320 return d_map.size(); in size()
324 return d_map.empty(); in empty()
[all …]
|
| /dports/math/cvc4/CVC4-1.7/src/util/ |
| H A D | dense_map.h | 231 BackingMap d_map; variable
250 d_map.set(x, true); in add()
278 BackingMap d_map; variable
284 DenseMultiset() : d_map() {} in DenseMultiset()
296 if(d_map.isKey(x)){
297 d_map.set(x, d_map.get(x)+c);
299 d_map.set(x,c);
304 d_map.set(x, c); in setCount()
319 BackingMap::KeyList keys(d_map.begin(), d_map.end()); in removeOneOfEverything()
326 if(d_map.isKey(x)){ in count()
[all …]
|
| /dports/math/cvc3/cvc3-2.4.1/src/include/ |
| H A D | expr_map.h | 67 ExprMapType d_map; variable
167 ExprMap(const ExprMap& map): d_map(map.d_map) { } in ExprMap()
170 bool empty() const { return d_map.empty(); } in empty()
175 void clear() { d_map.clear(); } in clear()
186 d_map.erase((*l).first); in erase()
198 return m1.d_map == m2.d_map;
211 ExprHashMapType d_map; variable
300 ExprHashMap(size_t n): d_map(n) { } in ExprHashMap()
302 ExprHashMap(const ExprHashMap& map): d_map(map.d_map) { } in ExprHashMap()
310 void clear() { d_map.clear(); } in clear()
[all …]
|
| H A D | cdmap_ordered.h | 70 if(d_cdmap->d_map.count(d_key) > 0) { in setNull()
71 d_cdmap->d_map.erase(d_key); in setNull()
131 std::map<Key,CDOmapOrdered<Key,Data>*> d_map;
154 i=d_map.begin(), iend=d_map.end(); in setNull()
156 d_map.clear(); in setNull()
166 size_t size() const { return d_map.size(); } in size()
174 if(i == d_map.end()) { // Create new object
176 d_map[k] = obj;
186 if(i == d_map.end()) { // Create new object
189 d_map[k] = obj;
[all …]
|
| H A D | cdmap.h | 71 if(d_cdmap->d_map.count(d_key) > 0) { in setNull()
72 d_cdmap->d_map.erase(d_key); in setNull()
156 i=d_map.begin(), iend=d_map.end(); in setNull()
161 d_map.clear(); in setNull()
171 size_t size() const { return d_map.size(); } in size()
181 if(i == d_map.end()) { // Create new object
183 d_map[k] = obj;
193 if(i == d_map.end()) { // Create new object
196 d_map[k] = obj;
257 iterator begin() const { return iterator(d_map.begin()); } in begin()
[all …]
|
| /dports/math/cvc4/CVC4-1.7/src/theory/arrays/ |
| H A D | static_fact_manager.h | 43 MapType d_map; variable
75 MapType::const_iterator i = d_map.find(n); in debugFind()
76 if(i == d_map.end()) { in debugFind()
85 MapType::iterator i = d_map.find(n); in find()
86 if(i == d_map.end()) { in find()
99 d_map.insert(pr); in find()
105 Assert(d_map.find(n) == d_map.end()); in setCanon()
106 Assert(d_map.find(newParent) == d_map.end()); in setCanon()
108 d_map[n] = newParent; in setCanon()
|
| H A D | union_find.h | 51 MapType d_map; variable
93 typename MapType::const_iterator i = d_map.find(n); in debugFind()
94 if(i == d_map.end()) { in debugFind()
104 typename MapType::iterator i = d_map.find(n); in find()
105 if(i == d_map.end()) { in find()
121 d_map.insert(pr); in find()
128 Assert(d_map.find(n) == d_map.end()); in setCanon()
129 Assert(d_map.find(newParent) == d_map.end()); in setCanon()
132 d_map[n] = newParent; in setCanon()
|
| /dports/math/coxeter3/coxeter-7b5a1f0/ |
| H A D | bits.cpp | 237 f = d_map[j]; in firstBit()
264 if (d_map[ml]&f) in isEmpty()
268 if (d_map[j]) in isEmpty()
290 LFlags f = d_map[base]; in lastBit()
309 d_map.assign(map.d_map); in assign()
361 d_map[f] &= old; in setSize()
362 d_map.setZero(f+1,d_map.size()-f-1); in setSize()
379 d_map[j] = ~d_map[j]; in operator ~()
381 d_map[d_map.size()-1] &= lastchunk(); in operator ~()
395 d_map[j] &= map.chunk(j); in operator &=()
[all …]
|
| /dports/dns/powerdns/pdns-4.5.2/pdns/ |
| H A D | auth-zonecache.cc | 64 auto iter = mc.d_map.find(zone); in getEntry()
65 if (iter != mc.d_map.end()) { in getEntry()
104 auto iter = mc.d_map.find(zone); in replace()
105 if (iter != mc.d_map.end()) { in replace()
109 mc.d_map.emplace(zone, val); in replace()
122 mc.d_map[zone] = val; in replace()
129 mc.d_map = std::move(newMaps[mapIndex].d_map); in replace()
158 auto iter = mc.d_map.find(zone); in add()
159 if (iter != mc.d_map.end()) { in add()
163 mc.d_map.emplace(zone, val); in add()
|
| /dports/x11-toolkits/qwt6/qwt-6.1.6/src/ |
| H A D | qwt_legend_data.cpp | 33 d_map = map; in setValues()
42 return d_map; in values()
51 return d_map.contains( role ); in hasRole()
64 d_map[role] = data; in setValue()
73 if ( !d_map.contains( role ) ) in value()
76 return d_map[role]; in value()
82 return !d_map.isEmpty(); in isValid()
|
| H A D | qwt_text.cpp | 45 EngineMap d_map; member in QwtTextEngineDict
65 it != d_map.constEnd(); ++it ) in ~QwtTextEngineDict()
78 it != d_map.end(); ++it ) in textEngine()
89 EngineMap::const_iterator it = d_map.find( format ); in textEngine()
90 if ( it != d_map.end() ) in textEngine()
97 it = d_map.find( QwtText::PlainText ); in textEngine()
111 if ( it != d_map.constEnd() ) in setTextEngine()
114 d_map.remove( format ); in setTextEngine()
118 d_map.insert( format, engine ); in setTextEngine()
126 EngineMap::const_iterator it = d_map.find( format ); in textEngine()
[all …]
|
| /dports/devel/xelfviewer/XELFViewer-0.03/XQwt/3rdparty/qwt/src/ |
| H A D | qwt_legend_data.cpp | 33 d_map = map; in setValues()
42 return d_map; in values()
51 return d_map.contains( role ); in hasRole()
64 d_map[role] = data; in setValue()
73 if ( !d_map.contains( role ) ) in value()
76 return d_map[role]; in value()
82 return !d_map.isEmpty(); in isValid()
|
| H A D | qwt_text.cpp | 45 EngineMap d_map; member in QwtTextEngineDict
65 it != d_map.constEnd(); ++it ) in ~QwtTextEngineDict()
78 it != d_map.end(); ++it ) in textEngine()
89 EngineMap::const_iterator it = d_map.find( format ); in textEngine()
90 if ( it != d_map.end() ) in textEngine()
97 it = d_map.find( QwtText::PlainText ); in textEngine()
111 if ( it != d_map.constEnd() ) in setTextEngine()
114 d_map.remove( format ); in setTextEngine()
118 d_map.insert( format, engine ); in setTextEngine()
126 EngineMap::const_iterator it = d_map.find( format ); in textEngine()
[all …]
|
| /dports/comms/gnuradio/gnuradio-3.8.4.0/gnuradio-runtime/lib/ |
| H A D | block_registry.cc | 40 if (d_map.find(block->name()) == d_map.end()) { in block_register()
41 d_map[block->name()] = blocksubmap_t(); in block_register()
42 d_map[block->name()][0] = block; in block_register()
45 for (size_t i = 0; i <= d_map[block->name()].size(); i++) { in block_register()
46 if (d_map[block->name()].find(i) == d_map[block->name()].end()) { in block_register()
47 d_map[block->name()][i] = block; in block_register()
59 d_map[block->name()].erase(d_map[block->name()].find(block->symbolic_id())); in block_unregister()
|
| /dports/math/cvc4/CVC4-1.7/src/expr/ |
| H A D | kind_map.h | 44 KindMap& d_map; variable
48 d_map(m), in Accessor()
58 return d_map.tst(d_kind);
63 d_map.set(d_kind);
65 d_map.clr(d_kind);
76 const KindMap* d_map; variable
84 d_map(NULL), in iterator()
88 d_map(&m), in iterator()
92 ! d_map->tst(d_kind)) { in iterator()
100 ! d_map->tst(d_kind)) {
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map<Graph*, dist_t>::type d_map; variable
76 k = d_map[u] + 1; in tree_edge()
77 d_map[v] = k; in tree_edge()
83 k = d_map[u] + 1; in non_tree_edge()
84 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
85 girth = d_map[v]+ k; in non_tree_edge()
132 d_map = get(dist_t(), g); in main()
138 d_map[*i] = 0; in main()
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/example/ |
| H A D | girth.cpp | 60 boost::property_map< Graph*, dist_t >::type d_map; variable
79 k = d_map[u] + 1; in tree_edge()
80 d_map[v] = k; in tree_edge()
87 k = d_map[u] + 1; in non_tree_edge()
88 if (d_map[v] + k < girth && v != p_map[u]) in non_tree_edge()
89 girth = d_map[v] + k; in non_tree_edge()
135 d_map = get(dist_t(), g); in main()
141 d_map[*i] = 0; in main()
|
| /dports/x11-toolkits/qwt5-qt5/qwt5-qt5-2a9f1ae2/src/ |
| H A D | qwt_text.cpp | 49 EngineMap d_map; member in QwtTextEngineDict
63 it != d_map.end(); ++it ) in ~QwtTextEngineDict()
76 it != d_map.end(); ++it ) in textEngine()
87 EngineMap::const_iterator it = d_map.find(format); in textEngine()
88 if ( it != d_map.end() ) in textEngine()
95 it = d_map.find(QwtText::PlainText); in textEngine()
108 EngineMap::const_iterator it = d_map.find(format); in setTextEngine()
109 if ( it != d_map.end() ) in setTextEngine()
115 d_map.remove(format); in setTextEngine()
119 d_map.insert(format, engine); in setTextEngine()
[all …]
|