| /dports/math/onednn/oneDNN-2.5.1/src/gpu/jit/gemm/ |
| H A D | gemm_walk_orders.hpp | 78 for (bool nslice : {groups_m > groups_n, groups_m <= groups_n}) { in gemm_linear_order_args()
79 double s = nslice ? sn : sm; in gemm_linear_order_args()
85 int gc = nslice ? groups_n : groups_m; in gemm_linear_order_args()
86 int gco = nslice ? groups_m : groups_n; in gemm_linear_order_args()
110 if (nslice) slice *= -1; in gemm_linear_order_args()
118 bool nslice = (groups_m > groups_n); in gemm_linear_order_args() local
119 double s = nslice ? sn : sm; in gemm_linear_order_args()
120 int gc = nslice ? groups_n : groups_m; in gemm_linear_order_args()
|
| /dports/science/py-pymol/pymol-open-source-2.4.0/contrib/uiuc/plugins/molfile_plugin/src/ |
| H A D | spiderplugin.cpp | 56 int nslice; member
120 vol->nslice = (h.fbuf[0] < 0) ? -h.fbuf[0] : h.fbuf[0]; in open_spider_read()
123 total = vol->nslice * vol->nrow * vol->nsam; in open_spider_read()
128 vol->nslice <= 0 || vol->nslice > 100000) { in open_spider_read()
136 vol->nslice = (h.fbuf[0] < 0) ? -h.fbuf[0] : h.fbuf[0]; in open_spider_read()
139 total = vol->nslice * vol->nrow * vol->nsam; in open_spider_read()
145 vol->nslice <= 0 || vol->nslice > 100000) { in open_spider_read()
178 printf("spider nslice: %d\n", vol->nslice); in open_spider_read()
212 vol->vol[0].zsize = vol->nslice; in open_spider_read()
|
| /dports/math/faiss/faiss-1.7.1/benchs/distributed_ondisk/ |
| H A D | run_on_cluster.bash | 184 nslice=200
186 for((i=0;i<nslice;i++)); do
187 i0=$((nvec * i / nslice))
188 i1=$((nvec * (i + 1) / nslice))
218 nslice=50
220 for((i=0;i<nslice;i++)); do
221 i0=$((nlist * i / nslice))
222 i1=$((nlist * (i + 1) / nslice))
|
| /dports/science/teem/teem-1.11.0-src/src/nrrd/ |
| H A D | superset.c | 34 nrrdSplice(Nrrd *nout, const Nrrd *nin, const Nrrd *nslice, in nrrdSplice() argument
46 if (!(nin && nout && nslice)) { in nrrdSplice()
50 if (nout == nslice) { in nrrdSplice()
69 if (nrrdCheck(nslice) || nrrdCheck(nin)) { in nrrdSplice()
73 if (!( nin->dim-1 == nslice->dim )) { in nrrdSplice()
78 if (!( nin->type == nslice->type )) { in nrrdSplice()
80 me, airEnumStr(nrrdType, nslice->type), in nrrdSplice()
85 if (!( nin->blockSize == nslice->blockSize )) { in nrrdSplice()
92 for (ai=0; ai<nslice->dim; ai++) { in nrrdSplice()
125 dest = (char *)nslice->data; in nrrdSplice()
[all …]
|
| H A D | subset.c | 391 Nrrd *nline, *nslice; in nrrdSliceSelect() local
450 nslice = nrrdNew(); in nrrdSliceSelect()
451 airMopAdd(mop, nslice, (airMopper)nrrdNix, airMopAlways); in nrrdSliceSelect()
482 nslice->dim = nin->dim-1; in nrrdSliceSelect()
483 nslice->type = nin->type; in nrrdSliceSelect()
490 nslice->axis[bb].size = nin->axis[aa].size; in nrrdSliceSelect()
524 nslice->data = above; in nrrdSliceSelect()
525 if (nrrdSlice(nslice, nin, saxi, II)) { in nrrdSliceSelect()
534 nslice->data = below; in nrrdSliceSelect()
535 if (nrrdSlice(nslice, nin, saxi, II)) { in nrrdSliceSelect()
|
| /dports/devel/py-tables/tables-3.6.1/tables/ |
| H A D | index.py | 1290 def update_caches(self, nslice, ssorted): argument
1298 tmp.bounds[nslice] = ssorted[cs::cs]
1300 tmp.abounds[nslice * ncs:(nslice + 1) * ncs] = ssorted[0::cs]
1301 tmp.zbounds[nslice * ncs:(nslice + 1) * ncs] = ssorted[cs - 1::cs]
1304 tmp.mbounds[nslice * ncs:(nslice + 1) * ncs] = smedian
1501 if nslice < self.nslices:
1511 if nslice < self.nslices:
2024 for nslice in range(self.nrows):
2025 start = starts[nslice]
2026 stop = stops[nslice]
[all …]
|
| /dports/science/sparta/sparta-20Oct2021/tools/ |
| H A D | jagged3d.py | 28 def gentris(p1,p2,p3,nslice): argument
29 for j in range(nslice):
33 x = p2[0] + (j+0.0)/nslice * (p3[0]-p2[0])
34 y = p2[1] + (j+0.0)/nslice * (p3[1]-p2[1])
35 z = p2[2] + (j+0.0)/nslice * (p3[2]-p2[2])
40 x = p2[0] + (j+1.0)/nslice * (p3[0]-p2[0])
41 y = p2[1] + (j+1.0)/nslice * (p3[1]-p2[1])
42 z = p2[2] + (j+1.0)/nslice * (p3[2]-p2[2])
43 if j == nslice-1: p5 = p3
|
| /dports/science/py-gpaw/gpaw-21.6.0/gpaw/ |
| H A D | band_descriptor.py | 114 nslice = slice(band_rank, None, nstride)
116 nslice = slice(self.beg, self.end)
117 return nslice
121 nslice = self.get_slice(band_rank)
122 return np.arange(*nslice.indices(self.nbands))
128 nslice = self.get_slice(band_rank)
129 rank_n[nslice] = band_rank
|
| /dports/math/faiss/faiss-1.7.1/tests/ |
| H A D | test_transfer_invlists.cpp | 46 int nslice = 3; in test_index_type() local
97 for (int sl = 0; sl < nslice; sl++) { in test_index_type()
104 long i0 = sl * nlist / nslice; in test_index_type()
105 long i1 = (sl + 1) * nlist / nslice; in test_index_type()
|
| /dports/biology/freebayes/freebayes-1.3.5/contrib/htslib/cram/ |
| H A D | cram_index.c | 76 for (i = 0; i < e->nslice; i++) {
268 idx->nslice = idx->nalloc = 0; in cram_index_load()
278 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
288 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
289 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
326 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
407 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
438 while (i+1 < from->nslice && in cram_index_query()
462 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
478 int nslices = first->nslice; in cram_index_query_last()
[all …]
|
| /dports/biology/py-pysam/pysam-0.18.0/htslib/cram/ |
| H A D | cram_index.c | 76 for (i = 0; i < e->nslice; i++) {
268 idx->nslice = idx->nalloc = 0; in cram_index_load()
278 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
288 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
289 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
326 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
407 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
438 while (i+1 < from->nslice && in cram_index_query()
462 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
478 int nslices = first->nslice; in cram_index_query_last()
[all …]
|
| /dports/biology/htslib/htslib-1.14/cram/ |
| H A D | cram_index.c | 76 for (i = 0; i < e->nslice; i++) {
268 idx->nslice = idx->nalloc = 0; in cram_index_load()
278 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
288 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
289 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
326 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
407 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
438 while (i+1 < from->nslice && in cram_index_query()
462 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
478 int nslices = first->nslice; in cram_index_query_last()
[all …]
|
| /dports/science/teem/teem-1.11.0-src/src/unrrdu/ |
| H A D | splice.c | 37 Nrrd *nin, *nout, *nslice; in unrrdu_spliceMain() local
51 hestOptAdd(&opt, "s,slice", "nslice", airTypeOther, 1, 1, &(nslice), NULL, in unrrdu_spliceMain()
77 if (nrrdSplice(nout, nin, nslice, axis, pos)) { in unrrdu_spliceMain()
|
| /dports/biology/stacks/stacks-2.4/htslib/cram/ |
| H A D | cram_index.c | 74 for (i = 0; i < e->nslice; i++) {
258 idx->nslice = idx->nalloc = 0; in cram_index_load()
268 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
278 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
279 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
316 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
396 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
427 while (i+1 < from->nslice && in cram_index_query()
451 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
|
| /dports/biology/iolib/io_lib-io_lib-1-14-10/io_lib/ |
| H A D | cram_index.c | 84 for (i = 0; i < e->nslice; i++) {
167 idx->nslice = idx->nalloc = 0; in cram_index_load_private()
177 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load_private()
182 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load_private()
183 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load_private()
283 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
335 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
366 while (i+1 < from->nslice && in cram_index_query()
|
| /dports/biology/kallisto/kallisto-0.46.1/ext/htslib/cram/ |
| H A D | cram_index.c | 74 for (i = 0; i < e->nslice; i++) {
258 idx->nslice = idx->nalloc = 0; in cram_index_load()
268 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
278 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
279 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
316 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
368 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
399 while (i+1 < from->nslice && in cram_index_query()
|
| /dports/biology/vt/vt-0.57721/lib/htslib/cram/ |
| H A D | cram_index.c | 74 for (i = 0; i < e->nslice; i++) {
258 idx->nslice = idx->nalloc = 0; in cram_index_load()
268 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
278 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
279 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
316 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
396 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
427 while (i+1 < from->nslice && in cram_index_query()
451 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
|
| /dports/biology/bedtools/bedtools2-2.30.0/src/utils/htslib/cram/ |
| H A D | cram_index.c | 74 for (i = 0; i < e->nslice; i++) {
258 idx->nslice = idx->nalloc = 0; in cram_index_load()
268 if (idx->nslice+1 >= idx->nalloc) { in cram_index_load()
278 e.nalloc = e.nslice = 0; e.e = NULL; in cram_index_load()
279 *(ep = &idx->e[idx->nslice++]) = e; in cram_index_load()
316 for (i = 0; i < e->nslice; i++) { in cram_index_free_recurse()
396 i = 0, j = fd->index[refid+1].nslice-1; in cram_index_query()
427 while (i+1 < from->nslice && in cram_index_query()
451 slice = fd->index[refid+1].nslice - 1; in cram_index_last()
|
| /dports/science/gromacs/gromacs-2021.4/src/gromacs/gmxana/ |
| H A D | gmx_order.cpp | 87 int nslice, in find_nearest_neighbours() argument
103 snew(sl_count, nslice); in find_nearest_neighbours()
244 % nslice; in find_nearest_neighbours()
253 for (i = 0; (i < nslice); i++) in find_nearest_neighbours()
278 int nslice, in calc_tetra_order_parm() argument
302 snew(sg_slice, nslice); in calc_tetra_order_parm()
303 snew(sk_slice, nslice); in calc_tetra_order_parm()
304 snew(sg_slice_tot, nslice); in calc_tetra_order_parm()
305 snew(sk_slice_tot, nslice); in calc_tetra_order_parm()
333 for (i = 0; (i < nslice); i++) in calc_tetra_order_parm()
[all …]
|
| /dports/science/minc2/minc-release-2.2.00/conversion/scxtominc/ |
| H A D | scx_file.c | 116 long file_type, nslice, spos; in scx_open() local
157 if (scx_get_mnem(file, SCX_NCS, 0, &nslice, NULL, NULL) || (nslice<=0)) { in scx_open()
162 for (i=0; i<nslice; i++) { in scx_open()
164 (spos<0) || (spos>nslice)) { in scx_open()
|
| /dports/www/grafana8/grafana-8.3.6/vendor/go.opentelemetry.io/collector/config/internal/configsource/ |
| H A D | manager.go | 303 nslice := make([]interface{}, 0, len(v))
309 nslice = append(nslice, value)
311 return nslice, nil
|
| /dports/misc/mxnet/incubator-mxnet-1.9.0/example/named_entity_recognition/src/ |
| H A D | iterators.py | 51 nslice = 0
60 nslice += 1
67 …print("Warning, {0} sentences sliced to largest bucket size.".format(nslice)) if nslice > 0 else N…
|
| /dports/misc/py-mxnet/incubator-mxnet-1.9.0/example/named_entity_recognition/src/ |
| H A D | iterators.py | 51 nslice = 0
60 nslice += 1
67 …print("Warning, {0} sentences sliced to largest bucket size.".format(nslice)) if nslice > 0 else N…
|
| /dports/graphics/urt/urt-3.1b1_12/get/qcr/ |
| H A D | qcr.c | 303 set_up_qcr(x_size,y_size,nslice,offset) in set_up_qcr() argument
304 int x_size, y_size, nslice, offset; in set_up_qcr()
339 sizes[6] = (char) (nslice >> 8) & 0xff;
340 sizes[7] = (char) nslice;
|
| /dports/math/PDL/PDL-2.019/Basic/SourceFilter/ |
| H A D | Changes | 15 - nslice updates (indexing with multidim piddles)
38 - declare nslice lvalue sub if perl version >= 5.6.0
|