| /dports/math/cvc4/CVC4-1.7/src/preprocessing/ |
| H A D | assertion_pipeline.cpp | 32 d_nodes.clear(); in clear()
40 d_nodes.push_back(n); in push_back()
45 d_assumptionsStart = d_nodes.size() - 1; in push_back()
51 Assert(d_assumptionsStart + d_numAssumptions == d_nodes.size() - 1); in push_back()
58 PROOF(ProofManager::currentPM()->addDependence(n, d_nodes[i]);); in replace()
59 d_nodes[i] = n; in replace()
66 PROOF(ProofManager::currentPM()->addDependence(n, d_nodes[i]); in replace()
71 d_nodes[i] = n; in replace()
78 : ns) { ProofManager::currentPM()->addDependence(n, d_nodes[i]); }); in replace()
79 d_nodes[i] = NodeManager::currentNM()->mkConst<bool>(true); in replace()
[all …]
|
| H A D | assertion_pipeline.h | 39 size_t size() const { return d_nodes.size(); } in size()
41 void resize(size_t n) { d_nodes.resize(n); } in resize()
48 Node& operator[](size_t i) { return d_nodes[i]; }
49 const Node& operator[](size_t i) const { return d_nodes[i]; }
60 std::vector<Node>& ref() { return d_nodes; } in ref()
61 const std::vector<Node>& ref() const { return d_nodes; } in ref()
63 std::vector<Node>::const_iterator begin() const { return d_nodes.cbegin(); } in begin()
64 std::vector<Node>::const_iterator end() const { return d_nodes.cend(); } in end()
96 void updateRealAssertionsEnd() { d_realAssertionsEnd = d_nodes.size(); } in updateRealAssertionsEnd()
100 std::vector<Node> d_nodes;
|
| /dports/math/cvc4/CVC4-1.7/src/theory/bv/ |
| H A D | slicer.h | 157 std::vector<Node> d_nodes; variable
165 Assert (id < d_nodes.size()); in getRepr()
166 return d_nodes[id].getRepr(); in getRepr()
169 Assert (id < d_nodes.size()); in getChild()
170 return d_nodes[id].getChild(i); in getChild()
176 Assert (id < d_nodes.size()); in hasChildren()
177 return d_nodes[id].hasChildren(); in hasChildren()
181 Assert (id < d_nodes.size()); in setRepr()
182 d_nodes[id].setRepr(new_repr); in setRepr()
207 : d_nodes(), in UnionFind()
[all …]
|
| H A D | slicer.cpp | 191 d_nodes.push_back(node); in addTerm()
194 TermId id = d_nodes.size() - 1; in addTerm()
268 Debug("bv-slicer-uf") << " node: " << d_nodes[id].debugPrint() << endl; in split()
|
| /dports/math/cvc4/CVC4-1.7/src/theory/uf/ |
| H A D | equality_engine.cpp | 220 d_nodes.push_back(node); in newNode()
527 return d_nodes[representativeId]; in getRepresentative()
541 Node n1 = d_nodes[class1Id]; in merge()
542 Node n2 = d_nodes[class2Id]; in merge()
641 TNode term = d_nodes[funId]; in merge()
860 d_nodeIds.erase(d_nodes[i]); in backtrack()
872 d_nodes.resize(d_nodesCount); in backtrack()
949 eqp->d_node = d_nodes[t1Id].eqNode(d_nodes[t2Id]).notNode(); in explainEquality()
1534 d_notify.eqNotifyConstantTermMerge(d_nodes[t1classId], d_nodes[t2classId]); in propagate()
2151 return d_ee->d_nodes[d_it]; in operator *()
[all …]
|
| H A D | theory_uf_strong_solver.h | 148 std::map< Node, RegionNodeInfo* > d_nodes; variable
158 iterator begin() { return d_nodes.begin(); } in begin()
159 iterator end() { return d_nodes.end(); } in end()
167 Assert(d_nodes.find(n) != d_nodes.end()); in getRegionInfo()
168 return (* (d_nodes.find(n))).second; in getRegionInfo()
193 return d_nodes.find(n) != d_nodes.end() && d_nodes[n]->valid(); in hasRep()
209 Node frontKey() const { return d_nodes.begin()->first; } in frontKey()
|
| H A D | theory_uf_strong_solver.cpp | 60 d_nodes.clear(); in ~Region()
73 RegionNodeInfo* rni = r->d_nodes[n]; in takeNode()
101 for(Region::iterator it = r->d_nodes.begin(); it != r->d_nodes.end(); ++it) { in combine()
106 for(Region::iterator it = r->d_nodes.begin(); it != r->d_nodes.end(); ++it){ in combine()
136 DiseqList* del = d_nodes[b]->get(t); in setEqual()
161 d_nodes[ n1 ]->get(type)->setDisequal( n2, valid ); in setDisequal()
185 if( valid && d_nodes.find( n )==d_nodes.end() ){ in setRep()
186 d_nodes[n] = new RegionNodeInfo( d_cf->d_thss->getSatContext() ); in setRep()
188 d_nodes[n]->setValid(valid); in setRep()
208 RegionNodeInfo::DiseqList* del = d_nodes[ n1 ]->get(type); in isDisequal()
[all …]
|
| H A D | equality_engine.h | 277 std::vector<Node> d_nodes; variable
|
| /dports/math/cvc3/cvc3-2.4.1/src/sat/ |
| H A D | sat_proof.h | 73 std::list<SatProofNode*> d_nodes; variable
78 for (std::list<SatProofNode*>::iterator i = d_nodes.begin(); i != d_nodes.end(); ++i) { in ~SatProof()
89 d_nodes.push_back(node); in registerLeaf()
96 d_nodes.push_back(node); in registerNode()
|
| /dports/math/cvc4/CVC4-1.7/src/expr/ |
| H A D | attribute.cpp | 50 deleteFromTable(d_nodes, nv); in deleteAllAttributes()
59 deleteAllFromTable(d_nodes); in deleteAllAttributes()
91 deleteAttributesFromTable(d_nodes, ids); in deleteAttributes()
|
| H A D | attribute.h | 86 AttrHash<Node> d_nodes; variable
242 return am.d_nodes;
245 return am.d_nodes;
|
| /dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/ematching/ |
| H A D | trigger.cpp | 55 d_nodes.insert( d_nodes.begin(), nodes.begin(), nodes.end() ); in Trigger()
57 for( unsigned i=0; i<d_nodes.size(); i++ ){ in Trigger()
58 Trace("trigger") << " " << d_nodes[i] << std::endl; in Trigger()
60 if( d_nodes.size()==1 ){ in Trigger()
61 if( isSimpleTrigger( d_nodes[0] ) ){ in Trigger()
68 d_mg = new InstMatchGeneratorMulti(q, d_nodes, qe); in Trigger()
73 if( d_nodes.size()==1 ){ in Trigger()
74 if( isSimpleTrigger( d_nodes[0] ) ){ in Trigger()
81 for( unsigned i=0; i<d_nodes.size(); i++ ){ in Trigger()
115 for (unsigned i = 0; i < d_nodes.size(); i++) in addInstantiations()
[all …]
|
| H A D | trigger.h | 192 bool isMultiTrigger() { return d_nodes.size()>1; } in isMultiTrigger()
211 for (int i = 0; i < (int)d_nodes.size(); i++) in debugPrint()
217 Trace(c) << d_nodes[i]; in debugPrint()
421 std::vector< Node > d_nodes; variable
|
| /dports/science/rdkit/rdkit-Release_2021_03_5/Code/GraphMol/CIPLabeler/ |
| H A D | Digraph.cpp | 40 d_nodes.emplace_back(this, std::move(visit), atom, std::move(frac), dist, in addNode()
42 return d_nodes.back(); in addNode()
72 int Digraph::getNumNodes() const { return d_nodes.size(); } in getNumNodes()
138 if (MAX_NODE_COUNT > 0 && d_nodes.size() >= MAX_NODE_COUNT) { in expand()
|
| H A D | Digraph.h | 110 std::list<Node> d_nodes; variable
|
| /dports/math/qtiplot-doc/qtiplot-0.9.8.9/qtiplot/src/analysis/dialogs/ |
| H A D | GriddingDialog.cpp | 50 d_nodes(nodes) in GriddingDialog()
267 xy.setlength(d_nodes, 3); in loadDataFromTable()
325 for (int i = 1; i < d_nodes; i++){ in loadDataFromTable()
371 idwbuildmodifiedshepardr(xy, d_nodes, 2, boxRadius->value(), z); in accept()
374 …idwbuildmodifiedshepard(xy, d_nodes, 2, boxModel->currentIndex() + 1, boxNQ->value(), boxNW->value… in accept()
377 idwbuildnoisy(xy, d_nodes, 2, boxModel->currentIndex() + 1, boxNQ->value(), boxNW->value(), z); in accept()
441 idwbuildmodifiedshepardr(xy, d_nodes, 2, boxRadius->value(), z); in preview()
444 …idwbuildmodifiedshepard(xy, d_nodes, 2, boxModel->currentIndex() + 1, boxNQ->value(), boxNW->value… in preview()
447 idwbuildnoisy(xy, d_nodes, 2, boxModel->currentIndex() + 1, boxNQ->value(), boxNW->value(), z); in preview()
|
| H A D | GriddingDialog.h | 73 int d_nodes; variable
|
| /dports/dns/dnsdist/dnsdist-1.6.1/ |
| H A D | dnsname.hh | 443 d_nodes.insert(dnsname); in add()
459 d_nodes.insert(tmp); in add()
465 d_nodes.erase(name); in remove()
476 d_nodes.erase(tmp); in remove()
488 for (const auto& n : d_nodes) { in toString()
499 mutable std::set<DNSName> d_nodes; // Only used for string generation member
|
| /dports/dns/powerdns/pdns-4.5.2/pdns/ |
| H A D | dnsname.hh | 443 d_nodes.insert(dnsname); in add()
459 d_nodes.insert(tmp); in add()
465 d_nodes.erase(name); in remove()
476 d_nodes.erase(tmp); in remove()
488 for (const auto& n : d_nodes) { in toString()
499 mutable std::set<DNSName> d_nodes; // Only used for string generation member
|
| /dports/misc/py-xgboost/xgboost-1.5.1/src/predictor/ |
| H A D | gpu_predictor.cu | 38 common::Span<const RegTree::Node> d_nodes, in TreeView()
48 d_tree = d_nodes.subspan(begin, n_nodes); in TreeView()
270 tree_begin, tree_idx, d_nodes, in PredictLeafKernel()
303 tree_begin, tree_idx, d_nodes, in PredictKernel()
314 tree_begin, tree_idx, d_nodes, in PredictKernel()
362 auto d_nodes = nodes.DevicePointer(); in Init() local
497 auto d_nodes = device_model.nodes.ConstDeviceSpan(); in ExtractPaths() local
501 auto n = d_nodes[idx]; in ExtractPaths()
510 n = d_nodes[n.Parent() + tree_offset]; in ExtractPaths()
517 nodes_transform + d_nodes.size(), info.begin(), in ExtractPaths()
[all …]
|
| /dports/misc/xgboost/xgboost-1.5.1/src/predictor/ |
| H A D | gpu_predictor.cu | 38 common::Span<const RegTree::Node> d_nodes, in TreeView()
48 d_tree = d_nodes.subspan(begin, n_nodes); in TreeView()
270 tree_begin, tree_idx, d_nodes, in PredictLeafKernel()
303 tree_begin, tree_idx, d_nodes, in PredictKernel()
314 tree_begin, tree_idx, d_nodes, in PredictKernel()
362 auto d_nodes = nodes.DevicePointer(); in Init() local
497 auto d_nodes = device_model.nodes.ConstDeviceSpan(); in ExtractPaths() local
501 auto n = d_nodes[idx]; in ExtractPaths()
510 n = d_nodes[n.Parent() + tree_offset]; in ExtractPaths()
517 nodes_transform + d_nodes.size(), info.begin(), in ExtractPaths()
[all …]
|
| /dports/misc/py-xgboost/xgboost-1.5.1/src/tree/ |
| H A D | updater_gpu_hist.cu | 428 dh::TemporaryArray<RegTree::Node> d_nodes(p_tree->GetNodes().size()); in FinalisePosition() local
429 dh::safe_cuda(cudaMemcpyAsync(d_nodes.data().get(), p_tree->GetNodes().data(), in FinalisePosition()
430 d_nodes.size() * sizeof(RegTree::Node), in FinalisePosition()
451 FinalisePositionInPage(page, dh::ToSpan(d_nodes), in FinalisePosition()
456 FinalisePositionInPage(batch.Impl(), dh::ToSpan(d_nodes), in FinalisePosition()
464 const common::Span<RegTree::Node> d_nodes, in FinalisePositionInPage()
475 auto node = d_nodes[position]; in FinalisePositionInPage()
498 node = d_nodes[position]; in FinalisePositionInPage()
|
| /dports/misc/xgboost/xgboost-1.5.1/src/tree/ |
| H A D | updater_gpu_hist.cu | 428 dh::TemporaryArray<RegTree::Node> d_nodes(p_tree->GetNodes().size()); in FinalisePosition() local
429 dh::safe_cuda(cudaMemcpyAsync(d_nodes.data().get(), p_tree->GetNodes().data(), in FinalisePosition()
430 d_nodes.size() * sizeof(RegTree::Node), in FinalisePosition()
451 FinalisePositionInPage(page, dh::ToSpan(d_nodes), in FinalisePosition()
456 FinalisePositionInPage(batch.Impl(), dh::ToSpan(d_nodes), in FinalisePosition()
464 const common::Span<RegTree::Node> d_nodes, in FinalisePositionInPage()
475 auto node = d_nodes[position]; in FinalisePositionInPage()
498 node = d_nodes[position]; in FinalisePositionInPage()
|
| /dports/math/mfem/mfem-4.3/miniapps/meshing/ |
| H A D | minimal-surface.cpp | 463 auto d_nodes = S.fes->GetMesh()->GetNodes()->Write(); in SetNodes() local
465 MFEM_FORALL(i, ndof, d_nodes[c*ndof + i] = d_Xi[i]; ); in SetNodes()
472 auto d_nodes = S.fes->GetMesh()->GetNodes()->Read(); in GetNodes() local
473 MFEM_FORALL(i, ndof, d_Xi[i] = d_nodes[c*ndof + i]; ); in GetNodes()
|
| H A D | pminimal-surface.cpp | 470 auto d_nodes = S.fes->GetMesh()->GetNodes()->Write(); in SetNodes() local
472 MFEM_FORALL(i, ndof, d_nodes[c*ndof + i] = d_Xi[i]; ); in SetNodes()
479 auto d_nodes = S.fes->GetMesh()->GetNodes()->Read(); in GetNodes() local
480 MFEM_FORALL(i, ndof, d_Xi[i] = d_nodes[c*ndof + i]; ); in GetNodes()
|