HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 176 - 200 of 2317) sorted by null

1 2 3 4 5 6 78 91011>>

  /external/chromium_org/chrome/browser/resources/options/chromeos/
keyboard_overlay.css 11 display: table;
16 display: table-row;
20 display: table-cell;
  /external/chromium_org/chrome/browser/resources/suggestions_internals/
suggestions_internals.css 5 .suggestions-debug-table {
10 .suggestions-debug-table th {
14 .suggestions-debug-table td {
  /external/chromium_org/third_party/freetype/src/autofit/
afangles.c 141 /* the following table has been automatically generated with */
248 FT_Pos* table )
258 if ( table[j] >= table[j - 1] )
261 swap = table[j];
262 table[j] = table[j - 1];
263 table[j - 1] = swap;
271 AF_Width table,
289 if ( table[j].org >= table[j - 1].org
    [all...]
  /external/freetype/src/autofit/
afangles.c 141 /* the following table has been automatically generated with */
248 FT_Pos* table )
258 if ( table[j] >= table[j - 1] )
261 swap = table[j];
262 table[j] = table[j - 1];
263 table[j - 1] = swap;
271 AF_Width table,
289 if ( table[j].org >= table[j - 1].org
    [all...]
  /external/libcap-ng/libcap-ng-0.7/src/
lookup_table.c 47 all strings referenced in the table and the table itself, which uses
76 static int capng_lookup_name(const struct transtab *table,
82 if (!strcasecmp(tabstr + table[i].offset, name))
83 return table[i].value;
88 static const char *capng_lookup_number(const struct transtab *table,
95 if (table[i].value == number)
96 return tabstr + table[i].offset;
  /frameworks/av/media/libstagefright/codecs/amrnb/common/src/
lsp_lsf.cpp 50 Description: Placed table declarations in a .c file, rather than an included
63 Description: Added #ifdef __cplusplus around extern'ed table.
111 extern const Word16 table[];
140 table = cosine table
152 The transformation from lsp[i] to lsf[i] is approximated by a look-up table
182 // lsp[i] = table[ind]+ ((table[ind+1]-table[ind])*offset) / 256
184 L_tmp = L_mult (sub (table[ind + 1], table[ind]), offset)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/html/
HTMLTableRowsCollection.cpp 43 // Because we know that the parent is a table or a section, it's safe to cast it to an HTMLElement
48 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement& table, HTMLTableRowElement* previous)
52 if (previous && previous->parentNode() != table) {
60 child = Traversal<HTMLElement>::firstChild(table);
72 child = Traversal<HTMLElement>::firstChild(table);
73 else if (previous->parentNode() == table)
88 child = Traversal<HTMLElement>::firstChild(table);
101 HTMLTableRowElement* HTMLTableRowsCollection::lastRow(HTMLTableElement& table)
103 for (HTMLElement* tfoot = Traversal<HTMLElement>::lastChild(table, HasHTMLTagName(tfootTag)); tfoot; tfoot = Traversal<HTMLElement>::previousSibling(*tfoot, HasHTMLTagName(tfootTag))) {
108 for (HTMLElement* child = Traversal<HTMLElement>::lastChild(table); child; child = Traversal<HTMLElement>::previousSibling(*child))
    [all...]
  /external/chromium_org/third_party/skia/gm/
tablecolorfilter.cpp 53 static void make_table0(uint8_t table[]) {
56 table[i] = (n << 5) | (n << 2) | (n >> 1);
59 static void make_table1(uint8_t table[]) {
61 table[i] = i * i / 255;
64 static void make_table2(uint8_t table[]) {
67 table[i] = static_cast<uint8_t>(sqrtf(fi) * 255);
72 uint8_t table[256]; make_table0(table); local
73 return SkTableColorFilter::Create(table);
76 uint8_t table[256]; make_table1(table) local
80 uint8_t table[256]; make_table2(table); local
    [all...]
  /external/chromium_org/third_party/skia/src/effects/
SkTableMaskFilter.cpp 21 SkTableMaskFilter::SkTableMaskFilter(const uint8_t table[256]) {
22 memcpy(fTable, table, sizeof(fTable));
43 const uint8_t* table = fTable; local
49 dstP[x] = table[srcP[x]];
78 uint8_t table[256]; local
79 if (!buffer.readByteArray(table, 256)) {
82 return Create(table);
94 void SkTableMaskFilter::MakeGammaTable(uint8_t table[256], SkScalar gamma) {
101 table[i] = SkPin32(sk_float_round2int(powf(x, g) * 255), 0, 255);
106 void SkTableMaskFilter::MakeClipTable(uint8_t table[256], uint8_t min
    [all...]
  /external/libexif/libexif/canon/
mnote-canon-tag.c 33 } table[] = { variable in typeref:struct:__anon28266
134 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
135 if (table[i].tag == t) return table[i].name; /* do not translate */
164 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
165 if (table[i].tag == t) return (_(table[i].title));
193 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++
    [all...]
  /external/libexif/libexif/pentax/
mnote-pentax-tag.c 33 } table[] = { variable in typeref:struct:__anon28299
146 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
147 if (table[i].tag == t) return (table[i].name);
157 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++)
158 if (table[i].tag == t) return (_(table[i].title));
167 for (i = 0; i < sizeof (table) / sizeof (table[0]); i++
    [all...]
  /external/skia/gm/
tablecolorfilter.cpp 53 static void make_table0(uint8_t table[]) {
56 table[i] = (n << 5) | (n << 2) | (n >> 1);
59 static void make_table1(uint8_t table[]) {
61 table[i] = i * i / 255;
64 static void make_table2(uint8_t table[]) {
67 table[i] = static_cast<uint8_t>(sqrtf(fi) * 255);
72 uint8_t table[256]; make_table0(table); local
73 return SkTableColorFilter::Create(table);
76 uint8_t table[256]; make_table1(table) local
80 uint8_t table[256]; make_table2(table); local
    [all...]
  /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/htmlfiles/
jquery.tablesorter.min.js 2 (function($){$.extend({tablesorter:new function(){var parsers=[],widgets=[];this.defaults={cssHeader:"header",cssAsc:"headerSortUp",cssDesc:"headerSortDown",sortInitialOrder:"asc",sortMultiSortKey:"shiftKey",sortForce:null,sortAppend:null,textExtraction:"simple",parsers:{},widgets:[],widgetZebra:{css:["even","odd"]},headers:{},widthFixed:false,cancelSelection:true,sortList:[],headerList:[],dateFormat:"us",decimal:'.',debug:false};function benchmark(s,d){log(s+","+(new Date().getTime()-d.getTime())+"ms");}this.benchmark=benchmark;function log(s){if(typeof console!="undefined"&&typeof console.debug!="undefined"){console.log(s);}else{alert(s);}}function buildParserCache(table,$headers){if(table.config.debug){var parsersDebug="";}var rows=table.tBodies[0].rows;if(table.tBodies[0].rows[0]){var list=[],cells=rows[0].cells,l=cells.length;for(var i=0;i<l;i++){var p=false;if($.metadata&&($($headers[i]).metadata()&&$($headers[i]).metadata().sorter)){p=getParserById($($headers[i]).metadata().sorter);}else if((table.config.headers[i]&&table.config.headers[i].sorter)){p=getParserById(table.config.headers[i].sorter);}if(!p){p=detectParserForColumn(table,cells[i]);}if(table.config.debug){parsersDebug+="column:"+i+" parser:"+p.id+"\n";}list.push(p);}}if(table.config.debug){log(parsersDebug);}return list;};function detectParserForColumn(table,node){var l=pa (…)
    [all...]
  /external/iproute2/netem/
maketable.c 2 * Experimental data distribution table generator
7 * From this, create the inverse distribution table used to approximate
73 /* Create a (normalized) distribution table from a set of observed
74 * values. The table is fixed to run from (as it happens) -4 to +4,
95 int *table; local
99 table = calloc(DISTTABLESIZE, sizeof(int));
100 if (!table) {
101 perror("table alloc");
112 ++table[index];
118 return table;
202 int *table; local
    [all...]
  /external/chromium_org/third_party/icu/source/tools/toolutil/
ucm.c 64 ucm_printMapping(UCMTable *table, UCMapping *m, FILE *f) {
65 printMapping(m, UCM_GET_CODE_POINTS(table, m), UCM_GET_BYTES(table, m), f);
69 ucm_printTable(UCMTable *table, FILE *f, UBool byUnicode) {
73 m=table->mappings;
74 length=table->mappingsLength;
77 ucm_printMapping(table, m, f);
80 const int32_t *map=table->reverseMap;
82 ucm_printMapping(table, m+map[i], f);
212 UCMTable *table=(UCMTable *)context local
694 UCMTable *table; local
879 UCMTable *table=(UCMTable *)uprv_malloc(sizeof(UCMTable)); local
    [all...]
  /external/icu/icu4c/source/tools/toolutil/
ucm.c 64 ucm_printMapping(UCMTable *table, UCMapping *m, FILE *f) {
65 printMapping(m, UCM_GET_CODE_POINTS(table, m), UCM_GET_BYTES(table, m), f);
69 ucm_printTable(UCMTable *table, FILE *f, UBool byUnicode) {
73 m=table->mappings;
74 length=table->mappingsLength;
77 ucm_printMapping(table, m, f);
80 const int32_t *map=table->reverseMap;
82 ucm_printMapping(table, m+map[i], f);
212 UCMTable *table=(UCMTable *)context local
694 UCMTable *table; local
879 UCMTable *table=(UCMTable *)uprv_malloc(sizeof(UCMTable)); local
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
toaiff.py 21 table = {} variable
25 table['au'] = t
35 table['hcom'] = t
39 table['voc'] = t
43 table['wav'] = t
47 table['8svx'] = t
51 table['sndt'] = t
55 table['sndr'] = t
102 if ftype is None or not ftype in table:
107 sts = table[ftype].copy(fname, temp
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
toaiff.py 21 table = {} variable
25 table['au'] = t
35 table['hcom'] = t
39 table['voc'] = t
43 table['wav'] = t
47 table['8svx'] = t
51 table['sndt'] = t
55 table['sndr'] = t
102 if ftype is None or not ftype in table:
107 sts = table[ftype].copy(fname, temp
    [all...]
  /external/openfst/src/include/fst/
bi-table.h 1 // bi-table.h
73 HashBiTable(const HashBiTable<I, T, H, E> &table)
74 : hash_func_(table.hash_func_ ? new H(*table.hash_func_) : 0),
75 hash_equal_(table.hash_equal_ ? new E(*table.hash_equal_) : 0),
76 entry2id_(table.entry2id_.begin(), table.entry2id_.end(),
77 table.entry2id_.size(),
80 id2entry_(table.id2entry_) {
    [all...]
  /external/chromium_org/chrome/browser/resources/
gesture_config.css 11 display: table;
44 display: table-row;
48 display: table-cell;
59 display: table-cell;
63 display: table-cell;
73 display: table-cell;
80 display: table;
  /external/chromium_org/third_party/ots/src/
kern.cc 16 Buffer table(data, length);
22 if (!table.ReadU16(&kern->version) ||
23 !table.ReadU16(&num_tables)) {
43 if (!table.ReadU16(&subtable.version) ||
44 !table.ReadU16(&sub_length)) {
53 const size_t current_offset = table.offset();
58 if (!table.ReadU16(&subtable.coverage)) {
80 if (!table.ReadU16(&num_pairs) ||
81 !table.ReadU16(&subtable.search_range) ||
82 !table.ReadU16(&subtable.entry_selector) |
    [all...]
vorg.cc 9 // VORG - Vertical Origin Table
18 Buffer table(data, length);
23 if (!table.ReadU16(&vorg->major_version) ||
24 !table.ReadU16(&vorg->minor_version) ||
25 !table.ReadS16(&vorg->default_vert_origin_y) ||
26 !table.ReadU16(&num_recs)) {
50 if (!table.ReadU16(&rec.glyph_index) ||
51 !table.ReadS16(&rec.vert_origin_y)) {
55 OTS_WARNING("the table is not sorted");
68 if (!file->cff) return false; // this table is not for fonts with TT glyphs
    [all...]
  /external/chromium_org/base/metrics/
stats_counters.cc 40 StatsTable* table = StatsTable::current(); local
41 if (!table)
46 counter_id_ = table->FindCounter(name_);
47 if (table->GetSlot() == 0) {
48 if (!table->RegisterThread(std::string())) {
59 return table->GetLocation(counter_id_, table->GetSlot());
61 // counter_id_ was zero, which means the table is full.
  /frameworks/rs/cpu_ref/linkloader/include/impl/
ELFSectionHeaderTable.hxx 28 for (size_t i = 0; i < table.size(); ++i) {
29 delete table[i];
43 // Allocate a new section header table and assign the owner.
64 tab->table.push_back(sh.release());
76 out() << "ELF Section Header Table" << '\n';
79 for (size_t i = 0; i < table.size(); ++i) {
88 for (size_t i = 0; i < table.size(); ++i) {
89 ELFSectionHeaderTy *sh = table[i];
103 return table[0];
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/database/
MoreDatabaseUtils.java 30 * Builds a CREATE INDEX ddl statement for a given table and field.
32 * @param table The table name.
36 public static String buildCreateIndexSql(String table, String field) {
37 return "CREATE INDEX " + buildIndexName(table, field) + " ON " + table
42 * Builds a DROP INDEX ddl statement for a given table and field.
44 * @param table The table name that was originally used to create the index.
49 public static String buildDropIndexSql(String table, String field)
    [all...]

Completed in 461 milliseconds

1 2 3 4 5 6 78 91011>>