/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/ |
H A D | vnl_matrix_fixed.hxx | 204 vnl_matrix_fixed<T,nrows,ncols> 205 vnl_matrix_fixed<T,nrows,ncols> 214 vnl_matrix_fixed<T,nrows,ncols> 215 vnl_matrix_fixed<T,nrows,ncols> 225 vnl_vector_fixed<T,nrows> 229 vnl_vector_fixed<T,nrows> v; in apply_rowwise() 408 if (row_index >= nrows) in scale_row() 449 if (row + n > nrows) in get_n_rows() 478 if (row_index >= nrows) in get_row() 531 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal() [all …]
|
H A D | vnl_matrix_fixed_ref.hxx | 72 vnl_matrix_fixed<T,nrows,ncols> 81 vnl_matrix_fixed<T,nrows,ncols> 93 vnl_matrix_fixed<T,ncols,nrows> 104 vnl_matrix_fixed<T,ncols,nrows> 158 unsigned int i = nrows * ncols; in copy_in() 168 unsigned int i = nrows*ncols; in copy_out() 245 if (row_index >= nrows) in scale_row() 272 if (row + n > nrows) in get_n_rows() 300 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal() 384 if (nrows != m.rows() || in set_columns() [all …]
|
/dports/misc/vxl/vxl-3.3.2/core/vnl/ |
H A D | vnl_matrix_fixed_ref.hxx | 72 vnl_matrix_fixed<T,nrows,ncols> 81 vnl_matrix_fixed<T,nrows,ncols> 93 vnl_matrix_fixed<T,ncols,nrows> 104 vnl_matrix_fixed<T,ncols,nrows> 158 unsigned int i = nrows * ncols; in copy_in() 168 unsigned int i = nrows*ncols; in copy_out() 245 if (row_index >= nrows) in scale_row() 272 if (row + n > nrows) in get_n_rows() 300 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal() 384 if (nrows != m.rows() || in set_columns() [all …]
|
H A D | vnl_matrix_fixed.hxx | 204 vnl_matrix_fixed<T,nrows,ncols> 205 vnl_matrix_fixed<T,nrows,ncols> 214 vnl_matrix_fixed<T,nrows,ncols> 225 vnl_vector_fixed<T,nrows> 229 vnl_vector_fixed<T,nrows> v; in apply_rowwise() 292 vnl_matrix_fixed<T,nrows,ncols>::update (vnl_matrix_fixed<T,nrows,ncols> const& m, in update() argument 426 if (row_index >= nrows) in scale_row() 467 if (row + n > nrows) in get_n_rows() 496 if (row_index >= nrows) in get_row() 549 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal() [all …]
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_clinalg/ |
H A D | qmarray.c | 96 qm->nrows = nrows; in qmarray_alloc() 783 size_t nrows = Q->nrows; in qmam() local 978 size_t nrows = a->nrows; in qmaqmat_integrate() local 1065 totrows = a->nrows * b->nrows; in qmarray_kron() 1096 totrows = a->nrows * b->nrows; in qmarray_kron_integrate() 1132 totrows = a->nrows * b->nrows; in qmarray_kron_integrate_weighted() 1678 assert (x->nrows == y->nrows ); in qmarray_axpy() 3766 size_t nrows = A->nrows; in qmarray_qr() local 3940 size_t nrows = A->nrows; in qmarray_lq() local 4063 size_t nrows = A->nrows; in qmarray_qr_gs() local [all …]
|
H A D | diffusion.c | 183 out->funcs[kk + jj*F->nrows + ii*2*A->nrows*F->nrows ] = in dmrg_diffusion_midright() 184 t1[kk + jj*F->nrows + ii*F->nrows*A->nrows]; in dmrg_diffusion_midright() 185 out->funcs[kk + (jj+A->nrows)*F->nrows + ii*2*A->nrows*F->nrows ] = in dmrg_diffusion_midright() 186 t2[kk + jj*F->nrows + ii*F->nrows*A->nrows]; in dmrg_diffusion_midright() 188 t3[kk + jj*F->nrows + ii*F->nrows*A->nrows], in dmrg_diffusion_midright() 189 out->funcs[kk + (jj+A->nrows)*F->nrows + ii*2*A->nrows*F->nrows]); in dmrg_diffusion_midright() 191 t4[kk + jj*F->nrows + ii*F->nrows*A->nrows], in dmrg_diffusion_midright() 192 out->funcs[kk + (jj+A->nrows)*F->nrows + ii*2*A->nrows*F->nrows]); in dmrg_diffusion_midright() 216 assert (A->nrows == F->nrows); in dmrg_diffusion_firstright() 255 t2[kk + jj*F->nrows + ii*F->nrows*A->nrows], in dmrg_diffusion_firstright() [all …]
|
/dports/math/R-cran-raster/raster/R/ |
H A D | getValuesRows.R | 7 function(x, row, nrows) { argument 8 getValues(x, row=row, nrows=1) 13 function(x, row, nrows) { argument 29 function(x, row, nrows) { argument 37 nrows <- round(nrows) 39 stopifnot(nrows > 0) 41 endrow <- max(min(x@nrows, row+nrows-1), row) 42 nrows <- endrow - row + 1 63 function(x, row, nrows) { argument 69 function(x, row, nrows) { argument [all …]
|
H A D | mask.R | 91 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 92 m <- getValues( mask, row=tr$row[i], nrows=tr$nrows[i] ) 99 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 100 m <- getValues( mask, row=tr$row[i], nrows=tr$nrows[i] ) 109 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 117 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 129 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 137 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 148 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) 156 v <- getValues( x, row=tr$row[i], nrows=tr$nrows[i] ) [all …]
|
/dports/math/R-cran-matrixStats/matrixStats/src/ |
H A D | rowRanksWithTies.c | 54 R_xlen_t nrows, ncols; in rowRanksWithTies() local 55 R_xlen_t *crows = validateIndices(rows, nrow, 0, &nrows); in rowRanksWithTies() 69 PROTECT(ans = allocMatrix(REALSXP, nrows, ncols)); in rowRanksWithTies() 80 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 91 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 102 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 115 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 126 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 137 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() 162 PROTECT(ans = allocMatrix(INTSXP, nrows, ncols)); in rowRanksWithTies() [all …]
|
/dports/math/ploticus-nox11/pl240src/src/ |
H A D | proc_tree.c | 145 nrows = 0; in PLP_tree() 154 func[nrows] = '+'; in PLP_tree() 156 xval[nrows] = 0.0; in PLP_tree() 157 yval[nrows] = 0.0; in PLP_tree() 164 func[nrows] = '-'; in PLP_tree() 167 xval[nrows] = 0.0; in PLP_tree() 168 yval[nrows] = 0.0; in PLP_tree() 194 nrows++; in PLP_tree() 213 nrows++; in PLP_tree() 223 nrows++; in PLP_tree() [all …]
|
/dports/math/ploticus/pl240src/src/ |
H A D | proc_tree.c | 145 nrows = 0; in PLP_tree() 154 func[nrows] = '+'; in PLP_tree() 156 xval[nrows] = 0.0; in PLP_tree() 157 yval[nrows] = 0.0; in PLP_tree() 164 func[nrows] = '-'; in PLP_tree() 167 xval[nrows] = 0.0; in PLP_tree() 168 yval[nrows] = 0.0; in PLP_tree() 194 nrows++; in PLP_tree() 213 nrows++; in PLP_tree() 223 nrows++; in PLP_tree() [all …]
|
/dports/devel/libmtdev/mtdev-1.1.6/src/ |
H A D | match.c | 102 for (row = 0; row < nrows; row++) in ixoptimal() 105 mdistEnd = mdist + nrows * ncols; in ixoptimal() 108 if (nrows <= ncols) { in ixoptimal() 109 dmin = nrows; in ixoptimal() 115 mdistTemp += nrows; in ixoptimal() 120 mdistTemp += nrows; in ixoptimal() 128 mdistTemp += nrows; in ixoptimal() 149 mdistTemp = mdist + nrows*col; in ixoptimal() 150 columnEnd = mdistTemp + nrows; in ixoptimal() 161 mdistTemp = mdist + nrows*col; in ixoptimal() [all …]
|
/dports/graphics/art/ART-1.9.3/rtengine/klt/ |
H A D | pnmio.cc | 49 int *ncols, int *nrows, in pnmReadHeader() argument 67 *nrows = atoi(line); in pnmReadHeader() 68 if (*ncols < 0 || *nrows < 0 || *ncols > 10000 || *nrows > 10000) { in pnmReadHeader() 91 int *ncols, int *nrows, in pgmReadHeader() argument 109 int *ncols, int *nrows, in ppmReadHeader() argument 127 int *ncols, int *nrows, in pgmReadHeaderFile() argument 181 int *ncols, int *nrows) in pgmRead() argument 252 int nrows) in pgmWrite() argument 277 int nrows) in pgmWriteFile() argument 305 int nrows) in ppmWrite() argument [all …]
|
/dports/graphics/rawtherapee/rawtherapee-5.8/rtengine/klt/ |
H A D | pnmio.cc | 49 int *ncols, int *nrows, in pnmReadHeader() argument 67 *nrows = atoi(line); in pnmReadHeader() 68 if (*ncols < 0 || *nrows < 0 || *ncols > 10000 || *nrows > 10000) { in pnmReadHeader() 91 int *ncols, int *nrows, in pgmReadHeader() argument 109 int *ncols, int *nrows, in ppmReadHeader() argument 127 int *ncols, int *nrows, in pgmReadHeaderFile() argument 181 int *ncols, int *nrows) in pgmRead() argument 252 int nrows) in pgmWrite() argument 277 int nrows) in pgmWriteFile() argument 305 int nrows) in ppmWrite() argument [all …]
|
/dports/science/hypre/hypre-2.23.0/src/FEI_mv/fei-hypre/ |
H A D | ml_maxwell.cxx | 80 H.createMatricesAndVectors(nrows, 1, nrows); in fei_hypre_test() 83 for (i = 0; i < nrows; i++) in fei_hypre_test() 93 for (i = 0; i < nrows; i++) in fei_hypre_test() 113 G.createMatricesAndVectors(nrows, 1, nrows); in fei_hypre_test() 186 sol = new double[nrows]; in fei_hypre_test() 187 H.getSolution(sol, nrows); in fei_hypre_test() 255 (*N) = nrows; in hypre_read_matrix() 257 printf("matrix has %6d rows and %7d nonzeros\n",nrows,mat_ia[nrows]); in hypre_read_matrix() 283 fscanf(fp, "%d", &nrows); in hypre_read_rhs() 284 rhs = new double[nrows]; in hypre_read_rhs() [all …]
|
/dports/net/mpich/mpich-3.4.3/test/mpi/cxx/rma/ |
H A D | winfencex.cxx | 34 int i, j, nrows = MAX_NROWS, ncols = MAX_NCOLS; in main() local 42 aint = nrows * (ncols + 2) * sizeof(int); in main() 55 for (i = 0; i < nrows; i++) { in main() 57 buf[(ncols + 1) * nrows + i] = -1; in main() 60 for (i = 0; i < nrows; i++) { in main() 61 buf[i + (j + 1) * nrows] = rank * (ncols * nrows) + i + j * nrows; in main() 66 win.Put(&buf[0 + nrows], nrows, MPI::INT, left, ncols + 1, nrows, MPI::INT); in main() 67 win.Put(&buf[0 + ncols * nrows], nrows, MPI::INT, right, 0, nrows, MPI::INT); in main() 72 for (i = 0; i < nrows; i++) { in main() 73 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
H A D | winscale1x.cxx | 34 int i, j, nrows = MAX_NROWS, ncols = MAX_NCOLS; in main() local 44 aint = nrows * (ncols + 2) * sizeof(int); in main() 69 for (i = 0; i < nrows; i++) { in main() 71 buf[(ncols + 1) * nrows + i] = -1; in main() 74 for (i = 0; i < nrows; i++) { in main() 75 buf[i + (j + 1) * nrows] = rank * (ncols * nrows) + i + j * nrows; in main() 83 win.Put(&buf[0 + nrows], nrows, MPI::INT, left, ncols + 1, nrows, MPI::INT); in main() 84 win.Put(&buf[0 + ncols * nrows], nrows, MPI::INT, right, 0, nrows, MPI::INT); in main() 90 for (i = 0; i < nrows; i++) { in main() 91 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
H A D | winscale2x.cxx | 34 int i, j, nrows = MAX_NROWS, ncols = MAX_NCOLS; in main() local 45 aint = nrows * (ncols + 2) * sizeof(int); in main() 70 for (i = 0; i < nrows; i++) { in main() 72 buf[(ncols + 1) * nrows + i] = -1; in main() 75 for (i = 0; i < nrows; i++) { in main() 76 buf[i + (j + 1) * nrows] = rank * (ncols * nrows) + i + j * nrows; in main() 84 win.Put(&buf[0 + nrows], nrows, MPI::INT, left, ncols + 1, nrows, MPI::INT); in main() 85 win.Put(&buf[0 + ncols * nrows], nrows, MPI::INT, right, 0, nrows, MPI::INT); in main() 94 for (i = 0; i < nrows; i++) { in main() 95 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
/dports/net/mpich2/mpich2-1.5/test/mpi/cxx/rma/ |
H A D | winfencex.cxx | 55 for (i=0; i<nrows; i++) { in main() 60 for (i=0; i<nrows; i++) { in main() 61 buf[i + (j+1) * nrows] = in main() 62 rank * (ncols * nrows) + i + j * nrows; in main() 67 win.Put( &buf[0+nrows], nrows, MPI::INT, left, ncols+1, in main() 68 nrows, MPI::INT ); in main() 69 win.Put( &buf[0+ncols*nrows], nrows, MPI::INT, right, 0, in main() 70 nrows, MPI::INT ); in main() 75 for (i=0; i<nrows; i++) { in main() 76 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
H A D | winscale1x.cxx | 69 for (i=0; i<nrows; i++) { in main() 74 for (i=0; i<nrows; i++) { in main() 75 buf[i + (j+1) * nrows] = in main() 76 rank * (ncols * nrows) + i + j * nrows; in main() 84 win.Put( &buf[0+nrows], nrows, MPI::INT, left, ncols+1, in main() 85 nrows, MPI::INT ); in main() 86 win.Put( &buf[0+ncols*nrows], nrows, MPI::INT, right, 0, in main() 87 nrows, MPI::INT ); in main() 93 for (i=0; i<nrows; i++) { in main() 94 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
H A D | winscale2x.cxx | 70 for (i=0; i<nrows; i++) { in main() 75 for (i=0; i<nrows; i++) { in main() 76 buf[i + (j+1) * nrows] = in main() 77 rank * (ncols * nrows) + i + j * nrows; in main() 85 win.Put( &buf[0+nrows], nrows, MPI::INT, left, ncols+1, in main() 86 nrows, MPI::INT ); in main() 87 win.Put( &buf[0+ncols*nrows], nrows, MPI::INT, right, 0, in main() 88 nrows, MPI::INT ); in main() 97 for (i=0; i<nrows; i++) { in main() 98 ans = rank * (ncols * nrows) - nrows + i; in main() [all …]
|
/dports/lang/mosml/mosml-ver-2.10.1/src/mosmllib/test/ |
H A D | array2.sml | 39 nrows=NONE, ncols=NONE}) 102 val src = { base=a2, row=row, col=col, nrows=nrows, ncols=ncols} 154 (copy { src={ base=a1, row=row, col=col, nrows=nrows, ncols=ncols}, 263 {base=a3, row=row, col=col, nrows=nrows, ncols=ncols}; 272 chkmodifyi { row=0, col=0, nrows=NONE, ncols=NONE } 276 chkmodifyi { row=0, col=1, nrows=NONE, ncols=NONE } 280 chkmodifyi { row=1, col=0, nrows=NONE, ncols=NONE } 284 chkmodifyi { row=1, col=1, nrows=NONE, ncols=NONE } 332 { base=a3, row=row, col=col, nrows=nrows, ncols=ncols} 408 fun faili { row, col, nrows, ncols } = [all …]
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/tests/linalg/bblas/ |
H A D | test_gauss.c | 33 for (i = 0; i < nrows; ++i) { in printMatrix() 35 if (i < nrows - 1) in printMatrix() 51 nrows = ncols = 0; in main() 58 if (nrows == 0) { in main() 59 nrows = ncols = u; in main() 71 if (nrows == 0) nrows = ncols = 163; in main() 74 limbs_per_col = iceildiv(nrows, ULONG_BITS); in main() 78 for (i = 0; i < nrows; ++i) in main() 84 mpn_random(mat, limbs_per_row*nrows); in main() 98 printMatrix(s,nrows,nrows,limbs_per_col); in main() [all …]
|
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/DataManip/MetricMatrixCalc/Wrap/ |
H A D | rdMetricMatrixCalc.cpp | 72 npy_intp dMatLen = nrows * (nrows - 1) / 2; in getEuclideanDistMat() 97 for (i = 0; i < nrows; i++) { in getEuclideanDistMat() 115 for (i = 0; i < nrows; i++) { in getEuclideanDistMat() 130 for (i = 0; i < nrows; i++) { in getEuclideanDistMat() 152 unsigned int nrows = in getEuclideanDistMat() local 156 npy_intp dMatLen = nrows * (nrows - 1) / 2; in getEuclideanDistMat() 163 dData.reserve(nrows); in getEuclideanDistMat() 188 CHECK_INVARIANT(nrows > 1, ""); in getTanimotoDistMat() 200 npy_intp dMatLen = nrows * (nrows - 1) / 2; in getTanimotoDistMat() 223 CHECK_INVARIANT(nrows > 1, ""); in getTanimotoSimMat() [all …]
|
/dports/devel/py-qutip/qutip-4.6.2/qutip/cy/ |
H A D | brtools.pyx | 138 cdef int lrwork = 24*nrows, liwork = 10*nrows 198 eival, vl, &nrows, vr, &nrows, 362 nrows, nrows, nrows, nrows, 0, 0) 364 nrows, nrows, nrows, nrows, 2, 0) 384 nrows, nrows, nrows, nrows, 0, 0) 386 nrows, nrows, nrows, nrows, 2, 0) 400 nrows, nrows, nrows, nrows, 0, 2) 402 nrows, nrows, nrows, nrows, 0, 0) 648 coo.nrows = nrows**2 709 fdense2D_to_CSR(Z, evecs, nrows, nrows) [all …]
|