/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/ |
H A D | remesh.h | 219 ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), in isotropic_remeshing() local 238 internal::Connected_components_pmap<PM, FIMap>(faces, pmesh, ecmap, fimap, in isotropic_remeshing() 255 internal::constraints_are_short_enough(pmesh, ecmap, vpmap, fpmap, high), in isotropic_remeshing() 269 remesher(pmesh, vpmap, gt, protect, ecmap, vcmap, fpmap, fimap, need_aabb_tree); in isotropic_remeshing() 416 ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), in split_long_edges() local 424 remesher(pmesh, vpmap, gt, false/*protect constraints*/, ecmap, in split_long_edges() 426 … internal::Connected_components_pmap<PM, FIMap>(faces(pmesh), pmesh, ecmap, fimap, false), in split_long_edges()
|
H A D | smooth_mesh.h | 220 ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), in smooth_mesh() local 231 if(get(ecmap, edge(h, tmesh))) in smooth_mesh() 263 Delaunay_flipper delaunay_flipper(tmesh, vpmap, ecmap, gt); in smooth_mesh()
|
H A D | connected_components.h | 142 EdgeConstraintMap ecmap in connected_component() local 159 if(! get(ecmap, edge(hd, pmesh))){ in connected_component() 234 EdgeConstraintMap ecmap in connected_components() local 257 if ( get(ecmap, edge(h, pmesh)) ) continue; in connected_components()
|
/dports/biology/kallisto/kallisto-0.46.1/src/ |
H A D | Inspect.h | 131 cout << "#[inspect] number of equivalence classes = " << index.ecmap.size() << endl; in InspectIndex() 134 if (index.ecmap.size() != index.ecmapinv.size()) { in InspectIndex() 135 cout << "Error: sizes do not match. ecmap.size = " << index.ecmap.size() in InspectIndex() 152 for (int ec = 0; ec < index.ecmap.size(); ec++) { in InspectIndex() 153 const vector<int>& v = index.ecmap[ec]; in InspectIndex() 196 if (eiv.second < 0 || eiv.second >= index.ecmap.size()) { in InspectIndex() 202 auto &v = index.ecmap[eiv.second]; in InspectIndex() 227 ++kmhisto[index.ecmap[index.dbGraph.ecs[id]].size()]; in InspectIndex() 366 std::vector<std::unordered_map<int, std::vector<ECStruct>>> ec_chrom(index.ecmap.size()); in InspectIndex() 429 for (const auto& t : index.ecmap[ec]) { in InspectIndex() [all …]
|
H A D | Merge.cpp | 132 index_ec = index.ecmap.size(); in MergeBatchDirectories() 133 index.ecmap.push_back(c); in MergeBatchDirectories() 153 for (int j = 0; j < index.ecmap.size(); j++) { in MergeBatchDirectories() 156 const auto &v = index.ecmap[j]; in MergeBatchDirectories() 199 int sNumEcs = index.ecmap.size(); in MergeBatchDirectories()
|
H A D | weights.cpp | 222 const EcMap& ecmap, in calc_weights() argument 230 WeightMap weights(ecmap.size()); in calc_weights() 232 for (size_t ec = 0; ec < ecmap.size(); ec++) { in calc_weights() 233 auto& v = ecmap[ec]; in calc_weights()
|
H A D | MinCollector.cpp | 106 index.ecmap.push_back(u); in increaseCount() 137 assert(ec >= 0 && ec <= index.ecmap.size()); in decreaseCount() 164 std::vector<int> u = index.ecmap[ec]; in intersectECs() 251 for (int i = 0; i < index.ecmap.size(); i++) { in write() 254 const auto &v = index.ecmap[i]; in write()
|
H A D | PlaintextWriter.cpp | 159 writeSparseBatchMatrix(countsfilename, counts, index.ecmap.size()); in writeBatchMatrix() 192 for (int i = 0; i < index.ecmap.size(); i++) { in writeECList() 195 const auto &v = index.ecmap[i]; in writeECList()
|
H A D | KmerIndex.cpp | 172 ecmap.push_back(single); in BuildTranscripts() 405 ecmap.push_back(u); in BuildEquivalenceClasses() 667 tmp_size = ecmap.size(); in write() 672 for (int ec = 0; ec < ecmap.size(); ec++) { in write() 674 auto& v = ecmap[ec]; in write() 869 ecmap.resize(ecmap_size); in load() 888 ecmap[tmp_id] = tmp_vec; in load() 1339 if (ec < ecmap.size()) { in intersect() 1342 auto& u = ecmap[ec]; in intersect() 1410 ecmap.resize(0); in clear()
|
H A D | Fusion.hpp | 64 std::vector<int> u = index.ecmap[ec]; in simpleIntersect() 186 su.insert(index.ecmap[ec].begin(), index.ecmap[ec].end()); in checkUnionIntersection()
|
H A D | weights.h | 38 const EcMap& ecmap,
|
H A D | MinCollector.h | 21 counts(index.ecmap.size(), 0), in MinCollector()
|
H A D | KmerIndex.h | 135 EcMap ecmap; member
|
H A D | EMAlgorithm.h | 34 ecmap_(index.ecmap), in EMAlgorithm()
|
H A D | ProcessReads.cpp | 313 index.ecmap.push_back(u); in processReads() 387 int ecsize = index.ecmap.size(); in processReads() 389 if (ec != -1 && ecsize < index.ecmap.size()) { in processReads() 424 int ecsize = index.ecmap.size(); in processReads() 426 if (ec != -1 && ecsize < index.ecmap.size()) { in processReads() 1639 u = index.ecmap[ec]; // copy, but meh in processBufferTrans() 2043 u = index.ecmap[ec]; // copy, but meh in processBufferGenome()
|
H A D | main.cpp | 2357 collection.counts.assign(index.ecmap.size(), 0); in main() 2433 writeSparseBatchMatrix(tccfilename, MP.batchCounts, index.ecmap.size()); in main() 2464 for (auto t : index.ecmap[ec]) { in main()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/ |
H A D | tetrahedral_remeshing.h | 233 ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), in tetrahedral_isotropic_remeshing() local 268 , ecmap, fcmap in tetrahedral_isotropic_remeshing() 428 ECMap ecmap = choose_parameter(get_parameter(np, internal_np::edge_is_constrained), in tetrahedral_isotropic_remeshing() local 466 , ecmap, fcmap in tetrahedral_isotropic_remeshing()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Tetrahedral_remeshing/internal/ |
H A D | tetrahedral_adaptive_remeshing_impl.h | 127 , EdgeIsConstrainedMap ecmap in Adaptive_remesher() argument 143 init_c3t3(ecmap, fcmap); in Adaptive_remesher() 156 , EdgeIsConstrainedMap ecmap in Adaptive_remesher() argument 172 init_c3t3(ecmap, fcmap); in Adaptive_remesher() 396 void init_c3t3(const EdgeIsConstrainedMap& ecmap, in init_c3t3() argument 484 if (get(ecmap, CGAL::Tetrahedral_remeshing::make_vertex_pair<Tr>(e)) in init_c3t3()
|
/dports/science/lammps/lammps-stable_29Sep2021/src/MOLECULE/ |
H A D | fix_cmap.h | 84 double ecmap; variable
|
H A D | fix_cmap.cpp | 341 ecmap = 0.0; in post_force() 485 if (i1 < nlocal) ecmap += engfraction; in post_force() 486 if (i2 < nlocal) ecmap += engfraction; in post_force() 487 if (i3 < nlocal) ecmap += engfraction; in post_force() 488 if (i4 < nlocal) ecmap += engfraction; in post_force() 489 if (i5 < nlocal) ecmap += engfraction; in post_force() 624 MPI_Allreduce(&ecmap,&all,1,MPI_DOUBLE,MPI_SUM,world); in compute_scalar()
|
/dports/x11-wm/e16/e16-1.0.24/src/ |
H A D | icccm.c | 329 EX_Colormap ecmap, dcmap, ccmap; in ICCCM_Cmap() local 334 ecmap = Mode.current_cmap; in ICCCM_Cmap() 339 if (ecmap == dcmap) in ICCCM_Cmap() 347 if (ccmap == ecmap || EoGetWin(ewin)->argb) in ICCCM_Cmap()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/ |
H A D | remesh_impl.h | 183 , EdgeIsConstrainedMap ecmap 199 PMP::parameters::edge_is_constrained_map(ecmap) 209 make_OR_property_map(ecmap 237 EdgeConstraintMap ecmap, in constraints_are_short_enough() argument 249 get(ecmap, e) || in constraints_are_short_enough() 310 , EdgeIsConstrainedMap ecmap 324 , ecmap_(ecmap) in mesh_()
|
/dports/math/cgal/CGAL-5.3/include/CGAL/Polygon_mesh_processing/internal/Smoothing/ |
H A D | mesh_smoothing_impl.h | 79 const ECMap ecmap, in Delaunay_edge_flipper() argument 81 : mesh_(mesh), vpmap_(vpmap), ecmap_(ecmap), traits_(traits) in Delaunay_edge_flipper()
|