Home
last modified time | relevance | path

Searched refs:f_val (Results 1 – 25 of 240) sorted by relevance

12345678910

/dports/math/mfem/mfem-4.3/tests/unit/fem/
H A Dtest_get_value.cpp1640 Vector f_val(dim); f_val = 0.0; in to_string() local
2188 Vector f_val(dim); f_val = 0.0; in to_string() local
2336 << f_val[0] << "," << f_val[1] << "," in to_string()
2344 << f_val[0] << "," << f_val[1] << "," in to_string()
2482 Vector f_val(dim); f_val = 0.0; in to_string() local
3118 Vector f_val(dim); f_val = 0.0; in to_string() local
3404 Vector f_val(dim); f_val = 0.0; in to_string() local
3608 Vector f_val(dim); f_val = 0.0; in to_string() local
3819 Vector f_val(dim); f_val = 0.0; in to_string() local
4041 Vector f_val(2*dim-3); f_val = 0.0; in to_string() local
[all …]
/dports/science/openems/openEMS-0.0.35-71-g4c24b6e/matlab/
H A DDFT_time2freq.m1 function f_val = DFT_time2freq( t, val, freq, signal_type )
2 % f_val = DFT_time2freq( t, val, freq, signal_type )
13 % f_val: single-sided spectrum
19 % f_val=DFT_time2freq( t, t_val, f, 'periodic' );
20 % interp1(f,abs(f_val),3)
23 % plot( f, abs(f_val) )
33 f_val = zeros(1,numel(freq)); variable
35 f_val(f_idx) = sum( val .* exp( -1i * 2*pi*freq(f_idx) * t ) );
40 f_val = f_val * dt; variable
42 f_val = f_val / length(t); variable
[all …]
/dports/net/bird2/bird-2.0.8/filter/
H A Ddata.h67 struct f_val { struct
138 struct f_val from, to;
190 int val_same(const struct f_val *v1, const struct f_val *v2);
191 int val_compare(const struct f_val *v1, const struct f_val *v2);
192 void val_format(const struct f_val *v, buffer *buf);
193 char *val_format_str(struct linpool *lp, const struct f_val *v);
194 const char *val_dump(const struct f_val *v);
196 static inline int val_is_ip4(const struct f_val *v) in val_is_ip4()
198 int val_in_range(const struct f_val *v1, const struct f_val *v2);
200 int clist_set_type(const struct f_tree *set, struct f_val *v);
[all …]
H A Ddata.c71 const struct f_val f_const_empty_path = {
165 val_compare(const struct f_val *v1, const struct f_val *v2) in val_compare()
260 val_same(const struct f_val *v1, const struct f_val *v2) in val_same()
322 struct f_val v; in clist_match_set()
346 struct f_val v; in eclist_match_set()
370 struct f_val v; in lclist_match_set()
392 struct f_val v; in clist_filter()
427 struct f_val v; in eclist_filter()
461 struct f_val v; in lclist_filter()
494 val_in_range(const struct f_val *v1, const struct f_val *v2) in val_in_range()
[all …]
H A Dconfig.Y52 f_new_item(struct f_val from, struct f_val to) in f_new_item()
166 struct f_val empty; in f_generate_empty()
671 NUM { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_INT, .val.i = $1, }); }
672 | TRUE { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_BOOL, .val.i = 1, }); }
673 | FALSE { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_BOOL, .val.i = 0, }); }
674 | TEXT { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_STRING, .val.s = $1, }); }
676 | VPN_RD { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_RD, .val.ec = $1, }); }
677 | net_ { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_NET, .val.net = $1, }); }
680 $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = T_SET, .val.t = build_tree($2), });
684 …| ENUM { $$ = f_new_inst(FI_CONSTANT, (struct f_val) { .type = $1 >> 16, .val.i = $1 & 0xffff, }…
[all …]
/dports/misc/visp/visp-3.4.0/example/parse-argv/
H A Dparse-argv1.cpp61 bool getOptions(int argc, const char **argv, int &i_val, float &f_val, double &d_val);
74 void usage(const char *name, const char *badparam, int i_val, float f_val, double d_val) in usage() argument
95 Print the help.\n\n", i_val, f_val, d_val); in usage()
115 bool getOptions(int argc, const char **argv, int &i_val, float &f_val, double &d_val) in getOptions() argument
126 f_val = (float)atof(optarg_); in getOptions()
132 usage(argv[0], NULL, i_val, f_val, d_val); in getOptions()
137 usage(argv[0], optarg_, i_val, f_val, d_val); in getOptions()
145 usage(argv[0], NULL, i_val, f_val, d_val); in getOptions()
161 float f_val = 3.14f; in main() local
165 if (getOptions(argc, argv, i_val, f_val, d_val) == false) { in main()
[all …]
/dports/multimedia/vlc/vlc-3.0.16/modules/visualization/visual/
H A Dwindow.c143 float f_val = (float) i / (float) i_buffer_size_minus_1; in window_init() local
151 float f_val = (float) i / (float) i_buffer_size_minus_1; in window_init() local
153 - FT_A1 * cosf( 2.0f * (float) M_PI * f_val ) in window_init()
154 + FT_A2 * cosf( 4.0f * (float) M_PI * f_val ) in window_init()
155 - FT_A3 * cosf( 6.0f * (float) M_PI * f_val ) in window_init()
156 + FT_A4 * cosf( 8.0f * (float) M_PI * f_val ); in window_init()
163 float f_val = (float) i / (float) i_buffer_size_minus_1; in window_init() local
165 - BH_A1 * cosf( 2.0f * (float) M_PI * f_val ) in window_init()
166 + BH_A2 * cosf( 4.0f * (float) M_PI * f_val ) in window_init()
177 float f_val = (float) i / (float) i_buffer_size_minus_1; in window_init() local
[all …]
/dports/finance/py-quantecon/quantecon-0.5.2/quantecon/optimize/
H A Dnelder_mead.py194 f_val = np.empty(n+1, dtype=np.float64)
196 f_val[i] = _neg_bounded_fun(fun, bounds, vertices[i], args=args)
199 sort_ind = f_val.argsort()
214 term_f = f_val[worst_val_idx] - f_val[best_val_idx] < tol_f
228 if f_r >= f_val[best_val_idx] and f_r < f_val[sort_ind[n-1]]:
234 elif f_r < f_val[best_val_idx]:
259 if f_c < min(f_r, f_val[worst_val_idx]): # Accept contraction
269 f_val[i] = _neg_bounded_fun(fun, bounds, vertices[i],
272 sort_ind[1:] = f_val[sort_ind[1:]].argsort() + 1
281 f_val[worst_val_idx] = _neg_bounded_fun(fun, bounds,
[all …]
/dports/x11-toolkits/xforms/xforms-1.2.4/lib/
H A Dspinner.c240 double old_f_val = sp->f_val; in spinner_callback()
247 if ( eptr == s_val || f_val > sp->f_max || f_val < sp->f_min ) in spinner_callback()
258 sp->f_val = f_val; in spinner_callback()
345 sp->f_val = sp->old_fval = 0.0; in fl_create_spinner()
413 || f_val > sp->f_max in fl_get_spinner_value()
414 || f_val < sp->f_min ) in fl_get_spinner_value()
415 f_val = sp->f_val; in fl_get_spinner_value()
427 return sp->f_val = f_val; in fl_get_spinner_value()
456 sp->f_val = val; in fl_set_spinner_value()
459 sp->f_val = sp->f_max; in fl_set_spinner_value()
[all …]
/dports/devel/gcem/gcem-1.13.1/tests/
H A Dgcem_tests.hpp130 const T1 f_val, const T2 err_val, in print_test_pass() argument
137 << std::setprecision(print_precision_2) << f_val << "\n"; in print_test_pass()
147 const T1 f_val, const T2 err_val, in print_test_pass() argument
164 const T1 f_val, const T2 err_val, in print_test_pass() argument
184 const T1 f_val, const T2 expected_val, in print_test_fail() argument
196 std::cerr << " - Actual value: " << f_val << "\n"; in print_test_fail()
207 const T1 f_val, const T2 expected_val, in print_test_fail() argument
219 std::cerr << " - Actual value: " << f_val << "\n"; in print_test_fail()
230 const T1 f_val, const T2 expected_val, in print_test_fail() argument
242 std::cerr << " - Actual value: " << f_val << "\n"; in print_test_fail()
[all …]
/dports/math/bitwise/bitwise-0.43/src/
H A Dmisc.c301 double f_val = val; in sprintf_size() local
305 ret = sprintf(buf, "%.2lf PB", f_val / PB); in sprintf_size()
307 ret = sprintf(buf, "%.2lf TB", f_val / TB); in sprintf_size()
309 ret = sprintf(buf, "%.2lf GB", f_val / GB); in sprintf_size()
311 ret = sprintf(buf, "%.2lf MB", f_val / MB); in sprintf_size()
313 ret = sprintf(buf, "%.2lf Kb", f_val / kB); in sprintf_size()
318 ret = sprintf(buf, "%.2lf PiB", f_val / PiB); in sprintf_size()
320 ret = sprintf(buf, "%.2lf TiB", f_val / TiB); in sprintf_size()
322 ret = sprintf(buf, "%.2lf GiB", f_val / GiB); in sprintf_size()
324 ret = sprintf(buf, "%.2lf MiB", f_val / MiB); in sprintf_size()
[all …]
/dports/net/bird/bird-1.6.8/filter/
H A Dfilter.h120 struct f_val { struct
166 struct f_tree *find_tree(struct f_tree *t, struct f_val val);
197 struct f_val f_eval_rte(struct f_inst *expr, struct rte **rte, struct linpool *tmp_pool);
198 struct f_val f_eval(struct f_inst *expr, struct linpool *tmp_pool);
206 int val_compare(struct f_val v1, struct f_val v2);
207 int val_same(struct f_val v1, struct f_val v2);
209 void val_format(struct f_val v, buffer *buf);
282 struct f_val from, to;
301 #define NEW_F_VAL struct f_val * val; val = cfg_alloc(sizeof(struct f_val));
H A Dfilter.c128 val_compare(struct f_val v1, struct f_val v2) in val_compare()
211 val_same(struct f_val v1, struct f_val v2) in val_same()
291 struct f_val v; in clist_match_set()
315 struct f_val v; in eclist_match_set()
339 struct f_val v; in lclist_match_set()
361 struct f_val v; in clist_filter()
396 struct f_val v; in eclist_filter()
430 struct f_val v; in lclist_filter()
463 val_in_range(struct f_val v1, struct f_val v2) in val_in_range()
1768 struct f_val
[all …]
/dports/science/py-scikit-optimize/scikit-optimize-0.9.0/examples/
H A Dask-and-tell.py94 f_val = objective(next_x) variable
95 opt.tell(next_x, f_val)
105 f_val = objective(next_x) variable
106 res = opt.tell(next_x, f_val)
122 f_val = objective(next_x) variable
123 res = opt.tell(next_x, f_val)
H A Doptimizer-with-different-base-estimator.py92 f_val = objective(next_x) variable
93 res = opt_gp.tell(next_x, f_val)
134 f_val = objective(next_x) variable
135 res = opt.tell(next_x, f_val)
/dports/science/openems/openEMS-0.0.35-71-g4c24b6e/python/openEMS/
H A Dutilities.py24 f_val = np.zeros(len(freq))*1j
26 f_val[n_f] = np.sum( val*np.exp( -1j*2*np.pi*freq[n_f] * t ) )
29 f_val *= t[1]-t[0]
31 f_val /= len(t)
35 return 2*f_val # single-sided spectrum
/dports/science/code_saturne/code_saturne-7.1.0/src/turb/
H A Dcs_les_filter.c104 cs_real_t f_val[]) in _les_filter_ext_neighborhood() argument
187 f_val[i] = w1[i]/w2[i]; in _les_filter_ext_neighborhood()
192 cs_halo_sync_var(mesh->halo, CS_HALO_STANDARD, f_val); in _les_filter_ext_neighborhood()
270 f_val[i] = w1[i]/w2[i]; in _les_filter_ext_neighborhood()
275 cs_halo_sync_var_strided(mesh->halo, CS_HALO_EXTENDED, f_val, stride); in _les_filter_ext_neighborhood()
303 cs_real_t f_val[]) in cs_les_filter() argument
306 _les_filter_ext_neighborhood(stride, val, f_val); in cs_les_filter()
360 f_val[c_id] = _f_val / _f_weight; in cs_les_filter()
383 f_val[c_id*_stride + k] = _f_val[k] / _f_weight; in cs_les_filter()
396 cs_halo_sync_var_strided(mesh->halo, CS_HALO_STANDARD, f_val, _stride); in cs_les_filter()
/dports/finance/odoo/odoo-19d77c2a03335eb95a686bd69a1b56b38e87d609/odoo/tools/
H A Dconvert.py104 f_val = False
106 f_val = ids[0]
108 f_val = f_val[0]
109 return f_val
542 f_val = False
558 f_val = s[0][f_use]
570 f_val = int(f_val) if f_val else False
572 f_val = int(f_val)
574 f_val = float(f_val)
576 f_val = str2bool(f_val)
[all …]
/dports/x11-toolkits/xforms/xforms-1.2.4/fdesign/
H A Dsp_spinner.c48 sp->f_val = sp->i_val; in spinner_change_type()
55 sp->i_val = sp->f_val; in spinner_change_type()
132 set_finput_value( spn_attrib->initialval, sp->f_val, sp->prec ); in spinner_fill_in_spec_form()
193 if ( sp->f_val != defsp->f_val ) in spinner_emit_spec_fd_code()
194 fprintf( fp, " value: %.*f\n", sp->prec, sp->f_val ); in spinner_emit_spec_fd_code()
236 if ( sp->f_val != defsp->f_val ) in spinner_emit_spec_c_code()
238 sp->prec, sp->f_val ); in spinner_emit_spec_c_code()
/dports/multimedia/v4l_compat/linux-5.13-rc2/kernel/
H A Dauditfilter.c459 u32 f_val; in audit_data_to_entry() local
468 f_val = data->values[i]; in audit_data_to_entry()
473 f_val = 0; in audit_data_to_entry()
503 f->val = f_val; in audit_data_to_entry()
521 entry->rule.buflen += f_val; in audit_data_to_entry()
545 entry->rule.buflen += f_val; in audit_data_to_entry()
557 entry->rule.buflen += f_val; in audit_data_to_entry()
560 f->val = f_val; in audit_data_to_entry()
573 entry->rule.buflen += f_val; in audit_data_to_entry()
590 entry->rule.buflen += f_val; in audit_data_to_entry()
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/kernel/
H A Dauditfilter.c459 u32 f_val; in audit_data_to_entry() local
468 f_val = data->values[i]; in audit_data_to_entry()
473 f_val = 0; in audit_data_to_entry()
503 f->val = f_val; in audit_data_to_entry()
521 entry->rule.buflen += f_val; in audit_data_to_entry()
545 entry->rule.buflen += f_val; in audit_data_to_entry()
557 entry->rule.buflen += f_val; in audit_data_to_entry()
560 f->val = f_val; in audit_data_to_entry()
573 entry->rule.buflen += f_val; in audit_data_to_entry()
590 entry->rule.buflen += f_val; in audit_data_to_entry()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/kernel/
H A Dauditfilter.c459 u32 f_val; in audit_data_to_entry() local
468 f_val = data->values[i]; in audit_data_to_entry()
473 f_val = 0; in audit_data_to_entry()
503 f->val = f_val; in audit_data_to_entry()
521 entry->rule.buflen += f_val; in audit_data_to_entry()
545 entry->rule.buflen += f_val; in audit_data_to_entry()
557 entry->rule.buflen += f_val; in audit_data_to_entry()
560 f->val = f_val; in audit_data_to_entry()
573 entry->rule.buflen += f_val; in audit_data_to_entry()
590 entry->rule.buflen += f_val; in audit_data_to_entry()
[all …]
/dports/devel/sunpromake/schily-2021-09-18/bsh/
H A Dcall.c41 char *f_val; member
356 return (rf->f_val);
371 new->f_val = makestr(vp->av_av[2]);
378 free(rf->f_val);
380 rf->f_val = new->f_val;
422 free(rf->f_val);
442 pr_func(f, rf->f_name, rf->f_val);
/dports/devel/smake/schily-2021-09-18/bsh/
H A Dcall.c41 char *f_val; member
356 return (rf->f_val);
371 new->f_val = makestr(vp->av_av[2]);
378 free(rf->f_val);
380 rf->f_val = new->f_val;
422 free(rf->f_val);
442 pr_func(f, rf->f_name, rf->f_val);
/dports/devel/schilybase/schily-2021-09-18/bsh/
H A Dcall.c41 char *f_val; member
356 return (rf->f_val);
371 new->f_val = makestr(vp->av_av[2]);
378 free(rf->f_val);
380 rf->f_val = new->f_val;
422 free(rf->f_val);
442 pr_func(f, rf->f_name, rf->f_val);

12345678910