| /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/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 | 23 import com.google.common.collect.Table.Cell;
42 ArrayTable<String, Integer, Character> table = local
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))
283 ArrayTable<String, Integer, Character> table local
289 ArrayTable<String, Integer, Character> table local
301 ArrayTable<String, Integer, Character> table local
325 ArrayTable<String, Integer, Character> table local
353 ArrayTable<String, Integer, Character> table local
380 ArrayTable<String, Integer, Character> table local
394 ArrayTable<String, Integer, Character> table 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/skia/legacy/src/core/ |
| SkFilterProc.h | 21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
24 SkASSERT(table);
29 return table[(y << 2) | x];
32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
35 SkASSERT(table);
40 return table[(y << 2) | x];
43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
46 SkASSERT(table);
48 return &table[y << 30 >> 28];
66 inline SkFilter32Proc SkGetFilter32Proc22(const SkFilter32Proc* table,
[all...] |
| /external/skia/src/core/ |
| SkFilterProc.h | 21 inline SkFilterProc SkGetBilinearFilterProc(const SkFilterProc* table,
24 SkASSERT(table);
29 return table[(y << 2) | x];
32 inline SkFilterProc SkGetBilinearFilterProc22(const SkFilterProc* table,
35 SkASSERT(table);
40 return table[(y << 2) | x];
43 inline const SkFilterProc* SkGetBilinearFilterProc22Row(const SkFilterProc* table,
46 SkASSERT(table);
48 return &table[y << 30 >> 28];
66 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/valgrind/main/coregrind/ |
| m_hashtable.c | 3 /*--- A separately-chained hash table. m_hashtable.c ---*/
49 Bool iterOK; // table safe to iterate over?
50 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;
[all...] |
| /external/bison/lib/ |
| 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 take some space. Th
598 Hash_table *table; local
[all...] |
| /external/icu4c/layout/ |
| NonContextualGlyphSubst.h | 25 LookupTable table; member in struct:NonContextualGlyphSubstitutionHeader
|
| /external/javasqlite/src/main/java/SQLite/ |
| 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);
|
| /external/skia/legacy/include/effects/ |
| SkTableMaskFilter.h | 18 Applies a table lookup on each of the alpha values in the mask.
24 SkTableMaskFilter(const uint8_t table[256]);
27 void setTable(const uint8_t table[256]);
29 /** Utility that sets the gamma table
31 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
33 /** Utility that creates a clipping table: clamps values below min to 0
36 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
39 uint8_t table[256]; local
40 MakeGammaTable(table, gamma);
41 return SkNEW_ARGS(SkTableMaskFilter, (table));
45 uint8_t table[256]; local
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 226 ft_mem_table_alloc( FT_MemTable table,
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,
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
683 FT_MemTable table = (FT_MemTable)memory->user; local
719 FT_MemTable table = (FT_MemTable)memory->user; local
745 FT_MemTable table = (FT_MemTable)memory->user; local
826 FT_MemTable table; local
889 FT_MemTable table = (FT_MemTable)memory->user; local
925 FT_MemTable table = (FT_MemTable)memory->user; local
[all...] |
| /external/chromium-trace/trace-viewer/src/ |
| timeline_analysis_view.css | 14 .analysis-table {
19 .analysis-table > tr > td:first-child {
23 .analysis-table > tr > td {
27 .analysis-table-header {
31 .analysis-table-row {
35 .analysis-table-row:nth-child(2n+0) {
39 .analysis-slice-table-col-0 {
41 .analysis-slice-table-col-1 {
44 .analysis-slices-table-col-0 {
46 .analysis-slices-table-col-1
[all...] |
| /external/skia/include/effects/ |
| SkTableMaskFilter.h | 16 Applies a table lookup on each of the alpha values in the mask.
22 SkTableMaskFilter(const uint8_t table[256]);
25 /** Utility that sets the gamma table
27 static void MakeGammaTable(uint8_t table[256], SkScalar gamma);
29 /** Utility that creates a clipping table: clamps values below min to 0
32 static void MakeClipTable(uint8_t table[256], uint8_t min, uint8_t max);
35 uint8_t table[256]; local
36 MakeGammaTable(table, gamma);
37 return SkNEW_ARGS(SkTableMaskFilter, (table));
41 uint8_t table[256] local
[all...] |
| /external/icu4c/samples/layout/ |
| FontTableCache.cpp | 18 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;
[all...] |
| /external/icu4c/test/letest/ |
| FontTableCache.cpp | 19 const void *table; member in struct:FontTableCacheEntry
34 fTableCache[i].table = NULL;
41 DELETE_ARRAY(fTableCache[i].table);
44 fTableCache[i].table = NULL;
52 void FontTableCache::freeFontTable(const void *table) const
54 DELETE_ARRAY(table);
61 return fTableCache[i].table;
65 const void *table = readFontTable(tableTag); local
67 ((FontTableCache *) this)->add(tableTag, table);
69 return table;
[all...] |
| /external/smack/src/org/xbill/DNS/ |
| Options.java | 27 private static Map table; field in class:Options
62 table = null;
68 if (table == null)
69 table = new HashMap();
70 table.put(option.toLowerCase(), "true");
76 if (table == null)
77 table = new HashMap();
78 table.put(option.toLowerCase(), value.toLowerCase());
84 if (table == null)
86 table.remove(option.toLowerCase())
[all...] |
| /external/libxml2/ |
| hash.c | 55 * A single entry in the hash table
69 * The entire hash table
72 struct _xmlHashEntry *table; member in struct:_xmlHashTable
86 xmlHashComputeKey(xmlHashTablePtr table, const xmlChar *name,
92 value = table->random_seed;
110 return (value % table->size);
114 xmlHashComputeQKey(xmlHashTablePtr table,
122 value = table->random_seed;
162 return (value % table->size);
167 * @size: the size of the hash table
175 xmlHashTablePtr table; local
213 xmlHashTablePtr table; local
[all...] |
| /external/v8/test/cctest/ |
| test-dictionary.cc | 45 Handle<ObjectHashTable> table = FACTORY->NewObjectHashTable(23); local
48 table = PutIntoObjectHashTable(table, a, b);
49 CHECK_EQ(table->NumberOfElements(), 1);
50 CHECK_EQ(table->Lookup(*a), *b);
51 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value());
55 CHECK_EQ(table->NumberOfElements(), 1);
56 CHECK_EQ(table->Lookup(*a), *b);
57 CHECK_EQ(table->Lookup(*b), HEAP->undefined_value());
60 table = PutIntoObjectHashTable(table, a, FACTORY->NewJSArray(13))
106 Handle<ObjectHashSet> table = FACTORY->NewObjectHashSet(1); local
129 Handle<ObjectHashTable> table = FACTORY->NewObjectHashTable(1); local
[all...] |
| /external/chromium/chrome/browser/resources/options/ |
| certificate_manager.css | 7 .certificate-tree-table {
|
| /frameworks/base/graphics/java/android/graphics/ |
| TableMaskFilter.java | 24 public TableMaskFilter(byte[] table) {
25 if (table.length < 256) {
26 throw new RuntimeException("table.length must be >= 256");
28 native_instance = nativeNewTable(table);
43 private static native int nativeNewTable(byte[] table);
|
