| /external/python/cpython3/Lib/ |
| statistics.py | 252 # Generate a table of sorted (value, frequency) pairs.
253 table = collections.Counter(iter(data)).most_common()
254 if not table:
255 return table
257 maxfreq = table[0][1]
258 for i in range(1, len(table)):
259 if table[i][1] != maxfreq:
260 table = table[:i]
262 return table
[all...] |
| /frameworks/base/tests/JankBench/scripts/external/ |
| statistics.py | 295 # Generate a table of sorted (value, frequency) pairs.
296 table = collections.Counter(iter(data)).most_common()
297 if not table:
298 return table
300 maxfreq = table[0][1]
301 for i in range(1, len(table)):
302 if table[i][1] != maxfreq:
303 table = table[:i]
305 return table
[all...] |
| /external/e2fsprogs/debugfs/ |
| revoke.c | 66 * belongs to the committing transaction. Accesses to the second hash table
67 * happen only from the kjournald and no other thread touches this table. Also
73 * All users operating on the hash table belonging to the running transaction
76 * the hash table j_revoke_lock is used.
112 /* The revoke table is just a simple hash table of revoke records. */
115 /* It is conceivable that we might want a larger hash table
131 /* Utility functions to maintain the revoke table */
136 struct jbd2_revoke_table_s *table = journal->j_revoke; local
137 int hash_shift = table->hash_shift
232 struct jbd2_revoke_table_s *table; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| revoke.c | 66 * belongs to the committing transaction. Accesses to the second hash table
67 * happen only from the kjournald and no other thread touches this table. Also
73 * All users operating on the hash table belonging to the running transaction
76 * the hash table j_revoke_lock is used.
112 /* The revoke table is just a simple hash table of revoke records. */
115 /* It is conceivable that we might want a larger hash table
131 /* Utility functions to maintain the revoke table */
136 struct jbd2_revoke_table_s *table = journal->j_revoke; local
137 int hash_shift = table->hash_shift
232 struct jbd2_revoke_table_s *table; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RBBIDataWrapper.java | 79 // Index offsets to the fields in a state table row.
88 // Index offsets to header fields of a state table
97 // Bit selectors for the "FLAGS" field of the state table header
118 int fFTable; // forward state transition table.
120 int fRTable; // Offset to the reverse state transition table.
122 int fSFTable; // safe point forward transition table
124 int fSRTable; // safe point reverse transition table
130 int fStatusTable; // Offset to the table of rule status values
141 * RBBI State Table Indexing Function. Given a state number, return the
142 * array index of the start of the state table row for that state
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| RBBIDataWrapper.java | 78 // Index offsets to the fields in a state table row.
87 // Index offsets to header fields of a state table
96 // Bit selectors for the "FLAGS" field of the state table header
117 int fFTable; // forward state transition table.
119 int fRTable; // Offset to the reverse state transition table.
121 int fSFTable; // safe point forward transition table
123 int fSRTable; // safe point reverse transition table
129 int fStatusTable; // Offset to the table of rule status values
140 * RBBI State Table Indexing Function. Given a state number, return the
141 * array index of the start of the state table row for that state
[all...] |
| /external/iptables/iptables/ |
| xtables-translate.c | 144 family2str[h->family], p->table, p->chain);
147 family2str[h->family], p->table, p->chain);
215 char **table, bool restore)
219 .table = *table,
258 family2str[h->family], p.table, p.chain);
260 printf("flush table %s %s\n",
261 family2str[h->family], p.table);
272 printf("list table %s %s\n",
273 family2str[h->family], p.table);
395 char *table = "filter"; local
[all...] |
| /external/opencv/otherlibs/highgui/ |
| bitstrm.cpp | 443 int RLBitStream::GetHuff( const short* table )
450 int table_bits = table[0];
451 val = table[Show(table_bits) + 2];
456 table += val*2;
545 int RMBitStream::GetHuff( const short* table )
552 int table_bits = table[0];
553 val = table[Show(table_bits) + 1];
558 table += val;
589 bool bsCreateDecodeHuffmanTable( const int* src, short* table, int max_size )
619 /* calc offsets of sub tables and whole size of table */
690 int* table = dst; local
[all...] |
| /system/core/fs_mgr/ |
| fs_mgr_verity.cpp | 116 const char *table, uint32_t table_length)
122 // Hash the table
123 SHA256((uint8_t*)table, table_length, hash_buf);
135 LERROR << "Couldn't verify table";
149 verity.table, verity.table_length) == 0 ||
151 verity.table, verity.table_length) == 0) {
158 static int invalidate_table(char *table, size_t table_length)
165 if (table[n++] == ' ') {
173 while (n < table_length && table[n] != ' ') {
174 table[n++] = '0'
186 char *table; member in struct:verity_table_params
[all...] |
| /external/freetype/src/pshinter/ |
| pshalgo.c | 61 /* destroy hints table */
63 psh_hint_table_done( PSH_Hint_Table table,
66 FT_FREE( table->zones );
67 table->num_zones = 0;
68 table->zone = NULL;
70 FT_FREE( table->sort );
71 FT_FREE( table->hints );
72 table->num_hints = 0;
73 table->max_hints = 0;
74 table->sort_global = NULL
1571 PSH_Hint_Table table = &glyph->hint_tables[dimension]; local
1647 PSH_Blue_Table table; local
[all...] |
| /external/shflags/doc/ |
| rst2html.css | 16 .borderless, table.borderless td, table.borderless th {
19 table.borderless td, table.borderless th {
20 /* Override padding for "table.docutils td" with "! important".
21 The right padding separates the table cells. */
245 table.citation {
249 table.docinfo {
253 table.docutils {
258 table.footnote
[all...] |
| /external/skia/tests/ |
| ColorSpaceXformTest.cpp | 139 // Lookup-table based gamma curves
149 float* table = SkTAddOffset<float>(memory, sizeof(SkGammas)); local
150 table[0] = 0.00f;
151 table[1] = 0.05f;
152 table[2] = 0.10f;
153 table[3] = 0.15f;
154 table[4] = 0.25f;
155 table[5] = 0.35f;
156 table[6] = 0.45f;
157 table[7] = 0.60f
228 float* table = SkTAddOffset<float>(memory, sizeof(SkGammas)); local
276 float* table = SkTAddOffset<float>(memory, sizeof(SkColorLookUpTable)); local
[all...] |
| /external/skqp/tests/ |
| ColorSpaceXformTest.cpp | 139 // Lookup-table based gamma curves
149 float* table = SkTAddOffset<float>(memory, sizeof(SkGammas)); local
150 table[0] = 0.00f;
151 table[1] = 0.05f;
152 table[2] = 0.10f;
153 table[3] = 0.15f;
154 table[4] = 0.25f;
155 table[5] = 0.35f;
156 table[6] = 0.45f;
157 table[7] = 0.60f
228 float* table = SkTAddOffset<float>(memory, sizeof(SkGammas)); local
276 float* table = SkTAddOffset<float>(memory, sizeof(SkColorLookUpTable)); local
[all...] |
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowSQLiteDatabase.java | 72 public long insert(String table, String nullColumnHack, ContentValues values) {
73 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_NONE);
77 public long insertOrThrow(String table, String nullColumnHack, ContentValues values) {
80 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_NONE);
84 public long replace(String table, String nullColumnHack, ContentValues values) {
85 return insertWithOnConflict(table, nullColumnHack, values, SQLiteDatabase.CONFLICT_REPLACE);
89 public long insertWithOnConflict(String table, String nullColumnHack,
93 SQLStringAndBindings sqlInsertString = buildInsertString(table, initialValues, conflictAlgorithm);
114 public Cursor query(boolean distinct, String table, String[] columns,
123 String sql = SQLiteQueryBuilder.buildQueryString(distinct, table,
[all...] |
| /external/v8/src/ |
| compilation-cache.cc | 19 // Initial size of each compilation cache table allocated.
47 CompilationCacheTable* table = local
49 result = Handle<CompilationCacheTable>(table, isolate());
99 Handle<CompilationCacheTable> table = GetTable(generation); local
100 table->Remove(*function_info);
151 Handle<CompilationCacheTable> table = GetTable(generation); local
152 InfoVectorPair probe = table->LookupScript(source, context, language_mode);
190 Handle<CompilationCacheTable> table = GetFirstTable(); local
192 table, source, context, language_mode, function_info, literals));
199 // Make sure not to leak the table into the surrounding handl
205 Handle<CompilationCacheTable> table = GetTable(generation); local
222 Handle<CompilationCacheTable> table = GetFirstTable(); local
240 Handle<CompilationCacheTable> table = GetTable(generation); local
262 Handle<CompilationCacheTable> table = GetFirstTable(); local
[all...] |
| /libcore/ojluni/src/main/java/java/lang/ |
| ThreadLocal.java | 293 * very large and long-lived usages, the hash table entries use
296 * the table starts running out of space.
305 * entry can be expunged from table. Such entries are referred to
324 * The table, resized as necessary.
325 * table.length MUST always be a power of two.
327 private Entry[] table; field in class:ThreadLocal.ThreadLocalMap
330 * The number of entries in the table.
366 table = new Entry[INITIAL_CAPACITY];
368 table[i] = new Entry(firstKey, firstValue);
380 Entry[] parentTable = parentMap.table;
[all...] |
| /external/autotest/frontend/client/src/autotest/tko/ |
| FilterSelector.java | 73 private FlexTable table = new FlexTable(); field in class:FilterSelector
123 table.setWidget(0, 0, booleanOpPanel);
124 table.setWidget(1, 0, filtersPanel);
125 table.getFlexCellFormatter().setColSpan(1, 0, 2);
126 table.setWidget(2, 1, addLink);
127 table.getFlexCellFormatter().setHorizontalAlignment(
129 table.setWidget(3, 0, viewer);
130 table.getFlexCellFormatter().setColSpan(3, 0, 2);
131 table.setStylePrimaryName("box");
135 initWidget(table);
[all...] |
| /external/curl/lib/ |
| hash.c | 75 h->table = malloc(slots * sizeof(struct curl_llist));
76 if(h->table) {
78 Curl_llist_init(&h->table[i], (curl_llist_dtor) hash_element_dtor);
100 #define FETCH_LIST(x,y,z) &x->table[x->hash_func(y, z, x->slots)]
190 for(le = (h->table[i])->head;
213 Curl_llist_destroy(&h->table[i], (void *) h);
216 Curl_safefree(h->table);
245 list = &h->table[i];
304 if(h->table[i].head) {
305 iter->current_element = h->table[i].head
[all...] |
| /external/elfutils/lib/ |
| fixedsizehash.h | 1 /* Fixed size hash table with internal linking.
42 TYPE data type of the hash table entries
48 STORE_POINTER if defined the table stores a pointer and not an element
88 } table[0];
92 /* Constructor for the hashing table. */
97 /* We choose a size for the hashing table 150% over the number of
107 /* Adjust the size to be used for the hashing table. */
138 if (htab->table[idx].hval != 0)
143 if (htab->table[idx].hval == hval
144 && COMPARE (data, ENTRYP (htab->table[idx])) == 0
[all...] |
| /external/python/cpython2/Doc/tools/static/ |
| basic.css | 113 table.contentstable {
117 table.contentstable p.biglink {
133 table.indextable td {
138 table.indextable dl, table.indextable dd {
143 table.indextable tr.pcap {
147 table.indextable tr.cap {
252 table.docutils {
257 table.docutils td, table.docutils th
[all...] |
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/codecs/vc1/parser/ |
| vc1parse_ppic_adv.c | 19 * Table 20 of SMPTE 421M after processing up to POSTPROC by
28 const uint8_t *table;
local
38 table = VC1_MVMODE_LOW_TBL;
40 table = VC1_MVMODE_HIGH_TBL;
51 picLayerHeader->MVMODE = table[bit_count];
64 picLayerHeader->MVMODE2 = table[bit_count];
127 * Table 83 of SMPTE 421M after processing up to POSTPROC by
203 * Table 88 of SMPTE 421M after processing up to BFRACTION by
212 const uint8_t *table;
local
257 table = VC1_MVMODE_LOW_TBL;
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/internal/src/ |
| xpos_test.go | 27 MakePos(nil, 0, 0), // same table entry as NoPos
29 MakePos(nil, 10, 20), // same table entry as NoPos
32 MakePos(b3, 123, 0), // same table entry as MakePos(b3, 10, 20)
42 t.Errorf("table length discrepancy: %d != %d", len(tab.baseList), len(tab.indexMap))
47 t.Errorf("got table length %d; want %d", len(tab.baseList), wantLen)
|
| /prebuilts/go/linux-x86/src/cmd/internal/src/ |
| xpos_test.go | 27 MakePos(nil, 0, 0), // same table entry as NoPos
29 MakePos(nil, 10, 20), // same table entry as NoPos
32 MakePos(b3, 123, 0), // same table entry as MakePos(b3, 10, 20)
42 t.Errorf("table length discrepancy: %d != %d", len(tab.baseList), len(tab.indexMap))
47 t.Errorf("got table length %d; want %d", len(tab.baseList), wantLen)
|
| /system/extras/ioshark/ |
| ioshark_bench_mmap.c | 53 struct mmap_io_ent_tab_s table[MMAP_ENTS + 1]; member in struct:mmap_io_ent_s
69 mio->table[mio->num_entries].offset = offset;
70 mio->table[mio->num_entries].len =
72 total_len -= mio->table[mio->num_entries].len;
73 offset += mio->table[mio->num_entries].len;
91 if (mio->table[i].len > 0)
97 iolength = MIN(mio->table[i].len, iolength);
98 *offset = mio->table[i].offset;
99 mio->table[i].offset += iolength;
100 mio->table[i].len -= iolength
[all...] |
| /external/libxcam/cl_kernel/ |
| kernel_bayer_pipe.cl | 8 * gamma_table: RGGB table
88 inline float2 delta_coff (float2 in, __local float *table)
91 out.x = table[(int)(fabs(in.x * 64.0f))];
92 out.y = table[(int)(fabs(in.y * 64.0f))];
97 inline float2 dot_denoise (float2 value, float2 in1, float2 in2, float2 in3, float2 in4, __local float *table, float coff0)
100 coff1 = delta_coff (in1 - value, table);
101 coff2 = delta_coff (in2 - value, table);
102 coff3 = delta_coff (in3 - value, table);
103 coff4 = delta_coff (in4 - value, table);
123 inline float2 dot_denoise_ee (float2 value, float2 in1, float2 in2, float2 in3, float2 in4, __local float *table, float coff0, float2 *egain, CLEeConfig ee_config
[all...] |
