Home
last modified time | relevance | path

Searched refs:t_indx (Results 1 – 8 of 8) sorted by relevance

/dports/science/siconos/siconos-4.4.0/numerics/src/LCP/
H A Dlcp_pivot.c87 unsigned t_indx = 0; in lcp_pivot_covering_vector() local
209 block = pivot_init_pathsearch(dim, mat, &t_indx); in lcp_pivot_covering_vector()
228 bck_drive = t_indx; /* XXX correct ? */ in lcp_pivot_covering_vector()
293 DEBUG_PRINTF("t value : %le\n", mat[t_indx]); in lcp_pivot_covering_vector()
396 basis[t_indx] = drive; in lcp_pivot_covering_vector()
398 double pivot = (mat[t_indx] - 1.0)/mat[t_indx + drive*dim]; in lcp_pivot_covering_vector()
400 mat[t_indx] = pivot; in lcp_pivot_covering_vector()
417 DEBUG_PRINTF("t value : %le\n", mat[t_indx]); in lcp_pivot_covering_vector()
420 options->dparam[2] = mat[t_indx]; in lcp_pivot_covering_vector()
473 t_stack[nb_iter%stack_size] = mat[t_indx]; in lcp_pivot_covering_vector()
[all …]
H A Dlcp_pivot_lumod.c127 unsigned t_indx = 0; in lcp_pivot_lumod_covering_vector() local
219 DEBUG_PRINTF("lcp_pivot :: path search successful ! t_indx = %d\n", t_indx); in lcp_pivot_lumod_covering_vector()
220 bck_drive = t_indx; /* XXX correct ? */ in lcp_pivot_lumod_covering_vector()
254 DEBUG_PRINTF("t value : %le\n", mat[t_indx]); in lcp_pivot_lumod_covering_vector()
447 basis[t_indx] = drive; in lcp_pivot_lumod_covering_vector()
449 double pivot = (mat[t_indx] - 1.0)/mat[t_indx + drive*dim]; in lcp_pivot_lumod_covering_vector()
451 mat[t_indx] = pivot; in lcp_pivot_lumod_covering_vector()
470 options->dparam[2] = mat[t_indx]; in lcp_pivot_lumod_covering_vector()
522 t_stack[nb_iter%stack_size] = mat[t_indx]; in lcp_pivot_lumod_covering_vector()
523 DEBUG_PRINTF("t value : %2.2e\n", mat[t_indx]); in lcp_pivot_lumod_covering_vector()
[all …]
H A Dpivot-utils.h58 int pivot_init_pathsearch(unsigned dim, double* mat, unsigned* t_indx);
108 int pivot_selection_pathsearch(double* mat, unsigned dim, unsigned drive, unsigned t_indx);
H A Dpivot-utils.c274 int pivot_init_pathsearch(unsigned dim, double* mat, unsigned* t_indx) in pivot_init_pathsearch() argument
305 *t_indx = block; in pivot_init_pathsearch()
504 int pivot_selection_pathsearch(double* mat, unsigned dim, unsigned drive, unsigned t_indx) in pivot_selection_pathsearch() argument
506 int block = pivot_selection_lemke(mat, dim, drive, t_indx); in pivot_selection_pathsearch()
507 double pivot_t = mat[t_indx + drive*dim]; in pivot_selection_pathsearch()
511 double ratio_t = (mat[t_indx] - 1.0)/pivot_t; in pivot_selection_pathsearch()
/dports/sysutils/xmbmon/xmbmon205/
H A Dxmbmon.c553 t_indx[0] = 1; in get_res()
554 t_indx[1] = 2; in get_res()
557 t_indx[0] = 0; in get_res()
558 t_indx[1] = 2; in get_res()
561 t_indx[0] = 0; in get_res()
562 t_indx[1] = 1; in get_res()
564 t_indx[2] = 3; in get_res()
580 id = t_indx[i]; in repaint_proc()
628 id = t_indx[i]; in repaint_proc()
646 id = t_indx[i]; in repaint_proc()
[all …]
/dports/misc/vxl/vxl-3.3.2/contrib/brl/bbas/bsol/
H A Dbsol_hough_line_index.cxx331 int t_indx = (theta + i) % (th_dim_m1); in lines_in_interval() local
332 if (t_indx<0) in lines_in_interval()
333 t_indx += th_dim_m1; in lines_in_interval()
341 this->lines_at_index(r_indx, t_indx,temp); in lines_in_interval()
419 int t_indx = (theta + i) % (th_dim_m1); in parallel_lines() local
420 if (t_indx<0) in parallel_lines()
421 t_indx += th_dim_m1; in parallel_lines()
424 if (!(this->count(j, t_indx)>0)) in parallel_lines()
427 this->lines_at_index(j, t_indx, temp); in parallel_lines()
/dports/misc/vxl/vxl-3.3.2/core/vgl/algo/
H A Dvgl_hough_index_2d.hxx424 int t_indx = (theta + i) % (th_dim_); in lines_in_interval() local
425 if (t_indx<0) in lines_in_interval()
426 t_indx += th_dim_m1; in lines_in_interval()
523 int t_indx = (theta_index + i) % (th_dim_); in line_indices_in_interval() local
524 if (t_indx<0) in line_indices_in_interval()
525 t_indx += th_dim_m1; in line_indices_in_interval()
595 size_t t_indx = (theta + i) % (th_dim_m1); in parallel_lines() local
596 if (t_indx<0) in parallel_lines()
597 t_indx += th_dim_m1; in parallel_lines()
600 if (!(this->count(j, t_indx)>0)) in parallel_lines()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dsimilarity.py1307 t_indx = None if target is None else nodelist.index(target)
1310 G, s_indx, t_indx, importance_factor, max_iterations, tolerance