Searched refs:table (Results 201 - 225 of 1368) sorted by relevance

1234567891011>>

/external/icu/icu4c/source/tools/icuswap/
H A Dicuswap.cpp352 ToCEntry *table; local
430 /* check that the itemCount fits, then the ToC table, then at least the header of the last item */
441 /* ToC table does not fit */
506 * Allocate the ToC table and, if necessary, a temporary buffer for
516 * not only the ToC table but also the data items themselves.
524 table=(ToCEntry *)uprv_malloc(itemCount*sizeof(ToCEntry)+length+DEFAULT_PADDING_LENGTH);
525 if(table!=NULL) {
526 outBytes=(uint8_t *)(table+itemCount);
533 table=(ToCEntry *)uprv_malloc(itemCount*sizeof(ToCEntry));
535 if(table
[all...]
/external/autotest/frontend/client/src/autotest/afe/
H A DHostListView.java5 import autotest.common.table.DynamicTable.DynamicTableListener;
6 import autotest.common.table.SelectionManager;
38 protected HostTable table; field in class:HostListView
46 table = new HostTable(new HostDataSource(), true);
47 hostTableDecorator = new HostTableDecorator(table, HOSTS_PER_PAGE);
50 table.setWidgetFactory(selectionManager);
53 table.setClickable(true);
54 table.addListener(new DynamicTableListener() {
69 table.refresh();
/external/freetype/src/sfnt/
H A Dttbdf.c51 if ( bdf->table )
52 FT_FRAME_RELEASE( bdf->table );
75 FT_FRAME_EXTRACT( length, bdf->table ) )
81 bdf->table_end = bdf->table + length;
84 FT_Byte* p = bdf->table;
101 bdf->strings = bdf->table + strings;
105 p = bdf->table + 8;
132 FT_FRAME_RELEASE( bdf->table );
163 p = bdf->table + 8;
/external/pdfium/third_party/freetype/src/sfnt/
H A Dttbdf.c51 if ( bdf->table != NULL )
52 FT_FRAME_RELEASE( bdf->table );
75 FT_FRAME_EXTRACT( length, bdf->table ) )
81 bdf->table_end = bdf->table + length;
84 FT_Byte* p = bdf->table;
101 bdf->strings = bdf->table + strings;
105 p = bdf->table + 8;
132 FT_FRAME_RELEASE( bdf->table );
163 p = bdf->table + 8;
/external/pdfium/third_party/zlib_v128/
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
36 code FAR * FAR *table,
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
47 unsigned used; /* code entries in table used */
53 code here; /* table entr
32 inflate_table( codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work) argument
[all...]
/external/icu/icu4c/source/common/
H A Ducnvmbcs.h58 * (This only works with a utf8Friendly table.)
69 * slightly and optionally adds a table for conversion to MBCS (non-SBCS)
85 * UTF-8 lead byte and middle trail byte. Unlike the older MBCS stage 2 table,
123 * will be able to use the base table and ignore the extension.
125 * The unicodeMask in the static data is part of the base table data structure.
128 * The static data unicodeMask refers only to the base table's properties if
129 * a base table is included.
175 * -- base table name for extension-only table
180 * -- normal base table wit
[all...]
/external/mesa3d/src/compiler/glsl/
H A Dglsl_symbol_table.cpp107 this->table = _mesa_symbol_table_ctor();
114 _mesa_symbol_table_dtor(table);
120 _mesa_symbol_table_push_scope(table);
125 _mesa_symbol_table_pop_scope(table);
130 return _mesa_symbol_table_symbol_scope(table, name) == 0;
156 int added = _mesa_symbol_table_add_symbol(table, v->name, entry);
166 return _mesa_symbol_table_add_symbol(table, v->name, entry) == 0;
172 return _mesa_symbol_table_add_symbol(table, name, entry) == 0;
184 _mesa_symbol_table_add_symbol(table, name, entry) == 0;
203 return _mesa_symbol_table_add_symbol(table,
[all...]
/external/freetype/src/psnames/
H A Dpsmodule.c301 /* Build a table that maps Unicode values to glyph indices. */
304 PS_Unicodes table,
316 /* we first allocate the table */
317 table->num_maps = 0;
318 table->maps = NULL;
320 if ( !FT_NEW_ARRAY( table->maps, num_glyphs + EXTRA_GLYPH_LIST_SIZE ) )
328 map = table->maps;
368 /* now compress the table a bit */
369 count = (FT_UInt)( map - table->maps );
374 FT_FREE( table
303 ps_unicodes_init( FT_Memory memory, PS_Unicodes table, FT_UInt num_glyphs, PS_GetGlyphNameFunc get_glyph_name, PS_FreeGlyphNameFunc free_glyph_name, FT_Pointer glyph_data ) argument
401 ps_unicodes_char_index( PS_Unicodes table, FT_UInt32 unicode ) argument
447 ps_unicodes_char_next( PS_Unicodes table, FT_UInt32 *unicode ) argument
[all...]
/external/mesa3d/src/util/
H A Dhash_table.c36 * Implements an open-addressing, linear-reprobing hash table.
56 * free to avoid exponential performance degradation as the hash table fills
130 ht->table = rzalloc_array(ht, struct hash_entry, ht->size);
135 if (ht->table == NULL) {
144 * Frees the given hash table.
167 * Deletes all entries of the given hash table without deleting the table
178 for (entry = ht->table; entry != ht->table + ht->size; entry++) {
192 /** Sets the value of the key pointer used for deleted entries in the table
264 struct hash_entry *table, *entry; local
[all...]
/external/pdfium/third_party/freetype/src/psnames/
H A Dpsmodule.c298 /* Build a table that maps Unicode values to glyph indices. */
301 PS_Unicodes table,
313 /* we first allocate the table */
314 table->num_maps = 0;
315 table->maps = NULL;
317 if ( !FT_NEW_ARRAY( table->maps, num_glyphs + EXTRA_GLYPH_LIST_SIZE ) )
325 map = table->maps;
365 /* now compress the table a bit */
366 count = (FT_UInt)( map - table->maps );
371 FT_FREE( table
300 ps_unicodes_init( FT_Memory memory, PS_Unicodes table, FT_UInt num_glyphs, PS_GetGlyphNameFunc get_glyph_name, PS_FreeGlyphNameFunc free_glyph_name, FT_Pointer glyph_data ) argument
398 ps_unicodes_char_index( PS_Unicodes table, FT_UInt32 unicode ) argument
444 ps_unicodes_char_next( PS_Unicodes table, FT_UInt32 *unicode ) argument
[all...]
/external/fonttools/Lib/fontTools/
H A Dmerge.py25 assert allowDefault or clazz != DefaultTable, 'Oops, table class not found.'
100 allKeys = set.union(set(), *(vars(table).keys() for table in lst))
112 value = mergeLogic(getattr(table, key, NotImplemented) for table in lst)
334 for i,table in enumerate(tables):
335 for g in table.glyphs.values():
343 g.expand(table)
353 cmapTables = [(t,fontIdx) for fontIdx,table in enumerate(tables) for t in table
[all...]
/external/fonttools/Tools/fontTools/
H A Dmerge.py25 assert allowDefault or clazz != DefaultTable, 'Oops, table class not found.'
100 allKeys = set.union(set(), *(vars(table).keys() for table in lst))
112 value = mergeLogic(getattr(table, key, NotImplemented) for table in lst)
334 for i,table in enumerate(tables):
335 for g in table.glyphs.values():
343 g.expand(table)
353 cmapTables = [(t,fontIdx) for fontIdx,table in enumerate(tables) for t in table
[all...]
/external/icu/icu4c/source/tools/makeconv/
H A Dgencnvex.c40 CnvExtAddTable(NewConverter *cnvData, UCMTable *table, UConverterStaticData *staticData);
51 /* toUnicode (state table in ucm->states) */
126 /* write the header and base table name for an extension-only table */
140 /* write the header and the base table name */
291 * the toUnicode table.
293 * for the base toUnicode table but not for the base fromUnicode table.
294 * The table must be sorted.
298 reduceToUMappings(UCMTable *table) { argument
328 getToUnicodeValue(CnvExtData *extData, UCMTable *table, UCMapping *m) argument
411 generateToUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) argument
549 makeToUTable(CnvExtData *extData, UCMTable *table) argument
586 prepareFromUMappings(UCMTable *table) argument
635 getFromUBytesValue(CnvExtData *extData, UCMTable *table, UCMapping *m) argument
710 generateFromUTable(CnvExtData *extData, UCMTable *table, int32_t start, int32_t limit, int32_t unitIndex, uint32_t defaultValue) argument
929 generateFromUTrie(CnvExtData *extData, UCMTable *table, int32_t mapLength) argument
1010 makeFromUTable(CnvExtData *extData, UCMTable *table) argument
1056 CnvExtAddTable(NewConverter *cnvData, UCMTable *table, UConverterStaticData *staticData) argument
[all...]
/external/flatbuffers/include/flatbuffers/
H A Dreflection.h62 template<typename T> T GetFieldI(const Table &table, argument
65 return table.GetField<T>(field.offset(),
70 template<typename T> T GetFieldF(const Table &table, argument
73 return table.GetField<T>(field.offset(),
78 inline const String *GetFieldS(const Table &table, argument
81 return table.GetPointer<const String *>(field.offset());
85 template<typename T> Vector<T> *GetFieldV(const Table &table, argument
89 return table.GetPointer<Vector<T> *>(field.offset());
95 inline VectorOfAny *GetFieldAnyV(const Table &table, argument
97 return table
101 GetFieldT(const Table &table, const reflection::Field &field) argument
109 GetFieldStruct(const Table &table, const reflection::Field &field) argument
139 GetAnyFieldI(const Table &table, const reflection::Field &field) argument
147 GetAnyFieldF(const Table &table, const reflection::Field &field) argument
158 GetAnyFieldS(const Table &table, const reflection::Field &field, const reflection::Schema *schema) argument
229 GetAnyFieldAddressOf(const Table &table, const reflection::Field &field) argument
243 SetField(Table *table, const reflection::Field &field, T val) argument
258 SetAnyFieldI(Table *table, const reflection::Field &field, int64_t val) argument
267 SetAnyFieldF(Table *table, const reflection::Field &field, double val) argument
276 SetAnyFieldS(Table *table, const reflection::Field &field, const char *val) argument
357 GetUnionType( const reflection::Schema &schema, const reflection::Object &parent, const reflection::Field &unionfield, const Table &table) argument
424 SetFieldT(Table *table, const reflection::Field &field, const uint8_t *val) argument
[all...]
/external/autotest/frontend/client/src/autotest/public/
H A Dtkoclient.css7 /* necessary to get row headers aligned with table */
8 table.spreadsheet-parent td {
12 /* allow headers to scroll with table */
13 table.spreadsheet-headers {
61 .test-attributes .header table {
/external/fmtlib/doc/bootstrap/
H A Dprint.less45 display: table-header-group; // h5bp.com/t
91 .table {
99 .table-bordered {
/external/sfntly/cpp/
H A DCMakeLists.txt47 file(GLOB SFNTLY_TABLE_COMMON_FILES src/sfntly/table/*.h src/sfntly/table/*.cc)
48 file(GLOB SFNTLY_TABLE_BITMAP_FILES src/sfntly/table/bitmap/*.h src/sfntly/table/bitmap/*.cc)
49 file(GLOB SFNTLY_TABLE_CORE_FILES src/sfntly/table/core/*.h src/sfntly/table/core/*.cc)
50 file(GLOB SFNTLY_TABLE_TTF_FILES src/sfntly/table/truetype/*.h src/sfntly/table/truetype/*.cc)
55 source_group(table FILES ${SFNTLY_TABLE_COMMON_FILES})
56 source_group(table\\bitma
[all...]
/external/sfntly/cpp/src/sfntly/table/core/
H A Dhorizontal_metrics_table.cc17 #include "sfntly/table/core/horizontal_metrics_table.h"
108 FontDataTablePtr table = local
110 return table.Detach();
125 HorizontalMetricsTable* table = local
127 table->num_hmetrics_ = num_hmetrics;
133 HorizontalMetricsTable* table = local
135 table->num_glyphs_ = num_glyphs;
/external/flatbuffers/src/
H A Dreflection.cpp74 // Convert the table to a string. This is mostly for debugging purposes,
101 return "(table)";
158 // If your FlatBuffer's root table is not the schema's root table, you should
204 void ResizeTable(const reflection::Object &objectdef, Table *table) { argument
205 if (DagCheck(table))
207 auto vtable = table->GetVTable();
208 // Early out: since all fields inside the table must point forwards in
209 // memory, if the insertion point is before the table we can stop here.
210 auto tableloc = reinterpret_cast<uint8_t *>(table);
352 CopyInline(FlatBufferBuilder &fbb, const reflection::Field &fielddef, const Table &table, size_t align, size_t size) argument
359 CopyTable(FlatBufferBuilder &fbb, const reflection::Schema &schema, const reflection::Object &objectdef, const Table &table, bool use_string_pooling) argument
519 VerifyVector(flatbuffers::Verifier &v, const reflection::Schema &schema, const flatbuffers::Table &table, const reflection::Field &vec_field) argument
597 VerifyObject(flatbuffers::Verifier &v, const reflection::Schema &schema, const reflection::Object &obj, const flatbuffers::Table *table, bool required) argument
[all...]
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3collections.c42 // Interface functions for hash table
47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key);
48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key);
49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key);
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
59 static void antlr3HashFree (pANTLR3_HASH_TABLE table);
131 pANTLR3_HASH_TABLE table; local
195 antlr3HashFree(pANTLR3_HASH_TABLE table) argument
266 antlr3HashSize(pANTLR3_HASH_TABLE table) argument
274 antlr3HashRemoveI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
331 antlr3HashRemove(pANTLR3_HASH_TABLE table, void * key) argument
396 antlr3HashDeleteI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
420 antlr3HashDelete(pANTLR3_HASH_TABLE table, void * key) argument
444 antlr3HashGetI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key) argument
483 antlr3HashGet(pANTLR3_HASH_TABLE table, void * key) argument
523 antlr3HashPutI(pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument
594 antlr3HashPut(pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *)) argument
673 antlr3EnumNew(pANTLR3_HASH_TABLE table) argument
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationSettings.java137 void aliasReordering(CollationData data, int[] codesAndRanges, int codesLength, byte[] table) { argument
149 if(table != null &&
151 !reorderTableHasSplitBytes(table) :
156 reorderTable = table;
158 // Drop ranges before the first split byte. They are reordered by the table.
167 assert(!reorderTableHasSplitBytes(table));
171 assert(table[codesAndRanges[firstSplitByteRangeIndex] >>> 24] == 0);
203 // Write the lead byte permutation table.
205 byte[] table = new byte[256];
212 table[
240 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument
277 reorderTableHasSplitBytes(byte[] table) argument
[all...]
/external/icu/icu4c/source/i18n/
H A Dcollationdata.cpp222 uint8_t table[MAX_NUM_SCRIPT_RANGES]; local
223 uprv_memset(table, 0, sizeof(table));
230 table[index] = 0xff;
235 table[index] = 0xff;
262 lowStart = addLowScriptRange(table, index, lowStart);
295 if(table[index] != 0) { // Duplicate or equivalent script.
299 highLimit = addHighScriptRange(table, index, highLimit);
311 if(table[index] != 0) { // Duplicate or equivalent script.
315 lowStart = addLowScriptRange(table, inde
365 addLowScriptRange(uint8_t table[], int32_t index, int32_t lowStart) const argument
377 addHighScriptRange(uint8_t table[], int32_t index, int32_t highLimit) const argument
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationSettings.java135 void aliasReordering(CollationData data, int[] codesAndRanges, int codesLength, byte[] table) { argument
147 if(table != null &&
149 !reorderTableHasSplitBytes(table) :
154 reorderTable = table;
156 // Drop ranges before the first split byte. They are reordered by the table.
165 assert(!reorderTableHasSplitBytes(table));
169 assert(table[codesAndRanges[firstSplitByteRangeIndex] >>> 24] == 0);
201 // Write the lead byte permutation table.
203 byte[] table = new byte[256];
210 table[
238 setReorderArrays(int[] codes, int[] ranges, int rangesStart, int rangesLength, byte[] table) argument
275 reorderTableHasSplitBytes(byte[] table) argument
[all...]
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h74 * is deleted from the table.
87 /** Internal structure of a hash table bucket, which tracks
101 /** Structure that tracks a hash table
105 /** Indicates whether the table allows duplicate keys
109 /** Number of buckets available in this table
118 /** How many elements currently exist in the table.
122 /** Whether the hash table should strdup the keys it is given or not.
126 /** Pointer to function to completely delete this table
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table);
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, voi
161 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_HASH_ENUM_struct
184 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_LIST_struct
[all...]
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
H A DTable.java12 package org.jacoco.report.internal.html.table;
27 * Renderer for a table of {@link ITableItem}s.
36 * Create a new table without any columns yet.
43 * Adds a new column with the given properties to the table.
71 * Renders a table for the given icon
74 * parent element in which the table is created
76 * items that will make the table rows
78 * the summary of all coverage data items in the table static
83 * base folder of the table
92 final HTMLElement table
99 header(final HTMLElement table, final List<? extends ITableItem> items, final ICoverageNode total) argument
108 footer(final HTMLElement table, final ICoverageNode total, final Resources resources, final ReportOutputFolder base) argument
117 body(final HTMLElement table, final List<? extends ITableItem> items, final Resources resources, final ReportOutputFolder base) argument
[all...]

Completed in 889 milliseconds

1234567891011>>