Home
last modified time | relevance | path

Searched refs:old2new (Results 1 – 25 of 135) sorted by relevance

123456

/dports/math/SCIP/scip-7.0.3/src/cppad/local/optimize/
H A Doptimize_run.hpp230 { old2new[i].new_op = 0; in optimize_run()
231 old2new[i].new_var = 0; in optimize_run()
341 old2new[i_op].new_var = old2new[j_op].new_var; in optimize_run()
384 old2new , in optimize_run()
400 old2new[i_op].new_var = old2new[j_op].new_var; in optimize_run()
406 old2new , in optimize_run()
421 old2new[i_op].new_var = old2new[j_op].new_var; in optimize_run()
450 old2new , in optimize_run()
467 old2new[i_op].new_var = old2new[j_op].new_var; in optimize_run()
473 old2new , in optimize_run()
[all …]
H A Drecord_vv.hpp42 const CppAD::vector<struct struct_old2new>& old2new , in record_vv() argument
71 new_arg[0] = old2new[ play->var2op(arg[0]) ].new_var; in record_vv()
72 new_arg[1] = old2new[ play->var2op(arg[1]) ].new_var; in record_vv()
H A Drecord_csum.hpp66 const CppAD::vector<struct struct_old2new>& old2new , in record_csum() argument
144 size_t( old2new[ play->var2op(arg[0]) ].new_var) == 0 in record_csum()
187 size_t( old2new[ play->var2op(arg[1]) ].new_var) == 0 in record_csum()
225 new_arg = old2new[ play->var2op(old_arg) ].new_var; in record_csum()
234 new_arg = old2new[ play->var2op(old_arg) ].new_var; in record_csum()
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/points/
H A Dcolocate.cpp72 vector<index_t>& old2new, in Colocate() argument
76 old2new_(old2new), in Colocate()
225 vector<index_t>& old2new, in colocate() argument
241 old2new.resize(nb_points, index_t(-1)); in colocate()
259 old2new[i] < nb_points in colocate()
263 while(old2new[j] != j) { in colocate()
264 j = old2new[j]; in colocate()
266 old2new[i] = j; in colocate()
267 if(old2new[i] == i) { in colocate()
278 vector<index_t>& old2new, in colocate_by_lexico_sort() argument
[all …]
/dports/math/geogram/geogram-1.7.7/src/lib/geogram/mesh/
H A Dmesh_decimate.cpp108 vector<index_t> old2new; in mesh_decimate_vertex_clustering() local
110 new_points.data(), 3, M.vertices.nb(), old2new, 3 in mesh_decimate_vertex_clustering()
124 M.facet_corners.set_vertex(c, old2new[M.facet_corners.vertex(c)]); in mesh_decimate_vertex_clustering()
132 index_t w = old2new[v]; in mesh_decimate_vertex_clustering()
154 for(index_t i = 0; i < old2new.size(); i++) { in mesh_decimate_vertex_clustering()
155 if(old2new[i] == i) { in mesh_decimate_vertex_clustering()
156 old2new[i] = 0; in mesh_decimate_vertex_clustering()
158 old2new[i] = 1; in mesh_decimate_vertex_clustering()
162 M.vertices.delete_elements(old2new); in mesh_decimate_vertex_clustering()
/dports/textproc/py-gensim/gensim-4.0.1/gensim/models/
H A D__init__.py48 def __init__(self, old2new, id2token=None): argument
49 self.old2new = old2new
61 … return sorted((self.old2new[oldid], weight) for oldid, weight in bow if oldid in self.old2new)
/dports/science/dynare/dynare-4.6.4/dynare++/parser/cc/
H A Datom_substitutions.cc28 : new2old(as.new2old), old2new(as.old2new), old_atoms(oa), new_atoms(na) in AtomSubstitutions()
38 auto it = old2new.find(oldname); in add_substitution()
39 if (it != old2new.end()) in add_substitution()
45 old2new.emplace(std::move(oldname), snset); in add_substitution()
63 auto it = old2new.find(oname); in substitutions_finished()
64 if (it != old2new.end()) in substitutions_finished()
76 auto it = old2new.find(oldname); in get_new4old()
77 if (it != old2new.end()) in get_new4old()
91 for (const auto &it : old2new) in print()
/dports/math/barvinok/barvinok-0.41.5/
H A Dbfcounter.cc220 if (old2new[j] == -1) in compute_extra_num()
240 assert(old2new[l] != -1); in update_powers()
242 npowers[old2new[l]] += n; in update_powers()
276 old2new[i] = j; in compute_reduced_factors()
289 old2new[i] = -1; in compute_reduced_factors()
314 assert(old2new[k] != -1); in reduce()
315 npowers[old2new[k]] += v[i]->powers[k]; in reduce()
335 assert(old2new[k] != -1); in reduce()
336 bpowers[old2new[k]] += v[i]->powers[k]; in reduce()
355 if (old2new[j] == -1) { in reduce()
[all …]
/dports/science/hypre/hypre-2.23.0/src/distributed_ls/ParaSails/
H A Dpermute.c22 HYPRE_Int *old2new, *new2old; in permute() local
70 old2new = hypre_TAlloc(HYPRE_Int, M , HYPRE_MEMORY_HOST); in permute()
78 old2new[new2old[i]] = i; in permute()
85 hypre_fprintf(outfile, "%d %d %.15e\n", i+1, old2new[ind[j]-1]+1, val[j]); in permute()
92 hypre_TFree(old2new, HYPRE_MEMORY_HOST); in permute()
/dports/games/xonotic/Xonotic/source/qcsrc/tools/
H A Dauto-super.pl7 my %old2new = ();
24 $old2new{"$2$1"} = "$1"."_"."$2";
72 for(keys %old2new)
74 $s =~ s/\b$_\b/$old2new{$_}/g;
/dports/devel/cvsbook/cvsbook-1.21/
H A Dfix-anchors.py23 old2new = {} variable
27 old2new['(dir)'] = '_top'
51 return g[0] + g[1] + g[2] + old2new[g[3]] + g[4]
74 old2new[name] = newName
/dports/science/crf++/crfpp-1dc92a606f874a4fe52603803364cc1d90f952fb/
H A Dfeature_cache.cpp20 void FeatureCache::shrink(std::map<int, int> *old2new) { in shrink() argument
24 std::map<int, int>::iterator it = old2new->find(*f); in shrink()
25 if (it != old2new->end()) { in shrink()
/dports/math/geogram/geogram-1.7.7/src/lib/exploragram/hexdom/
H A Dcavity.cpp45 vector<index_t> old2new(quad->vertices.nb()); in merge_hex_boundary_and_quadtri() local
46 FOR(v, quad->vertices.nb()) old2new[v] = v; in merge_hex_boundary_and_quadtri()
54 old2new[v] = nearest; in merge_hex_boundary_and_quadtri()
59 quad->facets.set_vertex(f, fv, old2new[quad->facets.vertex(f, fv)]); in merge_hex_boundary_and_quadtri()
60 FOR(v, quad->vertices.nb()) if (old2new[v] != v) to_kill[v] = NOT_AN_ID; in merge_hex_boundary_and_quadtri()
/dports/textproc/yamcha/yamcha-0.33/libexec/
H A DPKI.pm114 my %old2new = ();
119 $old2new{$i} = $tsize;
124 $old2new{$i} = -1;
153 my $n = $old2new{$i};
/dports/net-mgmt/zabbix3-proxy/zabbix-3.0.32/src/zabbix_agent/
H A Dlogfiles.c631 char *p = old2new; in setup_old2new()
831 p = old2new; in resolve_old2new()
849 p = old2new + i; in resolve_old2new()
879 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1012 p = old2new + i_old * num_new; in find_old2new()
1950 char *old2new = NULL; in process_logrt() local
2018 old2new = zbx_malloc(old2new, (size_t)logfiles_num * (size_t)(*logfiles_num_old) * sizeof(char)); in process_logrt()
2024 zbx_free(old2new); in process_logrt()
2035 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
2052 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
[all …]
/dports/net-mgmt/zabbix3-java/zabbix-3.0.32/src/zabbix_agent/
H A Dlogfiles.c631 char *p = old2new; in setup_old2new()
831 p = old2new; in resolve_old2new()
849 p = old2new + i; in resolve_old2new()
879 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1012 p = old2new + i_old * num_new; in find_old2new()
1950 char *old2new = NULL; in process_logrt() local
2018 old2new = zbx_malloc(old2new, (size_t)logfiles_num * (size_t)(*logfiles_num_old) * sizeof(char)); in process_logrt()
2024 zbx_free(old2new); in process_logrt()
2035 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
2052 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
[all …]
/dports/net-mgmt/zabbix3-frontend/zabbix-3.0.32/src/zabbix_agent/
H A Dlogfiles.c631 char *p = old2new; in setup_old2new()
831 p = old2new; in resolve_old2new()
849 p = old2new + i; in resolve_old2new()
879 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1012 p = old2new + i_old * num_new; in find_old2new()
1950 char *old2new = NULL; in process_logrt() local
2018 old2new = zbx_malloc(old2new, (size_t)logfiles_num * (size_t)(*logfiles_num_old) * sizeof(char)); in process_logrt()
2024 zbx_free(old2new); in process_logrt()
2035 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
2052 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
[all …]
/dports/net-mgmt/zabbix3-server/zabbix-3.0.32/src/zabbix_agent/
H A Dlogfiles.c631 char *p = old2new; in setup_old2new()
831 p = old2new; in resolve_old2new()
849 p = old2new + i; in resolve_old2new()
879 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1012 p = old2new + i_old * num_new; in find_old2new()
1950 char *old2new = NULL; in process_logrt() local
2018 old2new = zbx_malloc(old2new, (size_t)logfiles_num * (size_t)(*logfiles_num_old) * sizeof(char)); in process_logrt()
2024 zbx_free(old2new); in process_logrt()
2035 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
2052 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
[all …]
/dports/net-mgmt/zabbix3-agent/zabbix-3.0.32/src/zabbix_agent/
H A Dlogfiles.c631 char *p = old2new; in setup_old2new()
831 p = old2new; in resolve_old2new()
849 p = old2new + i; in resolve_old2new()
879 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1012 p = old2new + i_old * num_new; in find_old2new()
1950 char *old2new = NULL; in process_logrt() local
2018 old2new = zbx_malloc(old2new, (size_t)logfiles_num * (size_t)(*logfiles_num_old) * sizeof(char)); in process_logrt()
2024 zbx_free(old2new); in process_logrt()
2035 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
2052 -1 != (j = find_old2new(old2new, logfiles_num, i))) in process_logrt()
[all …]
/dports/math/freefem++/FreeFem-sources-4.6/examples/3d/
H A Dperiodic-3d.edp16 int[int] old2new(0:Th.nv-1);
19 sort(sorder[],old2new);
20 int[int] new2old=old2new^-1; // inverse the permuation
22 // new2old[old2new[i]]=i;
/dports/net-mgmt/zabbix4-proxy/zabbix-4.0.30/src/zabbix_agent/
H A Dlogfiles.c972 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1021 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1171 char *old2new, *p; in create_old2new_and_copy_of() local
1175 p = old2new; in create_old2new_and_copy_of()
1203 zbx_free(old2new); in create_old2new_and_copy_of()
1206 zbx_free(old2new); in create_old2new_and_copy_of()
1218 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1220 return old2new; in create_old2new_and_copy_of()
1241 const char *p = old2new + i_old * num_new; in find_old2new()
2882 char *old2new; in update_new_list_from_old() local
[all …]
/dports/net-mgmt/zabbix4-server/zabbix-4.0.30/src/zabbix_agent/
H A Dlogfiles.c972 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1021 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1171 char *old2new, *p; in create_old2new_and_copy_of() local
1175 p = old2new; in create_old2new_and_copy_of()
1203 zbx_free(old2new); in create_old2new_and_copy_of()
1206 zbx_free(old2new); in create_old2new_and_copy_of()
1218 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1220 return old2new; in create_old2new_and_copy_of()
1241 const char *p = old2new + i_old * num_new; in find_old2new()
2882 char *old2new; in update_new_list_from_old() local
[all …]
/dports/net-mgmt/zabbix4-java/zabbix-4.0.30/src/zabbix_agent/
H A Dlogfiles.c972 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1021 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1171 char *old2new, *p; in create_old2new_and_copy_of() local
1175 p = old2new; in create_old2new_and_copy_of()
1203 zbx_free(old2new); in create_old2new_and_copy_of()
1206 zbx_free(old2new); in create_old2new_and_copy_of()
1218 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1220 return old2new; in create_old2new_and_copy_of()
1241 const char *p = old2new + i_old * num_new; in find_old2new()
2882 char *old2new; in update_new_list_from_old() local
[all …]
/dports/net-mgmt/zabbix4-frontend/zabbix-4.0.30/src/zabbix_agent/
H A Dlogfiles.c972 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1021 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1171 char *old2new, *p; in create_old2new_and_copy_of() local
1175 p = old2new; in create_old2new_and_copy_of()
1203 zbx_free(old2new); in create_old2new_and_copy_of()
1206 zbx_free(old2new); in create_old2new_and_copy_of()
1218 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1220 return old2new; in create_old2new_and_copy_of()
1241 const char *p = old2new + i_old * num_new; in find_old2new()
2882 char *old2new; in update_new_list_from_old() local
[all …]
/dports/net-mgmt/zabbix4-agent/zabbix-4.0.30/src/zabbix_agent/
H A Dlogfiles.c972 if (-1 == is_uniq_row(old2new, num_new, i)) in is_old2new_unique_mapping()
1021 …if (-1 != (c = is_uniq_row(old2new, num_new, i)) && -1 != is_uniq_col(old2new, num_old, num_new, c… in resolve_old2new()
1171 char *old2new, *p; in create_old2new_and_copy_of() local
1175 p = old2new; in create_old2new_and_copy_of()
1203 zbx_free(old2new); in create_old2new_and_copy_of()
1206 zbx_free(old2new); in create_old2new_and_copy_of()
1218 resolve_old2new(old2new, num_old, num_new); in create_old2new_and_copy_of()
1220 return old2new; in create_old2new_and_copy_of()
1241 const char *p = old2new + i_old * num_new; in find_old2new()
2882 char *old2new; in update_new_list_from_old() local
[all …]

123456