| /dports/math/4ti2/4ti2-Release_1_6_9/src/zsolve/ |
| H A D | Lattice.hpp | 105 int best_index = column; in reduce_gaussian() local
120 best_index = -1; in reduce_gaussian()
125 if ( current_value > 0 && (best_index < 0 || current_value < best_index)) in reduce_gaussian()
132 if (best_index < 0) in reduce_gaussian()
335 size_t best_index = i; in generate_lattice() local
345 best_index = current_index; in generate_lattice()
352 H.swap_rows (best_index, i); in generate_lattice()
362 best_index = i; in generate_lattice()
378 if (H[i][best_index] < 0) in generate_lattice()
387 if (j != best_index) in generate_lattice()
[all …]
|
| /dports/games/d2x/d2x-0.2.5/2d/ |
| H A D | palette.c | 292 int best_value, best_index, value; in gr_find_closest_color() local
317 best_index = 0; in gr_find_closest_color()
320 return best_index; in gr_find_closest_color()
333 best_index = i; in gr_find_closest_color()
336 add_computed_color(r, g, b, best_index); in gr_find_closest_color()
337 return best_index; in gr_find_closest_color()
349 int best_value, best_index, value; in gr_find_closest_color_current() local
356 best_index = 0; in gr_find_closest_color_current()
358 return best_index; in gr_find_closest_color_current()
369 best_index = i; in gr_find_closest_color_current()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/snowpac/include/ |
| H A D | NOWPAC.hpp | 707 …t += evaluations.values[i+1].at( evaluations.best_index )*evaluations.values[i+1].at( evaluations.… in compute_acceptance_ratio()
966 if(evaluations.values[i+1][evaluations.best_index] > 0.){ in best_point_is_feasible()
994 if(evaluations.values[i+1][evaluations.best_index] > 0.){ in last_point_is_feasible()
1631 evaluations.best_index = 0; in optimize()
1729 evaluations.best_index = h; in optimize()
1743 evaluations.best_index = h; in optimize()
1780 x_trial = evaluations.nodes[ evaluations.best_index ]; in optimize()
1858 x_trial = evaluations.nodes[ evaluations.best_index ]; in optimize()
1989 evaluations.best_index = evaluations.nodes.size()-1; in optimize()
2108 x_trial = evaluations.nodes[ evaluations.best_index ]; in optimize()
[all …]
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/snowpac/src/ |
| H A D | GaussianProcessSupport.cpp | 81 best_index = evaluations.best_index; in update_gaussian_processes_for_gp()
158 best_index = evaluations.best_index; in update_gaussian_processes_for_agp()
254 best_index = evaluations.best_index; in update_gaussian_processes_for_agp()
285 best_index = evaluations.best_index; in update_gaussian_processes_for_agp()
414 if(evaluations.active_index[i] == evaluations.best_index){ in smooth_data()
439 cur_xstar_idx = evaluations.best_index; in smooth_data()
543 if(evaluations.active_index[i] == evaluations.best_index){ in smooth_data()
554 if(evaluations.active_index[i] == evaluations.best_index){ in smooth_data()
558 if(evaluations.active_index[i] == evaluations.best_index){ in smooth_data()
562 if(evaluations.active_index[i] == evaluations.best_index){ in smooth_data()
[all …]
|
| /dports/math/armadillo/armadillo-10.7.1/include/armadillo_bits/ |
| H A D | op_min_meat.hpp | 397 uword best_index = 0; in direct_min() local
408 best_index = i; in direct_min()
414 best_index = j; in direct_min()
425 best_index = i; in direct_min()
712 uword best_index = 0; in min_with_index() local
793 uword best_index = 0; in min_with_index() local
1174 uword best_index = 0; in min_with_index() local
1185 return( A[best_index] ); in min_with_index()
1194 uword best_index = 0; in min_with_index() local
1205 best_index = best_col; in min_with_index()
[all …]
|
| H A D | op_max_meat.hpp | 397 uword best_index = 0; in direct_max() local
408 best_index = i; in direct_max()
414 best_index = j; in direct_max()
425 best_index = i; in direct_max()
712 uword best_index = 0; in max_with_index() local
793 uword best_index = 0; in max_with_index() local
1174 uword best_index = 0; in max_with_index() local
1185 return( A[best_index] ); in max_with_index()
1194 uword best_index = 0; in max_with_index() local
1205 best_index = best_col; in max_with_index()
[all …]
|
| /dports/math/R-cran-RcppArmadillo/RcppArmadillo/inst/include/armadillo_bits/ |
| H A D | op_max_meat.hpp | 397 uword best_index = 0; in direct_max() local
408 best_index = i; in direct_max()
414 best_index = j; in direct_max()
425 best_index = i; in direct_max()
712 uword best_index = 0; in max_with_index() local
793 uword best_index = 0; in max_with_index() local
1174 uword best_index = 0; in max_with_index() local
1185 return( A[best_index] ); in max_with_index()
1194 uword best_index = 0; in max_with_index() local
1205 best_index = best_col; in max_with_index()
[all …]
|
| H A D | op_min_meat.hpp | 397 uword best_index = 0; in direct_min() local
408 best_index = i; in direct_min()
414 best_index = j; in direct_min()
425 best_index = i; in direct_min()
712 uword best_index = 0; in min_with_index() local
793 uword best_index = 0; in min_with_index() local
1174 uword best_index = 0; in min_with_index() local
1185 return( A[best_index] ); in min_with_index()
1194 uword best_index = 0; in min_with_index() local
1205 best_index = best_col; in min_with_index()
[all …]
|
| /dports/games/d2x/d2x-0.2.5/unused/vga/new/ |
| H A D | palette.c | 147 int best_value, best_index, value; in gr_find_closest_color() local
172 best_index = 0; in gr_find_closest_color()
175 return best_index; in gr_find_closest_color()
188 best_index = i; in gr_find_closest_color()
191 add_computed_color(r, g, b, best_index); in gr_find_closest_color()
192 return best_index; in gr_find_closest_color()
204 int best_value, best_index, value; in gr_find_closest_color_current() local
211 best_index = 0; in gr_find_closest_color_current()
213 return best_index; in gr_find_closest_color_current()
224 best_index = i; in gr_find_closest_color_current()
[all …]
|
| /dports/games/d2x/d2x-0.2.5/unused/vga/ |
| H A D | palette.c | 148 int best_value, best_index, value; in gr_find_closest_color() local
173 best_index = 0; in gr_find_closest_color()
176 return best_index; in gr_find_closest_color()
189 best_index = i; in gr_find_closest_color()
192 add_computed_color(r, g, b, best_index); in gr_find_closest_color()
193 return best_index; in gr_find_closest_color()
205 int best_value, best_index, value; in gr_find_closest_color_current() local
212 best_index = 0; in gr_find_closest_color_current()
214 return best_index; in gr_find_closest_color_current()
225 best_index = i; in gr_find_closest_color_current()
[all …]
|
| /dports/deskutils/coolreader/coolreader-cr3.2.55/crengine/src/private/ |
| H A D | lvfontcache.cpp | 38 int best_index = -1; in findFallback() local
54 best_index = i; in findFallback()
57 if (best_index <= 0) in findFallback()
61 return _registered_list[best_index]; in findFallback()
65 int best_index = -1; in find() local
89 best_index = i; in find()
93 if (best_index < 0) in find()
97 return _registered_list[best_index]; in find()
|
| /dports/games/scid/scid/src/polyglot/ |
| H A D | list.cpp | 165 int best_index, best_move, best_value; in list_sort() local
171 best_index = i; in list_sort()
176 best_index = j; in list_sort()
181 if (best_index != i) { in list_sort()
183 best_move = list->move[best_index]; in list_sort()
184 ASSERT(best_value==list->value[best_index]); in list_sort()
186 for (j = best_index; j > i; j--) { in list_sort()
|
| /dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/contrib/paulistring/ |
| H A D | recombine.py | 86 for best_string_op, best_index, best_node in placements:
89 best_index <= last_index
91 best_index, last_index, len(output_ops)
94 last_index = best_index
95 output_ops.insert(best_index, best_string_op)
|
| /dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/contrib/paulistring/ |
| H A D | recombine.py | 86 for best_string_op, best_index, best_node in placements:
89 best_index <= last_index
91 best_index, last_index, len(output_ops)
94 last_index = best_index
95 output_ops.insert(best_index, best_string_op)
|
| /dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/contrib/paulistring/ |
| H A D | recombine.py | 86 for best_string_op, best_index, best_node in placements:
89 best_index <= last_index
91 best_index, last_index, len(output_ops)
94 last_index = best_index
95 output_ops.insert(best_index, best_string_op)
|
| /dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/contrib/paulistring/ |
| H A D | recombine.py | 86 for best_string_op, best_index, best_node in placements:
89 best_index <= last_index
91 best_index, last_index, len(output_ops)
94 last_index = best_index
95 output_ops.insert(best_index, best_string_op)
|
| /dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/contrib/paulistring/ |
| H A D | recombine.py | 86 for best_string_op, best_index, best_node in placements:
89 best_index <= last_index
91 best_index, last_index, len(output_ops)
94 last_index = best_index
95 output_ops.insert(best_index, best_string_op)
|
| /dports/mail/mairix/mairix-0.24/dfasyn/ |
| H A D | tabcompr.c | 92 int best_index; in find_default_states() local
104 best_index = -1; in find_default_states()
137 if (((best_index < 0) || (diffsize < best_diff)) in find_default_states()
140 best_index = j; in find_default_states()
145 dfa->s[i]->defstate = best_index; in find_default_states()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/content/browser/manifest/ |
| H A D | manifest_icon_downloader.cc | 157 int best_index = -1; in FindClosestBitmapIndex() local
184 best_index = i; in FindClosestBitmapIndex()
189 if (best_index != -1) in FindClosestBitmapIndex()
190 return best_index; in FindClosestBitmapIndex()
209 best_index = i; in FindClosestBitmapIndex()
214 return best_index; in FindClosestBitmapIndex()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/content/browser/manifest/ |
| H A D | manifest_icon_downloader.cc | 158 int best_index = -1; in FindClosestBitmapIndex() local
185 best_index = i; in FindClosestBitmapIndex()
190 if (best_index != -1) in FindClosestBitmapIndex()
191 return best_index; in FindClosestBitmapIndex()
210 best_index = i; in FindClosestBitmapIndex()
215 return best_index; in FindClosestBitmapIndex()
|
| /dports/games/polyglot/polyglot-1.4.70b/ |
| H A D | list.c | 171 int best_index, best_move, best_value; in list_sort() local
177 best_index = i; in list_sort()
182 best_index = j; in list_sort()
187 if (best_index != i) { in list_sort()
189 best_move = list->move[best_index]; in list_sort()
190 ASSERT(best_value==list->value[best_index]); in list_sort()
192 for (j = best_index; j > i; j--) { in list_sort()
|
| /dports/games/gnuchess/gnuchess-6.2.9/src/adapter/ |
| H A D | list.cpp | 187 int best_index, best_move, best_value; in list_sort() local
193 best_index = i; in list_sort()
198 best_index = j; in list_sort()
203 if (best_index != i) { in list_sort()
205 best_move = list->move[best_index]; in list_sort()
206 ASSERT(best_value==list->value[best_index]); in list_sort()
208 for (j = best_index; j > i; j--) { in list_sort()
|
| /dports/net/h323plus/h323plus-1_27_2/plugins/audio/iLBC/iLBC/ |
| H A D | iCBSearch.c | 40 int i, j, icount, stage, best_index, range, counter; in iCBSearch() local
100 best_index = 0; in iCBSearch()
148 best_index = 0; in iCBSearch()
196 best_index = icount; in iCBSearch()
213 &max_measure, &best_index, &gain, energy, in iCBSearch()
221 base_index=best_index; in iCBSearch()
359 best_index = icount; in iCBSearch()
370 &max_measure, &best_index, &gain, energy, in iCBSearch()
376 index[stage] = best_index; in iCBSearch()
|
| /dports/net/ilbc/ilbc-rfc3951/src/ |
| H A D | iCBSearch.c | 45 int i, j, icount, stage, best_index, range, counter; in iCBSearch() local
108 best_index = 0; in iCBSearch()
159 best_index = 0; in iCBSearch()
209 best_index = icount; in iCBSearch()
226 &max_measure, &best_index, &gain, energy, in iCBSearch()
232 base_index=best_index; in iCBSearch()
380 best_index = icount; in iCBSearch()
391 &max_measure, &best_index, &gain, energy, in iCBSearch()
397 index[stage] = best_index; in iCBSearch()
|
| /dports/net/sems/sems-f89581a/core/plug-in/ilbc/iLBC_rfc3951/ |
| H A D | iCBSearch.c | 45 int i, j, icount, stage, best_index, range, counter; in iCBSearch() local
108 best_index = 0; in iCBSearch()
159 best_index = 0; in iCBSearch()
209 best_index = icount; in iCBSearch()
226 &max_measure, &best_index, &gain, energy, in iCBSearch()
232 base_index=best_index; in iCBSearch()
380 best_index = icount; in iCBSearch()
391 &max_measure, &best_index, &gain, energy, in iCBSearch()
397 index[stage] = best_index; in iCBSearch()
|