HomeSort by relevance Sort by last modified time
    Searched defs:Table (Results 1 - 25 of 52) sorted by null

1 2 3

  /external/chromium_org/third_party/leveldatabase/src/include/leveldb/
table.h 21 // A Table is a sorted map from strings to strings. Tables are
22 // immutable and persistent. A Table may be safely accessed from
24 class Table {
26 // Attempt to open the table that is stored in bytes [0..file_size)
28 // retrieving data from the table.
30 // If successful, returns ok and sets "*table" to the newly opened
31 // table. The client should delete "*table" when no longer needed.
32 // If there was an error while initializing the table, sets "*table"
    [all...]
  /external/chromium_org/chrome/browser/ui/cocoa/
table_row_nsimage_cache.h 21 // Interface this cache expects for its table model.
22 class Table {
24 // Returns the number of rows in the table.
31 virtual ~Table() {}
35 explicit TableRowNSImageCache(Table* model);
41 // Call these functions every time the table changes, to update the cache.
48 // The table model we query for row count and icons.
49 Table* model_; // weak
  /external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/
table.cc 21 #include "sfntly/table/table.h"
25 #include "sfntly/table/bitmap/ebdt_table.h"
26 #include "sfntly/table/bitmap/eblc_table.h"
27 #include "sfntly/table/bitmap/ebsc_table.h"
28 #include "sfntly/table/core/cmap_table.h"
29 #include "sfntly/table/core/font_header_table.h"
30 #include "sfntly/table/core/horizontal_device_metrics_table.h"
31 #include "sfntly/table/core/horizontal_header_table.h"
32 #include "sfntly/table/core/horizontal_metrics_table.h
    [all...]
table.h 26 #include "sfntly/table/font_data_table.h"
27 #include "sfntly/table/header.h"
32 // A concrete implementation of a root level table in the font. This is the base
33 // class used for all specific table implementations and is used as the generic
34 // table for all tables which have no specific implementations.
35 class Table : public FontDataTable {
37 // Note: original version is Builder<T extends Table>
44 virtual void NotifyPostTableBuild(FontDataTable* table);
46 // Get a builder for the table type specified by the data in the header.
47 // @param header the header for the table
    [all...]
  /art/runtime/
reference_table.h 35 // Maintain a table of references. Used for JNI monitor references and
56 TrackingAllocator<GcRoot<mirror::Object>, kAllocatorTagReferenceTable>> Table;
57 static void Dump(std::ostream& os, Table& entries)
62 Table entries_;
intern_table.h 57 // Interns a potentially new string in the 'strong' table. (See above.)
61 // Interns a potentially new string in the 'strong' table. (See above.)
65 // Interns a potentially new string in the 'strong' table. (See above.)
68 // Interns a potentially new string in the 'weak' table. (See above.)
91 // Adds all of the resolved image strings from the image space into the intern table. The
116 // Table which holds pre zygote and post zygote interned strings. There is one instance for
118 class Table {
145 // caused by modifying the zygote intern table hash table. The pre zygote table are th
    [all...]
gc_map.h 34 // The number of entries in the table.
42 return &Table()[entry_offset + NativeOffsetWidth()];
45 // Get the native PC encoded in the table at the given index.
50 result |= Table()[entry_offset + i] << (i * 8);
92 const uint8_t* Table() const {
101 // The width of an entry in the table.
106 const uint8_t* const data_; // The header and table data
oat_file.h 347 typedef AllocationTrackingSafeMap<StringPiece, const OatDexFile*, kAllocatorTagOatFile> Table;
353 Table oat_dex_files_;
362 mutable Table secondary_oat_dex_files_ GUARDED_BY(secondary_lookup_lock_);
class_linker.h 399 // Attempts to insert a class into a class table. Returns NULL if
415 // Move all of the image classes into the class table for faster lookups.
419 // Move the class table to the pre-zygote table to reduce memory usage. This works by ensuring
420 // that no more classes are ever added to the pre zygote table which makes it that the pages
    [all...]
  /external/lzma/CS/7zip/Common/
CRC.cs 7 public static readonly uint[] Table;
11 Table = new uint[256];
21 Table[i] = r;
31 _value = Table[(((byte)(_value)) ^ b)] ^ (_value >> 8);
37 _value = Table[(((byte)(_value)) ^ data[offset + i])] ^ (_value >> 8);
  /external/lzma/Java/SevenZip/
CRC.java 7 static public int[] Table = new int[256];
19 Table[i] = r;
33 _value = Table[(_value ^ data[offset + i]) & 0xFF] ^ (_value >>> 8);
40 _value = Table[(_value ^ data[i]) & 0xFF] ^ (_value >>> 8);
45 _value = Table[(_value ^ b) & 0xFF] ^ (_value >>> 8);
  /external/chromium_org/third_party/brotli/src/woff2/
font.h 28 // Represents an sfnt font file. Only the table directory is parsed, for the
29 // table data we only store a raw pointer, therefore a font object is valid only
35 struct Table {
45 std::map<uint32_t, Table> tables;
47 Table* FindTable(uint32_t tag);
48 const Table* FindTable(uint32_t tag) const;
74 // Removes the digital signature (DSIG) table
woff2_common.h 35 struct Table {
  /external/chromium_org/third_party/leveldatabase/src/db/
memtable.h 77 typedef SkipList<const char*, KeyComparator> Table;
82 Table table_;
  /art/runtime/verifier/
dex_gc_map.h 50 // The number of entries in the table
59 return Table()[entry_offset];
61 return Table()[entry_offset] | (Table()[entry_offset + 1] << 8);
68 return &Table()[entry_offset + DexPcWidth()];
80 // Table of num_entries * (dex pc, bitmap)
81 const uint8_t* Table() const {
85 // The format of the table of the PCs for the table
104 // The width of an entry in the table
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DebugCheckers.cpp 162 typedef AnalyzerOptions::ConfigTable Table;
164 static int compareEntry(const Table::MapEntryTy *const *LHS,
165 const Table::MapEntryTy *const *RHS) {
173 const Table &Config = mgr.options.Config;
175 SmallVector<const Table::MapEntryTy *, 32> Keys;
176 for (Table::const_iterator I = Config.begin(), E = Config.end(); I != E;
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
hash.c 3 * Generic hash table.
44 #define TABLE_SIZE 1023 /**< Size of lookup table/array */
50 * An entry in the hash table.
60 * The hash table data structure.
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
80 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
81 if (table) {
    [all...]
  /external/chromium_org/v8/src/ic/
stub-cache.h 45 // Clear the lookup table (@ mark compact collection).
51 // Generate code for probing the stub cache table.
60 enum Table { kPrimary, kSecondary };
62 SCTableReference key_reference(StubCache::Table table) {
64 reinterpret_cast<Address>(&first_entry(table)->key));
67 SCTableReference map_reference(StubCache::Table table) {
69 reinterpret_cast<Address>(&first_entry(table)->map));
72 SCTableReference value_reference(StubCache::Table table)
    [all...]
  /external/fonttools/Lib/fontTools/ttLib/tables/
otConverters.py 9 """Given a table spec from otData.py, build a converter object for each
10 field of the table. This is called for each table in otData.py, and
41 convertersByName[cls.__name__] = Table(name, repeat, aux, cls)
46 convertersByName[cls.__name__] = Table(name, repeat, aux, cls)
181 table = self.tableClass()
182 table.decompile(reader, font)
183 return table
197 pass # NULL table, ignore
202 table = self.tableClass(
    [all...]
  /external/guava/guava/src/com/google/common/collect/
Table.java 31 * column key, with a single value. A table may be sparse, with only a small
41 * underlying table. Updating the table can change the contents of those
42 * collections, and updating the collections will change the table.
44 * <p>All methods that modify the table are optional, and the views returned by
45 * the table may or may not be modifiable. When modification isn't supported,
49 * @param <R> the type of the table row keys
50 * @param <C> the type of the table column keys
56 public interface Table<R, C, V> {
62 * Returns {@code true} if the table contains a mapping with the specifie
    [all...]
  /external/mesa3d/src/mesa/main/
hash.c 3 * Generic hash table.
44 #define TABLE_SIZE 1023 /**< Size of lookup table/array */
50 * An entry in the hash table.
60 * The hash table data structure.
63 struct HashEntry *Table[TABLE_SIZE]; /**< the lookup table */
73 * Create a new hash table.
75 * \return pointer to a new, empty hash table.
80 struct _mesa_HashTable *table = CALLOC_STRUCT(_mesa_HashTable); local
81 if (table) {
    [all...]
  /external/chromium_org/third_party/leveldatabase/src/table/
table.cc 5 #include "leveldb/table.h"
12 #include "table/block.h"
13 #include "table/filter_block.h"
14 #include "table/format.h"
15 #include "table/two_level_iterator.h"
20 struct Table::Rep {
38 Status Table::Open(const Options& options,
41 Table** table) {
42 *table = NULL
157 Table* table = reinterpret_cast<Table*>(arg); local
    [all...]
  /external/llvm/lib/MC/
MCContext.cpp 330 MCDwarfLineTable &Table = MCDwarfLineTablesCUMap[CUID];
331 return Table.getFile(Directory, FileName, FileNumber);
  /external/clang/lib/Basic/
IdentifierTable.cpp 1 //===--- IdentifierTable.cpp - Hash table for identifier lookup -----------===//
80 // Populate the identifier table with info about keywords for the current
125 const LangOptions &LangOpts, IdentifierTable &Table) {
153 Table.get(Keyword, AddResult == 3 ? tok::identifier : TokenCode);
162 IdentifierTable &Table) {
163 IdentifierInfo &Info = Table.get(Keyword, TokenCode);
171 IdentifierTable &Table) {
172 Table.get(Name).setObjCKeywordID(ObjCID);
175 /// AddKeywords - Add all keywords to the symbol table.
257 /// PrintStats - Print statistics about how well the identifier table is doin
    [all...]
  /external/clang/lib/Serialization/
GlobalModuleIndex.cpp 69 /// table.
303 IdentifierIndexTable &Table
305 IdentifierIndexTable::iterator Known = Table.find(Name);
306 if (Known == Table.end()) {
617 // Handle the identifier table
621 std::unique_ptr<InterestingIdentifierTable> Table(
626 for (InterestingIdentifierTable::data_iterator D = Table->data_begin(),
627 DEnd = Table->data_end();
646 /// table.
730 // Populate the hash table
    [all...]

Completed in 1470 milliseconds

1 2 3