| /external/freetype/include/freetype/ |
| ftotval.h | 75 * Validate BASE table.
78 * Validate GDEF table.
81 * Validate GPOS table.
84 * Validate GSUB table.
87 * Validate JSTF table.
90 * Validate MATH table.
133 * A pointer to the BASE table.
136 * A pointer to the GDEF table.
139 * A pointer to the GPOS table.
142 * A pointer to the GSUB table
[all...] |
| ftgxval.h | 66 /* Warning: Use FT_VALIDATE_XXX to validate a table. */
92 * for the `table-length' argument of function @FT_TrueTypeGX_Validate.
116 * Validate `feat' table.
119 * Validate `mort' table.
122 * Validate `morx' table.
125 * Validate `bsln' table.
128 * Validate `just' table.
131 * Validate `kern' table.
134 * Validate `opbd' table.
137 * Validate `trak' table
[all...] |
| /external/freetype/src/psaux/ |
| psobjs.h | 50 ps_table_new( PS_Table table,
55 ps_table_add( PS_Table table,
61 ps_table_done( PS_Table table ); variable
65 ps_table_release( PS_Table table ); variable
|
| /external/icu4c/ |
| icu4c.css | 120 p,pre,table,ul,ol,dl {
239 table.newsItem {
276 table.rtable caption {
285 table.rtable tr th {
290 table.rtable tr td {
295 table.rtable tr.broken td {
302 table.rtable tr.rarely td {
336 table.genTable {
343 table.gentable td {
351 table.genTable td.file
[all...] |
| /external/icu4c/layout/ |
| SimpleArrayProcessor.cpp | 29 simpleArrayLookupTable = (const SimpleArrayLookupTable *) &header->table;
|
| SingleTableProcessor.cpp | 29 singleTableLookupTable = (const SingleTableLookupTable *) &header->table;
|
| /external/icu4c/tools/makeconv/ |
| makeconv.h | 30 /* converter table type for writing */
52 (*addTable)(NewConverter *cnvData, UCMTable *table, UConverterStaticData *staticData);
|
| /external/libgsm/ |
| Android.mk | 33 src/table.c
|
| /frameworks/base/media/libeffects/testlibs/ |
| AudioCoefInterpolator.h | 29 // M-dimensional function. The approximation is based on a table of output
32 // Access to values are done by specifying input values in table index units,
39 // inDims An array of size nInDims with the size of the table on each
42 // table The coefficient table. Should be of size:
44 // func([i,j,k]) = table(i,j,k,:)
46 size_t nOutDims, const audio_coef_t * table);
71 // The coefficient table.
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_bridge/ |
| ebt_among.h | 9 * Write-once-read-many hash table, used for checking if a given
22 * hash table, which are stored also in form of pairs of integers
40 int table[257]; member in struct:ebt_mac_wormhash
|
| /external/guava/src/com/google/common/collect/ |
| CustomConcurrentHashMap.java | 51 * <p>The resulting hash table supports full concurrency of retrievals and
54 * and there is <i>not</i> any support for locking the entire table
64 * reflecting the state of the hash table at some point at or since the
150 * other kind of hash table is a relatively slow operation, so, when
151 * possible, it is a good idea to provide estimates of expected table
170 * hint for internal sizing. The table is internally partitioned to try to
174 * as many threads as will ever concurrently modify the table. Using a
291 * reclaimed entries will not be copied over during table expansions, for
325 * entries or expanding the internal table.
540 * The basic strategy is to subdivide the table among Segments
762 volatile AtomicReferenceArray<E> table; field in class:CustomConcurrentHashMap.Impl.Segment
785 AtomicReferenceArray<E> table = this.table; local
848 AtomicReferenceArray<E> table = this.table; local
933 AtomicReferenceArray<E> table = this.table; local
1047 AtomicReferenceArray<E> table = this.table; local
1086 AtomicReferenceArray<E> table = this.table; local
1130 AtomicReferenceArray<E> table = this.table; local
1172 AtomicReferenceArray<E> table = this.table; local
1207 AtomicReferenceArray<E> table = this.table; local
2029 AtomicReferenceArray<E> table = segment.table; local
[all...] |
| /external/webkit/WebCore/rendering/ |
| RenderTableCell.cpp | 93 RenderTableCol* tableCol = table()->colElement(col());
108 // The child cells rely on the grids up in the sections to do their calcPrefWidths work. Normally the sections are set up early, as table
111 table()->recalcSectionsIfNeeded();
184 // If the table grid is dirty, we cannot get reliable information about adjoining cells,
186 // the table is going to recalculate the grid, relayout and repaint its current rect, which
188 if (!table()->collapseBorders() || table()->needsSectionRecalc())
191 bool rtl = table()->style()->direction() == RTL;
198 if (RenderTableCell* before = table()->cellBefore(this)) {
204 if (RenderTableCell* after = table()->cellAfter(this))
[all...] |
| /external/chromium/base/ |
| stats_table.cc | 26 // | Thread names table |
28 // | Thread TID table |
30 // | Thread PID table |
32 // | Counter names table |
49 // the rows and columns of the table to particular threads, locking is
53 // shared-memory table only, and is used when we create new counters (e.g.
55 // data from the table does not require any locking at the shared memory
58 // Each process which accesses the table will create a StatsTable object.
59 // The StatsTable maintains a hash table of the existing counters in the
60 // table for faster lookup. Since the hash table is process specific
94 StatsTable* table; member in struct:__anon2252::StatsTableTLSData
535 StatsTable *table = StatsTable::current(); local
[all...] |
| id_map.h | 22 // pointers to objects. It is implemented as a hash table, optimized for
155 static inline void release_all(HashTable* table) {}
160 static inline void release_all(HashTable* table) {
161 for (typename HashTable::iterator i = table->begin();
162 i != table->end(); ++i) {
165 table->clear();
|
| /external/qemu/ |
| dcache.c | 41 uint32_t **table; member in struct:Dcache
76 // The number of rows in the table = size / (line_size * ways)
87 uint32_t **table = malloc(sizeof(uint32_t *) << log_rows); local
99 table[ii] = &data[ii << log_ways];
101 dcache.table = table;
140 free(dcache.table[0]);
141 free(dcache.table);
143 dcache.table = NULL;
189 if (cache_addr == dcache.table[row][ii])
[all...] |
| /external/iptables/ |
| ip6tables-restore.c | 71 "table '%s'\n", program_name, tablename);
189 /* New table */
190 char *table; local
192 table = strtok(buffer+1, " \t\n");
193 DEBUGP("line %u, table '%s'\n", line, table);
194 if (!table) {
196 "%s: line %u table name invalid\n",
200 strncpy(curtable, table, IP6T_TABLE_MAXNAMELEN);
206 handle = create_handle(table, modprobe)
[all...] |
| iptables-restore.c | 68 "table '%s'\n", program_name, tablename);
192 /* New table */
193 char *table; local
195 table = strtok(buffer+1, " \t\n");
196 DEBUGP("line %u, table '%s'\n", line, table);
197 if (!table) {
199 "%s: line %u table name invalid\n",
203 strncpy(curtable, table, IPT_TABLE_MAXNAMELEN);
209 handle = create_handle(table, modprobe)
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| symbol-table.h | 1 // symbol-table.h
55 void AddTable(SymbolTableImpl* table) {
56 for (size_t i = 0; i < table->symbols_.size(); ++i) {
57 AddSymbol(table->symbols_[i]);
154 // table with the lexical representation L o G.
161 // Construct symbol table with a unique name.
165 SymbolTable(const SymbolTable& table) : impl_(table.impl_) {
180 // Add a symbol with given key to table. A symbol table als
[all...] |
| /external/webkit/WebCore/css/ |
| quirks.css | 34 table {
|
| /frameworks/base/core/tests/coretests/src/android/widget/layout/table/ |
| FixedWidthTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.FixedWidth;
27 * {@link android.widget.layout.table.FixedWidth} is
|
| HorizontalGravityTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.HorizontalGravity;
28 * {@link android.widget.layout.table.HorizontalGravity} is
|
| WeightTest.java | 17 package android.widget.layout.table;
19 import android.widget.layout.table.Weight;
27 * {@link android.widget.layout.table.Weight} is
|
| /external/v8/src/ |
| compilation-cache.cc | 48 // Initial size of each compilation cache table allocated.
171 CompilationCacheTable* table = local
173 result = Handle<CompilationCacheTable>(table);
241 Handle<CompilationCacheTable> table = GetTable(generation); local
242 Handle<Object> probe(table->Lookup(*source));
288 Handle<CompilationCacheTable> table = GetTable(0); local
289 CALL_HEAP_FUNCTION_VOID(table->Put(*source, *boilerplate));
295 // Make sure not to leak the table into the surrounding handle
302 Handle<CompilationCacheTable> table = GetTable(generation); local
303 result = table->LookupEval(*source, *context)
328 Handle<CompilationCacheTable> table = GetTable(0); local
342 Handle<CompilationCacheTable> table = GetTable(generation); local
367 Handle<CompilationCacheTable> table = GetTable(0); local
[all...] |
| /external/clearsilver/python/examples/base/ |
| odb_sqlite.py | 50 cursor.execute("select name from sqlite_master where type='table'")
78 sql = "select sql from sqlite_master where type='table' and name='%s'" % table_name
86 def alterTableToMatch(self, table):
87 tableName = table.getTableName()
91 invalidAppCols, invalidDBCols = table.checkTable(warnflag=0)
104 newcols = table.getAppColumnList()
115 sql = "create temporary table %s (%s)" % (tmpTableName, tmpcolnames)
121 sql = "drop table %s" % tableName
124 sql = table._createTableSQL()
130 sql = "drop table %s" % tmpTableNam
[all...] |
| /external/webkit/WebKit/gtk/WebCoreSupport/ |
| PasteboardHelperGtk.cpp | 154 GtkTargetEntry* table = gtk_target_table_new_from_list(list, &numberOfTargets); local
156 if (numberOfTargets > 0 && table) {
166 gboolean succeeded = gtk_clipboard_set_with_data(clipboard, table, numberOfTargets,
177 if (table)
178 gtk_target_table_free(table, numberOfTargets);
|
