/external/eigen/doc/snippets/ |
H A D | Tutorial_AdvancedInitialization_LinSpaced.cpp | 1 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/autotest/frontend/migrations/ |
H A D | 004_add_indexes.py | 10 def get_index_name(table, field): 11 return table + '_' + field 15 for table, field in INDEXES: 17 (get_index_name(table, field), table, field)) 21 for table, field in INDEXES: 23 (get_index_name(table, field), table))
|
H A D | 007_indexes_on_acl_tables.py | 8 def get_index_name(table, field): 9 return table + '_' + field 13 for table, field in INDEXES: 15 (get_index_name(table, field), table, field)) 19 for table, field in INDEXES: 21 (get_index_name(table, field), table))
|
/external/elfutils/libdw/ |
H A D | dwarf_macro_getsrcfiles.c | 40 Dwarf_Macro_Op_Table *const table = macro->table; local 41 if (table->files == NULL) 43 Dwarf_Off line_offset = table->line_offset; 74 if (__libdw_getsrclines (dbg, line_offset, table->comp_dir, 75 table->is_64bit ? 8 : 4, 76 NULL, &table->files) < 0) 77 table->files = (void *) -1; 80 if (table->files == (void *) -1) 83 *files = table [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractTableReadTest.java | 36 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 D | AbstractTableTest.java | 35 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 D | ArrayTableTest.java | 45 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 D | AbstractTableReadTest.java | 34 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 D | ArrayTableTest.java | 43 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/syslinux/gpxe/src/include/gpxe/ |
H A D | tables.h | 92 * table, and then have a function call_init_fns() that simply calls 93 * all functions present in this table. If and only if serial.o gets 101 * our table sections have names of the format @c .tbl.NAME.NN where 102 * @c NAME designates the data structure stored in the table (e.g. @c 105 * symbol indicating "table start", and @c NN=99 is reserved for the 106 * symbol indicating "table end". 173 * Declare a linker table 177 * @ret table Linker table 182 * Get linker table dat [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | hash.h | 3 * 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); 48 extern void _mesa_HashLockMutex(struct _mesa_HashTable *table); 50 extern void _mesa_HashUnlockMutex(struct _mesa_HashTable *table); 52 extern void *_mesa_HashLookupLocked(struct _mesa_HashTable *table, GLuint key); 54 extern void _mesa_HashInsertLocked(struct _mesa_HashTable *table, 57 extern void _mesa_HashRemoveLocked(struct _mesa_HashTable *table, GLuin [all...] |
H A D | hash.c | 3 * Generic hash table. 45 * The hash table needs a particular pointer to be the marker for a key that 46 * was deleted from the table, along with NULL for the "never allocated in the 47 * table" marker. Legacy GL allows any GLuint to be used as a GL object name, 50 * struct hash_table. We tell the hash table to use "1" as the deleted key 51 * value, so that we test the deleted-key-in-the-table path as best we can. 56 * The hash table data structure. 63 /** Value that would be in the table for DELETED_KEY_VALUE. */ 76 * are never deleted, we will never see a collision in the table, because the 77 * table resize 119 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local 155 _mesa_DeleteHashTable(struct _mesa_HashTable *table) argument 176 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key) argument 203 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key) argument 226 _mesa_HashLookupLocked(struct _mesa_HashTable *table, GLuint key) argument 242 _mesa_HashLockMutex(struct _mesa_HashTable *table) argument 255 _mesa_HashUnlockMutex(struct _mesa_HashTable *table) argument 263 _mesa_HashInsert_unlocked(struct _mesa_HashTable *table, GLuint key, void *data) argument 299 _mesa_HashInsertLocked(struct _mesa_HashTable *table, GLuint key, void *data) argument 314 _mesa_HashInsert(struct _mesa_HashTable *table, GLuint key, void *data) argument 333 _mesa_HashRemove_unlocked(struct _mesa_HashTable *table, GLuint key) argument 357 _mesa_HashRemoveLocked(struct _mesa_HashTable *table, GLuint key) argument 363 _mesa_HashRemove(struct _mesa_HashTable *table, GLuint key) argument 380 _mesa_HashDeleteAll(struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument 411 _mesa_HashWalk(const struct _mesa_HashTable *table, void (*callback)(GLuint key, void *data, void *userData), void *userData) argument 442 _mesa_HashPrint(const struct _mesa_HashTable *table) argument 464 _mesa_HashFindFreeKeyBlock(struct _mesa_HashTable *table, GLuint numKeys) argument 500 _mesa_HashNumEntries(const struct _mesa_HashTable *table) argument [all...] |
/external/vulkan-validation-layers/loader/ |
H A D | table_ops.h | 46 VkLayerDispatchTable *table = &dev_table->core_dispatch; local 50 table->GetDeviceProcAddr = 52 table->DestroyDevice = (PFN_vkDestroyDevice)gpa(dev, "vkDestroyDevice"); 53 table->GetDeviceQueue = (PFN_vkGetDeviceQueue)gpa(dev, "vkGetDeviceQueue"); 54 table->QueueSubmit = (PFN_vkQueueSubmit)gpa(dev, "vkQueueSubmit"); 55 table->QueueWaitIdle = (PFN_vkQueueWaitIdle)gpa(dev, "vkQueueWaitIdle"); 56 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle)gpa(dev, "vkDeviceWaitIdle"); 57 table->AllocateMemory = (PFN_vkAllocateMemory)gpa(dev, "vkAllocateMemory"); 58 table->FreeMemory = (PFN_vkFreeMemory)gpa(dev, "vkFreeMemory"); 59 table 259 VkLayerDispatchTable *table = &dev_table->core_dispatch; local 294 loader_lookup_device_dispatch_table(const VkLayerDispatchTable *table, const char *name) argument 561 loader_init_instance_core_dispatch_table(VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa, VkInstance inst) argument 597 loader_init_instance_extension_dispatch_table( VkLayerInstanceDispatchTable *table, PFN_vkGetInstanceProcAddr gpa, VkInstance inst) argument 682 loader_lookup_instance_dispatch_table(const VkLayerInstanceDispatchTable *table, const char *name, bool *found_name) argument [all...] |
/external/libdrm/ |
H A D | xf86drmHash.c | 1 /* 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 109 HashTablePtr table; local 126 HashTablePtr table = (HashTablePtr)t; local 147 HashFind(HashTablePtr table, unsigned long key, unsigned long *h) argument 177 HashTablePtr table = (HashTablePtr)t; local 190 HashTablePtr table = (HashTablePtr)t; local 212 HashTablePtr table = (HashTablePtr)t; local 229 HashTablePtr table = (HashTablePtr)t; local 246 HashTablePtr table = (HashTablePtr)t; local [all...] |
/external/speex/libspeex/ |
H A D | fftwrap.h | 44 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/mesa3d/src/glx/ |
H A D | glxhash.c | 1 /* 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/mockito/src/test/java/org/mockitousage/bugs/varargs/ |
H A D | VarargsAndAnyObjectPicksUpExtraInvocationsTest.java | 22 TableBuilder table; field in class:VarargsAndAnyObjectPicksUpExtraInvocationsTest 27 table.newRow("qux", "foo", "bar", "baz"); 28 table.newRow("abc", "def"); 31 verify(table, times(2)).newRow(anyString(), (String[]) anyVararg()); 37 table.newRow("x", "foo", "bar", "baz"); 38 table.newRow("x", "def"); 41 verify(table, times(2)).newRow(eq("x"), (String[]) anyVararg()); 47 table.newRow("qux", "foo", "bar", "baz"); 48 table.newRow("abc", "def"); 51 verify(table) [all...] |
/external/mesa3d/src/mesa/program/ |
H A D | symbol_table.c | 33 * Link to the next symbol in the table with the same name 41 * Link to the next symbol in the table with the same scope 74 /** Hash table containing all symbols in the symbol table. */ 85 _mesa_symbol_table_pop_scope(struct _mesa_symbol_table *table) argument 87 struct scope_level *const scope = table->current_scope; 90 table->current_scope = scope->next; 91 table->depth--; 97 struct hash_entry *hte = _mesa_hash_table_search(table->ht, 101 * the hash table t 117 _mesa_symbol_table_push_scope(struct _mesa_symbol_table *table) argument 132 find_symbol(struct _mesa_symbol_table *table, const char *name) argument 148 _mesa_symbol_table_symbol_scope(struct _mesa_symbol_table *table, const char *name) argument 163 _mesa_symbol_table_find_symbol(struct _mesa_symbol_table *table, const char *name) argument 175 _mesa_symbol_table_add_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) argument 215 _mesa_symbol_table_replace_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) argument 230 _mesa_symbol_table_add_global_symbol(struct _mesa_symbol_table *table, const char *name, void *declaration) argument 290 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local 304 _mesa_symbol_table_dtor(struct _mesa_symbol_table *table) argument [all...] |
/external/bison/lib/ |
H A D | hash.c | 1 /* 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/flatbuffers/python/flatbuffers/ |
H A D | __init__.py | 16 from .table import Table
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
H A D | package-info.java | 14 * Internal: Sortable HTML table for coverage node elements. 16 package org.jacoco.report.internal.html.table
|
/external/javasqlite/src/main/java/SQLite/ |
H A D | BusyHandler.java | 10 * 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 D | indirect_api.cpp | 28 * 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/clang/test/Analysis/ |
H A D | malloc-overflow2.c | 9 struct table { struct 11 unsigned *table; member in struct:table 15 static int table_build(struct table *t) { 18 t->table = (unsigned *)malloc(sizeof(unsigned) * t->nentry); // expected-warning {{the computation of the size of the memory allocation may overflow}} 28 static int table_build_1(struct table *t) { 29 t->nentry = (sizeof(struct table) * 2 + 31) / 32; 30 t->table = (unsigned *)malloc(sizeof(unsigned) * t->nentry); // no-warning
|
/external/freetype/src/base/ |
H A D | ftdbgmem.c | 226 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 428 ft_mem_table_get_nodep( FT_MemTable table, FT_Byte* address ) argument 507 ft_mem_table_set( FT_MemTable table, FT_Byte* address, FT_Long size, FT_Long delta ) argument 606 ft_mem_table_remove( FT_MemTable table, FT_Byte* address, FT_Long delta ) argument 681 FT_MemTable table = (FT_MemTable)memory->user; local 717 FT_MemTable table = (FT_MemTable)memory->user; local 743 FT_MemTable table = (FT_MemTable)memory->user; local 825 FT_MemTable table; local 888 FT_MemTable table = (FT_MemTable)memory->user; local 923 FT_MemTable table = (FT_MemTable)memory->user; local [all...] |