Home
last modified time | relevance | path

Searched full:counts (Results 1 – 25 of 8912) sorted by relevance

12345678910>>...357

/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/stat/inference/
H A DChiSquareTest.java53 * 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 &ge; 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 …]
H A DGTest.java48 * 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 &ge; 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 …]
/aosp_15_r20/build/soong/ui/status/
H A Dstatus_test.go19 type counterOutput Counts
21 func (c *counterOutput) StartAction(action *Action, counts Counts) { argument
22 *c = counterOutput(counts)
24 func (c *counterOutput) FinishAction(result ActionResult, counts Counts) { argument
25 *c = counterOutput(counts)
35 func (c counterOutput) Expect(t *testing.T, counts Counts) { argument
36 if Counts(c) == counts {
41 if c.TotalActions != counts.TotalActions {
42 t.Errorf("Expected %d total edges, but got %d", counts.TotalActions, c.TotalActions)
44 if c.RunningActions != counts.RunningActions {
[all …]
H A Dstatus.go15 // Package status tracks actions run by various tools, combining the counts
97 // Counts describes the number of actions in each state
98 type Counts struct { struct
205 // called. counts will include the current counters across all
207 StartAction(action *Action, counts Counts) argument
210 // is called. counts will include the current counters across all
212 FinishAction(result ActionResult, counts Counts) argument
231 counts Counts member
234 // Protects counts and outputs, and allows each output to
275 s.counts.TotalActions += diff
[all …]
H A Dlog.go93 func (v *verboseLog) StartAction(action *Action, counts Counts) {}
95 func (v *verboseLog) FinishAction(result ActionResult, counts Counts) {
101 v.queueWrite(fmt.Sprintf("[%d/%d] ", counts.FinishedActions, counts.TotalActions), cmd, "\n")
143 func (e *errorLog) StartAction(action *Action, counts Counts) {}
145 func (e *errorLog) FinishAction(result ActionResult, counts Counts) {
205 func (e *errorProtoLog) StartAction(action *Action, counts Counts) {}
207 func (e *errorProtoLog) FinishAction(result ActionResult, counts Counts) {
254 func (b *buildProgressLog) StartAction(action *Action, counts Counts) {
255 b.updateCounters(counts)
258 func (b *buildProgressLog) FinishAction(result ActionResult, counts Counts) {
[all …]
/aosp_15_r20/frameworks/base/libs/hwui/tests/unit/
H A DWebViewFunctorManagerTests.cpp43 auto counts = TestUtils::copyCountsForFunctor(functor); in TEST() local
45 EXPECT_EQ(0, counts.contextDestroyed); in TEST()
46 EXPECT_EQ(1, counts.destroyed); in TEST()
62 auto counts = TestUtils::copyCountsForFunctor(functor); in TEST() local
63 EXPECT_EQ(0, counts.sync); in TEST()
64 EXPECT_EQ(0, counts.contextDestroyed); in TEST()
65 EXPECT_EQ(0, counts.destroyed); in TEST()
72 counts = TestUtils::copyCountsForFunctor(functor); in TEST()
73 EXPECT_EQ(1, counts.sync); in TEST()
80 counts = TestUtils::copyCountsForFunctor(functor); in TEST()
[all …]
/aosp_15_r20/external/rust/android-crates-io/crates/h2/src/proto/streams/
Dstreams.rs3 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 …]
Dsend.rs2 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 …]
Dprioritize.rs150 counts: &mut Counts, in send_data() argument
200 self.reserve_capacity(0, stream, counts); in send_data()
235 counts: &mut Counts, in reserve_capacity() argument
270 self.assign_connection_capacity(diff, stream, counts); in reserve_capacity()
325 counts: &mut Counts, in recv_connection_window_update() argument
330 self.assign_connection_capacity(inc, store, counts); in recv_connection_window_update()
336 pub fn reclaim_all_capacity(&mut self, stream: &mut store::Ptr, counts: &mut Counts) { in reclaim_all_capacity() argument
343 self.assign_connection_capacity(available, stream, counts); in reclaim_all_capacity()
349 pub fn reclaim_reserved_capacity(&mut self, stream: &mut store::Ptr, counts: &mut Counts) { in reclaim_reserved_capacity() argument
357 self.assign_connection_capacity(reserved, stream, counts); in reclaim_reserved_capacity()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/python/ops/distributions/
H A Ddirichlet_multinomial.py36 _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 …]
H A Dmultinomial.py37 _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 …]
/aosp_15_r20/frameworks/native/libs/ftl/
H A Dsmall_vector_test.cpp466 DestroyCounts(int& live, int& dead) : counts{live, dead} {} in DestroyCounts()
467 DestroyCounts(const DestroyCounts& other) : counts(other.counts) {} in DestroyCounts()
468 DestroyCounts(DestroyCounts&& other) : counts(other.counts) { other.alive = false; } in DestroyCounts()
469 ~DestroyCounts() { ++(alive ? counts.live : counts.dead); } in ~DestroyCounts()
474 } counts; member
486 SmallVector<DestroyCounts, 3> counts; in TEST() local
493 SmallVector<DestroyCounts, 3> counts; in TEST() local
494 counts.emplace_back(live, dead); in TEST()
495 counts.emplace_back(live, dead); in TEST()
496 counts.emplace_back(live, dead); in TEST()
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/python/kernel_tests/random/
H A Drandom_binomial_test.py36 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 …]
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/
H A DChiSquareTest.java33 * 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 …]
H A DChiSquareTestImpl.java58 * 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 …]
/aosp_15_r20/external/libchrome/base/metrics/
H A Dsample_vector.cc18 // 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 …]
/aosp_15_r20/packages/modules/NetworkStack/tests/unit/src/com/android/networkstack/ipmemorystore/
DIpMemoryStoreServiceTest.java388 void onNetworkEventCountRetrieved(Status status, int[] counts);
396 final int[] counts) throws RemoteException {
397 functor.onNetworkEventCountRetrieved(new Status(status), counts);
1164 // Query network event counts for NUD failures within TEST_CLUSTER.
1173 (status, counts) -> {
1174 assertTrue("Retrieve network event counts not successful : "
1176 assertTrue(counts.length == 2);
1177 assertEquals(30, counts[0]);
1178 assertEquals(10, counts[1]);
1187 (status, counts) -> {
[all …]
/aosp_15_r20/external/libvpx/vp9/decoder/
H A Dvp9_decodemv.c35 FRAME_COUNTS *counts = xd->counts; in read_intra_mode_y() local
36 if (counts) ++counts->y_mode[size_group][y_mode]; in read_intra_mode_y()
45 FRAME_COUNTS *counts = xd->counts; in read_intra_mode_uv() local
46 if (counts) ++counts->uv_mode[y_mode][uv_mode]; in read_intra_mode_uv()
54 FRAME_COUNTS *counts = xd->counts; in read_inter_mode() local
55 if (counts) ++counts->inter_mode[ctx][mode]; in read_inter_mode()
66 FRAME_COUNTS *counts = xd->counts; in read_selected_tx_size() local
76 if (counts) ++get_tx_counts(max_tx_size, ctx, &counts->tx)[tx_size]; in read_selected_tx_size()
186 FRAME_COUNTS *counts = xd->counts; in read_skip() local
187 if (counts) ++counts->skip[ctx][skip]; in read_skip()
[all …]
/aosp_15_r20/external/rappor/analysis/R/
H A Ddecode.R42 # sizes for each cohort. Other counts indicated how many times
46 # ests: a matrix of size m by k with estimated counts for the probability
68 v <- cohort_row[-1] # counts for individual bits
70 # true counts. It can be negative or
95 # Transform counts from absolute values to fractional, removing bias due to
101 # this possibility, and set the corresponding counts to 0.
112 # Y: a vector of size km with estimated counts from EstimateBloomCounts().
286 .DecodeBoolean <- function(counts, params, num_reports) { argument
287 # Boolean variables are reported without cohorts and to estimate counts,
288 # first sum up counts across all cohorts and then run EstimateBloomCounts
[all …]
/aosp_15_r20/frameworks/base/services/core/java/com/android/server/power/stats/
H A DBluetoothPowerStatsCollector.java213 UidStats counts = mUidStats.get(uid); in collectBluetoothActivityInfo() local
214 if (counts == null) { in collectBluetoothActivityInfo()
215 counts = new UidStats(); in collectBluetoothActivityInfo()
216 mUidStats.put(uid, counts); in collectBluetoothActivityInfo()
218 counts.rxCount += ut.getRxBytes(); in collectBluetoothActivityInfo()
219 counts.txCount += ut.getTxBytes(); in collectBluetoothActivityInfo()
223 UidStats counts = mUidStats.valueAt(i); in collectBluetoothActivityInfo() local
224 long rxDelta = Math.max(0, counts.rxCount - counts.lastRxCount); in collectBluetoothActivityInfo()
225 counts.lastRxCount = counts.rxCount; in collectBluetoothActivityInfo()
226 counts.rxCount = 0; in collectBluetoothActivityInfo()
[all …]
/aosp_15_r20/frameworks/base/services/tests/powerstatstests/src/com/android/server/power/stats/
H A DLongSamplingCounterArrayTest.java50 private static final long[] COUNTS = {1111, 2222, 3333, 4444}; field in LongSamplingCounterArrayTest
66 updateCounts(COUNTS); in testReadWriteParcel()
73 assertArrayEquals(COUNTS, mCounterArray.mCounts); in testReadWriteParcel()
80 updateCounts(COUNTS); in testReadWriteSummaryParcel()
87 assertArrayEquals(COUNTS, mCounterArray.mCounts); in testReadWriteSummaryParcel()
93 updateCounts(COUNTS); in testOnTimeStarted()
95 assertArrayEquals(COUNTS, mCounterArray.mCounts); in testOnTimeStarted()
100 updateCounts(COUNTS); in testOnTimeStopped()
102 assertArrayEquals(COUNTS, mCounterArray.mCounts); in testOnTimeStopped()
107 updateCounts(COUNTS); in testGetCountsLocked()
[all …]
/aosp_15_r20/external/pigweed/pw_async/
H A Dfake_dispatcher_test.cc48 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 …]
/aosp_15_r20/external/cronet/base/metrics/
H A Dsample_vector.cc30 // storage. Once the full counts storage is allocated, the single-sample must
44 IteratorTemplate(base::span<T> counts, const BucketRanges* bucket_ranges) in IteratorTemplate() argument
45 : counts_(counts), bucket_ranges_(bucket_ranges) { in IteratorTemplate()
153 if (!counts().has_value()) { in Accumulate()
160 // entries in the counts array so move the single-sample. in Accumulate()
161 if (counts().has_value()) { in Accumulate()
198 if (counts().has_value() || MountExistingCountsStorage()) { in TotalCount()
201 // over `counts().value()` directly without creating a dangling reference. in TotalCount()
202 span<const HistogramBase::AtomicCount> counts_span = counts().value(); in TotalCount()
223 if (counts().has_value() || MountExistingCountsStorage()) { in GetCountAtIndex()
[all …]
/aosp_15_r20/external/perfetto/protos/perfetto/metrics/android/
H A Dhwcomposer.proto22 // 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 …]
/aosp_15_r20/external/strace/
H A Dcount.c47 #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 …]

12345678910>>...357