Home
last modified time | relevance | path

Searched refs:ties (Results 51 – 75 of 4165) sorted by relevance

12345678910>>...167

/dports/math/R-cran-survey/survey/R/
H A Dsvyquantile.R42 yleft=min(xx),yright=max(xx),ties=min)
104 yleft=min(xx),yright=max(xx),ties=min)$y
122 yleft=min(xx),yright=max(xx),ties=min)$y
126 ties<-match.arg(ties)
180 ties<-match.arg(ties)
230 if (ties=="discrete")
241 xout=quantiles,ties=min)$y
274 xout=quantiles,ties=min)$y
300 if (ties=="discrete"){
310 ties=min)
[all …]
/dports/math/R-cran-VGAM/VGAM/man/
H A DbratUC.Rd12 Brat(mat, ties = 0 * mat, string = c(">", "=="), whitespace = FALSE)
18 dimension when there are ties, and \eqn{M+1} by \eqn{M+1}
19 when there are no ties. The rows are winners and the
26 \item{ties}{
29 default, there are no ties. The matrix must be symmetric,
40 is used to handle ties.
59 ties), while if there are ties, the non-diagonal elements
/dports/finance/R-cran-timeSeries/timeSeries/man/
H A Dbase-rank.Rd22 (called ???ties???), the argument ties.method determines the result at
24 permutation with increasing values at each index set of ties. The
38 \S4method{rank}{timeSeries}(x, na.last = TRUE, ties.method = )
52 \item{ties.method}{
53 a character string specifying how ties are treated; can be
/dports/biology/mothur/mothur-1.46.1/source/
H A Dlinearalgebra.cpp704 ties.clear();
748 ties.clear();
761 ties.clear();
840 ties.clear();
865 ties.clear();
878 ties.clear();
958 ties.clear();
1247 if (ties.size() > 1) { TIES.push_back(ties.size()); }
1256 if (ties.size() > 1) { TIES.push_back(ties.size()); }
1388 ties.clear();
[all …]
/dports/devel/trellis/prjtrellis-5eb0ad87/fuzzers/ECP5/132-dlldel/
H A Dfuzzer.py49 ties = []
51 ties.append("DDRDEL={}".format(ddrdel))
53 ties.append("LOADN=0")
54 if len(ties) > 0:
55 program += ":{}".format(",".join(ties))
/dports/misc/orange3/orange3-3.29.1/Orange/classification/
H A Dmajority.py34 ties = np.flatnonzero(probs == probs.max())
35 if len(ties) > 1:
37 .hexdigest(), 16) % len(ties)
38 unif_maj = ties[random_idx]
/dports/math/R-cran-matrixStats/matrixStats/src/
H A DweightedMedian_lowlevel_template.h20 … *x, R_xlen_t nx, double *w, R_xlen_t *idxs, R_xlen_t nidxs, int narm, int interpolate, int ties) { in CONCAT_MACROS()
273 if (ties == 1) { /* weighted */ in CONCAT_MACROS()
276 } else if (ties == 2) { /* min */ in CONCAT_MACROS()
278 } else if (ties == 4) { /* max */ in CONCAT_MACROS()
280 } else if (ties == 8) { /* mean */ in CONCAT_MACROS()
283 error("Unknown value of argument 'ties': %d", ties); in CONCAT_MACROS()
/dports/math/openturns/openturns-1.18/python/test/
H A Dt_DistFunc_spearman.py13 for ties in [True, False]:
17 print("size=", size, " ties=", ties, "tail=", tail, " rho=%.6g" %
18 rho, " p=%.6g" % DistFunc.pSpearmanCorrelation(size, rho, tail, ties))
/dports/math/R-cran-survey/survey/tests/
H A Dquantile.R18 oldsvyquantile(~y,ddf, c(0.01,0.1,0.5,0.9,0.99),ci=TRUE,ties="rounded",interval.type="betaWald") nameattr
22 oldsvyquantile(~y,ddf, c(0.01,0.1,0.5,0.9,0.99),ci=TRUE,ties="rounded",interval.type="betaWald",df=… nameattr
41 oldsvyquantile(~y,ddf, c(0.01,0.1,0.5,0.9,0.99),ci=TRUE,ties="rounded",interval.type="betaWald") nameattr
45 oldsvyquantile(~y,ddf, c(0.01,0.1,0.5,0.9,0.99),ci=TRUE,ties="rounded",interval.type="betaWald",df=… nameattr
/dports/math/R-cran-forcats/forcats/man/
H A Dfct_lump.Rd17 ties.method = c("min", "average", "first", "last", "random", "max")
29 ties.method = c("min", "average", "first", "last", "random", "max")
39 It there are ties, you will get at least \code{abs(n)} values.}
51 \item{ties.method}{A character string specifying how ties are
96 # Use ties.method to control how tied factors are collapsed
98 fct_lump_n(x, n = 6, ties.method = "max")
/dports/math/minizinc/libminizinc-2.5.5/share/minizinc/std/
H A Darg_max.mzn7 When breaking ties the least index is returned.
14 When breaking ties the least index is returned.
21 When breaking ties the least index is returned.
44 When breaking ties the least index is returned.
53 When breaking ties the least index is returned.
62 When breaking ties the least index is returned.
H A Darg_min.mzn8 When breaking ties the least index is returned.
15 When breaking ties the least index is returned.
22 When breaking ties the least index is returned.
45 When breaking ties the least index is returned.
54 When breaking ties the least index is returned.
63 When breaking ties the least index is returned.
/dports/games/fmars/fmars-0.0.207/
H A Dbench.py19 ties = int (output[0][1])
24 return w1wins, w2wins, ties, realtime
62 w1wins, w2wins, ties, realtime = fight (war1, war2, rounds,
65 w2wins, reslen, ties,
/dports/editors/texstudio/texstudio-4.1.2/utilities/dictionaries/
H A Dlv_LV-Latvian.aff3227 SFX < ties jos ties
3228 SFX < ties jies ties
3229 SFX < ties jas ties
3230 SFX < ties jamies ties
3231 SFX < ties jaties ties
3232 SFX < ties jās ties
3233 SFX < ties jāmies ties
3234 SFX < ties jāties ties
3262 SFX > āties āties [ā]ties
3284 SFX > īties āties [ī]ties
[all …]
/dports/math/R-cran-matrixStats/matrixStats/man/
H A DweightedMedian.Rd8 interpolate = is.null(ties), ties = NULL, ...)
29 \item{ties}{If \code{interpolate == FALSE}, a character string specifying
30 how to solve ties between two \code{x}'s that are satisfying the weighted
32 When \code{ties} is \code{"min"} ("lower weighted median"), the smaller
34 median"), the larger value is returned. If \code{ties}
36 \code{ties} is \code{"weighted"} (or \code{\link[base]{NULL}}) a weighted
88 m2 <- weightedMedian(x, ties = "weighted") # 5.5 (default)
89 m3 <- weightedMedian(x, ties = "min") # 5
90 m4 <- weightedMedian(x, ties = "max") # 6
/dports/math/openturns/openturns-1.18/lib/test/
H A Dt_DistFunc_spearman.cxx47 const Bool ties = iTies == 0; in main() local
54 …size << ", ties=" << ties << ", tail=" << tail << ", rho=" << rho << ", p=" << DistFunc::pSpearman… in main()
/dports/math/R-cran-terra/terra/src/
H A Dmath_utils.cpp170 double modal_value(std::vector<double> values, unsigned ties, bool narm, std::default_random_engine… in modal_value() argument
180 if (ties < 3) { in modal_value()
196 if (ties == 0) { in modal_value()
203 } else if (ties == 1) { in modal_value()
211 } else if (ties == 2) { in modal_value()
219 } else if (ties == 3) { in modal_value()
/dports/math/R-cran-raster/raster/man/
H A Dmodal.Rd14 \S4method{modal}{ANY}(x, ..., ties='random', na.rm=FALSE, freq=FALSE)
16 \S4method{modal}{Raster}(x, ..., ties='random', na.rm=FALSE, freq=FALSE)
22 …\item{ties}{character. Indicates how to treat ties. Either 'random', 'lowest', 'highest', 'first',…
/dports/math/R-cran-Matching/Matching/
H A DChangeLog52 Changed Mks.test() to handle warnings for ties in
240 ties. At the expense of slightly more memory, the Match() function is
243 matches due to ties. For this problem, Match() now takes 60 seconds
253 Match() and GenMatch now support the "ties" option. The default
256 If the dataset is large and there are many ties between potential
257 matches, setting ties=FALSE often results in a large speedup with
260 Specifically, the ties option controls whether ties should be handled
261 deterministically. By default ties==TRUE. If, for example, one
266 number of observations. If ties==FALSE, ties will be randomly broken.
269 and there are many ties between potential matches, setting ties=FALSE
[all …]
/dports/databases/pgFormatter/pgFormatter-5.1/t/pg-test-files/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]
/dports/databases/postgresql11-plperl/postgresql-11.14/src/test/regress/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]
/dports/databases/postgresql11-client/postgresql-11.14/src/test/regress/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]
/dports/databases/postgresql11-docs/postgresql-11.14/src/test/regress/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]
/dports/databases/postgresql11-contrib/postgresql-11.14/src/test/regress/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]
/dports/databases/postgresql11-pltcl/postgresql-11.14/src/test/regress/sql/
H A Dwindow.sql385 exclude ties), salary, enroll_date from empsalary;
400 exclude ties),
409 exclude ties),
414 exclude ties),
416 exclude ties),
639 exclude ties), salary, enroll_date from empsalary;
642 exclude ties), salary, enroll_date from empsalary;
645 exclude ties), salary, enroll_date from empsalary;
648 exclude ties), salary, enroll_date from empsalary;
709 exclude ties), unique1, four
[all …]

12345678910>>...167