Home
last modified time | relevance | path

Searched +defs:K +defs:nn +defs:s (Results 1 – 25 of 213) sorted by relevance

123456789

/dports/math/freefem++/FreeFem-sources-4.6/plugin/seq/
H A DfuncTemplate.cpp49 int nn = A->N( ); // get number of nodes in CppModTemplate3() local
64 int nn = A->N( ); // get number of nodes in CppModTemplate4() local
79 int nn = A->N( ); // get number of nodes in CppModTemplate5() local
94 int nn = A->N( ); // get number of nodes in CppModTemplate6() local
110 int nn = A->N( ); // get number of nodes in CppModTemplate7() local
127 int nn = A->N( ); // get number of nodes in CppModTemplate8() local
140 double funcs3(Stack s, const double &a, const double &b, const double &c) { return a + b + c; } in funcs3()
142 double funcs2(Stack s, const double &a, const double &b) { return a + b; } in funcs2()
144 double funcs1(Stack s, const double &a) { return a; } in funcs1()
153 typedef double K; in mytest() typedef
/dports/math/glpk/glpk-5.0/examples/tsp/
H A Dmincut.c51 int min_cut(int nn, int ne, const int beg[/*1+ne*/], in min_cut()
115 int min_st_cut(int nn, int ne, const int beg[/*1+ne*/], in min_st_cut()
116 const int end[/*1+ne*/], const int cap[/*1+ne*/], int s, int t, in min_st_cut()
224 int min_cut_sw(int nn, int ne, const int beg[/*1+ne*/], in min_cut_sw()
227 int I, J, K, S, T, DEG, NV, NE, *HEAD, *NEXT, *NUMB, *BEG, *END, in min_cut_sw() local
/dports/math/faiss/faiss-1.7.1/faiss/impl/
H A DNNDescent.cpp25 Nhood::Nhood(int l, int s, std::mt19937& rng, int N) { in Nhood()
106 int insert_into_pool(Neighbor* addr, int size, Neighbor nn) { in insert_into_pool()
149 NNDescent::NNDescent(const int d, const int K) : K(K), random_seed(2021), d(d) { in NNDescent()
191 auto& nn = graph[n]; in update() local
223 auto& nn = node.pool[l]; in update() local
461 Neighbor nn(id, dist, true); in search() local
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/linalg/bwc/mpfq/
H A Dmpfq_u64k3.h197 #define mpfq_u64k3_field_characteristic(K, z) mpz_set_ui(z,2) argument
204 #define mpfq_u64k3_field_clear(K) /**/ argument
233 #define mpfq_u64k3_sub(K, r, s1, s2) mpfq_u64k3_add(K,r,s1,s2) argument
235 #define mpfq_u64k3_neg(K, r, s) mpfq_u64k3_set(K,r,s) argument
257 #define mpfq_u64k3_elt_ur_neg(K, r, s) mpfq_u64k3_elt_ur_set(K,r,s) argument
259 #define mpfq_u64k3_elt_ur_sub(K, r, s1, s2) mpfq_u64k3_elt_ur_add(K,r,s1,s2) argument
322 #define mpfq_u64k3_vec_scan(K, w, n) mpfq_u64k3_vec_fscan(K,stdin,w,n) argument
369 #define mpfq_u64k3_simd_groupsize(K) 192 argument
451 int mpfq_u64k3_inv(mpfq_u64k3_dst_field K MAYBE_UNUSED, mpfq_u64k3_dst_elt r, mpfq_u64k3_src_elt s) in mpfq_u64k3_inv()
577 unsigned int nn = n >> 1; in mpfq_u64k3_vec_rev() local
[all …]
H A Dmpfq_u64k2.h197 #define mpfq_u64k2_field_characteristic(K, z) mpz_set_ui(z,2) argument
204 #define mpfq_u64k2_field_clear(K) /**/ argument
233 #define mpfq_u64k2_sub(K, r, s1, s2) mpfq_u64k2_add(K,r,s1,s2) argument
235 #define mpfq_u64k2_neg(K, r, s) mpfq_u64k2_set(K,r,s) argument
257 #define mpfq_u64k2_elt_ur_neg(K, r, s) mpfq_u64k2_elt_ur_set(K,r,s) argument
259 #define mpfq_u64k2_elt_ur_sub(K, r, s1, s2) mpfq_u64k2_elt_ur_add(K,r,s1,s2) argument
322 #define mpfq_u64k2_vec_scan(K, w, n) mpfq_u64k2_vec_fscan(K,stdin,w,n) argument
369 #define mpfq_u64k2_simd_groupsize(K) 128 argument
451 int mpfq_u64k2_inv(mpfq_u64k2_dst_field K MAYBE_UNUSED, mpfq_u64k2_dst_elt r, mpfq_u64k2_src_elt s) in mpfq_u64k2_inv()
577 unsigned int nn = n >> 1; in mpfq_u64k2_vec_rev() local
[all …]
H A Dmpfq_u64k4.h197 #define mpfq_u64k4_field_characteristic(K, z) mpz_set_ui(z,2) argument
204 #define mpfq_u64k4_field_clear(K) /**/ argument
233 #define mpfq_u64k4_sub(K, r, s1, s2) mpfq_u64k4_add(K,r,s1,s2) argument
235 #define mpfq_u64k4_neg(K, r, s) mpfq_u64k4_set(K,r,s) argument
257 #define mpfq_u64k4_elt_ur_neg(K, r, s) mpfq_u64k4_elt_ur_set(K,r,s) argument
259 #define mpfq_u64k4_elt_ur_sub(K, r, s1, s2) mpfq_u64k4_elt_ur_add(K,r,s1,s2) argument
322 #define mpfq_u64k4_vec_scan(K, w, n) mpfq_u64k4_vec_fscan(K,stdin,w,n) argument
369 #define mpfq_u64k4_simd_groupsize(K) 256 argument
451 int mpfq_u64k4_inv(mpfq_u64k4_dst_field K MAYBE_UNUSED, mpfq_u64k4_dst_elt r, mpfq_u64k4_src_elt s) in mpfq_u64k4_inv()
577 unsigned int nn = n >> 1; in mpfq_u64k4_vec_rev() local
[all …]
H A Dmpfq_u64k1.h197 #define mpfq_u64k1_field_characteristic(K, z) mpz_set_ui(z,2) argument
204 #define mpfq_u64k1_field_clear(K) /**/ argument
233 #define mpfq_u64k1_sub(K, r, s1, s2) mpfq_u64k1_add(K,r,s1,s2) argument
235 #define mpfq_u64k1_neg(K, r, s) mpfq_u64k1_set(K,r,s) argument
257 #define mpfq_u64k1_elt_ur_neg(K, r, s) mpfq_u64k1_elt_ur_set(K,r,s) argument
259 #define mpfq_u64k1_elt_ur_sub(K, r, s1, s2) mpfq_u64k1_elt_ur_add(K,r,s1,s2) argument
322 #define mpfq_u64k1_vec_scan(K, w, n) mpfq_u64k1_vec_fscan(K,stdin,w,n) argument
369 #define mpfq_u64k1_simd_groupsize(K) 64 argument
451 int mpfq_u64k1_inv(mpfq_u64k1_dst_field K MAYBE_UNUSED, mpfq_u64k1_dst_elt r, mpfq_u64k1_src_elt s) in mpfq_u64k1_inv()
577 unsigned int nn = n >> 1; in mpfq_u64k1_vec_rev() local
[all …]
H A Dmpfq_m128.h198 #define mpfq_m128_field_characteristic(K, z) mpz_set_ui(z,2) argument
205 #define mpfq_m128_field_clear(K) /**/ argument
323 #define mpfq_m128_vec_scan(K, w, n) mpfq_m128_vec_fscan(K,stdin,w,n) argument
370 #define mpfq_m128_simd_groupsize(K) 128 argument
398 void mpfq_m128_set(mpfq_m128_dst_field K MAYBE_UNUSED, mpfq_m128_dst_elt r, mpfq_m128_src_elt s) in mpfq_m128_set()
448 void mpfq_m128_neg(mpfq_m128_dst_field K MAYBE_UNUSED, mpfq_m128_dst_elt r, mpfq_m128_src_elt s) in mpfq_m128_neg()
462 int mpfq_m128_inv(mpfq_m128_dst_field K MAYBE_UNUSED, mpfq_m128_dst_elt r, mpfq_m128_src_elt s) in mpfq_m128_inv()
519 …d mpfq_m128_reduce(mpfq_m128_dst_field K MAYBE_UNUSED, mpfq_m128_dst_elt r, mpfq_m128_dst_elt_ur s) in mpfq_m128_reduce()
526 int mpfq_m128_cmp(mpfq_m128_dst_field K MAYBE_UNUSED, mpfq_m128_src_elt r, mpfq_m128_src_elt s) in mpfq_m128_cmp()
591 unsigned int nn = n >> 1; in mpfq_m128_vec_rev() local
[all …]
/dports/multimedia/mjpegtools/mjpegtools-2.1.0/y4mscaler/
H A Dgraphics.C34 ysYCbCr ysYCbCr::parse_string(char *s) in parse_string()
99 void ysRatio::_reduce64(int64_t &nn, int64_t &dd) in _reduce64()
117 int ysRatio::parse_ratio(const char *s) in parse_ratio()
132 int ysRegion::parse_geometry(const char *s) in parse_geometry()
204 int ysRatioRegion::parse_geometry(const char *s) in parse_geometry()
248 enum AnchorMode_t parse_anchor_mode(const char *s) in parse_anchor_mode()
751 ysRatioPoint K = ratio(); in effective_sample_offset() local
759 int ysSubsampling::parse_mode(const char *s) in parse_mode()
833 const char *s = y4m_chroma_description(_mode); in mode_to_string() local
/dports/math/gecode/gecode-0916a1a/examples/
H A Dcrowded-chess.cpp93 Bishops(Bishops& s) : Space(s), n(s.n) { in Bishops() function in __anon774658690111::Bishops
111 while (Bishops* s = e.next()) { in init_bishops() local
188 IntVarArray s; ///< The board member in CrowdedChess
200 K, ///< Knight enumerator
244 const int nn = n*n, q = n, r = n, b = (2*n)-2, in CrowdedChess() local
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A DRNM.hpp304 explicit SubArray(long nn,long sta=0,long s=1): n(nn),step(s),start(sta) {} in SubArray()
321 ShapeOfArray(const ShapeOfArray & s,long nn): n(s.n),step(s.n),next(nn) {} in ShapeOfArray()
324 ShapeOfArray(long nn,long s): n(nn),step(s),next(-1) {} in ShapeOfArray()
326 ShapeOfArray(long nn,long s,long nextt): n(nn),step(s),next(nextt) {} in ShapeOfArray()
354 void init(long nn,long s=1,long nextt=-1) { n=nn; step=s; next=nextt;} in init()
399 typedef R K; // type of data typedef in KN_
585 KN_(R *u,long nn,long s):ShapeOfArray(nn,s),v(u){} in KN_()
586 KN_(R *u,long nn,long s,long nextt):ShapeOfArray(nn,s,nextt),v(u){} in KN_()
641 KNM_(R* u,long nn,long mm,long s) in KNM_()
965 typedef R K; typedef in KN
[all …]
H A DHashMatrix.cpp89 R s=0; in pscal() local
191 I nn,mm,f77, sstate, tstate; in HashMatrix() local
236 HashMatrix<I,R>::HashMatrix(int Half,I nn) in HashMatrix()
282 HashMatrix<I,R>::HashMatrix(I nn,const R *diag) in HashMatrix()
567 I nn= II.N(), mm= JJ.N(); in RenumberingInv() local
751 I nn=A.n,mm=A.m; in Add() local
773 void Addto(HashMatrix<I,R> *P0, const HashMatrix<I,K> *PA,R (*f)(K) ,bool trans, I ii00,I jj00) in Addto()
776 I nn=A.n,mm=A.m; in Addto() local
1125 double s=0; in FrobeniusNorm() local
1135 double s=0; in norm1() local
[all …]
H A DMeshSn.cpp71 const Element & K(this->elements[k]); in GSave() local
202 Element & K(this->elements[k]); in readmsh() local
606 string s; in GRead() local
629 Element & K(this->elements[k]); in GRead() local
663 Element &K=(this->elements)[itt]; in Find() local
688 R s=(a[0]+a[1]+a[2]); in Find() local
691 int na[3],nn=0; in Find() local
745 Element &K =(this->elements)[nopt]; in Find() local
885 const TriangleS &K(elements[i] ); in flipSurfaceMeshS() local
1281 const Element & K(elements[i]); in serialize_withBorderMesh() local
[all …]
/dports/math/R-cran-lava/lava/R/
H A Deffects.R78 K <- length(idx.list[[i]]) functionVar
107 nn <- c("total","direct","indirect") vector
124 s <- summary(x,...) functionVar
149 nn <- indirectef <- c() functionVar
150 K <- seq_len(length(object$margef)) functionVar
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/bamg/
H A DRNM.hpp293 explicit SubArray(long nn,long sta=0,long s=1): n(nn),step(s),start(sta) {} in SubArray()
310 ShapeOfArray(const ShapeOfArray & s,long nn): n(s.n),step(s.n),next(nn) {} in ShapeOfArray()
313 ShapeOfArray(long nn,long s): n(nn),step(s),next(-1) {} in ShapeOfArray()
315 ShapeOfArray(long nn,long s,long nextt): n(nn),step(s),next(nextt) {} in ShapeOfArray()
342 void init(long nn,long s=1,long nextt=-1) { n=nn; step=s; next=nextt;} in init()
439 typedef R K; // type of data typedef in KN_
612 KN_(R *u,long nn,long s):ShapeOfArray(nn,s),v(u){} in KN_()
613 KN_(R *u,long nn,long s,long nextt):ShapeOfArray(nn,s,nextt),v(u){} in KN_()
873 long K() const {return shapek.n;} in K() function in KNMK_
971 typedef R K; typedef in KN
[all …]
/dports/biology/biosig/biosig-2.3.3/biosig4matlab/t400_Classification/
H A Dtrain_sc.m457 K = length(CC.Labels); variable
634 s = sparse(2:sz2+1,1:sz2,r,sz2+1,sz2,2*sz2); variable
684 s = sparse(2:sz2+1,1:sz2,r,sz2+1,sz2,2*sz2); variable
840 nn = ECM0(1,1,1); % number of samples in training set for class k variable
858 nn = ECM(1,1,k);% number of samples in training set for class k variable
/dports/math/gretl/gretl-2021d/lib/src/
H A Dkalman.c884 kalman *K; in kalman_new() local
942 kalman *K; in kalman_new_minimal() local
1559 const char *s; in check_for_matrix_updates() local
2906 int nn = (K->n * K->n + K->n) / 2; in kalman_arma_smooth() local
3020 int nr, nn; in kalman_smooth() local
3921 static int output_matrix_slot (const char *s) in output_matrix_slot()
4054 static int input_matrix_slot (const char *s) in input_matrix_slot()
4087 kalman *K = kptr; in maybe_set_kalman_element() local
4183 kalman *K = kptr; in maybe_delete_kalman_element() local
4223 kalman *K = kptr; in maybe_retrieve_kalman_element() local
[all …]
/dports/math/octave-forge-nan/nan-3.6.1/inst/
H A Dtrain_sc.m463 K = length(CC.Labels); variable
639 s = sparse(2:sz2+1,1:sz2,r,sz2+1,sz2,2*sz2); variable
691 s = sparse(2:sz2+1,1:sz2,r,sz2+1,sz2,2*sz2); variable
847 nn = ECM0(1,1,1); % number of samples in training set for class k variable
870 nn = ECM(1,1,k);% number of samples in training set for class k variable
/dports/math/lcalc/lcalc-1.23/src/
H A DLcommandline_numbertheory.cc110 long long s; in multmodN() local
199 int i,p,s,t; in my_kronecker() local
294 int p,s,t; in my_kronecker() local
356 int nn,mm,ii; in my_kronecker() local
394 int p,s,t,i; in simplified_jacobi() local
428 int p,s,t; in simplified_jacobi() local
715 int K; //number of distinct odd primes dividing q in characters() local
/dports/math/miracl/miracl-5.6/
H A Dake12bna.cpp92 ZZn6 nn,dd; in line() local
132 ECn2 K,T; in cofactor() local
297 char s[HASH_LEN]; in H1() local
328 char s[HASH_LEN]; in H2() local
397 Big a,b,s,ss,p,q,x,y,B,cf,t; in main() local
/dports/math/gmp/gmp-6.2.1/mpz/
H A Dbin_uiui.c214 mp_size_t nn, kn, alloc; in mpz_bdiv_bin_uiui() local
549 #define COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
564 #define SH_COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
582 int s; in limb_apprsqrt() local
622 mp_limb_t s; in mpz_goetgheluck_bin_uiui() local
/dports/math/gap/gap-4.11.0/extern/gmp/mpz/
H A Dbin_uiui.c204 mp_size_t nn, kn, alloc; in mpz_bdiv_bin_uiui() local
535 #define COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
550 #define SH_COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
564 int s; in limb_apprsqrt() local
603 mp_limb_t s; in mpz_goetgheluck_bin_uiui() local
/dports/math/mingw32-libgmp/gmp-6.0.0/mpz/
H A Dbin_uiui.c204 mp_size_t nn, kn, alloc; in mpz_bdiv_bin_uiui() local
535 #define COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
550 #define SH_COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
564 int s; in limb_apprsqrt() local
603 mp_limb_t s; in mpz_goetgheluck_bin_uiui() local
/dports/math/kalker/gmp-mpfr-sys-21966f4bfb56c87d407eb14c72e92ef4e55856aa/gmp-6.2.1-c/mpz/
H A Dbin_uiui.c214 mp_size_t nn, kn, alloc; in mpz_bdiv_bin_uiui() local
549 #define COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
564 #define SH_COUNT_A_PRIME(P, N, K, PR, MAX_PR, VEC, I) \ argument
582 int s; in limb_apprsqrt() local
622 mp_limb_t s; in mpz_goetgheluck_bin_uiui() local
/dports/graphics/gmt/gmt-6.3.0/src/
H A Dgmt_fft.c103 …T, unsigned int n_columns, unsigned int n_rows, unsigned int *f, double *r, size_t *s, double *t) { in gmtlib_fourt_stats()
281 GMT_LOCAL double gmtfft_kx (uint64_t k, struct GMT_FFT_WAVENUMBER *K) { in gmtfft_kx()
292 GMT_LOCAL double gmtfft_ky (uint64_t k, struct GMT_FFT_WAVENUMBER *K) { in gmtfft_ky()
303 GMT_LOCAL double gmtfft_kr (uint64_t k, struct GMT_FFT_WAVENUMBER *K) { in gmtfft_kr()
311 double gmt_fft_get_wave (uint64_t k, struct GMT_FFT_WAVENUMBER *K) { in gmt_fft_get_wave()
320 double gmt_fft_any_wave (uint64_t k, unsigned int mode, struct GMT_FFT_WAVENUMBER *K) { in gmt_fft_any_wave()
332 int gmt_fft_set_wave (struct GMT_CTRL *GMT, unsigned int mode, struct GMT_FFT_WAVENUMBER *K) { in gmt_fft_set_wave()
349 struct GMT_FFT_WAVENUMBER *K = gmtfft_get_fftwave_ptr (v_K); in GMT_FFT_Wavenumber() local
674 GMT_LOCAL int gmtfft_brenner_fourt_f (gmt_grdfloat *data, int *nn, int *ndim, int *ksign, int *ifor… in gmtfft_brenner_fourt_f()
1589 int ksign, ndim = 2, nn[2] = {n_columns, n_rows}, kmode = mode; in gmtfft_2d_brenner() local

123456789