Home
last modified time | relevance | path

Searched refs:sza (Results 1 – 25 of 732) sorted by relevance

12345678910>>...30

/dports/math/fftw3-float/fftw-3.3.9/libbench2/
H A Dverify-rdft2.c39 static void cpyr(R *ra, const bench_tensor *sza, in cpyr() argument
45 bench_dotens2(sza, szb, &k.k); in cpyr()
78 const bench_tensor *sza, const bench_tensor *vecsza, in cpyhc2() argument
83 BENCH_ASSERT(sza->rnk <= 1); in cpyhc2()
85 k.n = tensor_sz(sza); in cpyhc2()
87 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in cpyhc2()
90 k.as = sza->dims[0].os; in cpyhc2()
120 BENCH_ASSERT(sza->rnk <= 1); in icpyhc2()
122 k.n = tensor_sz(sza); in icpyhc2()
124 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in icpyhc2()
[all …]
/dports/math/fftw3/fftw-3.3.9/libbench2/
H A Dverify-rdft2.c39 static void cpyr(R *ra, const bench_tensor *sza, in cpyr() argument
45 bench_dotens2(sza, szb, &k.k); in cpyr()
78 const bench_tensor *sza, const bench_tensor *vecsza, in cpyhc2() argument
83 BENCH_ASSERT(sza->rnk <= 1); in cpyhc2()
85 k.n = tensor_sz(sza); in cpyhc2()
87 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in cpyhc2()
90 k.as = sza->dims[0].os; in cpyhc2()
120 BENCH_ASSERT(sza->rnk <= 1); in icpyhc2()
122 k.n = tensor_sz(sza); in icpyhc2()
124 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in icpyhc2()
[all …]
/dports/math/fftw3-long/fftw-3.3.9/libbench2/
H A Dverify-rdft2.c39 static void cpyr(R *ra, const bench_tensor *sza, in cpyr() argument
45 bench_dotens2(sza, szb, &k.k); in cpyr()
78 const bench_tensor *sza, const bench_tensor *vecsza, in cpyhc2() argument
83 BENCH_ASSERT(sza->rnk <= 1); in cpyhc2()
85 k.n = tensor_sz(sza); in cpyhc2()
87 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in cpyhc2()
90 k.as = sza->dims[0].os; in cpyhc2()
120 BENCH_ASSERT(sza->rnk <= 1); in icpyhc2()
122 k.n = tensor_sz(sza); in icpyhc2()
124 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in icpyhc2()
[all …]
/dports/math/fftw3-quad/fftw-3.3.9/libbench2/
H A Dverify-rdft2.c39 static void cpyr(R *ra, const bench_tensor *sza, in cpyr() argument
45 bench_dotens2(sza, szb, &k.k); in cpyr()
78 const bench_tensor *sza, const bench_tensor *vecsza, in cpyhc2() argument
83 BENCH_ASSERT(sza->rnk <= 1); in cpyhc2()
85 k.n = tensor_sz(sza); in cpyhc2()
87 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in cpyhc2()
90 k.as = sza->dims[0].os; in cpyhc2()
120 BENCH_ASSERT(sza->rnk <= 1); in icpyhc2()
122 k.n = tensor_sz(sza); in icpyhc2()
124 if (!BENCH_FINITE_RNK(sza->rnk) || sza->rnk == 0) in icpyhc2()
[all …]
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/PgSQL/rdkit/
H A Dsfp_op.c185 unsigned int sza,szb; in sfp_dice_sml() local
191 sza=VARSIZE(ba)-VARHDRSZ; in sfp_dice_sml()
195 res = calcSparseStringDiceSml(a,sza,b,szb); in sfp_dice_sml()
205 unsigned int sza,szb; in sfp_dice_sml_op() local
211 sza=VARSIZE(ba)-VARHDRSZ; in sfp_dice_sml_op()
215 res = calcSparseStringDiceSml(a,sza,b,szb); in sfp_dice_sml_op()
225 unsigned int sza; in sfp_allvals_gt() local
231 sza=VARSIZE(ba)-VARHDRSZ; in sfp_allvals_gt()
233 res = calcSparseStringAllValsGT(a,sza,tgt); in sfp_allvals_gt()
242 unsigned int sza; in sfp_allvals_lt() local
[all …]
/dports/games/freecol/freecol-0.11.6/data/mods/example/
H A Dresources.properties9 …on.unit.model.unit.milkmaid.soldier.attack.w=resources/images/units/soldier/soldier-attack-left.sza
10 …n.unit.model.unit.milkmaid.soldier.attack.e=resources/images/units/soldier/soldier-attack-right.sza
11 …on.unit.model.unit.milkmaid.dragoon.attack.w=resources/images/units/dragoon/dragoon-attack-left.sza
12 …n.unit.model.unit.milkmaid.dragoon.attack.e=resources/images/units/dragoon/dragoon-attack-right.sza
/dports/www/mod_jk/tomcat-connectors-1.2.48-src/native/common/
H A Djk_pool.c146 size_t sza = strlen(a); in jk_pool_strcat() local
147 if ((szs + sza) == 0) { in jk_pool_strcat()
150 rc = jk_pool_alloc(p, szs + sza + 1); in jk_pool_strcat()
153 memcpy(rc + szs, a, sza + 1); in jk_pool_strcat()
/dports/math/nauty/nauty27r3/
H A Dtestg.c369 group_node *sza,*szb; in compare_count_node() local
377 cmp = compare_groupnodes(sza,szb); in compare_count_node()
396 group_node *sza,*szb; in add_count() local
406 if (compare_groupnodes(sza,szb) < 0) in add_count()
409 if (compare_groupnodes(sza,szb) > 0) in add_count()
547 group_node *sza,*szb; in printkeyvals() local
563 sza = (group_node*)val[i].lo; in printkeyvals()
564 write_group_size(f,sza); in printkeyvals()
596 sza = (group_node*)val[i].lo; in printkeyvals()
597 write_group_size(f,sza); in printkeyvals()
[all …]
/dports/math/py-pynauty/pynauty-1.0.2/src/nauty27r1/
H A Dtestg.c369 group_node *sza,*szb; in compare_count_node() local
377 cmp = compare_groupnodes(sza,szb); in compare_count_node()
396 group_node *sza,*szb; in add_count() local
406 if (compare_groupnodes(sza,szb) < 0) in add_count()
409 if (compare_groupnodes(sza,szb) > 0) in add_count()
547 group_node *sza,*szb; in printkeyvals() local
563 sza = (group_node*)val[i].lo; in printkeyvals()
564 write_group_size(f,sza); in printkeyvals()
596 sza = (group_node*)val[i].lo; in printkeyvals()
597 write_group_size(f,sza); in printkeyvals()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/liblouis/src/tests/yaml/
H A Dhu-hu-g1-hyph_harness.yaml102 - [borsszaga, bors-sza-ga]
121 - [Csalásszagú, Csa-lás-sza-gú]
179 - [égésszabály, égés-sza-bály]
390 - [hasisszagot, ha-sis-sza-got]
396 - [hekusszagot, he-kus-sza-got]
420 - [hússzagú, hús-sza-gú]
475 - [jósszavai, jós-sza-vai]
526 - [kevésszavú, ke-vés-sza-vú]
617 - [lesszabály, les-sza-bály]
866 - [priamossza, pria-mos-sza]
[all …]
/dports/devel/liblouis/liblouis-3.20.0/tests/braille-specs/
H A Dhu-hu-g1-hyph_harness.yaml102 - [borsszaga, bors-sza-ga]
121 - [Csalásszagú, Csa-lás-sza-gú]
179 - [égésszabály, égés-sza-bály]
390 - [hasisszagot, ha-sis-sza-got]
396 - [hekusszagot, he-kus-sza-got]
420 - [hússzagú, hús-sza-gú]
475 - [jósszavai, jós-sza-vai]
526 - [kevésszavú, ke-vés-sza-vú]
617 - [lesszabály, les-sza-bály]
866 - [priamossza, pria-mos-sza]
[all …]
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/geom3d/
H A DvectorCross3d.m64 sza = size(a); variable
69 switch sign(numel(sza) - numel(szb))
71 c = zeros(sza);
75 c = zeros(max(sza, szb));
/dports/devel/radare2/radare2-5.1.1/libr/main/
H A Dradiff2.c955 ut64 sza = 0, szb = 0; in r_main_radiff2() local
1143 sza = (ut64)strlen ((const char *) bufa); in r_main_radiff2()
1186 sza = sz; in r_main_radiff2()
1192 sza = sz; in r_main_radiff2()
1209 sza = fsz; in r_main_radiff2()
1221 if (sza != szb) { in r_main_radiff2()
1222 eprintf ("File size differs %"PFMT64u" vs %"PFMT64u"\n", (ut64)sza, (ut64)szb); in r_main_radiff2()
1252 fileobj (&ro, ro.file, bufa, sza); in r_main_radiff2()
1261 char *res = r_diff_buffers_unified (d, bufa, (int)sza, bufb, (int)szb); in r_main_radiff2()
1268 r_diff_buffers (d, bufa, (ut32)sza, bufb, (ut32)szb); in r_main_radiff2()
[all …]
/dports/science/healpix/Healpix_3.50/src/java/src/healpix/essentials/
H A DRangeSet.java185 private static int strategy (int sza, int szb) in strategy() argument
189 int slo = sza<szb ? sza : szb, in strategy()
190 shi = sza<szb ? szb : sza; in strategy()
191 double cost1 = fct1 * (sza+szb); in strategy()
193 return (cost1<=cost2) ? 1 : (slo==sza) ? 2 : 3; in strategy()
/dports/math/py-ducc0/ducc0-0.22.0/src/ducc0/math/
H A Drangeset.h84 static int strategy (size_t sza, size_t szb) in strategy() argument
88 size_t slo = sza<szb ? sza : szb, in strategy()
89 shi = sza<szb ? szb : sza; in strategy()
90 double cost1 = fct1 * (sza+szb); in strategy()
92 return (cost1<=cost2) ? 1 : (slo==sza) ? 2 : 3; in strategy()
/dports/science/healpix/Healpix_3.50/src/cxx/cxxsupport/
H A Drangeset.h83 static int strategy (tsize sza, tsize szb) in strategy() argument
87 tsize slo = sza<szb ? sza : szb, in strategy()
88 shi = sza<szb ? szb : sza; in strategy()
89 double cost1 = fct1 * (sza+szb); in strategy()
91 return (cost1<=cost2) ? 1 : (slo==sza) ? 2 : 3; in strategy()
H A Dcrangeset.h219 static int strategy (tsize sza, tsize szb) in strategy() argument
223 tsize slo = sza<szb ? sza : szb, in strategy()
224 shi = sza<szb ? szb : sza; in strategy()
225 double cost1 = fct1 * (sza+szb); in strategy()
227 return (cost1<=cost2) ? 1 : (slo==sza) ? 2 : 3; in strategy()
/dports/finance/qtbitcointrader/QtBitcoinTrader-1.40.55/src/Resources/Language/
H A DPolish.lng194 CheckBox_TR00060=Najwyższa cena
195 CheckBox_TR00061=Najniższa cena
274 String_AS_MARKET_HIGH=Najwyższa cena
276 String_AS_MARKET_LOW=Najniższa cena
339 String_IF_MARKET_HIGH_LESS=Jeżeli najwyższa cena<%1
340 String_IF_MARKET_HIGH_MORE=Jeżeli najwyższa cena>%1
354 String_IF_MARKET_LOW_EQUAL=Jeżeli najniższa cena=%1
355 String_IF_MARKET_LOW_LESS=Jeżeli najniższa cena<%1
356 String_IF_MARKET_LOW_MORE=Jeżeli najniższa cena>%1
375 String_INDICATOR_HIGHPRICE=Najwyższa cena
[all …]
/dports/devel/hs-ShellCheck/ShellCheck-0.8.0/_cabal_deps/primitive-0.7.3.0/Data/Primitive/
H A DArray.hs614 ab <*> a = createArray (szab * sza) (die "<*>" "impossible") $ \mb ->
618 go2 (i * sza) f 0
620 go2 off f j = when (j < sza) $
626 where szab = sizeofArray ab; sza = sizeofArray a
628 a *> b = createArray (sza * szb) (die "*>" "impossible") $ \mb ->
629 let go i | i < sza = copyArray mb (i * szb) b 0 szb *> go (i + 1)
632 where sza = sizeofArray a; szb = sizeofArray b function
634 a <* b = createArray (sza * szb) (die "<*" "impossible") $ \ma ->
637 go i | i < sza
642 where sza = sizeofArray a; szb = sizeofArray b function
/dports/math/hs-Agda/Agda-2.6.2/_cabal_deps/primitive-0.7.0.1/Data/Primitive/
H A DArray.hs638 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
642 go2 (i*sza) f 0
644 go2 off f j = when (j < sza) $
650 where szab = sizeofArray ab ; sza = sizeofArray a
651 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
652 let go i | i < sza = copyArray mb (i * szb) b 0 szb
655 where sza = sizeofArray a ; szb = sizeofArray b function
656 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
659 go i | i < sza
664 where sza = sizeofArray a ; szb = sizeofArray b function
/dports/devel/stack/stack-2.7.3/_cabal_deps/primitive-0.7.1.0/Data/Primitive/
H A DArray.hs675 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
679 go2 (i*sza) f 0
681 go2 off f j = when (j < sza) $
687 where szab = sizeofArray ab ; sza = sizeofArray a
688 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
689 let go i | i < sza = copyArray mb (i * szb) b 0 szb
692 where sza = sizeofArray a ; szb = sizeofArray b function
693 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
696 go i | i < sza
701 where sza = sizeofArray a ; szb = sizeofArray b function
/dports/devel/hs-threadscope/threadscope-0.2.14/_cabal_deps/primitive-0.7.1.0/Data/Primitive/
H A DArray.hs675 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
679 go2 (i*sza) f 0
681 go2 off f j = when (j < sza) $
687 where szab = sizeofArray ab ; sza = sizeofArray a
688 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
689 let go i | i < sza = copyArray mb (i * szb) b 0 szb
692 where sza = sizeofArray a ; szb = sizeofArray b function
693 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
696 go i | i < sza
701 where sza = sizeofArray a ; szb = sizeofArray b function
/dports/games/hs-scroll/scroll-1.20180421/_cabal_deps/primitive-0.7.0.1/Data/Primitive/
H A DArray.hs638 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
642 go2 (i*sza) f 0
644 go2 off f j = when (j < sza) $
650 where szab = sizeofArray ab ; sza = sizeofArray a
651 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
652 let go i | i < sza = copyArray mb (i * szb) b 0 szb
655 where sza = sizeofArray a ; szb = sizeofArray b function
656 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
659 go i | i < sza
664 where sza = sizeofArray a ; szb = sizeofArray b function
/dports/games/hedgewars-server/hedgewars-src-1.0.0/gameServer/_cabal_deps/primitive-0.7.0.1/Data/Primitive/
H A DArray.hs638 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
642 go2 (i*sza) f 0
644 go2 off f j = when (j < sza) $
650 where szab = sizeofArray ab ; sza = sizeofArray a
651 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
652 let go i | i < sza = copyArray mb (i * szb) b 0 szb
655 where sza = sizeofArray a ; szb = sizeofArray b function
656 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
659 go i | i < sza
664 where sza = sizeofArray a ; szb = sizeofArray b function
/dports/converters/hs-aeson-pretty/aeson-pretty-0.8.8/_cabal_deps/primitive-0.7.0.1/Data/Primitive/
H A DArray.hs638 ab <*> a = createArray (szab*sza) (die "<*>" "impossible") $ \mb ->
642 go2 (i*sza) f 0
644 go2 off f j = when (j < sza) $
650 where szab = sizeofArray ab ; sza = sizeofArray a
651 a *> b = createArray (sza*szb) (die "*>" "impossible") $ \mb ->
652 let go i | i < sza = copyArray mb (i * szb) b 0 szb
655 where sza = sizeofArray a ; szb = sizeofArray b function
656 a <* b = createArray (sza*szb) (die "<*" "impossible") $ \ma ->
659 go i | i < sza
664 where sza = sizeofArray a ; szb = sizeofArray b function

12345678910>>...30