Searched refs:pm_d (Results 1 – 3 of 3) sorted by relevance
39 for (int i=0; i<l; i++) tmp_d[i] = pm_d[base+i]; in to_tmp()47 for (int i=0; i<l; i++) pm_d[base+i] = tmp_d[i]; in from_tmp()55 for (int i=0; i<l; i++) best_d[i] = pm_d[base+i]; in to_best()63 for (int i=0; i<l; i++) pm_d[base+i] = best_d[i]; in from_best()223 if (pm_d[base] == -1) { in stream_pm()231 while (j<l and pm_d[base+j] == i) { in stream_pm()390 if (pm_d[l*v] == -1) return false; // already Top in lift()529 pm_d = new int[l*nodecount()]; in run()589 if (pm_d[l*v] != -1) { in run()603 if (pm_d[l*v] != -1) { in run()[all …]
46 int *pm_d; member in pg::SSPMSolver
123 gen pm_d=(gpm-1)/vp[i];124 test=powmod(polyx,pm_d,v,env);