| /dports/cad/gmsh/gmsh-4.9.2-source/Mesh/ |
| H A D | BackgroundMesh.cpp | 797 auto it = old2new.find(v); in importGModelMeshes()
798 if(it == old2new.end()) { in importGModelMeshes()
800 old2new[v] = mesh_vertices.back(); in importGModelMeshes()
815 auto it = old2new.find(v); in importGModelMeshes()
816 if(it == old2new.end()) { in importGModelMeshes()
818 old2new[v] = mesh_vertices.back(); in importGModelMeshes()
824 MVertex *v0 = old2new[elt->getVertex(0)]; in importGModelMeshes()
845 auto it = old2new.find(v); in importGModelMeshes()
846 if(it == old2new.end()) { in importGModelMeshes()
853 old2new[v] = mesh_vertices.back(); in importGModelMeshes()
[all …]
|
| /dports/math/freefem++/FreeFem-sources-4.6/3rdparty/dissection/src/freefem++-interface/examples++-load/ |
| H A D | Dissection.cpp | 23 int nrow, int nrow1, int *old2new, int *new2old, in generate_CSR() argument
33 const int j = old2new[ind_col[k]]; in generate_CSR()
87 int nrow, int nrow1, int *old2new, int *new2old,
93 int nrow, int nrow1, int *old2new,
169 int *old2new = new int[dim]; in SolveDissection() local
203 old2new[_new2old[i]] = i; in SolveDissection()
210 nnz = generate_CSR<double>(indcols_tmp, coefs_tmp, dim, _dim0, old2new, in SolveDissection()
213 delete [] old2new; in SolveDissection()
354 int *old2new = new int[dim]; in SolveDissection() local
388 old2new[_new2old[i]] = i; in SolveDissection()
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/points/ |
| H A D | colocate.h | 78 vector<index_t>& old2new,
101 vector<index_t>& old2new,
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/basic/ |
| H A D | attributes.cpp | 144 const vector<index_t>& old2new in compress() argument
146 geo_debug_assert(old2new.size() <= cached_size_); in compress()
148 for(index_t i=0; i<old2new.size(); ++i) { in compress()
149 index_t j = old2new[i]; in compress()
206 const vector<index_t>& old2new in compress() argument
209 cur.second->compress(old2new); in compress()
|
| /dports/cad/gmsh/gmsh-4.9.2-source/contrib/QuadMeshingTools/ |
| H A D | qmtCurveQuantization.cpp | 190 unordered_map<GEdge *, int> old2new; in solveQuantizationWithGreedyApproach() local
194 auto it = old2new.find(ge); in solveQuantizationWithGreedyApproach()
195 if(it == old2new.end()) { in solveQuantizationWithGreedyApproach()
196 old2new[ge] = count; in solveQuantizationWithGreedyApproach()
205 for(auto &kv : x_ideal) { c_x_ideal[old2new[kv.first]] = kv.second; } in solveQuantizationWithGreedyApproach()
214 int node = old2new[ge]; in solveQuantizationWithGreedyApproach()
220 int node1 = old2new[ge1]; in solveQuantizationWithGreedyApproach()
222 int node2 = old2new[ge2]; in solveQuantizationWithGreedyApproach()
|
| H A D | qmtMeshGeometryOptimization.cpp | 393 old2new[v] = vcount; in buildCondensedStructure()
408 old2new[v] = vcount; in buildCondensedStructure()
417 if(nvs[0] < nInterior) v2v[old2new[vs[0]]].push_back(old2new[vs[1]]); in buildCondensedStructure()
418 if(nvs[1] < nInterior) v2v[old2new[vs[1]]].push_back(old2new[vs[0]]); in buildCondensedStructure()
424 size_t nvs[2] = {old2new[vs[0]], old2new[vs[1]]}; in buildCondensedStructure()
425 if(nvs[0] < nInterior) v2v[old2new[vs[0]]].push_back(old2new[vs[1]]); in buildCondensedStructure()
426 if(nvs[1] < nInterior) v2v[old2new[vs[1]]].push_back(old2new[vs[0]]); in buildCondensedStructure()
448 old2new[v] = vcount; in buildCondensedStructure()
471 old2new[v] = vcount; in buildCondensedStructure()
1117 if(it == old2new.end()) { in patchOptimizeGeometryGlobal()
[all …]
|
| /dports/net-mgmt/zabbix5-java/zabbix-5.0.19/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1191 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1240 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1391 char *old2new, *p; in create_old2new_and_copy_of() local
1395 p = old2new; in create_old2new_and_copy_of()
1424 zbx_free(old2new); in create_old2new_and_copy_of()
1427 zbx_free(old2new); in create_old2new_and_copy_of()
1439 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1441 return old2new; in create_old2new_and_copy_of()
1462 const char *p = old2new + i_old * num_new; in find_old2new()
3249 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix5-frontend/zabbix-5.0.19/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1191 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1240 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1391 char *old2new, *p; in create_old2new_and_copy_of() local
1395 p = old2new; in create_old2new_and_copy_of()
1424 zbx_free(old2new); in create_old2new_and_copy_of()
1427 zbx_free(old2new); in create_old2new_and_copy_of()
1439 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1441 return old2new; in create_old2new_and_copy_of()
1462 const char *p = old2new + i_old * num_new; in find_old2new()
3249 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix5-proxy/zabbix-5.0.19/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1191 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1240 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1391 char *old2new, *p; in create_old2new_and_copy_of() local
1395 p = old2new; in create_old2new_and_copy_of()
1424 zbx_free(old2new); in create_old2new_and_copy_of()
1427 zbx_free(old2new); in create_old2new_and_copy_of()
1439 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1441 return old2new; in create_old2new_and_copy_of()
1462 const char *p = old2new + i_old * num_new; in find_old2new()
3249 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix54-server/zabbix-5.4.9/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1192 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1241 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1392 char *old2new, *p; in create_old2new_and_copy_of() local
1396 p = old2new; in create_old2new_and_copy_of()
1425 zbx_free(old2new); in create_old2new_and_copy_of()
1428 zbx_free(old2new); in create_old2new_and_copy_of()
1440 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1442 return old2new; in create_old2new_and_copy_of()
1463 const char *p = old2new + i_old * num_new; in find_old2new()
3250 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix5-agent/zabbix-5.0.19/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1191 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1240 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1391 char *old2new, *p; in create_old2new_and_copy_of() local
1395 p = old2new; in create_old2new_and_copy_of()
1424 zbx_free(old2new); in create_old2new_and_copy_of()
1427 zbx_free(old2new); in create_old2new_and_copy_of()
1439 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1441 return old2new; in create_old2new_and_copy_of()
1462 const char *p = old2new + i_old * num_new; in find_old2new()
3249 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix54-agent/zabbix-5.4.9/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1192 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1241 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1392 char *old2new, *p; in create_old2new_and_copy_of() local
1396 p = old2new; in create_old2new_and_copy_of()
1425 zbx_free(old2new); in create_old2new_and_copy_of()
1428 zbx_free(old2new); in create_old2new_and_copy_of()
1440 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1442 return old2new; in create_old2new_and_copy_of()
1463 const char *p = old2new + i_old * num_new; in find_old2new()
3250 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix5-server/zabbix-5.0.19/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1191 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1240 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1391 char *old2new, *p; in create_old2new_and_copy_of() local
1395 p = old2new; in create_old2new_and_copy_of()
1424 zbx_free(old2new); in create_old2new_and_copy_of()
1427 zbx_free(old2new); in create_old2new_and_copy_of()
1439 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1441 return old2new; in create_old2new_and_copy_of()
1462 const char *p = old2new + i_old * num_new; in find_old2new()
3249 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix54-proxy/zabbix-5.4.9/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1192 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1241 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1392 char *old2new, *p; in create_old2new_and_copy_of() local
1396 p = old2new; in create_old2new_and_copy_of()
1425 zbx_free(old2new); in create_old2new_and_copy_of()
1428 zbx_free(old2new); in create_old2new_and_copy_of()
1440 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1442 return old2new; in create_old2new_and_copy_of()
1463 const char *p = old2new + i_old * num_new; in find_old2new()
3250 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix54-frontend/zabbix-5.4.9/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1192 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1241 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1392 char *old2new, *p; in create_old2new_and_copy_of() local
1396 p = old2new; in create_old2new_and_copy_of()
1425 zbx_free(old2new); in create_old2new_and_copy_of()
1428 zbx_free(old2new); in create_old2new_and_copy_of()
1440 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1442 return old2new; in create_old2new_and_copy_of()
1463 const char *p = old2new + i_old * num_new; in find_old2new()
3250 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/net-mgmt/zabbix54-java/zabbix-5.4.9/src/zabbix_agent/logfiles/ |
| H A D | logfiles.c | 1192 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1241 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1392 char *old2new, *p; in create_old2new_and_copy_of() local
1396 p = old2new; in create_old2new_and_copy_of()
1425 zbx_free(old2new); in create_old2new_and_copy_of()
1428 zbx_free(old2new); in create_old2new_and_copy_of()
1440 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1442 return old2new; in create_old2new_and_copy_of()
1463 const char *p = old2new + i_old * num_new; in find_old2new()
3250 char *old2new; in update_new_list_from_old() local
[all …]
|
| /dports/math/geogram/geogram-1.7.7/src/lib/exploragram/hexdom/ |
| H A D | hex_dominant.cpp | 109 vector<index_t> old2new(tet_mesh->vertices.nb()); in add_hexes_to_tetmesh() local
110 Geom::colocate(tet_mesh->vertices.point_ptr(0), 3, tet_mesh->vertices.nb(), old2new, eps); in add_hexes_to_tetmesh()
112 tet_mesh->cells.set_vertex(c, cv, old2new[tet_mesh->cells.vertex(c, cv)]); in add_hexes_to_tetmesh()
113 FOR(v, tet_mesh->vertices.nb()) if (old2new[v] != v) to_kill[v] = NOT_AN_ID; in add_hexes_to_tetmesh()
372 vector<index_t> old2new(result->vertices.nb()); in hex_dominant() local
373 Geom::colocate(result->vertices.point_ptr(0), 3, result->vertices.nb(), old2new, eps); in hex_dominant()
375 result->cells.set_vertex(c, cv, old2new[result->cells.vertex(c, cv)]); in hex_dominant()
376 FOR(v, result->vertices.nb()) if (old2new[v] != v) to_kill[v] = NOT_AN_ID; in hex_dominant()
|
| H A D | mesh_utils.cpp | 98 vector<index_t> old2new(m->vertices.nb()); in merge_vertices() local
99 Geom::colocate(m->vertices.point_ptr(0), 3, m->vertices.nb(), old2new, eps); in merge_vertices()
100 FOR(e, m->edges.nb()) FOR(ev, 2) m->edges.set_vertex(e, ev, old2new[m->edges.vertex(e, ev)]); in merge_vertices()
101 …FOR(f, m->facets.nb()) FOR(fv, m->facets.nb_vertices(f)) m->facets.set_vertex(f, fv, old2new[m->fa… in merge_vertices()
102 …FOR(c, m->cells.nb()) FOR(cv, m->cells.nb_vertices(c)) m->cells.set_vertex(c, cv, old2new[m->cells… in merge_vertices()
103 FOR(v, m->vertices.nb()) if (old2new[v] != v) to_kill[v] = NOT_AN_ID; in merge_vertices()
|
| /dports/math/SCIP/scip-7.0.3/src/cppad/local/optimize/ |
| H A D | record_vp.hpp | 44 const CppAD::vector<struct struct_old2new>& old2new , in record_vp() argument
79 new_arg[0] = old2new[ play->var2op(arg[0]) ].new_var; in record_vp()
|
| H A D | record_pv.hpp | 43 const CppAD::vector<struct struct_old2new>& old2new , in record_pv() argument
81 new_arg[1] = old2new[ play->var2op(arg[1]) ].new_var; in record_pv()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/mesh/ |
| H A D | mesh_repair.cpp | 72 vector<index_t> old2new; in repair_colocate_vertices() local
82 old2new, M.vertices.dimension() in repair_colocate_vertices()
87 old2new, colocate_epsilon, M.vertices.dimension() in repair_colocate_vertices()
102 M.edges.set_vertex(e, 0, old2new[M.edges.vertex(e,0)]); in repair_colocate_vertices()
103 M.edges.set_vertex(e, 1, old2new[M.edges.vertex(e,1)]); in repair_colocate_vertices()
108 M.facet_corners.set_vertex(c, old2new[M.facet_corners.vertex(c)]); in repair_colocate_vertices()
120 for(index_t i = 0; i < old2new.size(); i++) { in repair_colocate_vertices()
121 if(old2new[i] == i) { in repair_colocate_vertices()
122 old2new[i] = 0; in repair_colocate_vertices()
124 old2new[i] = 1; in repair_colocate_vertices()
[all …]
|
| /dports/math/freefem++/FreeFem-sources-4.6/3rdparty/dissection/src/C-test/ |
| H A D | MM-Dissection-mRHS.cpp | 122 int nrow, int *nnz, int *mask, int *old2new, in generate_CSR() argument
132 const int ii = old2new[i0]; in generate_CSR()
133 const int jj = old2new[j0]; in generate_CSR()
233 int nrow, int *nnz, int *mask, int *old2new,
238 int nrow, int *nnz, int *mask, int *old2new,
471 int *old2new = new int[nrow]; in main() local
482 old2new[i] = itmp++; in main()
485 old2new[i] = jtmp++; in main()
503 nrow, &nnz, mask, old2new, in main()
509 nrow, &nnz, mask, old2new, in main()
[all …]
|
| H A D | MM-Dissection-double-quad.cpp | 125 int nrow, int *nnz, int *mask, int *old2new, in generate_CSR() argument
135 const int ii = old2new[i0]; in generate_CSR()
136 const int jj = old2new[j0]; in generate_CSR()
454 int *old2new = new int[nrow]; in main() local
465 old2new[i] = itmp++; in main()
468 old2new[i] = jtmp++; in main()
474 fprintf(fp, "%d %d %d\n", i, old2new[i], mask[i]); in main()
486 nrow, &nnz, mask, old2new, in main()
492 nrow, &nnz, mask, old2new, in main()
498 delete [] old2new; in main()
|
| /dports/math/geogram/geogram-1.7.7/src/lib/geogram/delaunay/ |
| H A D | delaunay_2d.cpp | 277 vector<index_t>& old2new = cell_next_; in set_vertices() local
299 old2new[t] = nb_triangles; in set_vertices()
302 old2new[t] = index_t(-1); in set_vertices()
311 t = signed_index_t(old2new[t]); in set_vertices()
330 old2new[finite_ptr] = finite_ptr; in set_vertices()
335 old2new[infinite_ptr] = infinite_ptr; in set_vertices()
341 old2new[finite_ptr] = infinite_ptr; in set_vertices()
342 old2new[infinite_ptr] = finite_ptr; in set_vertices()
362 t = signed_index_t(old2new[t]); in set_vertices()
|
| /dports/math/barvinok/barvinok-0.41.5/ |
| H A D | bfcounter.h | 104 int *old2new; member
126 old2new = new int[nf]; in bf_reducer()
132 delete [] old2new; in ~bf_reducer()
|