/dports/math/R/R-4.1.2/src/library/stats/src/ |
H A D | statsR.h | 48 SEXP do_dchisq(SEXP sa, SEXP sb, SEXP sI); 49 SEXP do_dexp(SEXP sa, SEXP sb, SEXP sI); 50 SEXP do_dgeom(SEXP sa, SEXP sb, SEXP sI); 51 SEXP do_dpois(SEXP sa, SEXP sb, SEXP sI); 52 SEXP do_dt(SEXP sa, SEXP sb, SEXP sI); 53 SEXP do_dsignrank(SEXP sa, SEXP sb, SEXP sI); 56 SEXP do_pexp(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 62 SEXP do_pt(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 63 SEXP do_qt(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 70 SEXP do_df(SEXP sa, SEXP sb, SEXP sc, SEXP sI); [all …]
|
H A D | distn.c | 96 m_opt = asInteger(sI); in math2_1() 142 SEXP do_##name(SEXP sa, SEXP sb, SEXP sI) { \ 143 return math2_1(sa, sb, sI, name); \ 155 return math2_2(sa, sb, sI, sJ, name); \ in DEFMATH2_1() 223 i_1 = asInteger(sI); 251 i_1 = asInteger(sI); in math3_2() 272 return math3_1(sa, sb, sc, sI, name); \ 293 return math3_2(sa, sb, sc, sI, sJ, name); \ in DEFMATH3_1() 384 i_1 = asInteger(sI); 412 i_1 = asInteger(sI); in math4_2() [all …]
|
/dports/math/libRmath/R-4.1.1/src/library/stats/src/ |
H A D | statsR.h | 48 SEXP do_dchisq(SEXP sa, SEXP sb, SEXP sI); 49 SEXP do_dexp(SEXP sa, SEXP sb, SEXP sI); 50 SEXP do_dgeom(SEXP sa, SEXP sb, SEXP sI); 51 SEXP do_dpois(SEXP sa, SEXP sb, SEXP sI); 52 SEXP do_dt(SEXP sa, SEXP sb, SEXP sI); 53 SEXP do_dsignrank(SEXP sa, SEXP sb, SEXP sI); 56 SEXP do_pexp(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 62 SEXP do_pt(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 63 SEXP do_qt(SEXP sa, SEXP sb, SEXP sI, SEXP sJ); 70 SEXP do_df(SEXP sa, SEXP sb, SEXP sc, SEXP sI); [all …]
|
H A D | distn.c | 96 m_opt = asInteger(sI); in math2_1() 142 SEXP do_##name(SEXP sa, SEXP sb, SEXP sI) { \ 143 return math2_1(sa, sb, sI, name); \ 155 return math2_2(sa, sb, sI, sJ, name); \ in DEFMATH2_1() 223 i_1 = asInteger(sI); 251 i_1 = asInteger(sI); in math3_2() 272 return math3_1(sa, sb, sc, sI, name); \ 293 return math3_2(sa, sb, sc, sI, sJ, name); \ in DEFMATH3_1() 384 i_1 = asInteger(sI); 412 i_1 = asInteger(sI); in math4_2() [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/lib/poems/ |
H A D | onfunctions.cpp | 63 void OnPopulateSI(Mat3x3& inertia, double mass, Mat6x6& sI){ in OnPopulateSI() argument 65 sI(4,4)=mass; sI(5,5)=mass; sI(6,6)=mass; in OnPopulateSI() 66 sI(1,1)=inertia(1,1); sI(1,2)=inertia(1,2); sI(1,3)=inertia(1,3); in OnPopulateSI() 67 sI(2,1)=inertia(2,1); sI(2,2)=inertia(2,2); sI(2,3)=inertia(2,3); in OnPopulateSI() 68 sI(3,1)=inertia(3,1); sI(3,2)=inertia(3,2); sI(3,3)=inertia(3,3); in OnPopulateSI()
|
/dports/science/liggghts/LIGGGHTS-PUBLIC-3.8.0-26-g6e873439/lib/poems/ |
H A D | onfunctions.cpp | 63 void OnPopulateSI(Mat3x3& inertia, double mass, Mat6x6& sI){ in OnPopulateSI() argument 65 sI(4,4)=mass; sI(5,5)=mass; sI(6,6)=mass; in OnPopulateSI() 66 sI(1,1)=inertia(1,1); sI(1,2)=inertia(1,2); sI(1,3)=inertia(1,3); in OnPopulateSI() 67 sI(2,1)=inertia(2,1); sI(2,2)=inertia(2,2); sI(2,3)=inertia(2,3); in OnPopulateSI() 68 sI(3,1)=inertia(3,1); sI(3,2)=inertia(3,2); sI(3,3)=inertia(3,3); in OnPopulateSI()
|
/dports/math/blasfeo/blasfeo-0.1.2/examples/ |
H A D | example_d_lu_factorization.c | 140 struct blasfeo_dmat sI; in main() local 142 blasfeo_create_dmat(n, n, &sI, ptr_memory_strmat); in main() 143 ptr_memory_strmat += sI.memsize; in main() 173 blasfeo_pack_dmat(n, n, I, n, &sI, 0, 0); in main() 175 blasfeo_print_dmat(n, n, &sI, 0, 0); in main() 177 blasfeo_drowpe(n, ipiv, &sI); in main() 179 blasfeo_print_dmat(n, n, &sI, 0, 0); in main() 191 blasfeo_pack_tran_dmat(n, n, I, n, &sI, 0, 0); in main() 193 blasfeo_print_dmat(n, n, &sI, 0, 0); in main() 211 blasfeo_pack_dmat(n, n, I, n, &sI, 0, 0); in main() [all …]
|
H A D | example_s_lu_factorization.c | 140 struct blasfeo_smat sI; in main() local 142 blasfeo_create_smat(n, n, &sI, ptr_memory_strmat); in main() 143 ptr_memory_strmat += sI.memsize; in main() 168 blasfeo_pack_smat(n, n, I, n, &sI, 0, 0); in main() 170 blasfeo_print_smat(n, n, &sI, 0, 0); in main() 172 blasfeo_srowpe(n, ipiv, &sI); in main() 174 blasfeo_print_smat(n, n, &sI, 0, 0); in main() 176 blasfeo_strsm_llnu(n, n, 1.0, &sLU, 0, 0, &sI, 0, 0, &sD, 0, 0); in main() 186 blasfeo_pack_tran_smat(n, n, I, n, &sI, 0, 0); in main() 188 blasfeo_print_smat(n, n, &sI, 0, 0); in main()
|
/dports/lang/purescript/purescript-0.14.5/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/ |
H A D | KarpRabin.hs | 174 go !h sI = 177 if sI == maxIdx 183 !prev = S.drop (sI + 1) str 187 else go (rehash h (strAt sI) (strAt (sI + hLen))) (sI + 1) 189 let !rst = S.drop sI str 190 !rLen = strLen - sI 192 hd = strAt sI 195 if sI == maxIdx 204 else go (rehash h hd (strAt (sI + hLen))) (sI + 1) 214 past !prior rest !prev !pI !str !sI !hsh [all …]
|
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/ |
H A D | KarpRabin.hs | 174 go !h sI = 177 if sI == maxIdx 183 !prev = S.drop (sI + 1) str 187 else go (rehash h (strAt sI) (strAt (sI + hLen))) (sI + 1) 189 let !rst = S.drop sI str 190 !rLen = strLen - sI 192 hd = strAt sI 195 if sI == maxIdx 204 else go (rehash h hd (strAt (sI + hLen))) (sI + 1) 214 past !prior rest !prev !pI !str !sI !hsh [all …]
|
/dports/textproc/cgrep/cgrep-6.6.32/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/ |
H A D | KarpRabin.hs | 174 go !h sI = 177 if sI == maxIdx 183 !prev = S.drop (sI + 1) str 187 else go (rehash h (strAt sI) (strAt (sI + hLen))) (sI + 1) 189 let !rst = S.drop sI str 190 !rLen = strLen - sI 192 hd = strAt sI 195 if sI == maxIdx 204 else go (rehash h hd (strAt (sI + hLen))) (sI + 1) 214 past !prior rest !prev !pI !str !sI !hsh [all …]
|
/dports/math/z3/z3-z3-4.8.13/src/test/ |
H A D | model_evaluator.cpp | 16 sort* sI = a.mk_int(); in tst_model_evaluator() local 18 sort* dom[2] = { sI, m.mk_bool_sort() }; in tst_model_evaluator() 19 func_decl_ref f(m.mk_func_decl(symbol("f"), 2, dom, sI), m); in tst_model_evaluator() 20 func_decl_ref g(m.mk_func_decl(symbol("g"), 2, dom, sI), m); in tst_model_evaluator() 21 func_decl_ref h(m.mk_func_decl(symbol("h"), 2, dom, sI), m); in tst_model_evaluator() 22 func_decl_ref F(m.mk_func_decl(symbol("F"), 2, dom, sI), m); in tst_model_evaluator() 23 func_decl_ref G(m.mk_func_decl(symbol("G"), 2, dom, sI), m); in tst_model_evaluator() 24 expr_ref vI0(m.mk_var(0, sI), m); in tst_model_evaluator() 25 expr_ref vI1(m.mk_var(1, sI), m); in tst_model_evaluator() 50 …fi->set_else(m.mk_ite(m.mk_exists(1, &sI, &nI, a.mk_le(vI0p, m.mk_app(F, vI1p, vB2p))), vI0p, a.mk… in tst_model_evaluator() [all …]
|
/dports/math/py-z3-solver/z3-z3-4.8.10/src/test/ |
H A D | model_evaluator.cpp | 16 sort* sI = a.mk_int(); in tst_model_evaluator() local 18 sort* dom[2] = { sI, m.mk_bool_sort() }; in tst_model_evaluator() 19 func_decl_ref f(m.mk_func_decl(symbol("f"), 2, dom, sI), m); in tst_model_evaluator() 20 func_decl_ref g(m.mk_func_decl(symbol("g"), 2, dom, sI), m); in tst_model_evaluator() 21 func_decl_ref h(m.mk_func_decl(symbol("h"), 2, dom, sI), m); in tst_model_evaluator() 22 func_decl_ref F(m.mk_func_decl(symbol("F"), 2, dom, sI), m); in tst_model_evaluator() 23 func_decl_ref G(m.mk_func_decl(symbol("G"), 2, dom, sI), m); in tst_model_evaluator() 24 expr_ref vI0(m.mk_var(0, sI), m); in tst_model_evaluator() 25 expr_ref vI1(m.mk_var(1, sI), m); in tst_model_evaluator() 50 …fi->set_else(m.mk_ite(m.mk_exists(1, &sI, &nI, a.mk_le(vI0p, m.mk_app(F, vI1p, vB2p))), vI0p, a.mk… in tst_model_evaluator() [all …]
|
/dports/graphics/hugin/hugin-2020.0.0/src/hugin_base/vigra_ext/ |
H A D | ImageTransformsGPU.cpp | 981 for (vector<Rect2D>::iterator sI = sourceChunks.begin(); sI != sourceChunks.end(); ++sI) { in transformImageGPUIntern() local 1032 glTexCoord2f(sI->width(), 0.0); glVertex2f(sI->width(), 0.0); in transformImageGPUIntern() 1033 … glTexCoord2f(sI->width(), sI->height()); glVertex2f(sI->width(), sI->height()); in transformImageGPUIntern() 1034 … glTexCoord2f(0.0, sI->height()); glVertex2f(0.0, sI->height()); in transformImageGPUIntern() 1083 …iTexCoord2f(GL_TEXTURE0, sI->width(), 0.0); glMultiTexCoord2f(GL_TEXTURE1, sI->width(), … in transformImageGPUIntern() 1084 …ord2f(GL_TEXTURE0, sI->width(), sI->height()); glMultiTexCoord2f(GL_TEXTURE1, sI->width(), sI->he… in transformImageGPUIntern() 1109 glTexCoord2f(sI->width(), 0.0); glVertex2f(sI->width(), 0.0); in transformImageGPUIntern() 1110 … glTexCoord2f(sI->width(), sI->height()); glVertex2f(sI->width(), sI->height()); in transformImageGPUIntern() 1111 … glTexCoord2f(0.0, sI->height()); glVertex2f(0.0, sI->height()); in transformImageGPUIntern() 1143 glUniform2fARB(srcULParam, sI->left(), sI->top()); in transformImageGPUIntern() [all …]
|
/dports/lang/purescript/purescript-0.14.5/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Search/ |
H A D | KarpRabin.hs | 157 go !sI !h = 160 if sI == maxIdx 162 else go (sI + 1) (rehash h (strAt sI) (strAt (sI + hLen))) 164 let !rst = S.drop sI str 166 hd = strAt sI 168 more = if sI == maxIdx then [] else 169 go (sI + 1) (rehash h hd (strAt (sI + hLen))) 175 (sI,qs) : more
|
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Search/ |
H A D | KarpRabin.hs | 157 go !sI !h = 160 if sI == maxIdx 162 else go (sI + 1) (rehash h (strAt sI) (strAt (sI + hLen))) 164 let !rst = S.drop sI str 166 hd = strAt sI 168 more = if sI == maxIdx then [] else 169 go (sI + 1) (rehash h hd (strAt (sI + hLen))) 175 (sI,qs) : more
|
/dports/textproc/cgrep/cgrep-6.6.32/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Search/ |
H A D | KarpRabin.hs | 157 go !sI !h = 160 if sI == maxIdx 162 else go (sI + 1) (rehash h (strAt sI) (strAt (sI + hLen))) 164 let !rst = S.drop sI str 166 hd = strAt sI 168 more = if sI == maxIdx then [] else 169 go (sI + 1) (rehash h hd (strAt (sI + hLen))) 175 (sI,qs) : more
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/mlir/lib/Analysis/ |
H A D | PresburgerSet.cpp | 192 FlatAffineConstraints sI = s.getFlatAffineConstraints(i); in subtractRecursively() local 198 sI.getNumLocalIds()); in subtractRecursively() 199 sI.getLocalReprLbUbPairs(repr); in subtractRecursively() 203 b.mergeLocalIds(sI); in subtractRecursively() 213 b.addInequality(sI.getInequality(maybePair->first)); in subtractRecursively() 214 b.addInequality(sI.getInequality(maybePair->second)); in subtractRecursively() 228 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively() 243 2 * sI.getNumEqualities() + sI.getNumInequalities(); in subtractRecursively() 288 processInequality(sI.getInequality(j)); in subtractRecursively() 291 offset = sI.getNumInequalities(); in subtractRecursively() [all …]
|
/dports/lang/purescript/purescript-0.14.5/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/Internal/ |
H A D | BoyerMoore.hs | 483 | strEnd < sI = seek prior past str future (sI - patEnd) patEnd 485 case strAt sI of 487 if sI < patEnd 652 checkEnd !sI 653 | strEnd < sI = seek past str future (sI - patEnd) patEnd 655 case strAt sI of 657 if sI < patEnd 658 then (if sI == 0 868 checkEnd !sI 869 | strEnd < sI = seek past str fut (sI - patEnd) patEnd [all …]
|
/dports/devel/hs-spago/spago-0.20.3/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/Internal/ |
H A D | BoyerMoore.hs | 483 | strEnd < sI = seek prior past str future (sI - patEnd) patEnd 485 case strAt sI of 487 if sI < patEnd 652 checkEnd !sI 653 | strEnd < sI = seek past str future (sI - patEnd) patEnd 655 case strAt sI of 657 if sI < patEnd 658 then (if sI == 0 868 checkEnd !sI 869 | strEnd < sI = seek past str fut (sI - patEnd) patEnd [all …]
|
/dports/textproc/cgrep/cgrep-6.6.32/_cabal_deps/stringsearch-0.3.6.6/Data/ByteString/Lazy/Search/Internal/ |
H A D | BoyerMoore.hs | 483 | strEnd < sI = seek prior past str future (sI - patEnd) patEnd 485 case strAt sI of 487 if sI < patEnd 652 checkEnd !sI 653 | strEnd < sI = seek past str future (sI - patEnd) patEnd 655 case strAt sI of 657 if sI < patEnd 658 then (if sI == 0 868 checkEnd !sI 869 | strEnd < sI = seek past str fut (sI - patEnd) patEnd [all …]
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
H A D | PresburgerSet.cpp | 172 const FlatAffineConstraints &sI = s.getFlatAffineConstraints(i); in subtractRecursively() local 173 assert(sI.getNumLocalIds() == 0 && in subtractRecursively() 177 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively() 188 for (unsigned j = 0; j < 2 * sI.getNumEqualities() + sI.getNumInequalities(); in subtractRecursively() 224 for (unsigned j = 0, e = sI.getNumInequalities(); j < e; j++) { in subtractRecursively() 227 processInequality(sI.getInequality(j)); in subtractRecursively() 230 offset = sI.getNumInequalities(); in subtractRecursively() 231 for (unsigned j = 0, e = sI.getNumEqualities(); j < e; ++j) { in subtractRecursively() 232 const ArrayRef<int64_t> &coeffs = sI.getEquality(j); in subtractRecursively()
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
H A D | PresburgerSet.cpp | 172 const FlatAffineConstraints &sI = s.getFlatAffineConstraints(i); in subtractRecursively() local 173 assert(sI.getNumLocalIds() == 0 && in subtractRecursively() 177 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively() 188 for (unsigned j = 0; j < 2 * sI.getNumEqualities() + sI.getNumInequalities(); in subtractRecursively() 224 for (unsigned j = 0, e = sI.getNumInequalities(); j < e; j++) { in subtractRecursively() 227 processInequality(sI.getInequality(j)); in subtractRecursively() 230 offset = sI.getNumInequalities(); in subtractRecursively() 231 for (unsigned j = 0, e = sI.getNumEqualities(); j < e; ++j) { in subtractRecursively() 232 const ArrayRef<int64_t> &coeffs = sI.getEquality(j); in subtractRecursively()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/mlir/lib/Analysis/ |
H A D | PresburgerSet.cpp | 172 const FlatAffineConstraints &sI = s.getFlatAffineConstraints(i); in subtractRecursively() local 173 assert(sI.getNumLocalIds() == 0 && in subtractRecursively() 177 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively() 188 for (unsigned j = 0; j < 2 * sI.getNumEqualities() + sI.getNumInequalities(); in subtractRecursively() 224 for (unsigned j = 0, e = sI.getNumInequalities(); j < e; j++) { in subtractRecursively() 227 processInequality(sI.getInequality(j)); in subtractRecursively() 230 offset = sI.getNumInequalities(); in subtractRecursively() 231 for (unsigned j = 0, e = sI.getNumEqualities(); j < e; ++j) { in subtractRecursively() 232 const ArrayRef<int64_t> &coeffs = sI.getEquality(j); in subtractRecursively()
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/mlir/lib/Analysis/ |
H A D | PresburgerSet.cpp | 172 const FlatAffineConstraints &sI = s.getFlatAffineConstraints(i); in subtractRecursively() local 175 simplex.intersectFlatAffineConstraints(sI); in subtractRecursively() 186 for (unsigned j = 0; j < 2 * sI.getNumEqualities() + sI.getNumInequalities(); in subtractRecursively() 222 for (unsigned j = 0, e = sI.getNumInequalities(); j < e; j++) { in subtractRecursively() 225 processInequality(sI.getInequality(j)); in subtractRecursively() 228 offset = sI.getNumInequalities(); in subtractRecursively() 229 for (unsigned j = 0, e = sI.getNumEqualities(); j < e; ++j) { in subtractRecursively() 230 const ArrayRef<int64_t> &coeffs = sI.getEquality(j); in subtractRecursively()
|