| /dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/ |
| H A D | ScheduleCombineTestSuite.h | 78 gum::ScheduleCombine< double > comb2(result1, f3, myadd); in test_construct()
79 const gum::ScheduleMultiDim< double >& result2 = comb2.result(); in test_construct()
84 comb2.execute(); in test_construct()
93 gum::Sequence< const gum::ScheduleMultiDim< double >* > seq = comb2.multiDimArgs(); in test_construct()
99 gum::ScheduleCombine< double > comb3(comb2); in test_construct()
100 TS_GUM_ASSERT_EQUALS(comb3, comb2); in test_construct()
105 TS_ASSERT_DIFFERS(comb3, comb2) in test_construct()
107 delete &(comb2.result().multiDim()); in test_construct()
|
| H A D | ScheduleTestSuite.h | 74 gum::ScheduleCombine< double > comb2(f2, f3, schedule_myadd); in test_construct1()
75 const gum::ScheduleMultiDim< double >& result2 = comb2.result(); in test_construct1()
93 schedule.insert(comb2); in test_construct1()
202 gum::ScheduleCombine< double > comb2(f2, f3, schedule_myadd); in test_construct2()
203 const gum::ScheduleMultiDim< double >& result2 = comb2.result(); in test_construct2()
227 schedule.insert(comb2); in test_construct2()
|
| H A D | SchedulerBasicTestSuite.h | 81 gum::ScheduleCombinationBasic< double > comb2(schedule_sched_myadd); in test_construct1()
84 const gum::ScheduleMultiDim< double > result2 = comb2.combine(set2, schedule); in test_construct1()
192 gum::ScheduleCombinationBasic< double > comb2(schedule_sched_myadd); in test_construct2()
195 const gum::ScheduleMultiDim< double > result2 = comb2.combine(set2, schedule); in test_construct2()
298 gum::ScheduleCombinationBasic< double > comb2(schedule_sched_myadd); in test_construct3()
301 const gum::ScheduleMultiDim< double > result2 = comb2.combine(set2, schedule); in test_construct3()
403 gum::ScheduleCombinationBasic< double > comb2(schedule_sched_myadd); in test_construct4()
406 gum::ScheduleMultiDim< double > result2 = comb2.combine(set2, schedule); in test_construct4()
|
| /dports/graphics/dataplot/dataplot-2c1b27601a3b7523449de612613eadeead9a8f70/lib/macros/ |
| H A D | DEXCOMB.DP | 46 let comb2 = data 123 124 125 134 135 145 234 235 245 345
47 . extend comb comb2
54 let comb2 = data 12 13 14 15 16 23 24 25 26 34 35 36 45 46 56
57 extend comb comb2
65 let comb2 = data 12 13 14 15 16 17 23 24 25 26 27 34 35 36 37 ...
71 extend comb comb2
|
| /dports/mail/nextcloud-mail/mail/vendor/rubix/ml/src/CrossValidation/Metrics/ |
| H A D | RandIndex.php | 37 public static function comb2(int $n) : int function in Rubix\\ML\\CrossValidation\\Metrics\\RandIndex
88 $pHat = ($alpha * $beta) / self::comb2(count($predictions));
|
| /dports/converters/libiconv/libiconv-1.16/lib/ |
| H A D | cp1255.h | 98 …1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; }; member
362 if (cp1255_decomp_table[i].comb2 < 0) { in cp1255_wctomb()
373 r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2]; in cp1255_wctomb()
|
| /dports/comms/fldigi/fldigi-4.1.20/src/libtiniconv/encdec/ |
| H A D | cp1255.h | 99 …1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; }; member
363 if (cp1255_decomp_table[i].comb2 < 0) { in cp1255_wctomb()
374 r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2]; in cp1255_wctomb()
|
| /dports/emulators/dolphin-emu/dolphin-3152428/Externals/libiconv-1.14/lib/ |
| H A D | cp1255.h | 99 …1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; }; member
363 if (cp1255_decomp_table[i].comb2 < 0) { in cp1255_wctomb()
374 r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2]; in cp1255_wctomb()
|
| /dports/multimedia/aegisub/aegisub-3.2.2/vendor/iconv/libiconv/ |
| H A D | cp1255.h | 99 …1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; }; member
363 if (cp1255_decomp_table[i].comb2 < 0) { in cp1255_wctomb()
374 r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2]; in cp1255_wctomb()
|
| /dports/biology/py-python-libsbml/python-libsbml-5.19.0/libsbml_dependencies/libiconv/source/lib/ |
| H A D | cp1255.h | 99 …1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; }; member
363 if (cp1255_decomp_table[i].comb2 < 0) { in cp1255_wctomb()
374 r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2]; in cp1255_wctomb()
|
| /dports/science/jdftx/jdftx-1.6.0/fluid1D/fluid/ |
| H A D | MixedFMT.cpp | 63 double f2prime, f2 = WB_f2(n3, f2prime), comb2 = (n1*n2-n1v*n2v); in phiFMT_calc() local
66 double wphi = w * (n0*log(pole) + pole*(f2*comb2 + pole*((1./((24*M_PI)))*f3*comb3))); in phiFMT_calc()
71 n0 + pole*(f2*comb2 + pole*((1./(12*M_PI))*f3*comb3)) in phiFMT_calc()
72 + f2prime*comb2 + pole*((1./(24*M_PI))*f3prime*comb3)); in phiFMT_calc()
|
| /dports/mail/emil/emil-2.1.0-beta9/charset/ |
| H A D | gc.c | 55 codc1,codc2,dupl,comb1,comb2,resch,donotread, variable
481 comb2= getmnem(s);
482 if (comb2 && *(outtab+comb2) == 0)
489 *(outtab+resch)= (char)*(outtab+comb1)*C256+*(outtab+comb2);
490 *(combtab+*(outtab+comb2))= resch;
|
| /dports/audio/snd/snd-21.2/ |
| H A D | jcrev.scm | 14 (comb2 (make-comb 0.733 4999))
25 (combs (make-comb-bank (vector comb1 comb2 comb3 comb4)))
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | tree-affine.c | 199 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
203 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
204 for (i = 0; i < comb2->n; i++) in aff_combination_add()
205 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
206 if (comb2->rest) in aff_combination_add()
207 aff_combination_add_elt (comb1, comb2->rest, double_int_one); in aff_combination_add()
|
| /dports/science/jdftx/jdftx-1.6.0/jdftx/fluid/ |
| H A D | MixedFMT_internal.h | 137 double f2prime, f2 = WB_f2(n3, f2prime), comb2 = (n1*n2-n1v_n2v); in phiFMT_calc() local
139 double phi = n0*log(pole) + pole*(f2*comb2 + pole*((1./((24*M_PI)))*f3*comb3)); in phiFMT_calc()
143 double phi_n3 = pole*(n0 + pole*(f2*comb2 + pole*((1./(12*M_PI))*f3*comb3))) in phiFMT_calc()
144 + pole*(f2prime*comb2 + pole*((1./(24*M_PI))*f3prime*comb3)); in phiFMT_calc()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | tree-affine.c | 200 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
204 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
205 for (i = 0; i < comb2->n; i++) in aff_combination_add()
206 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
207 if (comb2->rest) in aff_combination_add()
208 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | tree-affine.c | 199 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
203 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
204 for (i = 0; i < comb2->n; i++) in aff_combination_add()
205 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
206 if (comb2->rest) in aff_combination_add()
207 aff_combination_add_elt (comb1, comb2->rest, double_int_one); in aff_combination_add()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | tree-affine.c | 207 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
211 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
212 for (i = 0; i < comb2->n; i++) in aff_combination_add()
213 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
214 if (comb2->rest) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->rest, double_int_one); in aff_combination_add()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | tree-affine.c | 209 aff_combination_add (aff_tree *comb1, aff_tree *comb2) in aff_combination_add() argument
213 aff_combination_add_cst (comb1, comb2->offset); in aff_combination_add()
214 for (i = 0; i < comb2->n; i++) in aff_combination_add()
215 aff_combination_add_elt (comb1, comb2->elts[i].val, comb2->elts[i].coef); in aff_combination_add()
216 if (comb2->rest) in aff_combination_add()
217 aff_combination_add_elt (comb1, comb2->rest, 1); in aff_combination_add()
|