/dports/security/munge/munge-munge-0.5.14/src/common/ |
H A D | rotate.c | 48 unsigned ntotal; in rotate_left() local 54 ntotal = sizeof (*up) * 8; in rotate_left() 55 n %= ntotal; in rotate_left() 59 mask = ~0 << (ntotal - n); in rotate_left() 61 move >>= ntotal - n; in rotate_left() 73 unsigned ntotal; in rotate_right() local 79 ntotal = sizeof (*up) * 8; in rotate_right() 80 n %= ntotal; in rotate_right() 84 mask = ~0 >> (ntotal - n); in rotate_right() 86 move <<= ntotal - n; in rotate_right()
|
/dports/math/faiss/faiss-1.7.1/faiss/ |
H A D | IndexFlat.cpp | 26 ntotal += n; in add() 31 ntotal = 0; in reset() 106 size_t nremove = ntotal - j; in remove_ids() 108 ntotal = j; in remove_ids() 109 xb.resize(ntotal * d); in remove_ids() 134 nb(storage.ntotal), in FlatL2Dis() 162 nb(storage.ntotal), in FlatIPDis() 212 perm.resize(ntotal); in update_permutation() 213 if (ntotal < 1000000) { in update_permutation() 249 idx_t i0 = 0, i1 = ntotal; in search() [all …]
|
H A D | IndexReplicas.cpp | 35 index->ntotal == existing->ntotal, in onAfterAddIndex() 39 existing->ntotal, in onAfterAddIndex() 40 index->ntotal); in onAfterAddIndex() 164 this->ntotal = 0; in syncWithSubIndexes() 172 this->ntotal = firstIndex->ntotal; in syncWithSubIndexes() 179 FAISS_THROW_IF_NOT(this->ntotal == index->ntotal); in syncWithSubIndexes() 188 this->ntotal = 0; in syncWithSubIndexes() 195 this->ntotal = firstIndex->ntotal; in syncWithSubIndexes() 201 FAISS_THROW_IF_NOT(this->ntotal == index->ntotal); in syncWithSubIndexes()
|
H A D | IndexNSG.cpp | 96 VisitedTable vt(ntotal); in search() 133 ntotal = storage->ntotal; in build() 151 !is_built && ntotal == 0, in add() 166 ntotal = storage->ntotal; in add() 167 FAISS_THROW_IF_NOT(ntotal == n); in add() 169 knng.resize(ntotal * (GK + 1)); in add() 177 for (idx_t i = 0; i < ntotal; i++) { in add() 220 ntotal = storage->ntotal; in add() 221 FAISS_THROW_IF_NOT(ntotal == n); in add() 223 knng.resize(ntotal * GK); in add() [all …]
|
H A D | IndexBinaryFlat.cpp | 25 ntotal += n; in add() 30 ntotal = 0; in reset() 57 ntotal, in search() 65 ntotal, in search() 76 for (idx_t i = 0; i < ntotal; i++) { in remove_ids() 88 long nremove = ntotal - j; in remove_ids() 90 ntotal = j; in remove_ids() 91 xb.resize(ntotal * code_size); in remove_ids() 105 hamming_range_search(x, xb.data(), n, ntotal, radius, code_size, result); in range_search()
|
H A D | IndexBinaryFromFloat.cpp | 23 ntotal = index->ntotal; in IndexBinaryFromFloat() 42 ntotal = index->ntotal; in add() 47 ntotal = index->ntotal; in reset() 79 ntotal = index->ntotal; in train()
|
H A D | MetaIndexes.cpp | 61 this->ntotal = 0; in reset() 72 this->ntotal = index->ntotal; in add_with_ids() 127 for (idx_t i = 0; i < this->ntotal; i++) { in remove_ids() 135 FAISS_ASSERT(j == index->ntotal); in remove_ids() 136 this->ntotal = j; in remove_ids() 137 id_map.resize(this->ntotal); in remove_ids() 160 size_t prev_ntotal = this->ntotal; in add_with_ids() 170 for (size_t i = 0; i < this->ntotal; i++) { in construct_rev_map() 220 ntotal = index0->ntotal; in sync_with_sub_indexes() 224 FAISS_THROW_IF_NOT(ntotal == index->ntotal); in sync_with_sub_indexes() [all …]
|
H A D | IndexShards.cpp | 156 this->ntotal = 0; in syncWithSubIndexes() 164 this->ntotal = firstIndex->ntotal; in syncWithSubIndexes() 172 this->ntotal += index->ntotal; in syncWithSubIndexes() 181 this->ntotal = 0; in syncWithSubIndexes() 188 this->ntotal = firstIndex->ntotal; in syncWithSubIndexes() 195 this->ntotal += index->ntotal; in syncWithSubIndexes() 238 this->ntotal == 0, in add_with_ids() 252 aids[i] = this->ntotal + i; in add_with_ids() 327 translations[s + 1] = translations[s] + this->at(s)->ntotal; in search()
|
H A D | IndexBinaryHNSW.cpp | 50 size_t ntotal = n0 + n; in hnsw_add_vertices() local 66 std::vector<omp_lock_t> locks(ntotal); in hnsw_add_vertices() 67 for (int i = 0; i < ntotal; i++) { in hnsw_add_vertices() 120 VisitedTable vt(ntotal); in hnsw_add_vertices() 150 for (int i = 0; i < ntotal; i++) in hnsw_add_vertices() 202 VisitedTable vt(ntotal); in search() 226 int n0 = ntotal; in add() 228 ntotal = storage->ntotal; in add() 230 hnsw_add_vertices(*this, n0, n, x, verbose, hnsw.levels.size() == ntotal); in add() 236 ntotal = 0; in reset()
|
/dports/science/simint/simint-v0.8/examples/ |
H A D | example1.c | 123 int ntotal = 0; in main() local 126 ncomputed = simint_compute_eri(&ss_pair, &ss_pair, 0.0, work, targets+ntotal); in main() 128 ntotal += ncomputed; in main() 130 ncomputed = simint_compute_eri(&ps_pair, &ss_pair, 0.0, work, targets+ntotal); in main() 133 ntotal += ncomputed; in main() 135 ncomputed = simint_compute_eri(&ps_pair, &ps_pair, 0.0, work, targets+ntotal); in main() 138 ntotal += ncomputed; in main() 143 ntotal += ncomputed; in main() 148 ntotal += ncomputed; in main() 153 ntotal += ncomputed; in main() [all …]
|
/dports/math/eclib/eclib-20210318/progs/ |
H A D | checkap.cc | 61 long ntotal = 16*nnf; in main() local 62 int* batch_i = new int[ntotal]; in main() 63 datafile.read((char*)batch_i,ntotal*sizeof(int)); in main() 67 ntotal = naq*nnf; in main() 68 short* batch = new short[ntotal]; in main() 69 datafile.read((char*)batch,ntotal*sizeof(short)); in main() 72 ntotal = nap*nnf; in main() 74 batch = new short[ntotal]; in main() 75 datafile.read((char*)batch,ntotal*sizeof(short)); in main()
|
H A D | aplist.cc | 62 int ntotal = 16*nnf; in main() local 63 int* batch_i = new int[ntotal]; in main() 64 datafile.read((char*)batch_i,ntotal*sizeof(int)); in main() 68 ntotal = naq*nnf; in main() 69 short* batch = new short[ntotal]; in main() 70 datafile.read((char*)batch,ntotal*sizeof(short)); in main() 78 ntotal = 25*nnf; in main() 80 batch = new short[ntotal]; in main() 81 datafile.read((char*)batch,ntotal*sizeof(short)); in main()
|
/dports/science/sparta/sparta-20Oct2021/src/ |
H A D | compute_react_isurf_grid.cpp | 51 ntotal = surf->sr[isr]->nlist; in ComputeReactISurfGrid() 62 for (int i = 0; i < ntotal; i++) in ComputeReactISurfGrid() 77 for (int ireaction = 0; ireaction < ntotal; ireaction++) { in ComputeReactISurfGrid() 93 ntotal = narg - 4; in ComputeReactISurfGrid() 97 size_per_grid_cols = ntotal; in ComputeReactISurfGrid() 252 for (int i = 0; i < ntotal; i++) vec[i] = 0.0; in surf_tally() 264 for (int i = 0; i < ntotal; i++) in surf_tally() 303 for (j = 0; j < ntotal; j++) in post_process_isurf_grid() 309 surf->collate_array_implicit(ntally,ntotal,tally2surf, in post_process_isurf_grid() 320 for (j = 0; j < ntotal; j++) in post_process_isurf_grid() [all …]
|
H A D | compute_react_surf.cpp | 43 ntotal = surf->sr[isr]->nlist; in ComputeReactSurf() 53 memory->create(reaction2col,ntotal,ncol,"react/surf:reaction2col"); in ComputeReactSurf() 54 for (int i = 0; i < ntotal; i++) in ComputeReactSurf() 69 for (int ireaction = 0; ireaction < ntotal; ireaction++) { in ComputeReactSurf() 85 ntotal = narg - 4; in ComputeReactSurf() 89 size_per_surf_cols = ntotal; in ComputeReactSurf() 240 for (int i = 0; i < ntotal; i++) vec[i] = 0.0; in surf_tally() 252 for (int i = 0; i < ntotal; i++) in surf_tally() 283 memory->create(array_surf,maxsurf,ntotal,"react/surf:array_surf"); in post_process_surf() 290 for (j = 0; j < ntotal; j++) in post_process_surf() [all …]
|
H A D | compute_react_boundary.cpp | 41 ntotal = surf->sr[isr]->nlist; in ComputeReactBoundary() 52 memory->create(reaction2col,ntotal,ncol,"react/surf:reaction2col"); in ComputeReactBoundary() 53 for (int i = 0; i < ntotal; i++) in ComputeReactBoundary() 68 for (int ireaction = 0; ireaction < ntotal; ireaction++) { in ComputeReactBoundary() 84 ntotal = narg - 3; in ComputeReactBoundary() 92 size_array_cols = ntotal; in ComputeReactBoundary() 128 MPI_Allreduce(&myarray[0][0],&array[0][0],nrow*ntotal, in compute_array() 142 for (int j = 0; j < ntotal; j++) in clear() 178 for (int i = 0; i < ntotal; i++) in boundary_tally()
|
/dports/databases/beansdb/beansdb-0.7.1.4/src/ |
H A D | item.c | 138 size_t ntotal = item_make_header(nkey + 1, flags, nbytes, suffix, &nsuffix); in item_alloc1() local 140 if (ntotal > settings.item_buf_size) in item_alloc1() 142 it = (item *)try_malloc(ntotal); in item_alloc1() 147 memset(it, 0, ntotal); in item_alloc1() 180 size_t ntotal = 0; in item_free() local 185 ntotal = ITEM_ntotal(it); in item_free() 186 if (ntotal > settings.item_buf_size) in item_free() 190 log_error("ntotal: %"PRIuS", use free() directly.", ntotal); in item_free() 200 … log_error("ntotal: %"PRIuS", add a item buffer to freelist fail, use free() directly.", ntotal); in item_free() 208 log_error("ntotal: %"PRIuS", add a item buffer to freelist.", ntotal); in item_free()
|
/dports/audio/audacity/audacity-Audacity-3.1.3/lib-src/libnyquist/nyquist/nyqsrc/ |
H A D | sndwrite.c | 147 long ntotal; in sound_save() local 202 *duration = ntotal / *sr; in sound_save() 245 long ntotal; in sound_overwrite() local 313 *duration = ntotal / sr; in sound_overwrite() 339 *duration = ntotal / sr; in sound_overwrite() 385 *ntotal = 0; in sound_save_sound() 455 *ntotal += togo; in sound_save_sound() 463 *ntotal, *ntotal / snd->format.srate); in sound_save_sound() 483 *ntotal = 0; in sound_save_array() 621 *ntotal += togo; in sound_save_array() [all …]
|
H A D | sndwritepa.c | 378 int64_t ntotal; in sound_save() local 430 *duration = ntotal / *sr; in sound_save() 463 *duration = ntotal / *sr; in sound_save() 627 *ntotal = 0; in sound_save_sound() 703 *ntotal += togo; in sound_save_sound() 704 if (*ntotal > debug_count) { in sound_save_sound() 711 *ntotal, *ntotal / sound_srate); in sound_save_sound() 732 *ntotal = 0; in sound_save_array() 872 *ntotal += togo; in sound_save_array() 873 if (*ntotal > debug_count) { in sound_save_array() [all …]
|
/dports/math/faiss/faiss-1.7.1/faiss/gpu/ |
H A D | GpuIndexBinaryFlat.cu | 84 (size_t)index->ntotal); in copyFrom() 85 this->ntotal = index->ntotal; in copyFrom() 93 if (index->ntotal > 0) { in copyFrom() 96 index->ntotal, in copyFrom() 105 index->ntotal = this->ntotal; in copyTo() 108 FAISS_ASSERT(data_->getSize() == this->ntotal); in copyTo() 109 index->xb.resize(this->ntotal * (this->d / 8)); in copyTo() 111 if (this->ntotal > 0) { in copyTo() 137 this->ntotal += n; in add() 145 this->ntotal = 0; in reset() [all …]
|
H A D | GpuCloner.cpp | 43 ifl->add(ifl2->ntotal, ifl2->xb.data()); in merge_index() 143 assert(gif->getNumVecs() == index->ntotal); in clone_Index() 154 if (reserveVecs > 0 && ifl->ntotal == 0) { in clone_Index() 177 if (reserveVecs > 0 && ifl->ntotal == 0) { in clone_Index() 188 ipq->ntotal, in clone_Index() 204 if (reserveVecs > 0 && ipq->ntotal == 0) { in clone_Index() 251 long i0 = i * index_ivf->ntotal / n; in copy_ivf_shard() 257 FAISS_ASSERT(idx2->ntotal == i1 - i0); in copy_ivf_shard() 329 if (index->ntotal > 0) { in clone_Index_to_shards() 330 long i0 = index->ntotal * i / n; in clone_Index_to_shards() [all …]
|
/dports/mail/rspamd-devel/rspamd-93430bb/lualib/ |
H A D | lua_meta.lua | 56 local ntotal = 0 81 ntotal = ntotal + 1 84 if ntotal > 0 then 85 njpg = 1.0 * njpg / ntotal 86 npng = 1.0 * npng / ntotal 87 nlarge = 1.0 * nlarge / ntotal 88 nsmall = 1.0 * nsmall / ntotal 164 local ntotal = 0.0 168 ntotal = ntotal + 1.0 185 if ntotal > 0 then [all …]
|
/dports/mail/rspamd/rspamd-3.1/lualib/ |
H A D | lua_meta.lua | 56 local ntotal = 0 81 ntotal = ntotal + 1 84 if ntotal > 0 then 85 njpg = 1.0 * njpg / ntotal 86 npng = 1.0 * npng / ntotal 87 nlarge = 1.0 * nlarge / ntotal 88 nsmall = 1.0 * nsmall / ntotal 164 local ntotal = 0.0 168 ntotal = ntotal + 1.0 185 if ntotal > 0 then [all …]
|
/dports/science/lammps/lammps-stable_29Sep2021/tools/python/ |
H A D | neb_combine.py | 49 ntotal = 0 variable 54 idvec = range(ntotal+1,ntotal+nnew+1) 56 ntotal += nnew 67 idvec = range(ntotal+1,ntotal+nback+1) 70 ntotal += nback 81 d[0].snaps[i].nselect = ntotal
|
/dports/math/R-cran-sspir/sspir/R/ |
H A D | getFamily.R | 18 simY <- function(n,lambda,ntotal,...) rpois(n,family$linkinv(lambda)) argument 22 vtilde <- function(lambda,ntotal,...) exp(-lambda) argument 33 simY <- function(n,lambda,ntotal,...) rbinom(n,ntotal,family$linkinv(lambda)) 37 vtilde <- function(lambda,ntotal,...) { 38 res <- ((1+exp(lambda))^2)/(ntotal*exp(lambda)) 39 res[ntotal==0] <- 1/4
|
/dports/math/faiss/faiss-1.7.1/faiss/impl/ |
H A D | NNDescent.cpp | 150 ntotal = 0; in NNDescent() 163 for (int n = 0; n < ntotal; n++) { in join() 180 for (int i = 0; i < ntotal; i++) { in update() 190 for (int n = 0; n < ntotal; ++n) { in update() 217 for (int n = 0; n < ntotal; ++n) { in update() 267 for (int i = 0; i < ntotal; ++i) { in update() 350 graph.reserve(ntotal); in init_graph() 392 ntotal = n; in build() 396 final_graph.resize(ntotal * K); in build() 400 for (int i = 0; i < ntotal; i++) { in build() [all …]
|