Searched refs:table (Results 76 - 100 of 1368) sorted by relevance

1234567891011>>

/external/guava/guava-tests/test/com/google/common/collect/
H A DTableCollectionTest.java123 Table<String, Integer, Character> table
126 populateForRowKeySet(table, elements);
127 return table.rowKeySet();
139 Table<String, Integer, Character> table = HashBasedTable.create();
140 populateForRowKeySet(table, elements);
141 return table.rowKeySet();
151 TreeBasedTable<String, Integer, Character> table = TreeBasedTable.create();
152 populateForRowKeySet(table, elements);
153 return table.rowKeySet();
168 Table<String, Integer, Character> table
581 populateForRowKeySet( Table<String, Integer, Character> table, String[] elements) argument
589 populateForColumnKeySet( Table<Integer, String, Character> table, String[] elements) argument
597 populateForValues( Table<Integer, Character, String> table, String[] elements) argument
1006 populateTable(Table<String, Integer, Character> table) argument
[all...]
H A DNewCustomTableTest.java46 Table<String, Integer, Character> table
48 populate(table, data);
49 return table;
53 table = create("foo", 3, 'a', "bar", 1, 'b', "foo", 2, 'c');
54 assertThat(table.rowKeySet()).has().exactly("foo", "bar").inOrder();
58 table = create("foo", 3, 'a', "bar", 1, 'b', "foo", 2, 'c');
59 assertThat(table.row("foo").keySet()).has().exactly(2, 3).inOrder();
H A DTablesTransformValuesTest.java42 Table<String, Integer, String> table = HashBasedTable.create();
47 table.put((String) data[i], (Integer) data[i + 1], value);
49 return Tables.transformValues(table, FIRST_CHARACTER);
52 // Null support depends on the underlying table and function.
59 table.put("foo", 1, 'a');
66 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
72 table.putAll(other);
75 assertEquals((Character) 'a', table.get("foo", 1));
76 assertEquals((Character) 'b', table.get("bar", 1));
77 assertEquals((Character) 'c', table
[all...]
/external/e2fsprogs/lib/ss/
H A Dinvocation.c31 register ss_data **table; local
34 table = _ss_table;
37 if (table == (ss_data **) NULL) {
38 table = (ss_data **) malloc(2 * size);
39 table[0] = table[1] = (ss_data *)NULL;
43 for (sci_idx = 1; table[sci_idx] != (ss_data *)NULL; sci_idx++)
45 table = (ss_data **) realloc((char *)table,
47 if (table
[all...]
H A Dss_err.c19 N_( "Request table not found"),
33 const struct error_table * table; member in struct:et_list
54 if (et->table->msgs == text)
58 if (!link.table)
63 et->table = &et_ss_error_table;
/external/guava/guava-gwt/src/com/google/common/collect/
H A DTreeBasedTable_CustomFieldSerializer.java29 public static void deserialize(SerializationStreamReader reader, TreeBasedTable<?, ?, ?> table) { argument
41 TreeBasedTable<Object, Object, Object> table =
43 return Table_CustomFieldSerializerBase.populate(reader, table);
46 public static void serialize(SerializationStreamWriter writer, TreeBasedTable<?, ?, ?> table) argument
48 writer.writeObject(table.rowComparator());
49 writer.writeObject(table.columnComparator());
50 Table_CustomFieldSerializerBase.serialize(writer, table);
H A DHashBasedTable_CustomFieldSerializer.java27 public static void deserialize(SerializationStreamReader reader, HashBasedTable<?, ?, ?> table) { argument
35 public static void serialize(SerializationStreamWriter writer, HashBasedTable<?, ?, ?> table) argument
37 Table_CustomFieldSerializerBase.serialize(writer, table);
/external/toolchain-utils/crb/
H A Dtable_formatter.py81 def GetTablePercents(self, table):
82 # Assumes table is not transposed.
85 pct_table.append(table[0])
86 for i in range(1, len(table)):
88 row.append(table[i][0])
89 for j in range(1, len(table[0])):
90 c = table[i][j]
91 b = table[i][1]
107 def TransposeTable(self, table):
109 for i in range(len(table[
[all...]
H A Dautotest_gatherer.py12 table = self.GetTableValues()
13 ret += self.GetTableLabels(table)
14 ret += self.GetFormattedTable(table,
21 table = self.GetTableValues()
22 summary_table = self.GetSummaryTableValues(table)
44 table = []
53 table.append(row)
65 table.append(row)
67 return table
/external/brotli/dec/
H A Dhuffman.c78 /* Stores code in table[0], table[step], table[2*step], ..., table[end] */
80 static BROTLI_INLINE void ReplicateValue(HuffmanCode* table, argument
85 table[end] = code;
89 /* Returns the table width of the next 2nd level table. count is the histogram
104 void BrotliBuildCodeLengthsHuffmanTable(HuffmanCode* table, argument
107 HuffmanCode code; /* current table entr
176 HuffmanCode* table; /* next available space in table */ local
267 BrotliBuildSimpleHuffmanTable(HuffmanCode* table, int root_bits, uint16_t* val, uint32_t num_symbols) argument
[all...]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DTablesTransformValuesTest.java41 Table<String, Integer, String> table = HashBasedTable.create();
46 table.put((String) data[i], (Integer) data[i + 1], value);
48 return Tables.transformValues(table, FIRST_CHARACTER);
51 // Null support depends on the underlying table and function.
56 table.put("foo", 1, 'a');
63 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c');
69 table.putAll(other);
72 assertEquals((Character) 'a', table.get("foo", 1));
73 assertEquals((Character) 'b', table.get("bar", 1));
74 assertEquals((Character) 'c', table
[all...]
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DTrieBuilder.java25 * have the same value. However, lookup is much faster than a hash table.
136 * index table lookups.
187 protected TrieBuilder(TrieBuilder table) argument
190 m_indexLength_ = table.m_indexLength_;
191 System.arraycopy(table.m_index_, 0, m_index_, 0, m_indexLength_);
192 m_dataCapacity_ = table.m_dataCapacity_;
193 m_dataLength_ = table.m_dataLength_;
194 m_map_ = new int[table.m_map_.length];
195 System.arraycopy(table.m_map_, 0, m_map_, 0, m_map_.length);
196 m_isLatin1Linear_ = table
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DTrieBuilder.java24 * have the same value. However, lookup is much faster than a hash table.
134 * index table lookups.
185 protected TrieBuilder(TrieBuilder table) argument
188 m_indexLength_ = table.m_indexLength_;
189 System.arraycopy(table.m_index_, 0, m_index_, 0, m_indexLength_);
190 m_dataCapacity_ = table.m_dataCapacity_;
191 m_dataLength_ = table.m_dataLength_;
192 m_map_ = new int[table.m_map_.length];
193 System.arraycopy(table.m_map_, 0, m_map_, 0, m_map_.length);
194 m_isLatin1Linear_ = table
[all...]
/external/autotest/frontend/client/src/autotest/afe/
H A DCheckBoxPanelDisplay.java10 private FlexTable table = new FlexTable(); field in class:CheckBoxPanelDisplay
14 initWidget(table);
22 table.setWidget(row, col, checkbox);
/external/selinux/libsepol/tests/
H A Dtest-expander-attr-map.c93 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_5"));
94 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_5_1_t"));
95 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_5_2_t"));
96 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_8"));
97 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_8_1_t"));
98 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_base_optional_disabled_8_2_t"));
99 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_mod_optional_disabled_4"));
100 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_mod_optional_disabled_4_1_t"));
101 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_mod_optional_disabled_4_2_t"));
102 CU_ASSERT(!hashtab_search((&base_expanded2)->p_types.table, "attr_check_mod_optional_disabled_
[all...]
/external/autotest/frontend/client/src/autotest/common/table/
H A DDataTable.java1 package autotest.common.table;
24 * A table to display data from JSONObjects. Each row displays data from one
30 * <li>.data-table - the entire table
40 // use CLICKABLE_WIDGET_COLUMN for widget that expect to receive clicks. The table will ignore
50 protected RightClickTable table; field in class:DataTable
59 // keep a list of JSONObjects corresponding to rows in the table
80 table = new RightClickTable();
81 initWidget(table);
83 table
[all...]
/external/toolchain-utils/cros_utils/
H A Dtabulator_test.py19 table = ['k1', ['1', '3'], ['55']]
22 result.Compute(cell, table[2], table[1])
23 expected = ' '.join([str(float(v)) for v in table[2]])
28 result.Compute(cell, table[2], table[1])
29 self.assertTrue(cell.value == float(table[2][0]))
83 table = tg.GetTable()
84 header = table.pop(0)
87 row = table
[all...]
/external/clang/test/CodeGenCXX/
H A Dpartial-init.cpp20 static Foo table[] = { variable
/external/e2fsprogs/lib/et/
H A Derror_table.h19 const struct error_table *table; member in struct:et_list
23 #define ERRCODE_RANGE 8 /* # of bits to shift table number */
/external/e2fsprogs/lib/et/test_cases/
H A Dcontinuation.c22 const struct error_table * table; member in struct:et_list
43 if (et->table->msgs == text)
47 if (!link.table)
52 et->table = &et_ovk_error_table;
H A Dheimdal3.c23 const struct error_table * table; member in struct:et_list
44 if (et->table->msgs == text)
48 if (!link.table)
53 et->table = &et_h3test_error_table;
/external/elfutils/libebl/
H A Deblcorenote.c59 #define ITEMS(type, table) \
61 *items = table; \
62 *nitems = sizeof table / sizeof table[0]; \
/external/freetype/src/sfnt/
H A Dttpost.c5 /* PostScript name table processing for TrueType and OpenType fonts */
21 /* The post table is not completely loaded by the core engine. This */
62 /* table of Mac names. Thus, it is possible to build a version of */
173 /* UNDOCUMENTED! The number of glyphs in this table can be smaller */
174 /* than the value in the maxp table (cf. cyberbit.ttf). */
177 /* in this table, so the test for this threshold has been dropped. */
200 /* compute number of names stored in table */
239 FT_TRACE6(( "load_format_20: %d byte left in post table\n",
254 " truncating at end of post table (%d byte left)\n",
269 " all entries in post table ar
282 TT_Post_20 table = &face->postscript_names.names.format_20; local
361 TT_Post_25 table = &face->postscript_names.names.format_25; local
433 TT_Post_20 table = &names->names.format_20; local
448 TT_Post_25 table = &names->names.format_25; local
521 TT_Post_20 table = &names->names.format_20; local
544 TT_Post_25 table = &names->names.format_25; local
[all...]
/external/mesa3d/src/mapi/glapi/
H A Dglapi_nop.c28 * No-op dispatch table.
30 * This file defines a special dispatch table which is loaded with no-op
36 * In the past, the dispatch table was loaded with pointers to a single
113 * Defines for the table of no-op entry points.
122 /** Return pointer to new dispatch table filled with no-op functions */
126 struct _glapi_table *table = malloc(num_entries * sizeof(_glapi_proc)); local
127 if (table) {
128 memcpy(table, __glapi_noop_table,
131 return table;
/external/pdfium/third_party/freetype/src/sfnt/
H A Dttpost.c5 /* Postcript name table processing for TrueType and OpenType fonts */
21 /* The post table is not completely loaded by the core engine. This */
62 /* table of Mac names. Thus, it is possible to build a version of */
173 /* UNDOCUMENTED! The number of glyphs in this table can be smaller */
174 /* than the value in the maxp table (cf. cyberbit.ttf). */
177 /* in this table, so the test for this threshold has been dropped. */
200 /* compute number of names stored in table */
239 FT_TRACE6(( "load_format_20: %d byte left in post table\n",
254 " truncating at end of post table (%d byte left)\n",
269 " all entries in post table ar
282 TT_Post_20 table = &face->postscript_names.names.format_20; local
359 TT_Post_25 table = &face->postscript_names.names.format_25; local
431 TT_Post_20 table = &names->names.format_20; local
446 TT_Post_25 table = &names->names.format_25; local
519 TT_Post_20 table = &names->names.format_20; local
542 TT_Post_25 table = &names->names.format_25; local
[all...]

Completed in 812 milliseconds

1234567891011>>