Searched refs:table (Results 1 - 25 of 941) sorted by relevance

1234567891011>>

/external/eigen/doc/snippets/
H A DTutorial_AdvancedInitialization_LinSpaced.cpp1 ArrayXXf table(10, 4);
2 table.col(0) = ArrayXf::LinSpaced(10, 0, 90);
3 table.col(1) = M_PI / 180 * table.col(0);
4 table.col(2) = table.col(1).sin();
5 table.col(3) = table.col(1).cos();
7 std::cout << table << std::endl;
/external/elfutils/src/libdw/
H A Ddwarf_macro_getsrcfiles.c42 Dwarf_Macro_Op_Table *const table = macro->table; local
43 if (table->files == NULL)
45 Dwarf_Off line_offset = table->line_offset;
76 if (__libdw_getsrclines (dbg, line_offset, table->comp_dir,
77 table->is_64bit ? 8 : 4,
78 NULL, &table->files) < 0)
79 table->files = (void *) -1;
82 if (table->files == (void *) -1)
85 *files = table
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractTableReadTest.java36 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest
39 * Creates a table with the specified data.
41 * @param data the table data, repeating the sequence row key, column key,
51 assertEquals(expectedSize, table.size());
56 table = create();
60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
61 assertTrue(table.contains("foo", 1));
62 assertTrue(table.contains("bar", 1));
63 assertTrue(table.contains("foo", 3));
64 assertFalse(table
[all...]
H A DAbstractTableTest.java35 Table<String, Integer, Character> table, Object... data) {
38 table.put(
52 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
54 table.clear();
55 assertEquals(0, table.size());
56 assertFalse(table.containsRow("foo"));
59 table.clear();
66 assertNull(table.put("foo", 1, 'a'));
67 assertNull(table.put("bar", 1, 'b'));
68 assertNull(table
34 populate( Table<String, Integer, Character> table, Object... data) argument
[all...]
H A DArrayTableTest.java45 ArrayTable<String, Integer, Character> table =
47 populate(table, data);
48 return table;
52 assertEquals(9, table.size());
66 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
67 assertTrue(table.contains("foo", 1));
68 assertTrue(table.contains("bar", 1));
69 assertTrue(table.contains("foo", 3));
70 assertTrue(table.contains("foo", 2));
71 assertTrue(table
[all...]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DAbstractTableReadTest.java34 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest
37 * Creates a table with the specified data.
39 * @param data the table data, repeating the sequence row key, column key,
49 assertEquals(expectedSize, table.size());
54 table = create();
58 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
59 assertTrue(table.contains("foo", 1));
60 assertTrue(table.contains("bar", 1));
61 assertTrue(table.contains("foo", 3));
62 assertFalse(table
[all...]
H A DArrayTableTest.java43 ArrayTable<String, Integer, Character> table =
45 populate(table, data);
46 return table;
50 assertEquals(9, table.size());
64 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
65 assertTrue(table.contains("foo", 1));
66 assertTrue(table.contains("bar", 1));
67 assertTrue(table.contains("foo", 3));
68 assertTrue(table.contains("foo", 2));
69 assertTrue(table
[all...]
/external/speex/libspeex/
H A Dfftwrap.h44 void spx_fft_destroy(void *table);
47 void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out);
50 void spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out);
53 void spx_fft_float(void *table, float *in, float *out);
56 void spx_ifft_float(void *table, float *in, float *out);
/external/skia/src/core/
H A DSkFilterProc.h21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table, argument
24 SkASSERT(table);
29 return table[(y << 2) | x];
32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table, argument
35 SkASSERT(table);
40 return table[(y << 2) | x];
43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table, argument
46 SkASSERT(table);
48 return &table[y << 30 >> 28];
66 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table, argument
77 SkGetFilter32Proc22Row(const SkFilter32Proc* table, unsigned y) argument
101 SkGetBilinearFilterPtrProc(const SkFilterPtrProc* table, SkFixed x, SkFixed y) argument
115 SkGetBilinearFilterPtrProcYTable(const SkFilterPtrProc* table, SkFixed y) argument
126 SkGetBilinearFilterPtrXProc(const SkFilterPtrProc* table, SkFixed x) argument
[all...]
/external/icu/icu4c/source/layout/
H A DNonContextualGlyphSubst.h23 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
28 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader2
/external/libdrm/
H A Dxf86drmHash.c1 /* xf86drmHash.c -- Small hash table support for integer -> integer mapping
31 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
35 * 1) The table is power-of-two sized. Prime sized tables are more
37 * sized table, especially when double hashing is not used for collision
40 * 2) The hash computation uses a table of random integers [Hanson97,
45 * With a table size of 512, the current implementation is sufficient for a
49 * naive) approach to dynamic hash table implementation simply creates a
50 * new hash table when necessary, rehashes all the data into the new table,
51 * and destroys the old table
159 HashTablePtr table; local
176 HashTablePtr table = (HashTablePtr)t; local
197 HashFind(HashTablePtr table, unsigned long key, unsigned long *h) argument
227 HashTablePtr table = (HashTablePtr)t; local
240 HashTablePtr table = (HashTablePtr)t; local
262 HashTablePtr table = (HashTablePtr)t; local
279 HashTablePtr table = (HashTablePtr)t; local
296 HashTablePtr table = (HashTablePtr)t; local
329 compute_dist(HashTablePtr table) argument
347 check_table(HashTablePtr table, unsigned long key, unsigned long value) argument
377 HashTablePtr table; local
[all...]
/external/mesa3d/src/glx/
H A Dglxhash.c1 /* glxhash.c -- Small hash table support for integer -> integer mapping
33 * hash table using self-organizing linked lists [Knuth73, pp. 398-399] for
37 * 1) The table is power-of-two sized. Prime sized tables are more
39 * sized table, especially when double hashing is not used for collision
42 * 2) The hash computation uses a table of random integers [Hanson97,
47 * With a table size of 512, the current implementation is sufficient for a
51 * naive) approach to dynamic hash table implementation simply creates a
52 * new hash table when necessary, rehashes all the data into the new table,
53 * and destroys the old table
159 __glxHashTablePtr table; local
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local
201 HashFind(__glxHashTablePtr table, unsigned long key, unsigned long *h) argument
233 __glxHashTablePtr table = (__glxHashTablePtr) t; local
249 __glxHashTablePtr table = (__glxHashTablePtr) t; local
275 __glxHashTablePtr table = (__glxHashTablePtr) t; local
295 __glxHashTablePtr table = (__glxHashTablePtr) t; local
313 __glxHashTablePtr table = (__glxHashTablePtr) t; local
356 compute_dist(__glxHashTablePtr table) argument
377 check_table(__glxHashTablePtr table, unsigned long key, unsigned long value) argument
407 __glxHashTablePtr table; local
[all...]
/external/mesa3d/src/glsl/
H A Dglsl_symbol_table.h43 * type safe and some symbol table invariants.
48 _glsl_symbol_table_destructor (glsl_symbol_table *table) argument
50 table->~glsl_symbol_table();
58 void *table; local
60 table = ralloc_size(ctx, size);
61 assert(table != NULL);
63 ralloc_set_destructor(table, (void (*)(void*)) _glsl_symbol_table_destructor);
65 return table;
71 static void operator delete(void *table) argument
73 ralloc_set_destructor(table, NUL
121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_table
[all...]
/external/mesa3d/src/mesa/main/
H A Dhash.h3 * Generic hash table.
40 extern void _mesa_DeleteHashTable(struct _mesa_HashTable *table);
42 extern void *_mesa_HashLookup(struct _mesa_HashTable *table, GLuint key);
44 extern void _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data);
46 extern void _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key);
49 _mesa_HashDeleteAll(struct _mesa_HashTable *table,
54 _mesa_HashWalk(const struct _mesa_HashTable *table,
58 extern GLuint _mesa_HashFirstEntry(struct _mesa_HashTable *table);
60 extern GLuint _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key);
62 extern void _mesa_HashPrint(const struct _mesa_HashTable *table);
[all...]
H A Dhash.c3 * Generic hash table.
44 #define TABLE_SIZE 1023 /**< Size of lookup table/array */
50 * An entry in the hash table.
60 * The hash table data structure.
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
80 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
81 if (table) {
82 _glthread_INIT_MUTEX(table
99 _mesa_DeleteHashTable(struct _mesa_HashTable *table) argument
127 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key) argument
156 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key) argument
176 _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data) argument
231 _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key) argument
283 _mesa_HashDeleteAll(struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
319 _mesa_HashWalk(const struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument
350 _mesa_HashFirstEntry(struct _mesa_HashTable *table) argument
373 _mesa_HashNextEntry(const struct _mesa_HashTable *table, GLuint key) argument
418 _mesa_HashPrint(const struct _mesa_HashTable *table) argument
447 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable *table, GLuint numKeys) argument
487 _mesa_HashNumEntries(const struct _mesa_HashTable *table) argument
[all...]
/external/bison/lib/
H A Dhash.c1 /* hash - hashing table processing.
20 /* A generic hash table package. */
56 are not empty, there are N_ENTRIES active entries in the table. */
86 /* A hash table contains many internal entries, each holding a pointer to
91 and the current table size. At each slot position in the hash table,
97 entries divided by the table size. Finding the slot for a data is usually
100 larger hash table size (that is, a larger number of buckets) is prone to
103 Long buckets slow down the lookup algorithm. One might use big hash table
105 become inordinate, as unused slots in the hash table tak
150 hash_get_n_buckets(const Hash_table *table) argument
158 hash_get_n_buckets_used(const Hash_table *table) argument
166 hash_get_n_entries(const Hash_table *table) argument
174 hash_get_max_bucket_length(const Hash_table *table) argument
201 hash_table_ok(const Hash_table *table) argument
230 hash_print_statistics(const Hash_table *table, FILE *stream) argument
249 safe_hasher(const Hash_table *table, const void *key) argument
261 hash_lookup(const Hash_table *table, const void *entry) argument
288 hash_get_first(const Hash_table *table) argument
307 hash_get_next(const Hash_table *table, const void *entry) argument
336 hash_get_entries(const Hash_table *table, void **buffer, size_t buffer_size) argument
368 hash_do_for_each(const Hash_table *table, Hash_processor processor, void *processor_data) argument
512 check_tuning(Hash_table *table) argument
598 Hash_table *table; local
653 hash_clear(Hash_table *table) argument
696 hash_free(Hash_table *table) argument
751 allocate_entry(Hash_table *table) argument
776 free_entry(Hash_table *table, struct hash_entry *entry) argument
790 hash_find_entry(Hash_table *table, const void *entry, struct hash_entry **bucket_head, bool delete) argument
943 hash_rehash(Hash_table *table, size_t candidate) argument
1038 hash_insert_if_absent(Hash_table *table, void const *entry, void const **matched_ent) argument
1122 hash_insert0(Hash_table *table, void const *entry, void const **matched_ent) argument
1134 hash_insert(Hash_table *table, void const *entry) argument
1148 hash_delete(Hash_table *table, const void *entry) argument
1212 hash_print(const Hash_table *table) argument
[all...]
/external/javasqlite/src/main/java/SQLite/
H A DBusyHandler.java10 * Invoked when a table is locked by another process
12 * until the table becomes unlocked, or false in order
15 * @param table the name of the locked table
16 * @param count number of times the table was locked
19 public boolean busy(String table, int count); argument
/external/mesa3d/src/glx/tests/
H A Dindirect_api.cpp28 * Tests various apsects of the dispatch table generated by
31 * * No entry in the table should be \c NULL.
33 * * Entries in the table that correspond to "known" functions with GLX
36 * * Entries beyond the end of the "known" part of the table (i.e., entries
40 * * Entries in the table that correspond to "known" functions that lack
713 _glapi_proc *table; member in class:IndirectAPI
719 this->table = (_glapi_proc *) __glXNewIndirectAPI();
725 free(this->table);
726 this->table = NULL;
733 /* __glXNewIndirectAPI determines the size of the dispatch table b
738 _glapi_table *table = __glXNewIndirectAPI(); local
[all...]
/external/valgrind/include/
H A Dpub_tool_hashtable.h3 /*--- A hash table implementation. pub_tool_hashtable.h ---*/
36 /* Generic type for a separately-chained hash table. Via a kind of dodgy
54 /* Make a new table. Allocates the memory with VG_(calloc)(), so can
55 be freed with VG_(free)(). The table starts small but will
60 /* Count the number of nodes in a table. */
61 extern Int VG_(HT_count_nodes) ( const VgHashTable *table );
63 /* Add a node to the table. Duplicate keys are permitted. */
66 /* Looks up a VgHashNode by key in the table.
70 extern void* VG_(HT_lookup) ( const VgHashTable *table, UWord key );
72 /* Removes a VgHashNode by key from the table
[all...]
/external/freetype/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
308 FT_MemTable table; local
427 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument
506 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_Long size, FT_Long delta ) argument
605 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument
680 FT_MemTable table = (FT_MemTable)memory->user; local
716 FT_MemTable table = (FT_MemTable)memory->user; local
742 FT_MemTable table = (FT_MemTable)memory->user; local
824 FT_MemTable table; local
887 FT_MemTable table = (FT_MemTable)memory->user; local
922 FT_MemTable table = (FT_MemTable)memory->user; local
[all...]
/external/pdfium/third_party/freetype/src/base/
H A Dftdbgmem.c226 ft_mem_table_alloc( FT_MemTable table, argument
229 FT_Memory memory = table->memory;
233 memory->user = table->memory_user;
234 block = table->alloc( memory, size );
235 memory->user = table;
242 ft_mem_table_free( FT_MemTable table, argument
245 FT_Memory memory = table->memory;
248 memory->user = table->memory_user;
249 table->free( memory, block );
250 memory->user = table;
307 FT_MemTable table; local
425 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument
504 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_ULong size, FT_Long delta ) argument
603 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument
678 FT_MemTable table = (FT_MemTable)memory->user; local
714 FT_MemTable table = (FT_MemTable)memory->user; local
740 FT_MemTable table = (FT_MemTable)memory->user; local
821 FT_MemTable table; local
884 FT_MemTable table = (FT_MemTable)memory->user; local
920 FT_MemTable table = (FT_MemTable)memory->user; local
[all...]
/external/icu/icu4c/source/samples/layout/
H A DFontTableCache.cpp18 const void *table; member in struct:FontTableCacheEntry
33 fTableCache[i].table = NULL;
40 freeFontTable(fTableCache[i].table);
43 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 LE_DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
72 add(LETag tableTag, const void *table) argument
[all...]
/external/libxml2/
H A Dhash.c51 * A single entry in the hash table
65 * The entire hash table
68 struct _xmlHashEntry *table; member in struct:_xmlHashTable
82 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name, argument
88 value = table->random_seed;
108 return (value % table->size);
112 xmlHashComputeQKey(xmlHashTablePtr table, argument
120 value = table->random_seed;
162 return (value % table->size);
167 * @size: the size of the hash table
175 xmlHashTablePtr table; local
209 xmlHashTablePtr table; local
229 xmlHashGrow(xmlHashTablePtr table, int size) argument
320 xmlHashFree(xmlHashTablePtr table, xmlHashDeallocator f) argument
375 xmlHashAddEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata) argument
392 xmlHashAddEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata) argument
411 xmlHashUpdateEntry(xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f) argument
431 xmlHashUpdateEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f) argument
447 xmlHashLookup(xmlHashTablePtr table, const xmlChar *name) argument
462 xmlHashLookup2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2) argument
478 xmlHashQLookup(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name) argument
496 xmlHashQLookup2(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2) argument
517 xmlHashAddEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata) argument
633 xmlHashUpdateEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f) argument
755 xmlHashLookup3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3) argument
799 xmlHashQLookup3(xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3) argument
845 xmlHashScan(xmlHashTablePtr table, xmlHashScanner f, void *data) argument
861 xmlHashScanFull(xmlHashTablePtr table, xmlHashScannerFull f, void *data) argument
912 xmlHashScan3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data) argument
933 xmlHashScanFull3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data) argument
975 xmlHashCopy(xmlHashTablePtr table, xmlHashCopier f) argument
1017 xmlHashSize(xmlHashTablePtr table) argument
1035 xmlHashRemoveEntry(xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f) argument
1054 xmlHashRemoveEntry2(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f) argument
1074 xmlHashRemoveEntry3(xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) argument
[all...]
/external/chromium-trace/trace-viewer/tracing/tracing/ui/base/
H A Dsortable_table.css6 * /deep/ .sortable-table > thead > tr > td {
/external/lzma/C/
H A D7zCrcOpt.c8 #define CRC_UPDATE_BYTE_2(crc, b) (table[((crc) ^ (b)) & 0xFF] ^ ((crc) >> 8))
10 UInt32 MY_FAST_CALL CrcUpdateT4(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
19 table[0x300 + (v & 0xFF)] ^
20 table[0x200 + ((v >> 8) & 0xFF)] ^
21 table[0x100 + ((v >> 16) & 0xFF)] ^
22 table[0x000 + ((v >> 24))];
29 UInt32 MY_FAST_CALL CrcUpdateT8(UInt32 v, const void *data, size_t size, const UInt32 *table) argument
31 return CrcUpdateT4(v, data, size, table);

Completed in 1380 milliseconds

1234567891011>>