| /frameworks/base/tools/aapt2/link/ |
| ProductFilter_test.cpp | 29 ResourceTable table; local
30 ASSERT_TRUE(table.AddResource(
34 ASSERT_TRUE(table.AddResource(
39 ASSERT_TRUE(table.AddResource(
43 ASSERT_TRUE(table.AddResource(
49 ASSERT_TRUE(filter.Consume(context.get(), &table));
52 &table, "android:string/one", land, ""));
54 &table, "android:string/one", land, "tablet"));
56 &table, "android:string/one", port, ""));
58 &table, "android:string/one", port, "tablet"))
64 ResourceTable table; local
90 ResourceTable table; local
114 ResourceTable table; local
[all...] |
| NoDefaultResourceRemover_test.cpp | 25 std::unique_ptr<ResourceTable> table = local
41 ASSERT_TRUE(remover.Consume(context.get(), table.get()));
43 EXPECT_TRUE(table->FindResource(test::ParseNameOrDie("android:string/foo")));
44 EXPECT_FALSE(table->FindResource(test::ParseNameOrDie("android:string/bar")));
45 EXPECT_TRUE(table->FindResource(test::ParseNameOrDie("android:string/bat")));
46 EXPECT_TRUE(table->FindResource(test::ParseNameOrDie("android:string/baz")));
|
| NoDefaultResourceRemover.h | 37 bool Consume(IAaptContext* context, ResourceTable* table) override;
|
| /frameworks/base/tools/aapt2/ |
| ResourceTable_test.cpp | 35 ResourceTable table; local
37 EXPECT_FALSE(table.AddResource(
42 EXPECT_FALSE(table.AddResource(
49 ResourceTable table; local
51 EXPECT_TRUE(table.AddResourceMangled(
57 ResourceTable table; local
59 EXPECT_TRUE(table.AddResource(
64 EXPECT_THAT(test::GetValue<Id>(&table, "android:attr/id"), NotNull());
68 ResourceTable table; local
74 EXPECT_TRUE(table.AddResource
103 ResourceTable table; local
122 ResourceTable table; local
137 ResourceTable table; local
223 ResourceTable table; local
245 ResourceTable table; local
[all...] |
| /toolchain/binutils/binutils-2.27/gas/ |
| hash.c | 1 /* hash.c -- gas hash table code
21 /* This version of the hash table code is a wholescale replacement of
22 the old hash table code, which was fairly bad. This is based on
23 the hash table code in BFD, but optimized slightly for the
25 are stored in the hash table. Instead, it always stores a pointer.
26 The assembler uses the hash table mostly to store symbols, and we
27 don't need to confuse the symbol structure with a hash table
34 /* An entry in a hash table. */
42 table. */
44 /* Pointer being stored in the hash table. *
52 struct hash_entry **table; member in struct:hash_control
[all...] |
| /external/freetype/src/otvalid/ |
| otvmath.c | 5 /* OpenType MATH table validation (body). */
46 otv_MathConstants_validate( FT_Bytes table,
49 FT_Bytes p = table;
69 otv_Device_validate( table + DeviceTableOffset, otvalid );
86 otv_MathItalicsCorrectionInfo_validate( FT_Bytes table,
90 FT_Bytes p = table;
111 otv_Coverage_validate( table + Coverage, otvalid, (FT_Int)cnt );
119 otv_Device_validate( table + DeviceTableOffset, otvalid );
135 otv_MathKern_validate( FT_Bytes table,
138 FT_Bytes p = table;
[all...] |
| otvalid.h | 5 /* OpenType table validation (specification only). */
36 otv_BASE_validate( FT_Bytes table,
42 otv_GDEF_validate( FT_Bytes table,
49 otv_GPOS_validate( FT_Bytes table,
54 otv_GSUB_validate( FT_Bytes table,
61 otv_JSTF_validate( FT_Bytes table,
68 otv_MATH_validate( FT_Bytes table,
|
| /external/freetype/src/autofit/ |
| afangles.c | 81 /* the following table has been automatically generated with */
188 FT_Pos* table )
198 if ( table[j] >= table[j - 1] )
201 swap = table[j];
202 table[j] = table[j - 1];
203 table[j - 1] = swap;
211 AF_Width table,
229 if ( table[j].org >= table[j - 1].org
[all...] |
| /external/skia/src/effects/ |
| SkTableMaskFilter.cpp | 16 explicit SkTableMaskFilterImpl(const uint8_t table[256]);
43 SkTableMaskFilterImpl::SkTableMaskFilterImpl(const uint8_t table[256]) {
44 memcpy(fTable, table, sizeof(fTable));
65 const uint8_t* table = fTable; local
71 dstP[x] = table[srcP[x]];
100 uint8_t table[256]; local
101 if (!buffer.readByteArray(table, 256)) {
104 return sk_sp<SkFlattenable>(SkTableMaskFilter::Create(table));
109 SkMaskFilter* SkTableMaskFilter::Create(const uint8_t table[256]) {
110 return new SkTableMaskFilterImpl(table);
114 uint8_t table[256]; local
120 uint8_t table[256]; local
[all...] |
| /external/skqp/src/effects/ |
| SkTableMaskFilter.cpp | 16 explicit SkTableMaskFilterImpl(const uint8_t table[256]);
43 SkTableMaskFilterImpl::SkTableMaskFilterImpl(const uint8_t table[256]) {
44 memcpy(fTable, table, sizeof(fTable));
65 const uint8_t* table = fTable; local
71 dstP[x] = table[srcP[x]];
100 uint8_t table[256]; local
101 if (!buffer.readByteArray(table, 256)) {
104 return sk_sp<SkFlattenable>(SkTableMaskFilter::Create(table));
109 SkMaskFilter* SkTableMaskFilter::Create(const uint8_t table[256]) {
110 return new SkTableMaskFilterImpl(table);
114 uint8_t table[256]; local
120 uint8_t table[256]; local
[all...] |
| /external/e2fsprogs/lib/et/ |
| com_right.c | 53 if (code >= p->table->base && code < p->table->base + p->table->n_msgs)
54 return p->table->msgs[code - p->table->base];
64 if ((code >= p->table->base) &&
65 (code < p->table->base + p->table->n_msgs)) {
66 strncpy(str, p->table->msgs[code - p->table->base], len)
[all...] |
| /external/google-breakpad/src/common/windows/ |
| dia_util.h | 46 // Finds the first table implementing the COM interface with ID |iid| in the
48 // table is found. On success the table will be returned via |table|.
49 bool FindTable(REFIID iid, IDiaSession* session, void** table);
51 // A templated version of FindTable. Finds the first table implementing type
53 // error or if no such table is found. On success the table will be returned via
54 // |table|.
56 bool FindTable(IDiaSession* session, InterfaceType** table) {
[all...] |
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/m68k/ |
| p2663.s | 5 jsr table(%pc,%d7.w) | wrong
6 jsr %pc@(table-.-2:b,%d7:w) | correct but cryptic
9 table: label
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/mach-o/ |
| dysymtab-1-64.d | 10 table of content: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
11 module table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
12 external reference table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
13 indirect symbol table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
14 external relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
15 local relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
|
| dysymtab-1.d | 10 table of content: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
11 module table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
12 external reference table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
13 indirect symbol table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
14 external relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
15 local relocation table: off: 0x00000000 num: 0.*\(endoff: 0x00000000\)
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/ |
| IntHashtable.java | 15 * Integer hash table.
27 table.remove(new Integer(key));
29 table.put(new Integer(key), new Integer(value));
34 Integer value = table.get(new Integer(key));
40 private Map<Integer, Integer> table = new HashMap<Integer, Integer>(); field in class:IntHashtable
|
| IntStringHashtable.java | 15 * Integer-String hash table. Uses Java Hashtable for now.
27 table.remove(new Integer(key));
29 table.put(new Integer(key), value);
34 String value = table.get(new Integer(key));
40 private Map<Integer, String> table = new HashMap<Integer, String>(); field in class:IntStringHashtable
|
| LongHashtable.java | 26 table.remove(new Long(key));
28 table.put(new Long(key), new Integer(value));
33 Integer value = table.get(new Long(key));
39 private Map<Long, Integer> table = new HashMap<Long, Integer>(); field in class:LongHashtable
|
| /external/tensorflow/tensorflow/core/lib/io/ |
| two_level_iterator.h | 22 namespace table { namespace in namespace:tensorflow
38 } // namespace table
|
| /frameworks/av/media/libstagefright/codecs/amrwb/src/ |
| isp_isf.cpp | 58 approximated by a look-up table and interpolation.
107 /* Look-up table for transformations */
109 /* table of cos(x) in Q15 */
111 static const int16 table[129] = variable
168 /* isp[i] = table[ind]+ ((table[ind+1]-table[ind])*offset) / 128 */
170 L_tmp = mul_16by16_to_int32(table[ind + 1] - table[ind], offset);
171 isp[i] = add_int16(table[ind], (int16)(L_tmp >> 8))
[all...] |
| /frameworks/base/libs/androidfw/tests/ |
| Split_test.cpp | 67 ResTable table; local
69 table.add(basic_contents_.data(), basic_contents_.size()));
76 ResTable table; local
77 table.setParameters(&frenchConfig);
80 table.add(basic_contents_.data(), basic_contents_.size()));
87 ssize_t block = table.getResource(R::string::test1, &val, MAY_NOT_BE_BAG, 0,
105 ResTable table; local
106 table.setParameters(&expectedConfig);
109 table.add(basic_contents_.data(), basic_contents_.size()));
110 ASSERT_EQ(NO_ERROR, table.add(basic_de_fr_contents_.data()
129 ResTable table; local
158 ResTable table; local
188 ResTable table; local
214 ResTable table; local
232 ResTable table; local
253 ResTable table; local
[all...] |
| /toolchain/binutils/binutils-2.27/ld/testsuite/ld-m68hc11/ |
| relax-group.s | 10 ldx #table
14 ldy #table
18 ldx #table+3
23 ldy #table+3
28 ldx #table+6
37 ldy #table+6
53 ldx #table+0xfe
62 ldy #table+0xfe
74 ldx #table+10
79 ldy #table+1
155 table: .long 0 label
[all...] |
| /external/elfutils/lib/ |
| dynamicsizehash.c | 35 NAME name of the hash table structure.
36 TYPE data type of the hash table entries
41 ITERATE iterating over the table entries is possible
53 if (htab->table[idx].hashval != 0)
57 if (htab->table[idx].hashval == hval
58 && COMPARE (htab->table[idx].data, val) == 0)
72 if (htab->table[idx].hashval == hval
73 && COMPARE (htab->table[idx].data, val) == 0)
76 while (htab->table[idx].hashval);
86 if (htab->table[idx].hashval == 0
[all...] |
| /external/libxml2/include/libxml/ |
| hash.h | 3 * Description: This module implements the hash table support used in
19 * The hash table.
112 xmlHashFree (xmlHashTablePtr table,
119 * Add a new entry to the hash table.
122 xmlHashAddEntry (xmlHashTablePtr table,
126 xmlHashUpdateEntry(xmlHashTablePtr table,
131 xmlHashAddEntry2(xmlHashTablePtr table,
136 xmlHashUpdateEntry2(xmlHashTablePtr table,
142 xmlHashAddEntry3(xmlHashTablePtr table,
148 xmlHashUpdateEntry3(xmlHashTablePtr table,
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TreeBasedTableTest.java | 58 TreeBasedTable<String, String, String> table =
60 table.put("a", "b", "c");
61 table.put("c", "b", "a");
62 table.put("a", "a", "d");
64 table.put("b", entry.getKey(), entry.getValue());
66 return table.row("b");
83 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
84 table.put("a", "b", "c");
85 table.put("c", "b", "a");
86 table.put("a", "a", "d")
91 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
110 TreeBasedTable<String, String, String> table = TreeBasedTable.create(); local
131 TreeBasedTable<String, Integer, Character> table = local
142 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create(); local
[all...] |
