Home
last modified time | relevance | path

Searched refs:num_terms (Results 1 – 25 of 222) sorted by relevance

123456789

/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/pecos/src/
H A DFourierInverseTransformation.cpp34 ifftVector.sizeUninitialized(num_terms); in initialize()
79 for (i=0; i<num_terms; i++) in power_spectral_density()
97 for (i=0; i<num_terms; i++) in compute_sample()
120 for (i=0; i<num_terms; i++) in compute_samples()
164 for (i=0; i<num_terms; i++) { in compute_sample_shinozuka_deodatis()
207 corr, num_terms, lhsSamples); in compute_sample_grigoriu()
209 for (i=0; i<num_terms; i++) { in compute_sample_grigoriu()
226 int num_terms = omegaSequence.length(); in compute_ifft_sample_set() local
228 for (size_t i=0; i<num_terms; i++) in compute_ifft_sample_set()
239 ZFFTI_F77(num_terms, wsave); in compute_ifft_sample_set()
[all …]
/dports/x11/mlterm/mlterm-3.9.1/vtemu/
H A Dvt_term_manager.c42 static u_int num_terms; variable
60 for (count = 0; count < num_terms; count++) { in sig_error()
278 if (num_terms == MAX_TERMS) { in vt_create_term()
322 if (num_terms > 0) { in vt_create_term()
323 return terms[num_terms - 1]; in vt_create_term()
348 return terms[num_terms++]; in vt_create_term()
366 terms[count] = terms[--num_terms]; in vt_destroy_term()
467 return num_terms; in vt_get_all_terms()
471 if (num_terms > 0) { in vt_close_dead_terms()
516 len = (50 + 2) * num_terms; in vt_get_pty_list()
[all …]
/dports/textproc/py-gensim/gensim-4.0.1/gensim/corpora/
H A Ducicorpus.py44 self.num_terms = int(next(fin).strip())
51 self.num_docs, self.num_terms, self.num_nnz
125 num_terms, num_nnz = 0, 0
140 num_terms = max(num_terms, 1 + max_id)
144 if num_docs * num_terms != 0:
147 num_docs, num_terms, 100.0 * num_nnz / (num_docs * num_terms),
148 num_nnz, num_docs * num_terms
278 num_terms = len(id2word)
280 num_terms = 1 + max(id2word)
282 num_terms = 0
[all …]
H A Dbleicorpus.py144 num_terms = len(id2word)
146 num_terms = 1 + max(id2word)
148 num_terms = 0
161 logger.info("saving vocabulary of %i words to %s", num_terms, fname_vocab)
163 for featureid in range(num_terms):
/dports/math/R-cran-recipes/recipes/R/
H A Disomap.R91 num_terms = 5, argument
108 num_terms = num_terms,
128 num_terms = num_terms,
145 if (x$num_terms > 0) {
146 x$num_terms <- min(x$num_terms, ncol(training))
155 ndim = x$num_terms,
171 num_terms = x$num_terms,
184 if (object$num_terms > 0) {
191 comps <- comps[, 1:object$num_terms, drop = FALSE]
206 if (x$num_terms == 0) {
[all …]
/dports/graphics/scantailor/scantailor-advanced-1.0.16/imageproc/
H A DPolynomialLine.cpp43 const auto num_terms = static_cast<const int>(coeffs.size()); in doLeastSquares() local
49 MatT<double> AtA(num_terms, num_terms); in doLeastSquares()
50 VecT<double> Atb(num_terms); in doLeastSquares()
53 VecT<double> powers(num_terms); in doLeastSquares()
63 for (int j = 0; j < num_terms; ++j) { in doLeastSquares()
69 for (int i = 0; i < num_terms; ++i) { in doLeastSquares()
72 for (int j = 0; j < num_terms; ++j) { in doLeastSquares()
80 for (int i = 0; i < num_terms; ++i) { in doLeastSquares()
H A DPolynomialSurface.cpp57 const int num_terms = calcNumTerms(); in PolynomialSurface() local
58 VecT<double>(num_terms, 0.0).swap(m_coeffs); in PolynomialSurface()
63 MatT<double> AtA(num_terms, num_terms); in PolynomialSurface()
64 VecT<double> Atb(num_terms); in PolynomialSurface()
103 const int num_terms = calcNumTerms(); in PolynomialSurface() local
109 MatT<double> AtA(num_terms, num_terms); in PolynomialSurface()
110 VecT<double> Atb(num_terms); in PolynomialSurface()
244 VecT<double> full_powers(num_terms); in prepareDataForLeastSquares()
266 for (int i = 0; i < num_terms; ++i) { in prepareDataForLeastSquares()
322 VecT<double> full_powers(num_terms); in prepareDataForLeastSquares()
[all …]
/dports/math/stanmath/math-4.2.0/stan/math/prim/err/
H A Dcheck_3F2_converges.hpp53 int num_terms = 0; in check_3F2_converges() local
56 if (is_nonpositive_integer(a1) && fabs(a1) >= num_terms) { in check_3F2_converges()
58 num_terms = floor(fabs(value_of_rec(a1))); in check_3F2_converges()
60 if (is_nonpositive_integer(a2) && fabs(a2) >= num_terms) { in check_3F2_converges()
62 num_terms = floor(fabs(value_of_rec(a2))); in check_3F2_converges()
64 if (is_nonpositive_integer(a3) && fabs(a3) >= num_terms) { in check_3F2_converges()
66 num_terms = floor(fabs(value_of_rec(a3))); in check_3F2_converges()
69 bool is_undefined = (is_nonpositive_integer(b1) && fabs(b1) <= num_terms) in check_3F2_converges()
70 || (is_nonpositive_integer(b2) && fabs(b2) <= num_terms); in check_3F2_converges()
H A Dcheck_2F1_converges.hpp45 int num_terms = 0; in check_2F1_converges() local
48 if (is_nonpositive_integer(a1) && fabs(a1) >= num_terms) { in check_2F1_converges()
50 num_terms = floor(fabs(value_of_rec(a1))); in check_2F1_converges()
52 if (is_nonpositive_integer(a2) && fabs(a2) >= num_terms) { in check_2F1_converges()
54 num_terms = floor(fabs(value_of_rec(a2))); in check_2F1_converges()
57 bool is_undefined = is_nonpositive_integer(b1) && fabs(b1) <= num_terms; in check_2F1_converges()
/dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/stan/math/prim/scal/err/
H A Dcheck_3F2_converges.hpp54 int num_terms = 0; in check_3F2_converges() local
57 if (is_nonpositive_integer(a1) && fabs(a1) >= num_terms) { in check_3F2_converges()
59 num_terms = floor(fabs(value_of_rec(a1))); in check_3F2_converges()
61 if (is_nonpositive_integer(a2) && fabs(a2) >= num_terms) { in check_3F2_converges()
63 num_terms = floor(fabs(value_of_rec(a2))); in check_3F2_converges()
65 if (is_nonpositive_integer(a3) && fabs(a3) >= num_terms) { in check_3F2_converges()
67 num_terms = floor(fabs(value_of_rec(a3))); in check_3F2_converges()
70 bool is_undefined = (is_nonpositive_integer(b1) && fabs(b1) <= num_terms) in check_3F2_converges()
71 || (is_nonpositive_integer(b2) && fabs(b2) <= num_terms); in check_3F2_converges()
H A Dcheck_2F1_converges.hpp46 int num_terms = 0; in check_2F1_converges() local
49 if (is_nonpositive_integer(a1) && fabs(a1) >= num_terms) { in check_2F1_converges()
51 num_terms = floor(fabs(value_of_rec(a1))); in check_2F1_converges()
53 if (is_nonpositive_integer(a2) && fabs(a2) >= num_terms) { in check_2F1_converges()
55 num_terms = floor(fabs(value_of_rec(a2))); in check_2F1_converges()
58 bool is_undefined = is_nonpositive_integer(b1) && fabs(b1) <= num_terms; in check_2F1_converges()
/dports/textproc/py-gensim/gensim-4.0.1/gensim/models/
H A Drpmodel.py73 return "RpModel(num_terms=%s, num_topics=%s)" % (self.num_terms, self.num_topics)
87 self.num_terms = len(self.id2word)
89 self.num_terms = 1 + max(self.id2word)
91 self.num_terms = 0
93 shape = self.num_topics, self.num_terms
148 …vec = matutils.sparse2full(bow, self.num_terms).reshape(self.num_terms, 1) / np.sqrt(self.num_topi…
H A Dlsimodel.py408 self.num_terms = len(self.id2word)
484 num_terms=self.num_terms, chunksize=chunksize,
502 … chunk, num_docs=len(chunk), num_terms=self.num_terms, num_nnz=nnz, dtype=self.dtype)
587 vec = matutils.corpus2csc(bow, num_terms=self.num_terms, dtype=self.projection.u.dtype)
918 num_terms = int(num_terms)
923 y = np.zeros(dtype=dtype, shape=(num_terms, samples))
928 …assert num_terms == m, "mismatch in number of features: %i in sparse matrix vs. %i parameter" % (m…
955 …chunk = matutils.corpus2csc(chunk, num_terms=num_terms, dtype=dtype) # documents = columns of spa…
957 assert m == num_terms
977 chunk = matutils.corpus2csc(chunk, num_terms=num_terms, dtype=dtype)
[all …]
/dports/net/httpry/httpry-0.1.8/scripts/plugins/
H A Dsearch_terms.pm17 my $num_terms = 0;
89 $num_terms += ($search_term =~ s/\".*?\"//g);
92 $num_terms += ($search_term =~ s/\s+//g);
93 $num_terms++ if ($search_term);
146 print OUTFILE "Terms: $num_terms\n";
148 print OUTFILE "Avg terms/query: " . sprintf("%.1f", ($num_terms / $num_queries)) . "\n\n\n";
/dports/x11/mlterm/mlterm-3.9.1/uitoolkit/
H A Dui_event_source.c49 u_int num_terms; in receive_next_event() local
65 num_terms = vt_get_all_terms(&terms); in receive_next_event()
96 for (count = 0; count < num_terms; count++) { in receive_next_event()
145 for (count = 0; count < num_terms; count++) { in receive_next_event()
198 num_terms = vt_get_all_terms(&terms); in receive_next_event()
236 num_terms = vt_get_all_terms(&terms); in receive_next_event()
265 for (count = 0; count < num_terms; count++) { in receive_next_event()
312 u_int num_terms; in ui_event_source_process() local
338 num_terms = vt_get_all_terms(&terms); in ui_event_source_process()
340 for (count = 0; count < num_terms; count++) { in ui_event_source_process()
/dports/x11/mlterm/mlterm-3.9.1/android/jni/
H A Dui_event_source.c37 u_int num_terms; in get_current_term() local
40 num_terms = vt_get_all_terms(&terms); in get_current_term()
42 for (count = 0; count < num_terms; count++) { in get_current_term()
135 u_int num_terms; in need_resize() local
138 num_terms = vt_get_all_terms(&terms); in need_resize()
140 for (count = 0; count < num_terms; count++) { in need_resize()
172 if (count < num_terms) { in need_resize()
198 u_int num_terms; in ui_event_source_process() local
213 if (prev_num_terms != num_terms && (p = realloc(fds, sizeof(int) * num_terms))) { in ui_event_source_process()
226 prev_num_terms = num_terms; in ui_event_source_process()
[all …]
/dports/misc/adios2/ADIOS2-2.7.1/thirdparty/EVPath/EVPath/
H A Dmodels.c24 {"num_terms", "integer", sizeof(int), FMOffset(model_ptr, num_terms)},
72 m->num_terms = buffer_size/2+1; in EVmodel_take_fft()
73 fftw_complex* fft = fftw_malloc(sizeof(fftw_complex)*m->num_terms); in EVmodel_take_fft()
82 m->terms = (double *)malloc(sizeof(double)*m->num_terms*2); in EVmodel_take_fft()
84 for(int i=0; i<m->num_terms; ++i) { in EVmodel_take_fft()
106 int buffer_size = (m->num_terms-1)*2; in EVmodel_fit_fft()
112 for(int i=0; i<m->num_terms; i+=2) { in EVmodel_fit_fft()
/dports/textproc/p5-Plucene/Plucene-1.25/lib/Plucene/Search/
H A DSimilarity.pm28 my ($self, $num_terms) = @_;
29 return 0 if not defined $num_terms or $num_terms == 0;
30 return ceil(255 / sqrt($num_terms));
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dsmt_implied_equalities.cpp59 for (unsigned i = 0; i < num_terms; ++i) { in partition_terms()
332 for (unsigned i = 0; i < num_terms; ++i) { in operator ()()
337 assert_relevant(num_terms, terms); in operator ()()
345 partition_terms(num_terms, terms, termids); in operator ()()
355 for (unsigned i = 0; i < num_terms; ++i) { in operator ()()
378 return gi(num_terms, terms, class_ids); in implied_equalities()
469 void initialize(unsigned num_terms, expr* const* terms) {
473 unsigned log_terms = 1, nt = num_terms;
477 for (unsigned i = 0; i < num_terms; ++i) {
501 unsigned num_terms, expr* const* terms,
[all …]
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dsmt_implied_equalities.cpp59 for (unsigned i = 0; i < num_terms; ++i) { in partition_terms()
332 for (unsigned i = 0; i < num_terms; ++i) { in operator ()()
337 assert_relevant(num_terms, terms); in operator ()()
345 partition_terms(num_terms, terms, termids); in operator ()()
355 for (unsigned i = 0; i < num_terms; ++i) { in operator ()()
378 return gi(num_terms, terms, class_ids); in implied_equalities()
469 void initialize(unsigned num_terms, expr* const* terms) {
473 unsigned log_terms = 1, nt = num_terms;
477 for (unsigned i = 0; i < num_terms; ++i) {
501 unsigned num_terms, expr* const* terms,
[all …]
/dports/math/z3/z3-z3-4.8.13/src/test/
H A Dget_implied_equalities.cpp34 unsigned const num_terms = 7; in tst_get_implied_equalities1() local
46 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities1()
47 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities1()
60 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities1()
61 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities1()
96 unsigned const num_terms = 5; in tst_get_implied_equalities2() local
101 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities2()
102 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities2()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/test/
H A Dget_implied_equalities.cpp34 unsigned const num_terms = 7; in tst_get_implied_equalities1() local
46 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities1()
47 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities1()
60 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities1()
61 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities1()
96 unsigned const num_terms = 5; in tst_get_implied_equalities2() local
101 Z3_get_implied_equalities(ctx, solver, num_terms, terms, class_ids); in tst_get_implied_equalities2()
102 for (i = 0; i < num_terms; ++i) { in tst_get_implied_equalities2()
/dports/mail/spamprobe/spamprobe-1.4d/src/spamprobe/
H A DSpamFilter.cc267 double &num_terms) in computeScoreProducts() argument
288 num_terms = 0; in computeScoreProducts()
292 if ((num_terms >= max_terms) && in computeScoreProducts()
309 num_terms += times; in computeScoreProducts()
324 double spamness, goodness, num_terms; in originalScoreMessage() local
347 double spamness, goodness, num_terms; in alt1ScoreMessage() local
350 double p = 1.0 - pow(goodness, 1.0 / num_terms); in alt1ScoreMessage()
351 double q = 1.0 - pow(spamness, 1.0 / num_terms); in alt1ScoreMessage()
370 double spamness, goodness, num_terms; in normalScoreMessage() local
373 spamness = pow(spamness, 1.0 / num_terms); in normalScoreMessage()
[all …]
/dports/textproc/py-gensim/gensim-4.0.1/gensim/
H A Dmatutils.py120 if num_terms is None:
121 num_terms = corpus.num_terms
158 if num_terms is None:
159 num_terms = max(indices) + 1 if indices else 0
498 result[:, docno] = sparse2full(doc, num_terms)
1191 num_docs, num_terms, num_nnz, self.fname
1197 def fake_headers(self, num_docs, num_terms, num_nnz): argument
1313 num_terms = num_terms or _num_terms
1315 if num_docs * num_terms != 0:
1318 … num_docs, num_terms, 100.0 * num_nnz / (num_docs * num_terms), num_nnz, num_docs * num_terms
[all …]
/dports/math/R-cran-recipes/recipes/tests/testthat/
H A Dtest_isomap.R33 step_isomap(x1, x2, x3, neighbors = 3, num_terms = 3, id = "")
59 step_isomap(x1, x2, x3, neighbors = 3, num_terms = 3)
74 step_isomap(x1, x2, x3, neighbors = 3, num_terms = 0, id = "") %>%
104 step_isomap(all_numeric_predictors(), num_terms = 1, neighbors = 1) %>%
136 step_isomap(x1, x2, x3, neighbors = 3, num_terms = 3, id = "", keep_original_cols = TRUE)
158 step_isomap(x1, x2, x3, neighbors = 3, num_terms = 3)

123456789