| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/plfit/ |
| H A D | sampling.c | 190 if (sampler->probs == 0) { in plfit_walker_alias_sampler_init()
215 free(sampler->probs); in plfit_walker_alias_sampler_init()
221 free(sampler->probs); in plfit_walker_alias_sampler_init()
229 for (i = 0, p = sampler->probs; i < n; i++, p++) { in plfit_walker_alias_sampler_init()
244 (sampler->probs[long_index] + sampler->probs[short_index]) - 1; in plfit_walker_alias_sampler_init()
245 if (sampler->probs[long_index] < 1) { in plfit_walker_alias_sampler_init()
254 sampler->probs[i] = 1; in plfit_walker_alias_sampler_init()
258 sampler->probs[i] = 1; in plfit_walker_alias_sampler_init()
270 if (sampler->probs) { in plfit_walker_alias_sampler_destroy()
271 free(sampler->probs); in plfit_walker_alias_sampler_destroy()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/random/test/ |
| H A D | test_discrete_distribution.cpp | 58 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
61 boost::random::discrete_distribution<> dist_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
83 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
107 boost::random::discrete_distribution<>::param_type parm_r(probs); in BOOST_AUTO_TEST_CASE()
111 parm_it(probs.begin(), probs.end()); in BOOST_AUTO_TEST_CASE()
120 std::vector<double> probs = boost::assign::list_of(1.0)(2.0)(1.0); in BOOST_AUTO_TEST_CASE() local
124 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
133 boost::random::discrete_distribution<> dist_r(probs); in BOOST_AUTO_TEST_CASE()
145 boost::random::discrete_distribution<> dist(probs); in BOOST_AUTO_TEST_CASE()
154 std::vector<double> probs = boost::assign::list_of(0.0)(1.0); in BOOST_AUTO_TEST_CASE() local
[all …]
|
| /dports/misc/orange3/orange3-3.29.1/Orange/tests/ |
| H A D | test_naive_bayes.py | 96 np.testing.assert_equal(probs, probs2)
165 probs = model(test_data, ret=model.Probs)
166 np.testing.assert_almost_equal(exp_probs, probs)
170 np.testing.assert_almost_equal(exp_probs, probs)
175 probs = model(test_data, ret=model.Probs)
184 probs = model(test_x, ret=model.Probs)
206 values, probs = model.predict(test_x)
266 probs = model(test_data, ret=model.Probs)
276 probs = model(test_data, ret=model.Probs)
285 probs = model(test_x, ret=model.Probs)
[all …]
|
| /dports/archivers/zip-ada/zip-ada/zip_lib/ |
| H A D | lzma-encoding.adb | 470 … Strict_Literal(b, b_match, probs.lit(probs_lit_idx..probs.lit'Last), sim_state, sim_pos_state);
554 return res * Simulate_Length(probs.rep_len, length);
599 probs.dist.align_coder,
610 Simulate_Length(probs.len, length) *
780 … Predicted.Strict_Literal(b, b_match, probs.lit(pb_lit_idx..probs.lit'Last), state, pos_state))
792 Write_Literal(probs.lit(pb_lit_idx..probs.lit'Last), UInt32(b));
794 Write_Literal_Matched(probs.lit(pb_lit_idx..probs.lit'Last), UInt32(b), UInt32(b_match));
901 probs.dist.align_coder,
912 Encode_Length(probs.len, length);
924 Encode_Bit(probs.switch.rep(state), Rep_match_choice);
[all …]
|
| /dports/math/saga/saga-8.1.3/saga-gis/src/tools/imagery/imagery_maxent/ |
| H A D | me.cpp | 82 probs.clear(); in getProbs()
83 probs.assign(_classes, 0); in getProbs()
92 probs[c] = s; in getProbs()
93 if (max<0 || probs[max]<s) in getProbs()
96 double sum = sumLogProb(probs); in getProbs()
98 probs[i] = exp(probs[i])/exp(sum); in getProbs()
117 vector<double> probs; in getExpects() local
118 getProbs(e, probs); in getExpects()
134 vector<double> probs; in getObsCounts() local
198 vector<double> probs; in Test_Event() local
[all …]
|
| /dports/textproc/R-cran-readr/readr/R/ |
| H A D | problems.R | 33 problems <- probs(x)
58 probs <- function(x) { function
63 probs <- problems(x) functionVar
64 if (is.null(probs)) 0 else nrow(probs)
72 probs <- problems(x) functionVar
73 x[unique(probs$row), , drop = FALSE]
82 probs <- as.data.frame(attr(x, "problems")) functionVar
83 many_problems <- nrow(probs) > 5
85 probs_f <- format(utils::head(probs, 5), justify = "left")
87 probs_f <- rbind(names(probs), probs_f)
|
| /dports/net/bosh-cli/bosh-cli-5.5.0/cmd/ |
| H A D | cloud_check.go | 21 probs, err := c.deployment.ScanForProblems()
36 for _, p := range probs {
46 if len(probs) == 0 {
49 return bosherr.Errorf("%d problem(s) found", len(probs))
55 answers, err = c.defaultResolutions(probs)
60 answers, err = c.applyResolutions(opts.Resolutions, probs)
65 answers, err = c.askForResolutions(probs)
82 for _, prob := range probs {
115 func (c CloudCheckCmd) askForResolutions(probs []boshdir.Problem) ([]boshdir.ProblemAnswer, error) {
118 for _, prob := range probs {
[all …]
|
| /dports/math/R-cran-coda/coda/R/ |
| H A D | cumuplot.R | 1 cumuplot <- function(x, probs=c(0.025,0.5,0.975), ylab="", lty=c(2,1), argument
13 cquantile <- function(z, probs) argument
16 cquant <- matrix(0, nrow=length(z), length(probs))
19 cquant[i,] <- quantile(z[1:i], probs=probs, names=FALSE)
21 cquant[i,] <- quantile(z[1:i], probs=probs)
24 names(cquant) <- paste(formatC(100*probs,format="fg",width=1,digits=7),
42 Y <- cquantile(as.matrix(x[[i]])[,j], probs=probs)
|
| /dports/www/firefox-esr/firefox-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/net/freeswitch/freeswitch-1.10.3.-release/libs/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/net-im/tg_owt/tg_owt-d578c76/src/third_party/libvpx/source/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/multimedia/libvpx/libvpx-1.11.0/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/media/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/libvpx/source/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/www/firefox/firefox-99.0/media/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/libvpx/source/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/media/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, in cost() argument
39 const vp9_prob prob = probs[i / 2]; in cost()
49 cost(costs, tree, probs, ii, cc); in cost()
53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) { in vp9_cost_tokens() argument
54 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { in vp9_cost_tokens_skip() argument
60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
61 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/media/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/media/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_cost.c | 39 static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, in cost() argument
41 const vpx_prob prob = probs[i / 2]; in cost()
52 cost(costs, tree, probs, ii, cc); in cost()
56 void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens() argument
57 cost(costs, tree, probs, 0, 0); in vp9_cost_tokens()
60 void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { in vp9_cost_tokens_skip() argument
63 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); in vp9_cost_tokens_skip()
64 cost(costs, tree, probs, 2, 0); in vp9_cost_tokens_skip()
|