| /external/apache-commons-math/src/main/java/org/apache/commons/math3/stat/inference/ |
| D | ChiSquareTest.java | 53 * frequency counts.
56 * hypothesis that the observed counts follow the expected distribution.</p>
59 * <li>Expected counts must all be positive.
61 * <li>Observed counts must all be ≥ 0.
70 * expected and observed counts are equal.</p>
72 * @param observed array of observed frequency counts
73 * @param expected array of expected frequency counts
125 * frequency counts to those in the <code>expected</code> array.
128 * the null hypothesis that the observed counts conform to the frequency distribution
129 * described by the expected counts.</p>
[all …]
|
| D | GTest.java | 48 * frequency counts.
51 * Test) evaluating the null hypothesis that the observed counts follow the
55 * <li>Expected counts must all be positive. </li>
56 * <li>Observed counts must all be ≥ 0. </li>
65 * expected and observed counts are equal.</p>
67 * @param observed array of observed frequency counts
68 * @param expected array of expected frequency counts
115 * {@code observed} frequency counts to those in the {@code expected} array.
118 * can reject the null hypothesis that the observed counts conform to the
119 * frequency distribution described by the expected counts.</p>
[all …]
|
| /external/tensorflow/tensorflow/python/ops/distributions/ |
| D | dirichlet_multinomial.py | 36 _dirichlet_multinomial_sample_note = """For each batch of counts,
41 different sequences have the same counts so the probability includes a
57 is defined over a (batch of) length-`K` vector `counts` such that
58 `tf.reduce_sum(counts, -1) = total_count`. The Dirichlet-Multinomial is
63 The Dirichlet-Multinomial is a distribution over `K`-class counts, i.e., a
64 length-`K` vector of non-negative integer `counts = n = [n_0, ..., n_{K-1}]`.
92 `counts = [n_0,...,n_{K-1}] ~ Multinomial(total_count, probs)`
95 distribution. When calling distribution functions (e.g., `dist.prob(counts)`),
96 `concentration`, `total_count` and `counts` are broadcast to the same shape.
97 The last dimension of `counts` corresponds single Dirichlet-Multinomial
[all …]
|
| D | multinomial.py | 37 _multinomial_sample_note = """For each batch of counts, `value = [n_0, ...
42 sequences have the same counts so the probability includes a combinatorial
59 (batch of) length-`K` vector `counts` such that
60 `tf.reduce_sum(counts, -1) = total_count`. The Multinomial is identically the
65 The Multinomial is a distribution over `K`-class counts, i.e., a length-`K`
66 vector of non-negative integer `counts = n = [n_0, ..., n_{K-1}]`.
119 The distribution functions can be evaluated on counts.
122 # counts same shape as p.
123 counts = [1., 0, 3]
124 dist.prob(counts) # Shape []
[all …]
|
| /external/tensorflow/tensorflow/python/kernel_tests/random/ |
| D | random_binomial_test.py | 36 self, num, counts, probs, dtype, gen=None, sample_shape=None, seed=None): argument
42 shape=shape, counts=counts, probs=probs, dtype=dtype)
61 for counts in (1., 10., 22., 50.):
63 sampler = self._Sampler(int(5e4), counts, prob, dt, gen=gen)
68 dist=stats.binom(counts, prob),
76 sx = self._Sampler(1000, counts=10., probs=0.4, dtype=dt, seed=345)
77 sy = self._Sampler(1000, counts=10., probs=0.4, dtype=dt, seed=345)
83 shape=[1000], seed=[12, 34], counts=10., probs=0.4, output_dtype=dt)
85 shape=[1000], seed=[12, 34], counts=10., probs=0.4, output_dtype=dt)
99 rnd = rng.binomial(shape=[10], counts=np.float32(2.), probs=np.float32(0.5))
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
| D | ChiSquareTest.java | 33 * frequency counts.
36 * the observed counts follow the expected distribution.</p>
39 * <li>Expected counts must all be positive.
41 * <li>Observed counts must all be >= 0.
49 * @param observed array of observed frequency counts
50 * @param expected array of expected frequency counts
63 * frequency counts to those in the <code>expected</code> array.
66 * the null hypothesis that the observed counts conform to the frequency distribution
67 * described by the expected counts.</p>
70 * <li>Expected counts must all be positive.
[all …]
|
| D | ChiSquareTestImpl.java | 58 * expected and observed counts are equal.</p>
60 * @param observed array of observed frequency counts
61 * @param expected array of expected frequency counts
107 * expected and observed counts are equal.</p>
109 * @param observed array of observed frequency counts
110 * @param expected array of expected frequency counts
126 * expected and observed counts are equal.</p>
128 * @param observed array of observed frequency counts
129 * @param expected array of expected frequency counts
147 * @param counts array representation of 2-way table
[all …]
|
| D | UnknownDistributionChiSquareTest.java | 34 * Chi-Square two sample test statistic</a> comparing bin frequency counts
36 * sums of frequency counts in the two samples are not required to be the
44 * both observed counts follow the same distribution.</p>
47 * <li>Observed counts must be non-negative.
49 * <li>Observed counts for a specific bin must not both be zero.
51 * <li>Observed counts for a specific sample must not all be 0.
59 * @param observed1 array of observed frequency counts of the first data set
60 * @param observed2 array of observed frequency counts of the second data set
71 * bin frequency counts in <code>observed1</code> and
75 * can reject the null hypothesis that the observed counts conform to the
[all …]
|
| /external/perfetto/protos/perfetto/metrics/android/ |
| D | hwcomposer.proto | 22 // Counts the number of composition total layers in the trace. (non-weighted average)
25 // Counts the number of composition dpu layers in the trace. (non-weighted average)
28 // Counts the number of composition gpu layers in the trace. (non-weighted average)
31 // Counts the number of composition dpu cached layers in the trace. (non-weighted average)
34 // Counts the number of composition surfaceflinger cached layers in the trace.
38 // Counts the number of composition rounded corner decoration layers in the trace.
42 // Counts how many times validateDisplay is skipped.
45 // Counts how many times validateDisplay cannot be skipped.
48 // Counts how many times validateDisplay is already separated from presentDisplay
52 // Counts how many unhandled validation cases which might be caused by errors.
[all …]
|
| /external/rappor/analysis/R/ |
| D | read_input.R | 16 # Read parameter, counts and map files.
43 # Handle the case of redundant cohorts, i.e. the counts file needs to be
44 # further aggregated to obtain counts for the number of cohorts specified in
48 AdjustCounts <- function(counts, params) { argument
49 apply(counts, 2, function(x) {
50 tapply(x, rep(1:params$m, nrow(counts) / params$m), sum)
55 # Read in the counts file.
59 counts <- read.csv(counts_file, header = FALSE) functionVar
62 counts <- AdjustCounts(counts, params)
65 if (nrow(counts) != params$m) {
[all …]
|
| /external/llvm/test/tools/llvm-profdata/ |
| D | general.proftext | 5 # RUN: llvm-profdata show %t.profdata --function function_count_only --counts | FileCheck %s -check…
13 # FUNC_COUNT_ONLY-NEXT: Block counts: []
15 # RUN: llvm-profdata show %t.profdata.dense --function "name with spaces" --counts | FileCheck %s -…
16 # RUN: llvm-profdata show %t.profdata --function "name with spaces" --counts | FileCheck %s --check…
25 # SPACES-NEXT: Block counts: [0]
28 # RUN: llvm-profdata show %t.profdata --function large_numbers --counts | FileCheck %s -check-prefi…
41 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
74 …D-SUMMARY: 3 blocks with count >= 576460752303423488 account for 80 percentage of the total counts.
75 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 90 percentage of the total counts.
76 …D-SUMMARY: 4 blocks with count >= 288230376151711744 account for 95 percentage of the total counts.
[all …]
|
| D | multiple-inputs.test | 4 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
6 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3
10 FOO3: Block counts: [7, 6]
16 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3EMPTY
20 FOO3EMPTY: Block counts: [2, 3]
26 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
27 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=FOO3FOO3BAR3 --chec…
31 FOO3FOO3BAR3-1: Block counts: [5, 8]
35 FOO3FOO3BAR3-2: Block counts: [11, 13]
41 RUN: llvm-profdata show %t -all-functions -counts | FileCheck %s --check-prefix=DISJOINT --check-pr…
[all …]
|
| D | compat.proftext | 8 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function function_count_only --counts | Fi…
16 # FUNC_COUNT_ONLY-NEXT: Block counts: []
18 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function "name with spaces" --counts | Fil…
27 # SPACES-NEXT: Block counts: [0]
29 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v1 --function large_numbers --counts | FileChec…
42 # LARGENUM-NEXT: Block counts: [1152921504606846976, 576460752303423488, 288230376151711744, 144115…
49 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v2 -all-functions --counts | FileCheck %s -chec…
56 # FORMATV2-NEXT: Block counts: [179900]
61 # FORMATV2-NEXT: Block counts: [1000, 1000000, 499500]
67 # RUN: llvm-profdata show %S/Inputs/compat.profdata.v4 -all-functions --counts | FileCheck %s -chec…
[all …]
|
| /external/spdx-tools/reporter/ |
| D | reporter.go | 36 counts := []struct {
47 counts = append(counts, entry)
50 sort.Slice(counts, func(i, j int) bool { return counts[i].count > counts[j].count })
52 for _, c := range counts {
99 counts := []struct {
110 counts = append(counts, entry)
113 sort.Slice(counts, func(i, j int) bool { return counts[i].count > counts[j].count })
115 for _, c := range counts {
162 counts := []struct {
173 counts = append(counts, entry)
[all …]
|
| /external/libchrome/base/metrics/ |
| D | sample_vector.cc | 18 // storage. Once the full counts storage is allocated, the single-sample must
39 if (!counts()) { in Accumulate()
46 // entries in the counts array so move the single-sample. in Accumulate()
47 if (counts()) in Accumulate()
59 subtle::NoBarrier_AtomicIncrement(&counts()[bucket_index], count); in Accumulate()
79 if (counts() || MountExistingCountsStorage()) { in TotalCount()
82 const HistogramBase::AtomicCount* counts_array = counts(); in TotalCount()
102 if (counts() || MountExistingCountsStorage()) in GetCountAtIndex()
103 return subtle::NoBarrier_Load(&counts()[bucket_index]); in GetCountAtIndex()
119 if (counts() || MountExistingCountsStorage()) { in Iterator()
[all …]
|
| /external/rust/android-crates-io/crates/h2/src/proto/streams/ |
| D | send.rs | 2 store, Buffer, Codec, Config, Counts, Frame, Prioritize, Prioritized, Store, Stream, StreamId,
130 counts: &mut Counts, in send_headers() argument
147 if counts.peer().is_local_init(frame.stream_id()) && !stream.is_pending_push { in send_headers()
177 counts: &mut Counts, in send_reset() argument
233 self.prioritize.reclaim_all_capacity(stream, counts); in send_reset()
240 counts: &mut Counts, in schedule_implicit_reset() argument
250 self.prioritize.reclaim_reserved_capacity(stream, counts); in schedule_implicit_reset()
259 counts: &mut Counts, in send_data() argument
266 .send_data(frame, buffer, stream, counts, task) in send_data()
274 counts: &mut Counts, in send_trailers() argument
[all …]
|
| D | streams.rs | 3 use super::{Buffer, Config, Counts, Prioritized, Recv, Send, Stream, StreamId};
71 counts: Counts, field
146 me.counts.dec_num_remote_reset_streams(); in next_incoming()
174 .clear_expired_reset_streams(&mut me.store, &mut me.counts); in clear_expired_reset_streams()
200 me.counts.apply_remote_settings(frame, is_initial); in apply_remote_settings()
206 &mut me.counts, in apply_remote_settings()
258 if me.counts.peer().is_server() { in send_request()
285 &mut me.counts, in send_request()
305 let is_full = me.counts.next_send_stream_will_reach_capacity(); in send_request()
395 counts: Counts::new(peer, &config), in new()
[all …]
|
| /external/strace/ |
| D | count.c | 47 #define counts (countv[current_personality]) macro
57 if (!counts) in count_syscall()
58 counts = xcalloc(nsyscalls, sizeof(*counts)); in count_syscall()
59 struct call_counts *cc = &counts[tcp->scno]; in count_syscall()
80 return -ts_cmp(&counts[*((int *) a)].time, in time_cmp()
81 &counts[*((int *) b)].time); in time_cmp()
95 int m = counts[*((int *) a)].calls; in count_cmp()
96 int n = counts[*((int *) b)].calls; in count_cmp()
149 if (counts == NULL || counts[i].calls == 0) in call_summary_pers()
151 ts_mul(&dtv, &overhead, counts[i].calls); in call_summary_pers()
[all …]
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/IPO/ |
| D | SyntheticCountsPropagation.cpp | 1 //=- SyntheticCountsPropagation.cpp - Propagate function counts --*- C++ -*-=//
9 // This file implements a transformation that synthesizes entry counts for
11 // counts. The presence of !prof metadata with counter name set to
15 // function entry counts in the PGO mode.
18 // counts of all functions and then doing a top-down traversal of the
19 // callgraph-scc to propagate the counts. For each function the set of callsites
22 // count. For non-trivial SCCs, the new counts are computed from the previous
23 // counts and updated in one shot.
40 #define DEBUG_TYPE "synthetic-counts-propagation"
58 // Assign initial synthetic entry counts to functions.
[all …]
|
| /external/cronet/tot/base/metrics/ |
| D | sample_vector.h | 81 // Moves the single-sample value to a mounted "counts" array.
84 // Mounts (creating if necessary) an array of "counts" for multi-value
88 // Mounts "counts" storage that already exists. This does not attempt to move
93 // Creates "counts" storage and returns a span to it. The span's size must
94 // be the number of counts required by the histogram. Ownership of the
99 std::optional<span<HistogramBase::AtomicCount>> counts() { in counts() function
108 std::optional<span<const HistogramBase::AtomicCount>> counts() const { in counts() function
117 void set_counts(span<HistogramBase::AtomicCount> counts) const { in set_counts() argument
118 CHECK_EQ(counts.size(), counts_size_); in set_counts()
119 counts_data_.store(counts.data(), std::memory_order_release); in set_counts()
[all …]
|
| /external/cronet/stable/base/metrics/ |
| D | sample_vector.h | 81 // Moves the single-sample value to a mounted "counts" array.
84 // Mounts (creating if necessary) an array of "counts" for multi-value
88 // Mounts "counts" storage that already exists. This does not attempt to move
93 // Creates "counts" storage and returns a span to it. The span's size must
94 // be the number of counts required by the histogram. Ownership of the
99 std::optional<span<HistogramBase::AtomicCount>> counts() { in counts() function
108 std::optional<span<const HistogramBase::AtomicCount>> counts() const { in counts() function
117 void set_counts(span<HistogramBase::AtomicCount> counts) const { in set_counts() argument
118 CHECK_EQ(counts.size(), counts_size_); in set_counts()
119 counts_data_.store(counts.data(), std::memory_order_release); in set_counts()
[all …]
|
| /external/rappor/bin/ |
| D | decode_dist.R | 23 make_option("--counts", default="", help="Counts file (required)"),
31 make_option("--adjust-counts-hack", dest="adjust_counts_hack",
33 help="Allow the counts file to have more rows than cohorts.
46 if (opts$counts == "") {
47 UsageError("--counts is required.")
89 counts <- ReadCountsFile(opts$counts, params, adjust_counts = opts$adjust_counts_hack) functionVar
90 counts <- AdjustCounts(counts, params)
94 num_reports <- sum(counts[, 1])
99 res <- Decode(counts, map$map, params, correction = opts$correction,
117 …histogram$counts <- histogram$counts / sum(histogram$counts) # convert the histogram to frequenci…
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/ |
| D | SyntheticCountsPropagation.cpp | 1 //=- SyntheticCountsPropagation.cpp - Propagate function counts --*- C++ -*-=//
9 // This file implements a transformation that synthesizes entry counts for
11 // counts. The presence of !prof metadata with counter name set to
15 // function entry counts in the PGO mode.
18 // counts of all functions and then doing a top-down traversal of the
19 // callgraph-scc to propagate the counts. For each function the set of callsites
22 // count. For non-trivial SCCs, the new counts are computed from the previous
23 // counts and updated in one shot.
46 #define DEBUG_TYPE "synthetic-counts-propagation"
64 // Assign initial synthetic entry counts to functions.
[all …]
|
| /external/pigweed/pw_async/ |
| D | fake_dispatcher_test.cc | 48 CallCounts counts; member
52 this->counts.ok++; in fn()
54 this->counts.cancelled++; in fn()
65 EXPECT_EQ(counter.counts, CallCounts{}); in TEST()
74 EXPECT_EQ(counter.counts, CallCounts{.ok = 1}); in TEST()
84 EXPECT_EQ(counter.counts, CallCounts{.ok = 1}); in TEST()
93 EXPECT_EQ(counter.counts, CallCounts{.ok = 1}); in TEST()
96 EXPECT_EQ(counter.counts, CallCounts{.ok = 2}); in TEST()
108 EXPECT_EQ(counter_1.counts, CallCounts{.ok = 1}); in TEST()
109 EXPECT_EQ(counter_2.counts, CallCounts{.ok = 1}); in TEST()
[all …]
|
| /external/sdv/vsomeip/third_party/boost/any/test/ |
| D | any_test_rv.cpp | 123 "checking copy counts"); in test_move_construction()
126 "checking move counts"); in test_move_construction()
143 "checking copy counts"); in test_move_assignment()
146 "checking move counts"); in test_move_assignment()
162 "checking copy counts"); in test_copy_construction()
165 "checking move counts"); in test_copy_construction()
182 "checking copy counts"); in test_copy_assignment()
185 "checking move counts"); in test_copy_assignment()
206 "checking copy counts"); in test_move_construction_from_value()
209 "checking move counts"); in test_move_construction_from_value()
[all …]
|