| /external/deqp/doc/testspecs/VK/ |
| D | sparse_resources.txt | 25 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
27 First queue is used to perform binding of device memory to sparse buffer. The binding operation sig…
30 The second queue is used to perform transfer operations. The test creates two non-sparse buffer obj…
31 one used as input and the second as output. The input buffer is used to transfer data to sparse buf…
32 transfered further from sparse buffer to output buffer. The transer queue waits on a semaphore, bef…
44 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
46 First queue is used to perform binding of device memory to sparse image. The binding operation sign…
49 The second queue is used to perform transfer operations. The test creates two non-sparse buffer obj…
50 one used as input and the second as output. The input buffer is used to transfer data to sparse ima…
51 transfered further from sparse image to output buffer. The transfer queue waits on a semaphore, bef…
[all …]
|
| /external/v8/test/mjsunit/ |
| D | array-functions-prototype-misc.js | 179 var sparse = []; variable
180 sparse[pos + 1000] = 'is ';
181 sparse[pos + 271828] = 'time ';
182 sparse[pos + 31415] = 'the ';
183 sparse[pos + 012260199] = 'all ';
184 sparse[-1] = 'foo';
185 sparse[pos + 22591927] = 'good ';
186 sparse[pos + 1618033] = 'for ';
187 sparse[pos + 91] = ': Now ';
188 sparse[pos + 86720199] = 'men.';
[all …]
|
| /external/eigen/doc/ |
| D | TutorialSparse.dox | 7 Manipulating and solving sparse problems involves various modules which are summarized below:
11 …eMatrix and SparseVector classes, matrix assembly, basic sparse linear algebra (including sparse t…
12 … <Eigen/SparseCholesky>\endcode</td><td>Direct sparse LLT and LDLT Cholesky factorization to solve…
14 <td>%Sparse LU factorization to solve general square sparse systems</td></tr>
15 …de<Eigen/SparseQR>\endcode </td><td>%Sparse QR factorization for solving sparse linear least-squar…
22 …ized representation storing only the nonzero coefficients. Such a matrix is called a sparse matrix.
26 The class SparseMatrix is the main sparse matrix representation of Eigen's sparse module; it offers…
45 and one of its possible sparse, \b column \b major representation:
68 The results of %Eigen's operations always produces \b compressed sparse matrices.
97 In this example, we start by defining a column-major sparse matrix type of double \c SparseMatrix<d…
[all …]
|
| D | SparseQuickReference.dox | 2 /** \eigenManualPage SparseQuickRefPage Quick reference guide for sparse matrices
7 …sparse matrices in the class SparseMatrix. First, it is recommended to read the introductory tuto…
8 …column major. The default is column major. Most arithmetic operations on sparse matrices will asse…
95 sm1.isVector(); // Check if sm1 is a sparse vector or a sparse matrix
103 …sparse matrices provided that the dimensions are adequate and that the matrices have the same stor…
233 <td> For general sparse solve, Use any suitable module described at \ref TopicSparseSystems </td>
|
| /external/smali/baksmali/src/test/resources/SwitchTest/ |
| D | UnorderedSparseSwitchInput.smali | 9 sparse-switch v0, :SparseSwitch
28 .sparse-switch
34 .end sparse-switch
|
| D | UnorderedSparseSwitchOutput.smali | 6 sparse-switch v0, :sswitch_data_c
21 .sparse-switch
27 .end sparse-switch
|
| /external/eigen/Eigen/ |
| D | OrderingMethods | 13 * It defines various built-in and external ordering methods for sparse matrices.
15 * the sparse matrix decomposition (LLT, LU, QR).
18 * Using for instance the sparse Cholesky decomposition, it is expected that
27 * A simple usage is as a template parameter in the sparse decomposition classes :
|
| D | IterativeLinearSolvers | 12 …oblems of the form \c A \c x = \c b, where \c A is a squared matrix, usually very large and sparse.
22 …* Such problems can also be solved using the direct sparse decomposition modules: SparseCholesky, …
|
| D | SparseCore | 17 * This module provides a sparse matrix representation, and basic associatd matrix manipulations
31 /** The type used to identify a general sparse storage. */
|
| /external/squashfs-tools/squashfs-tools/ |
| D | process_fragments.c | 64 int bytes = file_buffer->size, sparse = TRUE, value; in checksum_sparse() local
70 sparse = FALSE; in checksum_sparse()
76 return sparse; in checksum_sparse()
276 int sparse = checksum_sparse(file_buffer); in frag_thrd() local
283 if(sparse_files && sparse) { in frag_thrd()
|
| D | unsquashfs.h | 100 char sparse; member
208 char sparse; member
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| D | CMakeLists.txt | 29 add_library(deqp-vk-sparse-resources STATIC ${DEQP_VK_IMAGE_SRCS})
30 target_link_libraries(deqp-vk-sparse-resources ${DEQP_VK_IMAGE_LIBS})
|
| D | vktSparseResourcesBufferSparseResidency.hpp | 31 namespace sparse namespace
|
| D | vktSparseResourcesImageSparseResidency.hpp | 31 namespace sparse namespace
|
| D | vktSparseResourcesMipmapSparseResidency.hpp | 31 namespace sparse namespace
|
| D | vktSparseResourcesBufferMemoryAliasing.hpp | 31 namespace sparse namespace
|
| D | vktSparseResourcesTests.hpp | 31 namespace sparse namespace
|
| /external/ceres-solver/docs/source/ |
| D | features.rst | 51 `Eigen`_ or `LAPACK`_) for dense problems, sparse Cholesky
52 factorization (`SuiteSparse`_ or `CXSparse`_) for large sparse
53 problems custom Schur complement based dense, sparse, and
87 .. _SuiteSparse: http://www.cise.ufl.edu/research/sparse/SuiteSparse/
90 .. _CXSparse: https://www.cise.ufl.edu/research/sparse/CXSparse/
|
| /external/smali/smali/src/test/resources/LexerTest/ |
| D | DirectiveTest.tokens | 20 SPARSE_SWITCH_DIRECTIVE(".sparse-switch")
21 END_SPARSE_SWITCH_DIRECTIVE(".end sparse-switch")
|
| /external/autotest/client/tests/wb_kupdate/ |
| D | control | 8 This tests checks the wb_kupdate code path by writting data to a sparse file
27 sparse_file=os.path.join( # Absolute path to the sparse file.
|
| /external/squashfs-tools/kernel/fs/squashfs/ |
| D | file.c | 379 int bytes, i, offset = 0, sparse = 0; in squashfs_readpage() local
411 sparse = 1; in squashfs_readpage()
455 int avail = sparse ? 0 : min_t(int, bytes, PAGE_CACHE_SIZE); in squashfs_readpage()
480 if (!sparse) in squashfs_readpage()
|
| /external/e2fsprogs/misc/ |
| D | e2image.c | 561 int sparse = 0; in output_meta_data_blocks() local
662 if (sparse) in output_meta_data_blocks()
663 seek_relative(fd, sparse); in output_meta_data_blocks()
664 sparse = 0; in output_meta_data_blocks()
678 sparse += fs->blocksize; in output_meta_data_blocks()
679 if (sparse > 1024*1024) { in output_meta_data_blocks()
681 sparse -= 1024*1024; in output_meta_data_blocks()
698 sparse = 0; in output_meta_data_blocks()
715 if (sparse) { in output_meta_data_blocks()
721 offset = seek_relative(fd, sparse); in output_meta_data_blocks()
[all …]
|
| /external/chromium-trace/catapult/third_party/mapreduce/mapreduce/ |
| D | kv_pb.py | 168 def _BuildTagLookupTable(sparse, maxtag, default=None): argument
169 return tuple([sparse.get(i, default) for i in xrange(0, 1+maxtag)])
346 def _BuildTagLookupTable(sparse, maxtag, default=None): argument
347 return tuple([sparse.get(i, default) for i in xrange(0, 1+maxtag)])
|
| /external/e2fsprogs/tests/f_big_sparse/ |
| D | name | 1 big sparse file
|
| /external/opencv3/modules/imgproc/test/ |
| D | test_histograms.cpp | 757 CvSparseMat* sparse = (CvSparseMat*)hist[0]->bins; in validate_test_results() local
761 for( node = cvInitSparseMatIterator( sparse, &iterator ); in validate_test_results()
764 sum += *(float*)CV_NODE_VAL(sparse,node); in validate_test_results()
850 CvSparseMat* sparse = (CvSparseMat*)hist[0]->bins; in prepare_test_case() local
855 orig_nz_count = sparse->heap->active_count; in prepare_test_case()
860 for( node = cvInitSparseMatIterator( sparse, &iterator ), i = 0; in prepare_test_case()
863 const int* idx = CV_NODE_IDX(sparse,node); in prepare_test_case()
867 values->data.fl[i] = *(float*)CV_NODE_VAL(sparse,node); in prepare_test_case()
893 CvSparseMat* sparse = 0; in validate_test_results() local
898 sparse = (CvSparseMat*)hist[0]->bins; in validate_test_results()
[all …]
|