| /prebuilts/clang/host/darwin-x86/clang-3289846/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-3362437/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-3688880/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-3859424/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/linux-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/linux-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/linux-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...] |
| /prebuilts/clang/host/linux-x86/clang-3289846/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/linux-x86/clang-3362437/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/linux-x86/clang-3688880/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/linux-x86/clang-3859424/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/go/darwin-x86/src/math/big/ |
| natconv.go | 28 // TODO(gri) replace this with a table, generated at build time.
307 // construct table of successive squares of bb*leafSize to use in subdivisions
308 // result (table != nil) <=> (len(x) > leafSize > 0)
309 table := divisors(len(x), b, ndigits, bb)
315 q.convertWords(s, b, ndigits, bb, table)
350 func (q nat) convertWords(s []byte, b Word, ndigits int, bb Word, table []divisor) {
352 if table != nil {
355 index := len(table) - 1
360 for index > 0 && table[index-1].nbits > minLength {
363 if table[index].nbits >= maxLength && table[index].bbb.cmp(q) >= 0
[all...] |
| /prebuilts/go/linux-x86/src/math/big/ |
| natconv.go | 28 // TODO(gri) replace this with a table, generated at build time.
307 // construct table of successive squares of bb*leafSize to use in subdivisions
308 // result (table != nil) <=> (len(x) > leafSize > 0)
309 table := divisors(len(x), b, ndigits, bb)
315 q.convertWords(s, b, ndigits, bb, table)
350 func (q nat) convertWords(s []byte, b Word, ndigits int, bb Word, table []divisor) {
352 if table != nil {
355 index := len(table) - 1
360 for index > 0 && table[index-1].nbits > minLength {
363 if table[index].nbits >= maxLength && table[index].bbb.cmp(q) >= 0
[all...] |
| /prebuilts/misc/darwin-x86/analyzer/tools/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/misc/linux-x86/analyzer/tools/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/autotest/frontend/client/src/autotest/afe/ |
| HostTable.java | 3 import autotest.common.table.DataSource;
4 import autotest.common.table.DynamicTable;
39 // No wrap on "Hostname" of host table.
|
| /external/autotest/frontend/client/src/autotest/common/table/ |
| JSONObjectComparator.java | 1 package autotest.common.table;
3 import autotest.common.table.DataSource.SortSpec;
|
| /external/bzip2/ |
| bzip.css | 9 #f2f2f9 very light blue nav table background
10 #3366cc medium blue nav table border
53 table.nav {
60 table.nav a { text-decoration: none; }
61 table.nav a:hover { text-decoration: underline; }
62 table.nav td { font-size: 85%; }
|
| /external/dng_sdk/source/ |
| dng_1d_table.h | 15 * Definition of a lookup table based 1D floating-point to floating-point function abstraction using linear interpolation.
32 /// \brief A 1D floating-point lookup table using linear interpolation.
39 /// Constants denoting size of table.
43 kTableBits = 12, //< Table is always a power of 2 in size. This is log2(kTableSize).
44 kTableSize = (1 << kTableBits) //< Number of entries in table.
59 /// Set up table, initialize entries using functiion.
61 /// \param allocator Memory allocator from which table memory is allocated.
62 /// \param function Table is initialized with values of finction.Evalluate(0.0) to function.Evaluate(1.0).
99 /// Direct access function for table data.
101 const real32 * Table () cons
[all...] |
| /external/freetype/src/base/ |
| ftotval.c | 77 FT_Bytes table )
87 FT_FREE( table );
|
| /external/guava/guava-gwt/src/com/google/common/collect/ |
| DenseImmutableTable_CustomFieldSerializer.java | 38 SerializationStreamWriter writer, DenseImmutableTable<Object, Object, Object> table)
40 ImmutableTable_CustomFieldSerializerBase.serialize(writer, table);
|
| SparseImmutableTable_CustomFieldSerializer.java | 38 SerializationStreamWriter writer, SparseImmutableTable<Object, Object, Object> table)
40 ImmutableTable_CustomFieldSerializerBase.serialize(writer, table);
|
| /external/iptables/iptables/ |
| ip6tables-standalone.c | 14 * firewall table (aimed for the 2.3 kernels)
44 char *table = "filter"; local
61 ret = do_command6(argc, argv, &table, &handle, false);
|
| iptables-standalone.c | 14 * firewall table (aimed for the 2.3 kernels)
46 char *table = "filter"; local
64 ret = do_command4(argc, argv, &table, &handle, false);
|
| xtables-arp-standalone.c | 14 * firewall table (aimed for the 2.3 kernels)
49 char *table = "filter"; local
67 ret = do_commandarp(&h, argc, argv, &table);
|
