| /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/ |
| log2_tab.h | 23 * Purpose : Table for routine Log2().
28 static const Word16 table[33] = variable
|
| isp_isf.tab | 22 /* table of cos(x) in Q15 */
24 static const Word16 table[129] = {
|
| /external/eigen/doc/snippets/ |
| 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/elfutils/libdw/ |
| 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;
51 /* If TABLE->comp_dir is NULL that could mean any of the
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
[all...] |
| /external/autotest/frontend/migrations/ |
| 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))
|
| 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))
|
| 118_add_hqe_indices.py | 11 def get_index_name(table, field):
12 """Formats the index name from a |table| and |field|."""
13 return table + '_' + field
18 for table, field in INDICES:
20 (get_index_name(table, field), table, field))
25 for table, field in INDICES:
27 (get_index_name(table, field), table))
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| AbstractTableReadTest.java | 30 * Test cases for {@link Table} read operations.
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,
47 protected abstract Table<String, Integer, Character>
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))
[all...] |
| AbstractTableTest.java | 26 * Test cases for a {@link Table} implementation supporting reads and writes.
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'))
[all...] |
| ArrayTableTest.java | 25 import com.google.common.collect.Table.Cell;
45 ArrayTable<String, Integer, Character> table = local
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))
287 ArrayTable<String, Integer, Character> table local
293 ArrayTable<String, Integer, Character> table local
305 ArrayTable<String, Integer, Character> table local
329 ArrayTable<String, Integer, Character> table local
357 ArrayTable<String, Integer, Character> table local
384 ArrayTable<String, Integer, Character> table local
399 ArrayTable<String, Integer, Character> table local
[all...] |
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| AbstractTableReadTest.java | 28 * Test cases for {@link Table} read operations.
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,
45 protected abstract Table<String, Integer, Character>
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))
[all...] |
| ArrayTableTest.java | 24 import com.google.common.collect.Table.Cell;
43 ArrayTable<String, Integer, Character> table = local
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))
280 ArrayTable<String, Integer, Character> table local
286 ArrayTable<String, Integer, Character> table local
298 ArrayTable<String, Integer, Character> table local
322 ArrayTable<String, Integer, Character> table local
350 ArrayTable<String, Integer, Character> table local
377 ArrayTable<String, Integer, Character> table local
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/build-android/generated/include/ |
| vk_dispatch_table_helper.h | 28 VkLayerDispatchTable *table,
31 memset(table, 0, sizeof(*table));
33 table->GetDeviceProcAddr = (PFN_vkGetDeviceProcAddr) gpa(device, "vkGetDeviceProcAddr");
34 table->DestroyDevice = (PFN_vkDestroyDevice) gpa(device, "vkDestroyDevice");
35 table->GetDeviceQueue = (PFN_vkGetDeviceQueue) gpa(device, "vkGetDeviceQueue");
36 table->QueueSubmit = (PFN_vkQueueSubmit) gpa(device, "vkQueueSubmit");
37 table->QueueWaitIdle = (PFN_vkQueueWaitIdle) gpa(device, "vkQueueWaitIdle");
38 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle) gpa(device, "vkDeviceWaitIdle");
39 table->AllocateMemory = (PFN_vkAllocateMemory) gpa(device, "vkAllocateMemory")
[all...] |
| /external/syslinux/gpxe/src/include/gpxe/ |
| 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
176 * @v name Table name
177 * @ret table Linker table
[all...] |
| /external/mesa3d/src/mesa/main/ |
| 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, GLuint key)
[all...] |
| 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 resizes itself when it approaches full, and thus key % table_size =
119 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
[all...] |
| /external/libdrm/ |
| 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. The approach in [Larson88] is superior i
109 HashTablePtr table; local
126 HashTablePtr table = (HashTablePtr)t; local
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/ |
| 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/libxkbcommon/xkbcommon/src/ |
| atom.c | 85 darray(struct atom_node) table; member in struct:atom_table
91 struct atom_table *table; local
93 table = calloc(1, sizeof(*table));
94 if (!table)
97 darray_init(table->table);
99 darray_resize0(table->table, 1);
101 return table;
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| lsp_lsf_tbl.cpp | 37 Description: Added #ifdef __cplusplus and removed "extern" from table
80 extern const Word16 table[];
81 const Word16 table[65] = variable
|
| /external/libxkbcommon/xkbcommon/src/compose/ |
| table.c | 25 #include "table.h"
36 struct xkb_compose_table *table; local
43 table = calloc(1, sizeof(*table));
44 if (!table) {
49 table->refcnt = 1;
50 table->ctx = xkb_context_ref(ctx);
52 table->locale = resolved_locale;
53 table->format = format;
54 table->flags = flags
97 struct xkb_compose_table *table; local
130 struct xkb_compose_table *table; local
161 struct xkb_compose_table *table; local
[all...] |
| /external/mesa3d/src/glx/ |
| 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. The approach in [Larson88] is superior i
159 __glxHashTablePtr table; local
178 __glxHashTablePtr table = (__glxHashTablePtr) t; local
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
407 __glxHashTablePtr table; local
[all...] |
| /external/mockito/src/test/java/org/mockitousage/bugs/varargs/ |
| 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).newRow(anyString(), eq("foo"), anyString(), anyString())
[all...] |
| /external/mesa3d/src/mesa/program/ |
| 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)
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 to point to it
290 struct _mesa_symbol_table *table = calloc(1, sizeof(*table)); local
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
| package-info.java | 14 * Internal: Sortable HTML table for coverage node elements.
16 package org.jacoco.report.internal.html.table
|
