| /external/sfntly/cpp/src/sfntly/table/core/ |
| horizontal_metrics_table.cc | 17 #include "sfntly/table/core/horizontal_metrics_table.h"
88 : Table(header, data),
108 FontDataTablePtr table = local
110 return table.Detach();
125 HorizontalMetricsTable* table = local
127 table->num_hmetrics_ = num_hmetrics;
133 HorizontalMetricsTable* table = local
135 table->num_glyphs_ = num_glyphs;
|
| /frameworks/base/tests/testables/src/android/testing/ |
| TestableSettingsProvider.java | 74 final String table = commands[1]; local
76 String k = key(table, arg, userId);
109 private static String key(String table, String key, int userId) {
110 if ("global".equals(table)) {
111 return table + "_" + key;
113 return table + "_" + userId + "_" + key;
|
| /hardware/qcom/gps/msm8084/utils/ |
| loc_log.cpp | 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
|
| /hardware/qcom/gps/msm8909/utils/ |
| loc_log.cpp | 60 const char* loc_get_name_from_mask(const loc_name_val_s_type table[], size_t table_size, long mask)
65 if (table[i].val & (long) mask)
67 return table[i].name;
74 const char* loc_get_name_from_val(const loc_name_val_s_type table[], size_t table_size, long value)
79 if (table[i].val == (long) value)
81 return table[i].name;
|
| /hardware/qcom/gps/msm8960/utils/ |
| loc_log.cpp | 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
|
| /hardware/qcom/gps/msm8994/utils/ |
| loc_log.cpp | 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
|
| /hardware/qcom/gps/msm8996/utils/ |
| loc_log.cpp | 60 const char* loc_get_name_from_mask(const loc_name_val_s_type table[], size_t table_size, long mask)
65 if (table[i].val & (long) mask)
67 return table[i].name;
74 const char* loc_get_name_from_val(const loc_name_val_s_type table[], size_t table_size, long value)
79 if (table[i].val == (long) value)
81 return table[i].name;
|
| /hardware/qcom/gps/msm8998/utils/ |
| loc_log.cpp | 56 const char* loc_get_name_from_mask(const loc_name_val_s_type table[], size_t table_size, long mask)
61 if (table[i].val & (long) mask)
63 return table[i].name;
70 const char* loc_get_name_from_val(const loc_name_val_s_type table[], size_t table_size, long value)
75 if (table[i].val == (long) value)
77 return table[i].name;
|
| /hardware/qcom/gps/utils/ |
| loc_log.cpp | 59 const char* loc_get_name_from_mask(loc_name_val_s_type table[], int table_size, long mask)
64 if (table[i].val & (long) mask)
66 return table[i].name;
73 const char* loc_get_name_from_val(loc_name_val_s_type table[], int table_size, long value)
78 if (table[i].val == (long) value)
80 return table[i].name;
|
| /prebuilts/go/darwin-x86/src/strings/ |
| export_test.go | 27 } else if t.table != nil {
29 if int(m) != r.tableSize && t.table[m] != nil {
31 s += r.printNode(t.table[m], depth+1)
|
| /prebuilts/go/linux-x86/src/strings/ |
| export_test.go | 27 } else if t.table != nil {
29 if int(m) != r.tableSize && t.table[m] != nil {
31 s += r.printNode(t.table[m], depth+1)
|
| /external/flatbuffers/src/ |
| reflection.cpp | 74 // Convert the table to a string. This is mostly for debugging purposes,
82 auto table_field = reinterpret_cast<const Table *>(
101 return "(table)";
158 // If your FlatBuffer's root table is not the schema's root table, you should
204 void ResizeTable(const reflection::Object &objectdef, Table *table) {
205 if (DagCheck(table))
206 return; // Table already visited.
207 auto vtable = table->GetVTable()
[all...] |
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 42 // Interface functions for hash table
47 static void antlr3HashDelete (pANTLR3_HASH_TABLE table, void * key);
48 static void * antlr3HashGet (pANTLR3_HASH_TABLE table, void * key);
49 static pANTLR3_HASH_ENTRY antlr3HashRemove (pANTLR3_HASH_TABLE table, void * key);
50 static ANTLR3_INT32 antlr3HashPut (pANTLR3_HASH_TABLE table, void * key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
54 static void antlr3HashDeleteI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
55 static void * antlr3HashGetI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
56 static pANTLR3_HASH_ENTRY antlr3HashRemoveI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key);
57 static ANTLR3_INT32 antlr3HashPutI (pANTLR3_HASH_TABLE table, ANTLR3_INTKEY key, void * element, void (ANTLR3_CDECL *freeptr)(void *));
59 static void antlr3HashFree (pANTLR3_HASH_TABLE table);
131 pANTLR3_HASH_TABLE table; local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationSettings.java | 137 void aliasReordering(CollationData data, int[] codesAndRanges, int codesLength, byte[] table) {
149 if(table != null &&
151 !reorderTableHasSplitBytes(table) :
156 reorderTable = table;
158 // Drop ranges before the first split byte. They are reordered by the table.
167 assert(!reorderTableHasSplitBytes(table));
171 assert(table[codesAndRanges[firstSplitByteRangeIndex] >>> 24] == 0);
203 // Write the lead byte permutation table.
205 byte[] table = new byte[256];
212 table[b] = (byte)(b + pair)
[all...] |
| /external/icu/icu4c/source/i18n/ |
| collationdata.cpp | 222 uint8_t table[MAX_NUM_SCRIPT_RANGES]; local
223 uprv_memset(table, 0, sizeof(table));
230 table[index] = 0xff;
235 table[index] = 0xff;
262 lowStart = addLowScriptRange(table, index, lowStart);
295 if(table[index] != 0) { // Duplicate or equivalent script.
299 highLimit = addHighScriptRange(table, index, highLimit);
311 if(table[index] != 0) { // Duplicate or equivalent script.
315 lowStart = addLowScriptRange(table, index, lowStart)
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationSettings.java | 135 void aliasReordering(CollationData data, int[] codesAndRanges, int codesLength, byte[] table) {
147 if(table != null &&
149 !reorderTableHasSplitBytes(table) :
154 reorderTable = table;
156 // Drop ranges before the first split byte. They are reordered by the table.
165 assert(!reorderTableHasSplitBytes(table));
169 assert(table[codesAndRanges[firstSplitByteRangeIndex] >>> 24] == 0);
201 // Write the lead byte permutation table.
203 byte[] table = new byte[256];
210 table[b] = (byte)(b + pair)
[all...] |
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3collections.h | 74 * is deleted from the table.
87 /** Internal structure of a hash table bucket, which tracks
101 /** Structure that tracks a hash table
105 /** Indicates whether the table allows duplicate keys
109 /** Number of buckets available in this table
118 /** How many elements currently exist in the table.
122 /** Whether the hash table should strdup the keys it is given or not.
126 /** Pointer to function to completely delete this table
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table);
131 void (*del) (struct ANTLR3_HASH_TABLE_struct * table, void * key)
161 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_HASH_ENUM_struct
184 pANTLR3_HASH_TABLE table; member in struct:ANTLR3_LIST_struct
[all...] |
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/ |
| Table.java | 12 package org.jacoco.report.internal.html.table;
27 * Renderer for a table of {@link ITableItem}s.
29 public class Table {
36 * Create a new table without any columns yet.
38 public Table() {
39 this.columns = new ArrayList<Table.Column>();
43 * Adds a new column with the given properties to the table.
71 * Renders a table for the given icon
74 * parent element in which the table is created
76 * items that will make the table row
92 final HTMLElement table = parent.table(Styles.COVERAGETABLE); local
[all...] |
| /external/valgrind/callgrind/ |
| jumps.c | 47 jccs->table = (jCC**) CLG_MALLOC("cl.jumps.ijh.1",
52 jccs->table[i] = 0;
62 dst->table = current_jccs.table;
72 current_jccs.table = h->table;
82 /* double size of jcc table */
98 if (current_jccs.table[i] == NULL) continue;
100 curr_jcc = current_jccs.table[i];
119 VG_(free)(current_jccs.table);
[all...] |
| /external/clang/tools/scan-build/share/scan-build/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
| /external/clang/tools/scan-build-py/libscanbuild/resources/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
| /frameworks/base/tools/preload/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-2812033/tools/scan-build/share/scan-build/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3016494/tools/scan-build/share/scan-build/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3217047/tools/scan-build/share/scan-build/ |
| sorttable.js | 10 Add class="sortable" to any table you'd like to make sortable
34 forEach(document.getElementsByTagName('table'), function(table) {
35 if (table.className.search(/\bsortable\b/) != -1) {
36 sorttable.makeSortable(table);
42 makeSortable: function(table) {
43 if (table.getElementsByTagName('thead').length == 0) {
44 // table doesn't have a tHead. Since it should have, create one and
45 // put the first table row in it.
47 the.appendChild(table.rows[0])
[all...] |
