| /external/srec/seti/sltsEngine/src/ |
| run_seq_lts.c | 144 PHashTable* table = NULL; local
152 rc = PHashTableCreate( &hashArgs, hashName, &table);
156 rc = PHashTableGetValue( table, strings[i], (void**)&old);
158 rc = PHashTablePutValue( table, strings[i], (const void *)i, NULL );
161 return table;
[all...] |
| /external/srec/srec/include/ |
| pre_desc.h | 51 { /* mul-table data types */
80 const prdata *table; member in struct:__anon15442
174 prdata exp_wt[MAX_WTS]; /* weights exp lookup table */
175 mul_table_info mul; /* Mul-table */
176 logadd_table_info add; /* logadd-table */
192 logadd_table_info fbadd; /* logadd-table for ENC */
|
| /external/v8/src/ia32/ |
| disasm-ia32.cc | 183 static InstructionTable table; local
184 return &table;
893 // is not in 'instructions' table.
[all...] |
| /external/v8/test/cctest/ |
| test-regexp.cc | 624 // Enter test data into dispatch table.
626 DispatchTable table; local
630 table.AddRange(CharacterRange(range[j], range[j + 1]), i);
632 // Check that the table looks as we would expect
634 OutSet* outs = table.Get(p);
1398 DispatchTable table; local
1414 DispatchTable table; local
[all...] |
| /external/webkit/Source/JavaScriptCore/wtf/ |
| HashTable.h | 113 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition)
116 addIterator(table, this);
120 HashTableConstIterator(const HashTableType* table, PointerType position, PointerType endPosition, HashItemKnownGoodTag)
123 addIterator(table, this);
234 HashTableIterator(HashTableType* table, PointerType pos, PointerType end) : m_iterator(table, pos, end) { }
235 HashTableIterator(HashTableType* table, PointerType pos, PointerType end, HashItemKnownGoodTag tag) : m_iterator(table, pos, end, tag) { }
323 // in the table.
363 static void deallocateTable(ValueType* table, int size)
485 ValueType* table = m_table; local
532 ValueType* table = m_table; local
584 ValueType* table = m_table; local
644 ValueType* table = m_table; local
[all...] |
| /external/webkit/Source/WebCore/rendering/ |
| RenderTableCell.cpp | 96 if (RenderTableCol* tableCol = table()->colElement(col())) {
113 tableCol = table()->nextColElement(tableCol);
132 // The child cells rely on the grids up in the sections to do their computePreferredLogicalWidths work. Normally the sections are set up early, as table
135 table()->recalcSectionsIfNeeded();
249 // If the table grid is dirty, we cannot get reliable information about adjoining cells,
251 // the table is going to recalculate the grid, relayout and repaint its current rect, which
253 if (!table()->collapseBorders() || table()->needsSectionRecalc())
256 bool rtl = !table()->style()->isLeftToRightDirection();
263 if (RenderTableCell* before = table()->cellBefore(this))
464 RenderTable* table = this->table(); local
530 RenderTable* table = this->table(); local
608 RenderTable* table = this->table(); local
[all...] |
| /external/webkit/Source/WebKit/gtk/tests/ |
| testatk.c | 45 static const char* contentsInTable = "<html><body><table><tr><td>foo</td><td>bar</td></tr></table></body></html>";
47 static const char* contentsInTableWithHeaders = "<html><body><table><tr><th>foo</th><th>bar</th><th colspan='2'>baz</th></tr><tr><th>qux</th><td>1</td><td>2</td><td>3</td></tr><tr><th rowspan='2'>quux</th><td>4</td><td>5</td><td>6</td></tr><tr><td>6</td><td>7</td><td>8</td></tr><tr><th>corge</th><td>9</td><td>10</td><td>11</td></tr></table><table><tr><td>1</td><td>2</td></tr><tr><td>3</td><td>4</td></tr></table></body></html>";
59 static const char* layoutAndDataTables = "<html><body><table><tr><th>Odd</th><th>Even</th></tr><tr><td>1</td><td>2</td></tr></table><table><tr><td>foo</td><td>bar</td></tr></table></body></html>"
842 AtkObject* table = atk_object_ref_accessible_child(axWebView, 0); local
[all...] |
| /frameworks/base/telephony/java/com/android/internal/telephony/ |
| GsmAlphabet.java | 47 * following character should be looked up in the "extended" table.
61 * Using a non-default language locking shift table OR single shift table
67 * Using a non-default language locking shift table AND single shift table
110 * The GSM national language table to use, or 0 for the default 7-bit alphabet.
115 * The GSM national language shift table to use, or 0 for the default 7-bit extension table.
133 * Converts a char to a GSM 7 bit table index.
135 * GSM_EXTENDED_ESCAPE if this character is in the extended table
1448 String table = sLanguageTables[i]; typedefs
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| HashMap.java | 66 * An empty table shared by all zero-capacity maps (typically from default
69 * minimum-sized table.
87 * The hash table. If this hash map contains a mapping for null, it is
88 * not represented this hash table.
90 transient HashMapEntry<K, V>[] table; field in class:HashMap
109 * The table is rehashed when its size exceeds this threshold.
126 table = (HashMapEntry<K, V>[]) EMPTY_TABLE;
146 table = tab;
205 if (table == EMPTY_TABLE) {
206 doubleCapacity(); // Don't do unchecked puts to a shared table
[all...] |
| Hashtable.java | 51 * An empty table shared by all zero-capacity maps (typically from default
54 * minimum-sized table.
72 * The hash table.
74 private transient HashtableEntry<K, V>[] table; field in class:Hashtable
88 * The table is rehashed when its size exceeds this threshold.
106 table = (HashtableEntry<K, V>[]) EMPTY_TABLE;
125 table = tab;
181 if (table == EMPTY_TABLE) {
182 doubleCapacity(); // Don't do unchecked puts to a shared table.
222 result.makeTable(table.length)
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 17 * A hash table supporting full concurrency of retrievals and
23 * and there is <em>not</em> any support for locking the entire table
35 * Enumerations return elements reflecting the state of the hash table
43 * table is internally partitioned to try to permit the indicated
47 * threads as will ever concurrently modify the table. Using a
54 * hash table is a relatively slow operation, so, when possible, it is
55 * a good idea to provide estimates of expected table sizes in
75 * The basic strategy is to subdivide the table among Segments,
76 * each of which itself is a concurrently readable hash table. To
80 * well as elements of segment's table must use volatile access
295 transient volatile HashEntry<K,V>[] table; field in class:ConcurrentHashMap.Segment
[all...] |
| /packages/apps/Gallery2/src/com/android/photos/data/ |
| PhotoProvider.java | 71 * Internal database table used for account information
73 public static final String TABLE = "accounts";
77 public static final Uri CONTENT_URI = Uri.withAppendedPath(BASE_CONTENT_URI, TABLE);
94 /** Internal database table used for basic photo information. */
95 public static final String TABLE = "photos";
97 public static final Uri CONTENT_URI = Uri.withAppendedPath(BASE_CONTENT_URI, TABLE);
133 /** Internal database table used album information. */
134 public static final String TABLE = "albums";
136 public static final Uri CONTENT_URI = Uri.withAppendedPath(BASE_CONTENT_URI, TABLE);
170 /** Internal database table used metadata information. *
295 String table = getTableFromMatch(match, uri); local
320 String table = getTableFromMatch(match, uri); local
339 String table = getTableFromMatch(match, uri); local
391 String table; local
498 String table = getTableFromMatch(match, uri); local
[all...] |
| /packages/providers/TelephonyProvider/src/com/android/providers/telephony/ |
| MmsProvider.java | 283 String table = TABLE_PDU; local
309 table = TABLE_PART;
313 table = TABLE_ADDR;
317 table = TABLE_RATE;
321 table = TABLE_DRM;
333 if (table.equals(TABLE_PDU)) {
367 if ((rowId = db.insert(table, null, finalValues)) <= 0) {
374 } else if (table.equals(TABLE_ADDR)) {
378 if ((rowId = db.insert(table, null, finalValues)) <= 0) {
384 } else if (table.equals(TABLE_PART))
541 String table, extraSelection = null; local
700 String table; local
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| locale_facets.h | 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| locale_facets.h | 698 /// The size of the mask table. It is SCHAR_MAX + 1.
706 * @param table If non-zero, table is used as the per-char mask.
708 * @param del If true, passes ownership of table to this facet.
720 * @param table If non-zero, table is used as the per-char mask.
721 * @param del If true, passes ownership of table to this facet.
731 * This function compares the mask table[c] to @a m.
735 * @return True if m & table[c] is true, false otherwise.
975 table() const throw() function in class:ctype
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| locale_facets.h | 698 /// The size of the mask table. It is SCHAR_MAX + 1.
706 * @param table If non-zero, table is used as the per-char mask.
708 * @param del If true, passes ownership of table to this facet.
720 * @param table If non-zero, table is used as the per-char mask.
721 * @param del If true, passes ownership of table to this facet.
731 * This function compares the mask table[c] to @a m.
735 * @return True if m & table[c] is true, false otherwise.
975 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| locale_facets.h | 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| locale_facets.h | 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| locale_facets.h | 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| locale_facets.h | 697 /// The size of the mask table. It is SCHAR_MAX + 1.
705 * @param table If non-zero, table is used as the per-char mask.
707 * @param del If true, passes ownership of table to this facet.
719 * @param table If non-zero, table is used as the per-char mask.
720 * @param del If true, passes ownership of table to this facet.
730 * This function compares the mask table[c] to @a m.
734 * @return True if m & table[c] is true, false otherwise.
974 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| locale_facets.h | 698 /// The size of the mask table. It is SCHAR_MAX + 1.
706 * @param table If non-zero, table is used as the per-char mask.
708 * @param del If true, passes ownership of table to this facet.
720 * @param table If non-zero, table is used as the per-char mask.
721 * @param del If true, passes ownership of table to this facet.
731 * This function compares the mask table[c] to @a m.
735 * @return True if m & table[c] is true, false otherwise.
975 table() const throw() function in class:ctype
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| locale_facets.h | 699 /// The size of the mask table. It is SCHAR_MAX + 1.
707 * @param __table If non-zero, table is used as the per-char mask.
709 * @param __del If true, passes ownership of table to this facet.
721 * @param __table If non-zero, table is used as the per-char mask.
722 * @param __del If true, passes ownership of table to this facet.
732 * This function compares the mask table[c] to @a __m.
736 * @return True if __m & table[__c] is true, false otherwise.
976 table() const throw() function in class:ctype
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 95 * The basic strategy is to subdivide the table among Segments, each of which itself is a
96 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
169 /** The segments, each of which is a specialized hash table. */
547 * Masks used to compute indices in the following table.
554 * Look-up table for factories.
2088 volatile AtomicReferenceArray<ReferenceEntry<K, V>> table; field in class:LocalCache.Segment
2256 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2444 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2719 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2829 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2863 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3000 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3053 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3100 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3146 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3197 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3239 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3314 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3344 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3378 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3410 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MapMakerInternalMap.java | 76 * The basic strategy is to subdivide the table among Segments, each of which itself is a
77 * concurrently readable hash table. The map supports non-blocking reads and concurrent writes
150 /** The segments, each of which is a specialized hash table. */
516 * Masks used to compute indices in the following table.
522 * Look-up table for factories. First dimension is the reference type. The second dimension is
2094 volatile AtomicReferenceArray<ReferenceEntry<K, V>> table; field in class:MapMakerInternalMap.Segment
2429 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2511 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2543 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2677 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2728 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2773 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2816 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2857 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2929 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2960 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
2997 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
3025 AtomicReferenceArray<ReferenceEntry<K, V>> table = this.table; local
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapMakerInternalMapTest.java | 98 assertEquals(16 / map.segments.length, map.segments[0].table.length());
202 assertEquals(segmentSize, map.segments[i].table.length());
525 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
526 int index = hash & (table.length() - 1);
535 table.set(index, entry);
553 table.set(index, nullEntry);
565 table.set(index, dummy);
576 table.set(index, dummy);
601 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table local
645 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
783 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
823 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
906 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
1040 AtomicReferenceArray<ReferenceEntry<K, V>> table = segment.table; local
1059 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
1091 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
1125 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
1172 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
1475 AtomicReferenceArray<ReferenceEntry<Object, Object>> table = segment.table; local
[all...] |
