| /external/autotest/client/cros/video/ |
| frame_checksum_utils.py | 16 counts = {}
19 if checksum in counts:
20 counts[checksum] += 1
22 counts[checksum] = 1
24 return counts
|
| /external/libvpx/libvpx/vpx_dsp/ |
| prob.c | 29 const unsigned int *counts,
33 (l <= 0) ? counts[-l]
34 : tree_merge_probs_impl(l, tree, pre_probs, counts, probs);
37 (r <= 0) ? counts[-r]
38 : tree_merge_probs_impl(r, tree, pre_probs, counts, probs);
45 const unsigned int *counts, vpx_prob *probs) {
46 tree_merge_probs_impl(0, tree, pre_probs, counts, probs);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
| 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...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_dictcomps.py | 46 counts = [None] * 5
47 for i in range(len(counts)):
50 counts[i] = sys.gettotalrefcount()
51 print(counts)
|
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /external/python/cpython2/Lib/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /external/python/cpython3/Lib/test/ |
| test_listcomps.py | 140 counts = [None] * 5
141 for i in range(len(counts)):
144 counts[i] = sys.gettotalrefcount()
145 print(counts)
|
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_setcomps.py | 143 counts = [None] * 5
144 for i in range(len(counts)):
147 counts[i] = sys.gettotalrefcount()
148 print(counts)
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/duration/ |
| Period.java | 34 final int[] counts; field in class:Period
170 for (int i = 0; i < counts.length; ++i) {
171 if (counts[i] != 0) {
184 return counts[unit.ordinal] > 0;
195 if (counts[ord] == 0) {
198 return (counts[ord] - 1)/1000f;
259 * the same counts, both extend into the future or both into the
271 for (int i = 0; i < counts.length; ++i) {
272 if (counts[i] != rhs.counts[i])
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
| Period.java | 32 final int[] counts; field in class:Period
168 for (int i = 0; i < counts.length; ++i) {
169 if (counts[i] != 0) {
182 return counts[unit.ordinal] > 0;
193 if (counts[ord] == 0) {
196 return (counts[ord] - 1)/1000f;
257 * the same counts, both extend into the future or both into the
269 for (int i = 0; i < counts.length; ++i) {
270 if (counts[i] != rhs.counts[i])
[all...] |
| /external/tensorflow/tensorflow/contrib/distributions/python/ops/ |
| binomial.py | 33 For each batch member of counts `value`, `P[value]` is the probability that
36 the same counts, the probability includes a combinatorial coefficient.
116 The distribution functions can be evaluated on counts.
119 # counts same shape as p.
120 counts = [1., 2, 3]
121 dist.prob(counts) # Shape [3]
123 # p will be broadcast to [[.2, .3, .8], [.2, .3, .8]] to match counts.
124 counts = [[1., 2, 1], [2, 2, 4]]
125 dist.prob(counts) # Shape [2, 3]
127 # p will be broadcast to shape [5, 7, 3] to match counts
[all...] |
| /frameworks/base/wifi/java/android/net/wifi/ |
| WifiWakeReasonAndCounts.java | 133 WifiWakeReasonAndCounts counts = new WifiWakeReasonAndCounts();
134 counts.totalCmdEventWake = in.readInt();
135 counts.totalDriverFwLocalWake = in.readInt();
136 counts.totalRxDataWake = in.readInt();
138 counts.rxUnicast = in.readInt();
139 counts.rxMulticast = in.readInt();
140 counts.rxBroadcast = in.readInt();
142 counts.icmp = in.readInt();
143 counts.icmp6 = in.readInt();
144 counts.icmp6Ra = in.readInt()
[all...] |
| /external/strace/tests/ |
| readahead.c | 79 static const unsigned long counts[] = { variable
96 for (k = 0; k < ARRAY_SIZE(counts); k++) {
97 rc = readahead(fds[i], offsets[j], counts[k]);
101 counts[k], sprintrc(rc));
|
| /external/strace/tests-m32/ |
| readahead.c | 79 static const unsigned long counts[] = { variable
96 for (k = 0; k < ARRAY_SIZE(counts); k++) {
97 rc = readahead(fds[i], offsets[j], counts[k]);
101 counts[k], sprintrc(rc));
|
| /external/strace/tests-mx32/ |
| readahead.c | 79 static const unsigned long counts[] = { variable
96 for (k = 0; k < ARRAY_SIZE(counts); k++) {
97 rc = readahead(fds[i], offsets[j], counts[k]);
101 counts[k], sprintrc(rc));
|
| /frameworks/base/telecomm/java/android/telecom/Logging/ |
| TimedEvent.java | 31 HashMap<T, Integer> counts = new HashMap<>(); local
35 if (counts.containsKey(entry.getKey())) {
36 counts.put(entry.getKey(), counts.get(entry.getKey()) + 1);
39 counts.put(entry.getKey(), 1);
45 result.put(entry.getKey(), entry.getValue() / counts.get(entry.getKey()));
|
| /frameworks/base/telecomm/java/android/telecom/ |
| TimedEvent.java | 31 HashMap<T, Integer> counts = new HashMap<>(); local
35 if (counts.containsKey(entry.getKey())) {
36 counts.put(entry.getKey(), counts.get(entry.getKey()) + 1);
39 counts.put(entry.getKey(), 1);
45 result.put(entry.getKey(), entry.getValue() / counts.get(entry.getKey()));
|
| /packages/apps/Contacts/tests/src/com/android/contacts/group/ |
| GroupUtilTest.java | 41 int counts[] = new int[]{1, 2, 2, 3, 1, 2}; local
42 assertFalse(GroupUtil.needTrimming(count, positions, counts));
45 counts = new int[]{1, 6, 2, 7, 1, 2, 1, 2};
46 assertTrue(GroupUtil.needTrimming(count, positions, counts));
52 final int[] counts = new int[]{1, 6, 2, 7, 1, 2, 1, 2}; local
55 final ContactsSectionIndexer indexer = new ContactsSectionIndexer(sections, counts);
57 GroupUtil.updateBundle(bundle, indexer, subscriptsList, sections, counts);
67 MoreAsserts.assertEquals("Wrong counts!", newCounts, bundle.getIntArray(Contacts
75 final int[] counts = new int[]{81, 36, 84, 55, 28, 15, 18, 38, 145, 60, 41, 73, 15, 2, 56, local
103 final ContactsSectionIndexer indexer = new ContactsSectionIndexer(sections, counts);
[all...] |
| /external/strace/ |
| count.c | 47 #define counts (countv[current_personality]) macro
61 if (!counts)
62 counts = xcalloc(nsyscalls, sizeof(*counts));
63 cc = &counts[tcp->scno];
108 return -tv_cmp(&counts[*((int *) a)].time,
109 &counts[*((int *) b)].time);
123 int m = counts[*((int *) a)].calls;
124 int n = counts[*((int *) b)].calls;
182 if (counts == NULL || counts[i].calls == 0
[all...] |
| /packages/apps/Contacts/src/com/android/contacts/list/ |
| ContactsSectionIndexer.java | 26 * their respective counts.
40 * @param counts a non-null array of the same size as <code>sections</code>
42 public ContactsSectionIndexer(String[] sections, int[] counts) {
43 if (sections == null || counts == null) {
47 if (sections.length != counts.length) {
49 "The sections and counts arrays must have the same length");
52 // TODO process sections/counts based on current locale and/or specific section titles
55 mPositions = new int[counts.length];
57 for (int i = 0; i < counts.length; i++) {
66 position += counts[i]
[all...] |
| /packages/apps/Dialer/java/com/android/contacts/common/list/ |
| ContactsSectionIndexer.java | 24 * A section indexer that is configured with precomputed section titles and their respective counts.
37 * @param counts a non-null array of the same size as <code>sections</code>
39 public ContactsSectionIndexer(String[] sections, int[] counts) {
40 if (sections == null || counts == null) {
44 if (sections.length != counts.length) {
46 "The sections and counts arrays must have the same length");
49 // TODO process sections/counts based on current locale and/or specific section titles
52 mPositions = new int[counts.length];
54 for (int i = 0; i < counts.length; i++) {
62 position += counts[i]
[all...] |
