| /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;
|
| /prebuilts/ndk/r11/sources/android/support/src/musl-ctype/ |
| iswpunct.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| iswalpha.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| /prebuilts/ndk/r13/sources/android/support/src/musl-ctype/ |
| iswpunct.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| iswalpha.c | 3 static const unsigned char table[] = { variable
10 return (table[table[wc>>8]*32+((wc&255)>>3)]>>(wc&7))&1;
|
| /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))
|
| /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...] |
| /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/vulkan-validation-layers/loader/ |
| 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->MapMemory = (PFN_vkMapMemory)gpa(dev, "vkMapMemory")
259 VkLayerDispatchTable *table = &dev_table->core_dispatch; 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);
|
| /prebuilts/ndk/r13/sources/third_party/vulkan/src/build-android/generated/include/ |
| vk_dispatch_table_helper.h | 28 VkLayerDispatchTable *table,
31 memset(table, 0, sizeof(*table));
32 table->GetDeviceProcAddr =(PFN_vkGetDeviceProcAddr) gpa(device,"vkGetDeviceProcAddr");
33 table->DestroyDevice = (PFN_vkDestroyDevice) gpa(device, "vkDestroyDevice");
34 table->GetDeviceQueue = (PFN_vkGetDeviceQueue) gpa(device, "vkGetDeviceQueue");
35 table->QueueSubmit = (PFN_vkQueueSubmit) gpa(device, "vkQueueSubmit");
36 table->QueueWaitIdle = (PFN_vkQueueWaitIdle) gpa(device, "vkQueueWaitIdle");
37 table->DeviceWaitIdle = (PFN_vkDeviceWaitIdle) gpa(device, "vkDeviceWaitIdle");
38 table->AllocateMemory = (PFN_vkAllocateMemory) gpa(device, "vkAllocateMemory")
[all...] |
| /external/skia/src/core/ |
| SkFilterProc.h | 20 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
23 SkASSERT(table);
28 return table[(y << 2) | x];
31 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
34 SkASSERT(table);
39 return table[(y << 2) | x];
42 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
45 SkASSERT(table);
47 return &table[y << 30 >> 28];
65 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* 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/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/mesa3d/src/glsl/ |
| glsl_symbol_table.h | 43 * type safe and some symbol table invariants.
48 _glsl_symbol_table_destructor (glsl_symbol_table *table)
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)
73 ralloc_set_destructor(table, NULL)
121 struct _mesa_symbol_table *table; member in struct:glsl_symbol_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);
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...] |
