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

1234567891011>>

/external/chromium_org/tools/traceline/traceline/
H A Dsyscall_map.h5 // This table is a dump of system call numbers -> function names on an XP
23 std::map<int, const char*> table; local
24 if (1) { // XP table.
25 table[0] = "ntdll.dll!NtAcceptConnectPort";
26 table[1] = "ntdll.dll!NtAccessCheck";
27 table[2] = "ntdll.dll!ZwAccessCheckAndAuditAlarm";
28 table[3] = "ntdll.dll!NtAccessCheckByType";
29 table[4] = "ntdll.dll!NtAccessCheckByTypeAndAuditAlarm";
30 table[5] = "ntdll.dll!NtAccessCheckByTypeResultList";
31 table[
[all...]
/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/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.java42 ArrayTable<String, Integer, Character> table =
44 populate(table, data);
45 return table;
49 assertEquals(9, table.size());
63 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
64 assertTrue(table.contains("foo", 1));
65 assertTrue(table.contains("bar", 1));
66 assertTrue(table.contains("foo", 3));
67 assertTrue(table.contains("foo", 2));
68 assertTrue(table
[all...]
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Dstub_analysis_results.js15 var table = {
19 table.className = className;
20 this.tables.push(table);
21 return table;
24 appendTableHeader: function(table, label) {
25 if (table.tableHeader)
27 table.tableHeader = label;
30 appendSummaryRow: function(table, label, opt_text) {
31 table.rows.push({label: label,
35 appendSpacingRow: function(table) {
[all...]
H A Danalyze_slices.css6 .analysis-slices-table-col-1,
7 .analysis-slices-table-col-2 {
/external/chromium_org/third_party/mesa/src/chromium_gensrc/mesa/
H A Dindirect_init.c31 * Initialize indirect rendering dispatch table.
54 * Create and initialize a new GL dispatch table. The table is initialized
59 _glapi_proc *table; local
65 table = (_glapi_proc *) Xmalloc(entries * sizeof(_glapi_proc));
69 table[i] = (_glapi_proc) NoOp;
76 table[213] = (_glapi_proc) __indirect_glAccum;
77 table[240] = (_glapi_proc) __indirect_glAlphaFunc;
78 table[7] = (_glapi_proc) __indirect_glBegin;
79 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/chromium_org/third_party/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/chromium_org/tools/memory_inspector/memory_inspector/frontends/www_content/css/
H A Dnheap.css5 #nheap-table dl {
10 #nheap-table dt {
13 #nheap-table dd {
/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/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/mesa/src/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/chromium_org/third_party/mesa/src/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...]
/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...]
/external/valgrind/main/coregrind/
H A Dm_hashtable.c3 /*--- A separately-chained hash table. m_hashtable.c ---*/
49 Bool iterOK; // table safe to iterate over?
50 const HChar* name; // name of table (for debugging only)
72 VgHashTable table = VG_(calloc)("hashtable.Hc.1", local
74 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
75 table->n_chains = n_chains;
76 table->n_elements = 0;
77 table->iterOK = True;
78 table->name = name;
80 return table;
142 HT_add_node( VgHashTable table, void* vnode ) argument
158 HT_lookup( VgHashTable table, UWord key ) argument
172 HT_remove( VgHashTable table, UWord key ) argument
197 HT_to_array( VgHashTable table, UInt* n_elems ) argument
220 HT_ResetIter(VgHashTable table) argument
228 HT_Next(VgHashTable table) argument
252 HT_destruct(VgHashTable table, void(*freenode_fn)(void*)) 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/chromium_org/third_party/mesa/src/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/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/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dstack_trace_table_test.cc14 static void CheckTracesAndReset(tcmalloc::StackTraceTable* table, argument
16 void** entries = table->ReadStackTracesAndClear();
23 static void AddTrace(tcmalloc::StackTraceTable* table, argument
31 table->AddTrace(t);
35 tcmalloc::StackTraceTable table; local
37 // Empty table
38 CHECK_EQ(table.depth_total(), 0);
39 CHECK_EQ(table.bucket_total(), 0);
41 CheckTracesAndReset(&table, k1, ARRAYSIZE(k1));
57 AddTrace(&table, t
[all...]

Completed in 737 milliseconds

1234567891011>>