Home
last modified time | relevance | path

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

12345678910>>...12

/dports/math/fxt/fxt/demo/bits/
H A Dall-dbs-demo.cc24 ulong nn = 1UL<<n; in test_debruijn() local
66 const ulong nn = 1UL<<n, nnh = nn/2; in main() local
69 ulong N = nn-n-2, K = nnh-2; in main() local
/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
153 typedef double K; in mytest() typedef
H A DElement_P1dc1.cpp107 R TypeOfFE_P1ttdc1_::operator( )(const FElement &K, const R2 &P1Hat, const KN_< R > &u, in operator ( )()
129 void TypeOfFE_P1ttdc1_::FB(const bool *whatd, const Mesh &, const Triangle &K, const RdHat &PHat, in FB()
171 void TypeOfFE_P2ttdc1_::FB(const bool *whatd, const Mesh &, const Triangle &K, const RdHat &PHat, in FB()
261 void SetPtPkDC<Mesh3>(R3 *Pt, int kk, int nn, R cc) { // P0 P1 et P2 , P1b in SetPtPkDC()
286 void SetPtPkDC<MeshS>(R2 *Pt, int kk, int nn, R cc) { in SetPtPkDC()
304 void SetPtPkDC<MeshL>(R1 *Pt, int kk, int nn, R cc) { in SetPtPkDC()
399 …fFE_LagrangeDC3d<Mesh3>::FB(const What_d whatd, const Mesh3 &Th, const Mesh3::Element &K,const RdH… in FB() argument
454 …R TypeOfFE_LagrangeDC3d<Mesh3>::operator( )(const FElement &K, const R3 &PHat1, const KN_< R > &u,… in operator ( )() argument
494 …fFE_LagrangeDC3d<MeshS>::FB(const What_d whatd, const MeshS &Th, const MeshS::Element &K,const RdH… in FB() argument
542 …R TypeOfFE_LagrangeDC3d<MeshS>::operator( )(const FElement &K, const R2 &PHat1, const KN_< R > &u,… in operator ( )() argument
[all …]
H A DElement_P4.cpp45 static const int nn[15][4]; member in Fem2D::TypeOfFE_P4Lagrange
78 void Pi_h_alpha(const baseFElement &K, KN_< double > &v) const { in Pi_h_alpha() argument
123 void TypeOfFE_P4Lagrange::FB(const bool *whatd, const Mesh &, const Triangle &K, in FB()
H A Dsplitmesh6.cpp83 Triangle &K = Th[k]; in SplitMesh6() local
92 int nn = 0; in SplitMesh6() local
H A DElement_P3.cpp46 static const int nn[10][3]; member in Fem2D::TypeOfFE_P3Lagrange
77 void Pi_h_alpha(const baseFElement &K, KN_< double > &v) const { in Pi_h_alpha() argument
114 void TypeOfFE_P3Lagrange::FB(const bool *whatd, const Mesh &, const Triangle &K, in FB()
299 void TypeOfFE_P3_3d::set(const Mesh &Th, const Element &K, InterpolationMatrix< RdHat > &M, in set()
324 void TypeOfFE_P3_3d::FB(const What_d whatd, const Mesh &Th, const Mesh3::Element &K, in FB()
/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()
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/science/cgnslib/CGNS-4.1.2/src/tests/
H A Dtest_partial.c35 #define NODE_INDEX(I,J,K) ((I)+NUM_SIDE*(((J)-1)+NUM_SIDE*((K)-1))) argument
36 #define CELL_INDEX(I,J,K) ((I)+(NUM_SIDE-1)*(((J)-1)+(NUM_SIDE-1)*((K)-1))) argument
48 int i, j, k, n, nn, np; in get_parent() local
75 int n, i, j, k, l, nn, nf, np; in main() local
H A Dtest_ver31.c34 #define NODE_INDEX(I,J,K) ((I)+NUM_SIDE*(((J)-1)+NUM_SIDE*((K)-1))) argument
35 #define CELL_INDEX(I,J,K) ((I)+(NUM_SIDE-1)*(((J)-1)+(NUM_SIDE-1)*((K)-1))) argument
111 int n, i, j, k, nn, nf, np; in init_data() local
263 int k, nn, n, nij, koff, cgcoord; in write_coords() local
H A Dwrite_test.c47 #define NODE_INDEX(I,J,K) ((I)+NUM_SIDE*(((J)-1)+NUM_SIDE*((K)-1))) argument
48 #define CELL_INDEX(I,J,K) ((I)+(NUM_SIDE-1)*(((J)-1)+(NUM_SIDE-1)*((K)-1))) argument
115 int n, i, j, k, nn, nf, np; in init_data() local
454 int k, nn, n, nij, koff, cgcoord; in write_coords() local
H A Dwrite_rind.c31 #define INDEX(I,J,K) (int)((I) + NUM_I * ((J) + NUM_J * (K))) argument
64 int n, nn, i, j, k, ni, nj, nk; in main() local
/dports/math/dsdp/DSDP5.8/src/solver/
H A Ddsdpcone.c22 int DSDPConeSetUp(DSDPCone K,DSDPVec y){ in DSDPConeSetUp()
43 int DSDPConeSetUp2(DSDPCone K, DSDPVec yy0, DSDPSchurMat M){ in DSDPConeSetUp2()
64 int DSDPConeDestroy(DSDPCone *K){ in DSDPConeDestroy()
168 int DSDPConeANorm2( DSDPCone K , DSDPVec anorm2){ in DSDPConeANorm2()
265 int DSDPConeInvertS(DSDPCone K){ in DSDPConeInvertS()
312 int DSDPConeGetDimension(DSDPCone K, double *n){ in DSDPConeGetDimension()
314 double nn=0; in DSDPConeGetDimension() local
358 int DSDPConeView(DSDPCone K){ in DSDPConeView()
380 int DSDPConeMonitor(DSDPCone K, int tag){ in DSDPConeMonitor()
427 int DSDPGetConeName(DSDPCone K, char *cname, int maxlength){ in DSDPGetConeName()
[all …]
/dports/math/casadi/casadi-3.5.5/external_packages/DSDP/src/solver/
H A Ddsdpcone.c22 int DSDPConeSetUp(DSDPCone K,DSDPVec y){ in DSDPConeSetUp()
43 int DSDPConeSetUp2(DSDPCone K, DSDPVec yy0, DSDPSchurMat M){ in DSDPConeSetUp2()
64 int DSDPConeDestroy(DSDPCone *K){ in DSDPConeDestroy()
168 int DSDPConeANorm2( DSDPCone K , DSDPVec anorm2){ in DSDPConeANorm2()
265 int DSDPConeInvertS(DSDPCone K){ in DSDPConeInvertS()
312 int DSDPConeGetDimension(DSDPCone K, double *n){ in DSDPConeGetDimension()
314 double nn=0; in DSDPConeGetDimension() local
358 int DSDPConeView(DSDPCone K){ in DSDPConeView()
380 int DSDPConeMonitor(DSDPCone K, int tag){ in DSDPConeMonitor()
427 int DSDPGetConeName(DSDPCone K, char *cname, int maxlength){ in DSDPGetConeName()
[all …]
/dports/math/R-cran-lava/lava/R/
H A Dcluster.hook.R7 K <- length(uclust) functionVar
46 nn <- c("Estimate","Robust SE", "Naive SE", "P-value") vector
H A Deffects.R78 K <- length(idx.list[[i]]) functionVar
107 nn <- c("total","direct","indirect") vector
149 nn <- indirectef <- c() functionVar
150 K <- seq_len(length(object$margef)) functionVar
/dports/math/nfft/nfft-3.5.2/examples/nfft/
H A Dflags.c72 int r, NN[d], nn[d]; in time_accuracy() local
215 static void accuracy_pre_lin_psi(int d, int N, int M, int n, int m, int K) in accuracy_pre_lin_psi()
217 int r, NN[d], nn[d]; in accuracy_pre_lin_psi() local
/dports/math/openblas/OpenBLAS-0.3.18/kernel/x86_64/
H A Dsgemm_small_kernel_tt_skylakex.c194 int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, FLOAT * A, BLASLONG lda, FLOAT alpha, FLOAT * B, BLAS… in CNAME()
244 int nn = 16; in CNAME() local
294 int nn = 16; in CNAME() local
350 int nn = 16; in CNAME() local
397 int nn = 16; in CNAME() local
H A Ddgemm_small_kernel_tt_skylakex.c168 int CNAME(BLASLONG M, BLASLONG N, BLASLONG K, FLOAT * A, BLASLONG lda, FLOAT alpha, FLOAT * B, BLAS… in CNAME()
215 int nn = 8; in CNAME() local
272 int nn = 8; in CNAME() local
328 int nn = 8; in CNAME() local
375 int nn = 8; in CNAME() local
H A Ddgemm_kernel_4x8_skylakex_2.c77 #define INNER_KERNELm1(nn) \ argument
84 #define INNER_KERNELm2(nn) \ argument
91 #define INNER_KERNELm4(nn) \ argument
99 #define INNER_KERNELm8(nn) \ argument
421 int64_t K = (int64_t)k; int64_t M = (int64_t)m; in KERNEL_MAIN() local
/dports/math/libxsmm/libxsmm-1.16.3/samples/xgemm/
H A Dxgemm.c38 # define XGEMM(TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC) \ argument
42 # define XGEMM(TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC) \ argument
51 # define XGEMM_GOLD(TRANSA, TRANSB, M, N, K, ALPHA, A, LDA, B, LDB, BETA, C, LDC) \ in LIBXSMM_BLAS_SYMBOL_DECL() argument
61 LIBXSMM_BLAS_CONST libxsmm_blasint n = (2 < argc ? atoi(argv[2]) : k), nn = n; in LIBXSMM_BLAS_SYMBOL_DECL() local
/dports/math/faiss/faiss-1.7.1/faiss/impl/
H A DNNDescent.cpp106 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/cgal/CGAL-5.3/include/CGAL/
H A Dvcm_estimate_normals.h70 const K & /*kernel*/) ///< geometric traits. in vcm_offset()
112 const K &) in vcm_convolve()
132 std::vector<Tree_point> nn; in vcm_convolve() local
163 const K &) in vcm_convolve()
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A DFESpace-v0.cpp20 int n=0,nn=0; in Make() local
58 int p0=0,i0=0,N0=0,nn=0; in Makepij_alpha() local
172 virtual void Pi_h_alpha(const baseFElement & K,KN_<double> & v) const in Pi_h_alpha() argument
199 virtual void Pi_h_alpha(const baseFElement & K,KN_<double> & v) const in Pi_h_alpha() argument
215 KN<int> nn(teb.NbNode); in FEProduitConstruct() local
279 KN<int> w(7),nn(7); in FESumConstruct() local
490 int nn=0; in Make() local
624 int K,e; in Make() local
958 …void TypeOfFESum::FB(const bool * whatd,const Mesh & Th,const Triangle & K,const R2 & P,RNMK_ & va… in FB() argument
1123 void TypeOfFE_P1Bubble::FB(const bool *whatd,const Mesh & ,const Triangle & K,const R2 & P,RNMK_ & … in FB() argument
[all …]
/dports/science/R-cran-fastICA/fastICA/src/
H A Dica.c89 size_t iwork_size, ilwork, nn = *n, pp = *p, mm; in svd_JM() local
170 int M, K, N; in mmult_JM() local
536 calc_K_JM(double *x, int *n, int *p, double *K) in calc_K_JM()
540 size_t nn = *n, pp = *p; in calc_K_JM() local
590 size_t nn = *n, ee = *e; in calc_A_JM() local
634 icainc_JM (double *data_matrix, double *w_matrix, int *nn, int *pp, int *ee, in icainc_JM()
/dports/math/gretl/gretl-2021d/lib/src/
H A Dkalman.c213 void kalman_free (kalman *K) in kalman_free()
884 kalman *K; in kalman_new() local
942 kalman *K; in kalman_new_minimal() local
2906 int nn = (K->n * K->n + K->n) / 2; in kalman_arma_smooth() local
3020 int nr, nn; in kalman_smooth() local
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
4303 kalman *K = kptr; in print_kalman_bundle_info() local
4368 kalman *K = kptr; in kalman_serialize() local
[all …]

12345678910>>...12