Home
last modified time | relevance | path

Searched refs:probs (Results 151 – 175 of 2896) sorted by relevance

12345678910>>...116

/dports/security/vault/vault-1.8.2/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/helmfile/vault-f6547fa8e820/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/misc/concourse/vault-bdd38fca2cff/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/misc/concourse/concourse-6.7.2/vendor/github.com/hashicorp/vault/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/helmfile/helmfile-0.138.7/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/net/bosh-bootloader/bosh-bootloader-7.2.12/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/security/vault/vault-1.8.2/vendor/github.com/hashicorp/nomad/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/www/gitea/gitea-1.16.5/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/nomad/nomad-1.1.0/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/www/mattermost-server/mattermost-server-6.0.2/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/jest/jest-f76bc46/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/terraform/terraform-1.0.11/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/terraform-provider-vultr/terraform-provider-vultr-0.1.10/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/terraform-provider-gridscale/terraform-provider-gridscale-1.6.2/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/devel/bit/bit-1.1.2/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/sysutils/sensu-go/sensu-go-5.11.1/vendor/github.com/ulikunitz/xz/lzma/
H A Dtreecodecs.go29 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
42 b, err := d.DecodeBit(&tc.probs[m])
75 if err := e.EncodeBit(b, &tc.probs[m]); err != nil {
88 b, err := d.DecodeBit(&tc.probs[m])
101 probs []prob member
110 t.probs = make([]prob, len(src.probs))
111 copy(t.probs, src.probs)
122 probs: make([]prob, 1<<uint(bits)),
124 for i := range t.probs {
125 t.probs[i] = probInit
/dports/devel/boost-docs/boost_1_72_0/libs/random/test/
H A Dtest_hyperexponential_distribution.cpp88 …boost::random::hyperexponential_distribution<> dist_it(probs.begin(), probs.end(), rates.begin(), … in BOOST_AUTO_TEST_CASE()
129 boost::random::hyperexponential_distribution<> dist(probs, rates); in BOOST_AUTO_TEST_CASE()
162 …boost::random::hyperexponential_distribution<>::param_type param_it(probs.begin(), probs.end(), ra… in BOOST_AUTO_TEST_CASE()
239 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
244 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
276 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
282 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
326 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
331 …boost::random::hyperexponential_distribution<> check_dist(probs, std::vector<double>(probs.size(),… in BOOST_AUTO_TEST_CASE()
363 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
[all …]
H A Dtest_discrete_distribution.cpp58 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-python-libs/boost_1_72_0/libs/random/test/
H A Dtest_hyperexponential_distribution.cpp88 …boost::random::hyperexponential_distribution<> dist_it(probs.begin(), probs.end(), rates.begin(), … in BOOST_AUTO_TEST_CASE()
129 boost::random::hyperexponential_distribution<> dist(probs, rates); in BOOST_AUTO_TEST_CASE()
162 …boost::random::hyperexponential_distribution<>::param_type param_it(probs.begin(), probs.end(), ra… in BOOST_AUTO_TEST_CASE()
239 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
244 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
276 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
282 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
326 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
331 …boost::random::hyperexponential_distribution<> check_dist(probs, std::vector<double>(probs.size(),… in BOOST_AUTO_TEST_CASE()
363 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
[all …]
H A Dtest_discrete_distribution.cpp58 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 Dtest_hyperexponential_distribution.cpp88 …boost::random::hyperexponential_distribution<> dist_it(probs.begin(), probs.end(), rates.begin(), … in BOOST_AUTO_TEST_CASE()
129 boost::random::hyperexponential_distribution<> dist(probs, rates); in BOOST_AUTO_TEST_CASE()
162 …boost::random::hyperexponential_distribution<>::param_type param_it(probs.begin(), probs.end(), ra… in BOOST_AUTO_TEST_CASE()
239 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
244 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
276 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
282 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
326 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
331 …boost::random::hyperexponential_distribution<> check_dist(probs, std::vector<double>(probs.size(),… in BOOST_AUTO_TEST_CASE()
363 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/random/test/
H A Dtest_hyperexponential_distribution.cpp88 …boost::random::hyperexponential_distribution<> dist_it(probs.begin(), probs.end(), rates.begin(), … in BOOST_AUTO_TEST_CASE()
129 boost::random::hyperexponential_distribution<> dist(probs, rates); in BOOST_AUTO_TEST_CASE()
162 …boost::random::hyperexponential_distribution<>::param_type param_it(probs.begin(), probs.end(), ra… in BOOST_AUTO_TEST_CASE()
239 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
244 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
276 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
282 …om::hyperexponential_distribution<>::param_type check_param(probs, std::vector<double>(probs.size(… in BOOST_AUTO_TEST_CASE()
326 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
331 …boost::random::hyperexponential_distribution<> check_dist(probs, std::vector<double>(probs.size(),… in BOOST_AUTO_TEST_CASE()
363 boost::random::detail::print_vector(ss, probs); in BOOST_AUTO_TEST_CASE()
[all …]
/dports/devel/p5-Algorithm-Evolutionary/Algorithm-Evolutionary-0.82.1/lib/Algorithm/Evolutionary/
H A DHash_Wheel.pm42 my %probs = %$probs_hashref;
46 for ( sort keys %probs ) { $acc += $probs{$_};}
47 for ( sort keys %probs ) { $probs{$_} /= $acc;} #Normalizes array
53 for ( sort keys %probs ) {
54 push @{$self->{_accProbs}}, [$probs{$_} + $aux,$_ ];
55 $aux += $probs{$_};
/dports/math/igraph/igraph-0.9.5/vendor/plfit/
H A Dsampling.c190 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 …]

12345678910>>...116