Home
last modified time | relevance | path

Searched refs:ncols (Results 1 – 25 of 5261) sorted by relevance

12345678910>>...211

/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/VNL/src/vxl/core/vnl/
H A Dvnl_matrix_fixed.hxx204 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>
237 vnl_vector_fixed<T,ncols>
241 vnl_vector_fixed<T,ncols> v; in apply_columnwise()
421 if (column_index >= ncols) in scale_column()
462 if (column + n > ncols) in get_n_columns()
493 if (column_index >= ncols) in get_column()
531 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal()
[all …]
H A Dvnl_matrix_fixed_ref.hxx72 vnl_matrix_fixed<T,nrows,ncols>
75 vnl_matrix_fixed<T,nrows,ncols> ret; in apply()
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()
258 if (column_index >= ncols) in scale_column()
285 if (column + n > ncols) in get_n_columns()
300 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal()
[all …]
/dports/misc/vxl/vxl-3.3.2/core/vnl/
H A Dvnl_matrix_fixed_ref.hxx23 vnl_matrix_fixed_ref<T,nrows,ncols> const&
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()
258 if (column_index >= ncols) in scale_column()
285 if (column + n > ncols) in get_n_columns()
300 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal()
[all …]
H A Dvnl_matrix_fixed.hxx204 vnl_matrix_fixed<T,nrows,ncols>
205 vnl_matrix_fixed<T,nrows,ncols>
214 vnl_matrix_fixed<T,nrows,ncols>
237 vnl_vector_fixed<T,ncols>
241 vnl_vector_fixed<T,ncols> v; in apply_columnwise()
292 vnl_matrix_fixed<T,nrows,ncols>::update (vnl_matrix_fixed<T,nrows,ncols> const& m, in update()
439 if (column_index >= ncols) in scale_column()
480 if (column + n > ncols) in get_n_columns()
511 if (column_index >= ncols) in get_column()
549 vnl_vector<T> v(nrows < ncols ? nrows : ncols); in get_diagonal()
[all …]
/dports/x11-toolkits/gtk40/gtk-4.4.1/demos/gtk-demo/
H A Dsingular_value_decomposition.c118 pui = U + ncols * (ncols - 2); in householder_reduction()
119 pvi = V + ncols * (ncols - 1); in householder_reduction()
123 for (i = ncols - 2, ip1 = ncols - 1; in householder_reduction()
125 i--, pui -= ncols, pvi -= ncols, ip1--) in householder_reduction()
130 for (j = ip1; j < ncols; j++, pv += ncols) in householder_reduction()
135 for (k = ip1, pv = pvi + ncols; k < ncols; k++, pv += ncols) in householder_reduction()
137 for (k = ip1, pv = pvi + ncols; k < ncols; k++, pv += ncols) in householder_reduction()
142 for (j = ip1; j < ncols; j++, pv += ncols) in householder_reduction()
151 pui = U + ncols * (ncols - 1); in householder_reduction()
152 for (i = ncols - 1, ip1 = ncols; in householder_reduction()
[all …]
/dports/science/wxmacmolplt/wxmacmolplt-7.7-43-g9a46f7a/src/
H A DGeometries.cpp58 this->ncols = ncols; in Init()
202 *in = Matrix2D(ncols, ncols); in SVD()
234 s += a[k * ncols + i] * a[k * ncols + i]; in SVD()
265 s += a[i * ncols + k] * a[i * ncols + k]; in SVD()
300 v[j * ncols + i] = (a[i * ncols + j] / a[i * ncols + l]) / g; in SVD()
312 v[i * ncols + j] = v[j * ncols + i] = 0.0f; in SVD()
333 s += a[k * ncols + i] * a[k * ncols + j]; in SVD()
337 a[k * ncols + j] += f * a[k * ncols + i]; in SVD()
394 v[j * ncols + k] = -v[j * ncols + k]; in SVD()
479 w[i * ncols + i] = w[i_max * ncols + i_max]; in SVD()
[all …]
/dports/math/R-cran-matrixStats/matrixStats/src/
H A DrowRanksWithTies.c54 R_xlen_t nrows, ncols; in rowRanksWithTies() local
56 R_xlen_t *ccols = validateIndices(cols, ncol, 0, &ncols); 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/databases/grass7/grass-7.8.6/raster/r.basins.fill/
H A Dmain.c41 int nrows, ncols; in main() local
88 ncols = Rast_window_cols(); in main()
101 for (col = 0; col < ncols; col++) in main()
103 drain[row * ncols + col] = 0; in main()
109 if (drain[row * ncols + col] == 0 && in main()
110 ridge[row * ncols + col] == 0) { in main()
113 drain[row * ncols + col] = in main()
114 drain[(row - 1) * ncols + col]; in main()
117 drain[row * ncols + col] = in main()
130 drain[row * ncols + col] = in main()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_linalg/
H A Dmatrix_util.c80 outmat->ncols = 1; in v2m()
84 outmat->ncols = nVals; in v2m()
109 outmat->ncols = nVals; in diagv2m()
142 m->ncols = a->ncols + b->ncols; in horizcat()
149 memmove(m->vals + ii * m->ncols, a->vals + ii * a->ncols, a->ncols * siz); in horizcat()
150 memmove(m->vals + ii * m->ncols + a->ncols, b->vals + ii * b->ncols, b->ncols * siz); in horizcat()
174 m->ncols = 0; in block_diag()
178 m->ncols += mats[ii]->ncols; in block_diag()
193 cols = cols + mats[ii]->ncols; in block_diag()
238 m->ncols = ncols; in mat_ones()
[all …]
/dports/graphics/art/ART-1.9.3/rtengine/klt/
H A Dpnmio.cc49 int *ncols, int *nrows, in pnmReadHeader() argument
65 *ncols = atoi(line); in pnmReadHeader()
68 if (*ncols < 0 || *nrows < 0 || *ncols > 10000 || *nrows > 10000) { in pnmReadHeader()
91 int *ncols, int *nrows, in pgmReadHeader() argument
181 int *ncols, int *nrows) in pgmRead() argument
206 tmpptr += *ncols; in pgmRead()
251 int ncols, in pgmWrite() argument
264 img += ncols; in pgmWrite()
276 int ncols, in pgmWriteFile() argument
304 int ncols, in ppmWrite() argument
[all …]
/dports/graphics/rawtherapee/rawtherapee-5.8/rtengine/klt/
H A Dpnmio.cc49 int *ncols, int *nrows, in pnmReadHeader() argument
65 *ncols = atoi(line); in pnmReadHeader()
68 if (*ncols < 0 || *nrows < 0 || *ncols > 10000 || *nrows > 10000) { in pnmReadHeader()
91 int *ncols, int *nrows, in pgmReadHeader() argument
181 int *ncols, int *nrows) in pgmRead() argument
206 tmpptr += *ncols; in pgmRead()
251 int ncols, in pgmWrite() argument
264 img += ncols; in pgmWrite()
276 int ncols, in pgmWriteFile() argument
304 int ncols, in ppmWrite() argument
[all …]
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/tests/linalg/bwc/
H A Dshort_matmul.c46 ncols /= sizeof(uint64_t); in short_matmul_binary()
52 nrows = ncols; in short_matmul_binary()
53 ncols += ncols / 10; in short_matmul_binary()
64 if (l < ncols) { in short_matmul_binary()
119 if (x >= ncols) { in short_matmul_binary()
121 for( ; x >= ncols ; ncols += ncols / 10); in short_matmul_binary()
155 ncols /= coeffsize; in short_matmul_prime()
161 nrows = ncols; in short_matmul_prime()
162 ncols += ncols / 10; in short_matmul_prime()
179 if (l < ncols) { in short_matmul_prime()
[all …]
/dports/math/R-cran-raster/raster/R/
H A DreadRasterBrick.R16 endcol <- min(object@ncols, startcol+ncols-1)
17 ncols <- endcol - startcol + 1
22 if (c==1 & ncols==raster@ncols ) {
29 ncells <- nrows*ncols
32 offset <- raster@file@offset + (b-1) * raster@ncols * raster@nrows + (r-1) * raster@ncols
38 nc <- nrows*ncols
42 … offset <- raster@file@offset + (b-1) * raster@ncols * raster@nrows + (r-1) * raster@ncols + (c-1)
55 if (c==1 & ncols==raster@ncols ) {
86 if (c==1 & ncols==raster@ncols ) {
97 nc <- ncols*raster@data@nlayers
[all …]
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/linalg/bwc/
H A Dcleanup.cpp26 unsigned int ncols = 0; in main() local
43 blockmatrix S(ncols, ncols); in main()
44 blockmatrix ST(ncols, ncols); in main()
45 blockmatrix T(ncols, ncols); in main()
47 uint64_t * kzone = (uint64_t *) malloc(FLAT_BYTES_WITH_READAHEAD(ncols, ncols)); in main()
70 blockmatrix k(nrows, ncols); in main()
71 blockmatrix kprev(nrows, ncols); in main()
74 blockmatrix kS(nrows, ncols); in main()
77 int prevrank = ncols; in main()
103 ncols, in main()
[all …]
H A Dlingen_mat_types.hpp101 : nrows(nrows), ncols(ncols), x(mynew<unsigned long>(ncols*stride())) in bmat()
118 ncols = a.ncols; in operator =()
125 podswap(ncols, a.ncols); in swap()
222 : nrows(nrows), ncols(ncols), ncoef(ncoef) in polmat()
242 podswap(ncols,n.ncols); in swap()
250 ncols=n.ncols; in copy()
260 ncols = E.ncols; in set_mod_xi()
625 : nrows(nrows), ncols(ncols), po(&o), in tpolmat()
658 podswap(ncols,n.ncols); in swap()
784 ASSERT(s1.ncols == s2.ncols); in add()
[all …]
/dports/math/ggobi/ggobi-2.1.11/src/
H A Dvarchange.c38 for (j = d->ncols; j < d->ncols + ncols; j++) { in addvar_vartable_expand()
53 tour_realloc_up (d, d->ncols); in addvar_pipeline_realloc()
130 gint d_ncols_prev = d->ncols; in newvar_add_with_values()
139 d->ncols += 1; in newvar_add_with_values()
196 gint d_ncols_prev = d->ncols; in clone_vars()
209 d->ncols += ncols; in clone_vars()
213 for (k = 0; k < ncols; k++) { in clone_vars()
280 if (ncols >= d->ncols) in delete_vars()
300 keepers = g_malloc ((d->ncols - ncols) * sizeof (gint)); in delete_vars()
301 nkeepers = find_keepers (d->ncols, ncols, cols, keepers); in delete_vars()
[all …]
/dports/lang/mosml/mosml-ver-2.10.1/src/mosmllib/test/
H A Darray2.sml39 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/shells/ast-ksh/ast-ksh93v/src/lib/libvcodex/Vcama/
H A Dvcamadiff.c71 hdsz = vcsizeu(ncols);
78 { if((sz = (size/ncols)*ncols) > 0)
80 pd = dt; df += ncols; dt += ncols;
98 ncols = GETSIZE(dt);
102 pd = rcdt[ncols]; rcdt[ncols] = dt+SIZE;
121 ncols = 0;
136 vcioputu(&io, ncols);
176 if(ncols > 0)
177 { if(sz%ncols != 0)
180 for(pd = dt, df += ncols, dt += ncols; dt < enddt; )
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/C3/src/lib_clinalg/
H A Ddiffusion.c60 size_t width = r * A->ncols * F->ncols; in dmrg_diffusion_midleft()
101 assert (A->ncols == F->ncols); in dmrg_diffusion_lastleft()
149 size_t ms = r * A->ncols * F->ncols; in dmrg_diffusion_midright()
156 mat1[kk + jj*F->ncols + ii * A->ncols*F->ncols] = in dmrg_diffusion_midright()
157 mat[kk + jj*F->ncols + ii * (2*A->ncols*F->ncols)]; in dmrg_diffusion_midright()
158 mat2[kk + jj*F->ncols + ii * A->ncols*F->ncols] = in dmrg_diffusion_midright()
159 mat[kk + (jj+A->ncols)*F->ncols + ii * (2*A->ncols*F->ncols)]; in dmrg_diffusion_midright()
226 mat1[kk + jj*F->ncols + ii * A->ncols*F->ncols] = in dmrg_diffusion_firstright()
227 mat[kk + jj*F->ncols + ii * (2*A->ncols*F->ncols)]; in dmrg_diffusion_firstright()
228 mat2[kk + jj*F->ncols + ii * A->ncols*F->ncols] = in dmrg_diffusion_firstright()
[all …]
H A Dqmarray.c97 qm->ncols = ncols; in qmarray_alloc()
954 size_t ncols = b->ncols; in qmatqma_integrate() local
1679 assert (x->ncols == y->ncols ); in qmarray_axpy()
2892 size_t ncols = A->ncols; in qmarray_householder_simple() local
3015 svd(A->ncols, A->ncols, A->ncols, R, u,lam,vt); in qmarray_svd()
3055 size_t rank = truncated_svd(A->ncols, A->ncols, A->ncols, in qmarray_truncated_svd()
3155 assert (a->ncols == b->ncols); in qmarray_stackv()
3767 size_t ncols = A->ncols; in qmarray_qr() local
3941 size_t ncols = A->ncols; in qmarray_lq() local
4064 size_t ncols = A->ncols; in qmarray_qr_gs() local
[all …]
/dports/science/jdftx/jdftx-1.6.0/jdftx/electronic/
H A DColumnBundleOperators.cu25 void reducedL_kernel(int nbasis, int ncols, const complex* Y, complex* LY, in reducedL_kernel() argument
28 if(j<nbasis) reducedL_calc(j, nbasis, ncols, Y, LY, GGT, iGarr, k, detR); in reducedL_kernel()
30 void reducedL_gpu(int nbasis, int ncols, const complex* Y, complex* LY, in reducedL_gpu() argument
43 void reducedLinv_gpu(int nbasis, int ncols, const complex* Y, complex* LinvY, in reducedLinv_gpu() argument
54 if(j<nbasis) reducedLstress_calc(j, nbasis, ncols, Y, F, iGarr, k, result); in reducedLstress_kernel()
65 void precond_inv_kinetic_kernel(int nbasis, int ncols, complex* Y, in precond_inv_kinetic_kernel() argument
70 void precond_inv_kinetic_gpu(int nbasis, int ncols, complex* Y, in precond_inv_kinetic_gpu() argument
93 if(j<nbasis) translate_calc(j, nbasis, ncols, Y, iGarr, k, dr); in translate_kernel()
104 if(j<nbasis) translateColumns_calc(j, nbasis, ncols, Y, iGarr, k, dr); in translateColumns_kernel()
117 if(j<nbasis) reducedD_calc(j, nbasis, ncols, Y, DY, iGarr, kdotGe, Ge); in reducedD_kernel()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.jconsole/share/classes/sun/tools/jconsole/
H A DVariableGridLayout.java68 int ncols = getColumns(); in layoutContainer() local
75 nrows = (ncomponents + ncols - 1) / ncols; in layoutContainer()
91 if (row * ncols + col < nComps) { in layoutContainer()
99 if (row * ncols + col < nComps) { in layoutContainer()
141 fills = new boolean[ncols]; in layoutContainer()
145 for (int col = 0; col < ncols; col++) { in layoutContainer()
149 if (row * ncols + col < nComps) { in layoutContainer()
157 if (row * ncols + col < nComps) { in layoutContainer()
201 int ncols = getColumns(); in preferredLayoutSize() local
208 nrows = (ncomponents + ncols - 1) / ncols; in preferredLayoutSize()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.jconsole/share/classes/sun/tools/jconsole/
H A DVariableGridLayout.java68 int ncols = getColumns(); in layoutContainer() local
75 nrows = (ncomponents + ncols - 1) / ncols; in layoutContainer()
91 if (row * ncols + col < nComps) { in layoutContainer()
99 if (row * ncols + col < nComps) { in layoutContainer()
141 fills = new boolean[ncols]; in layoutContainer()
145 for (int col = 0; col < ncols; col++) { in layoutContainer()
149 if (row * ncols + col < nComps) { in layoutContainer()
157 if (row * ncols + col < nComps) { in layoutContainer()
201 int ncols = getColumns(); in preferredLayoutSize() local
208 nrows = (ncomponents + ncols - 1) / ncols; in preferredLayoutSize()
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/sun/tools/jconsole/
H A DVariableGridLayout.java68 int ncols = getColumns(); in layoutContainer() local
75 nrows = (ncomponents + ncols - 1) / ncols; in layoutContainer()
91 if (row * ncols + col < nComps) { in layoutContainer()
99 if (row * ncols + col < nComps) { in layoutContainer()
141 fills = new boolean[ncols]; in layoutContainer()
145 for (int col = 0; col < ncols; col++) { in layoutContainer()
149 if (row * ncols + col < nComps) { in layoutContainer()
157 if (row * ncols + col < nComps) { in layoutContainer()
201 int ncols = getColumns(); in preferredLayoutSize() local
208 nrows = (ncomponents + ncols - 1) / ncols; in preferredLayoutSize()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.jconsole/share/classes/sun/tools/jconsole/
H A DVariableGridLayout.java68 int ncols = getColumns(); in layoutContainer() local
75 nrows = (ncomponents + ncols - 1) / ncols; in layoutContainer()
91 if (row * ncols + col < nComps) { in layoutContainer()
99 if (row * ncols + col < nComps) { in layoutContainer()
141 fills = new boolean[ncols]; in layoutContainer()
145 for (int col = 0; col < ncols; col++) { in layoutContainer()
149 if (row * ncols + col < nComps) { in layoutContainer()
157 if (row * ncols + col < nComps) { in layoutContainer()
201 int ncols = getColumns(); in preferredLayoutSize() local
208 nrows = (ncomponents + ncols - 1) / ncols; in preferredLayoutSize()
[all …]

12345678910>>...211