| /external/chromium/net/tools/fetch/ |
| fetch_server.cc | 27 StatsTable table("fetchserver", 50, 1000);
28 table.set_current(&table);
43 // Dump the stats table.
45 int counter_max = table.GetMaxCounters();
47 std::string name(table.GetRowName(index));
49 int value = table.GetRowValue(index);
|
| /external/chromium/third_party/icu/source/i18n/ |
| ucol_cnt.cpp | 16 * This module maintains a contraction table structure in expanded form
77 static ContractionTable *addATableElement(CntTable *table, uint32_t *key, UErrorCode *status) {
98 table->elements[table->size] = el;
100 //uhash_put(table->elements, (void *)table->size, el, status);
102 *key = table->size++;
104 if(table->size == table->capacity) {
105 ContractionTable **newElements = (ContractionTable **)uprv_malloc(table->capacity*2*sizeof(ContractionTable *))
[all...] |
| ucol_cnt.h | 16 * This module maintains a contraction table structure in expanded form
63 uprv_cnttab_clone(CntTable *table, UErrorCode *status);
65 uprv_cnttab_close(CntTable *table);
67 /* construct the table for output */
69 uprv_cnttab_constructTable(CntTable *table, uint32_t mainOffset, UErrorCode *status);
70 /* adds more contractions in table. If element is non existant, it creates on. Returns element handle */
72 uprv_cnttab_addContraction(CntTable *table, uint32_t element, UChar codePoint, uint32_t value, UErrorCode *status);
73 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
75 uprv_cnttab_setContraction(CntTable *table, uint32_t element, uint32_t offset, UChar codePoint, uint32_t value, UErrorCode *status);
76 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existant, it creates on. Returns el (…)
[all...] |
| /external/icu4c/i18n/ |
| ucol_cnt.cpp | 16 * This module maintains a contraction table structure in expanded form
77 static ContractionTable *addATableElement(CntTable *table, uint32_t *key, UErrorCode *status) {
98 table->elements[table->size] = el;
100 //uhash_put(table->elements, (void *)table->size, el, status);
102 *key = table->size++;
104 if(table->size == table->capacity) {
105 ContractionTable **newElements = (ContractionTable **)uprv_malloc(table->capacity*2*sizeof(ContractionTable *))
[all...] |
| ucol_cnt.h | 16 * This module maintains a contraction table structure in expanded form
63 uprv_cnttab_clone(CntTable *table, UErrorCode *status);
65 uprv_cnttab_close(CntTable *table);
67 /* construct the table for output */
69 uprv_cnttab_constructTable(CntTable *table, uint32_t mainOffset, UErrorCode *status);
70 /* adds more contractions in table. If element is non existant, it creates on. Returns element handle */
72 uprv_cnttab_addContraction(CntTable *table, uint32_t element, UChar codePoint, uint32_t value, UErrorCode *status);
73 /* sets a part of contraction sequence in table. If element is non existant, it creates on. Returns element handle */
75 uprv_cnttab_setContraction(CntTable *table, uint32_t element, uint32_t offset, UChar codePoint, uint32_t value, UErrorCode *status);
76 /* inserts a part of contraction sequence in table. Sequences behind the offset are moved back. If element is non existant, it creates on. Returns el (…)
[all...] |
| /external/iproute2/ip/ |
| routel | 17 ip route list table "$@" |
26 table=""
40 echo "$network $via $src $proto $scope $dev $table"
57 table=$7;
58 printf(format,network,mask,via,src,proto,scope,dev,table);
|
| /external/e2fsprogs/lib/et/ |
| error_table.h | 19 const struct error_table *table; member in struct:et_list
23 #define ERRCODE_RANGE 8 /* # of bits to shift table number */
|
| com_right.c | 52 if (code >= p->table->base && code < p->table->base + p->table->n_msgs)
53 return p->table->msgs[code - p->table->base];
81 if (et->table->msgs == messages)
87 et->table = tab = &f->tab;
|
| /external/srec/srec/clib/ |
| log_add.c | 56 logtab->table = logtab__table;
58 prdata* table = (prdata *) CALLOC(logtab->add_log_limit + 2, sizeof(prdata), "clib.logadd"); local
59 logtab->table = table;
66 table[ii] = (prdata)(logtab->scale * mul_scale * log(1
69 PRINT_SOME_CODE(" %d,", table[ii]);
74 PLogMessage("L: log table scale is %f\n", (float)logtab->scale);
75 PLogMessage("L: log table has %d entries\n", (int)logtab->add_log_limit);
79 log_report("T: %d %f\n", ii, (float)logtab->table[ii]);
90 ASSERT(logtab->table);
[all...] |
| log_add.h | 32 ASSERT(logtab->table);
34 return (logtab->table[(int)(ival)]);
|
| /external/wpa_supplicant/ |
| eloop.c | 45 struct eloop_sock *table; member in struct:eloop_sock_table
80 static int eloop_sock_table_add_sock(struct eloop_sock_table *table,
86 if (table == NULL)
90 os_realloc(table->table,
91 (table->count + 1) * sizeof(struct eloop_sock));
95 tmp[table->count].sock = sock;
96 tmp[table->count].eloop_data = eloop_data;
97 tmp[table->count].user_data = user_data;
98 tmp[table->count].handler = handler
209 struct eloop_sock_table *table; local
219 struct eloop_sock_table *table; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/amrwb/src/ |
| isp_isf.cpp | 58 approximated by a look-up table and interpolation.
107 /* Look-up table for transformations */
109 /* table of cos(x) in Q15 */
111 const int16 table[129] = variable
168 /* isp[i] = table[ind]+ ((table[ind+1]-table[ind])*offset) / 128 */
170 L_tmp = mul_16by16_to_int32(table[ind + 1] - table[ind], offset);
171 isp[i] = add_int16(table[ind], (int16)(L_tmp >> 8))
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| ListResourceBundle.java | 29 HashMap<String, Object> table; field in class:ListResourceBundle
53 Iterator<String> local = table.keySet().iterator();
65 if (!table.containsKey(next)) {
95 Iterator<String> it = table.keySet().iterator();
114 return table.get(key);
118 if (table == null) {
120 table = new HashMap<String, Object>(contents.length / 3 * 4 + 3);
125 table.put((String) content[0], content[1]);
138 return table.keySet();
|
| /external/elfutils/lib/ |
| dynamicsizehash.c | 20 NAME name of the hash table structure.
21 TYPE data type of the hash table entries
26 ITERATE iterating over the table entries is possible
40 if (htab->table[idx].hashval != 0)
44 if (htab->table[idx].hashval == hval
45 && COMPARE (htab->table[idx].data, val) == 0)
59 if (htab->table[idx].hashval == hval
60 && COMPARE (htab->table[idx].data, val) == 0)
63 while (htab->table[idx].hashval);
73 if (htab->table[idx].hashval == 0
[all...] |
| /external/libxml2/include/libxml/ |
| hash.h | 3 * Description: This module implements the hash table support used in
19 * The hash table.
112 xmlHashFree (xmlHashTablePtr table,
116 * Add a new entry to the hash table.
119 xmlHashAddEntry (xmlHashTablePtr table,
123 xmlHashUpdateEntry(xmlHashTablePtr table,
128 xmlHashAddEntry2(xmlHashTablePtr table,
133 xmlHashUpdateEntry2(xmlHashTablePtr table,
139 xmlHashAddEntry3(xmlHashTablePtr table,
145 xmlHashUpdateEntry3(xmlHashTablePtr table,
[all...] |
| /external/chromium/third_party/icu/source/test/letest/ |
| FontTableCache.h | 29 virtual void freeFontTable(const void *table) const;
33 void add(LETag tableTag, const void *table);
|
| /external/icu4c/samples/layout/ |
| FontTableCache.h | 27 virtual void freeFontTable(const void *table) const;
31 void add(LETag tableTag, const void *table);
|
| /external/icu4c/test/letest/ |
| FontTableCache.h | 29 virtual void freeFontTable(const void *table) const;
33 void add(LETag tableTag, const void *table);
|
| /external/webkit/WebCore/rendering/ |
| TableLayout.h | 32 TableLayout(RenderTable* table)
33 : m_table(table)
|
| /external/skia/src/effects/ |
| SkTableMaskFilter.cpp | 9 SkTableMaskFilter::SkTableMaskFilter(const uint8_t table[256]) {
10 this->setTable(table);
15 void SkTableMaskFilter::setTable(const uint8_t table[256]) {
16 memcpy(fTable, table, 256);
35 const uint8_t* table = fTable; local
41 dstP[x] = table[srcP[x]];
85 void SkTableMaskFilter::MakeGammaTable(uint8_t table[256], SkScalar gamma) {
89 table[i] = SkPin32(SkScalarRound(powf(x, gamma) * 255), 0, 255);
94 void SkTableMaskFilter::MakeClipTable(uint8_t table[256], uint8_t min,
105 memset(table, 0, min + 1)
[all...] |
| /external/guava/src/com/google/common/collect/ |
| RegularImmutableSet.java | 32 @VisibleForTesting final transient Object[] table; field in class:RegularImmutableSet
33 // 'and' with an int to get a valid table index.
38 Object[] elements, int hashCode, Object[] table, int mask) {
40 this.table = table;
50 Object candidate = table[i & mask];
|
| /external/webkit/WebKitTools/pywebsocket/test/ |
| test_mock.py | 96 table = mock.MockTable({'Key':'Value'})
97 self.assertEqual('Value', table.get('KEY'))
98 self.assertEqual('Value', table['key'])
101 table = mock.MockTable([('Key', 'Value')])
102 self.assertEqual('Value', table.get('KEY'))
103 self.assertEqual('Value', table['key'])
106 table = mock.MockTable((('Key', 'Value'),))
107 self.assertEqual('Value', table.get('KEY'))
108 self.assertEqual('Value', table['key'])
111 table = mock.MockTable(
[all...] |
| /external/stlport/src/ |
| time_facets.cpp | 65 // _Init_time_info: initialize table with
69 static void _Init_timeinfo_base(_Time_Info_Base& table) {
70 table._M_time_format = "%H:%M:%S";
71 table._M_date_format = "%m/%d/%y";
72 table._M_date_time_format = "%m/%d/%y";
75 static void _Init_timeinfo(_Time_Info& table) {
78 table._M_dayname[i] = default_dayname[i];
80 table._M_monthname[i] = default_monthname[i];
81 table._M_am_pm[0] = "AM";
82 table._M_am_pm[1] = "PM"
149 const string& format, const _TimeInfo& table, const tm* t) { variable
216 const _TimeInfo& table, const tm* t) { variable
[all...] |
| /ndk/sources/cxx-stl/stlport/src/ |
| time_facets.cpp | 65 // _Init_time_info: initialize table with
69 static void _Init_timeinfo_base(_Time_Info_Base& table) {
70 table._M_time_format = "%H:%M:%S";
71 table._M_date_format = "%m/%d/%y";
72 table._M_date_time_format = "%m/%d/%y";
75 static void _Init_timeinfo(_Time_Info& table) {
78 table._M_dayname[i] = default_dayname[i];
80 table._M_monthname[i] = default_monthname[i];
81 table._M_am_pm[0] = "AM";
82 table._M_am_pm[1] = "PM"
149 const string& format, const _TimeInfo& table, const tm* t) { variable
216 const _TimeInfo& table, const tm* t) { variable
[all...] |
| /external/e2fsprogs/lib/ss/ |
| invocation.c | 32 register ss_data **table; local
35 table = _ss_table;
38 if (table == (ss_data **) NULL) {
39 table = (ss_data **) malloc(2 * size);
40 table[0] = table[1] = (ss_data *)NULL;
44 for (sci_idx = 1; table[sci_idx] != (ss_data *)NULL; sci_idx++)
46 table = (ss_data **) realloc((char *)table,
48 table[sci_idx+1] = (ss_data *) NULL
[all...] |
