Searched defs:matrix (Results 1 - 25 of 644) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/ceres-solver/examples/
H A Dlibmv_bundle_adjuster.cc57 // - Column-major camera rotation matrix, 9 float values.
132 // R is a 3x3 matrix representing the rotation of the camera.
333 // Read 3x3 column-major matrix from the file
335 Mat3 *matrix) {
337 (*matrix)(i % 3, i / 3) = file_reader.Read<float>();
627 // Convert cameras rotations fro mangle axis back to rotation matrix.
334 ReadMatrix3x3(const EndianAwareFileReader &file_reader, Mat3 *matrix) argument
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_diagonal_matrix.h50 // A thread safe block diagonal matrix implementation of
58 // modifying any cells when the matrix is being destroyed.
73 // Since the matrix is square, num_rows() == num_cols().
77 // Access to the underlying matrix object.
78 const TripletSparseMatrix* matrix() const { return tsm_.get(); } function in class:ceres::internal::BlockRandomAccessDiagonalMatrix
86 // The underlying matrix object which actually stores the cells.
H A Dblock_random_access_sparse_matrix.h52 // for doing the actual storage. This class augments this matrix with
58 // of this matrix.
63 // modifying any cells when the matrix is being destroyed.
78 // Since the matrix is square, num_rows() == num_cols().
82 // Access to the underlying matrix object.
83 const TripletSparseMatrix* matrix() const { return tsm_.get(); } function in class:ceres::internal::BlockRandomAccessSparseMatrix
100 // The underlying matrix object which actually stores the cells.
H A Dcompressed_row_sparse_matrix.cc236 << "Cannot append a matrix with row blocks to one without and vice versa."
237 << "This matrix has : " << row_blocks_.size() << " row blocks."
238 << "The matrix being appended has: " << m.row_blocks().size()
246 // Copy the contents of m into this matrix.
276 void CompressedRowSparseMatrix::ToCRSMatrix(CRSMatrix* matrix) const {
277 matrix->num_rows = num_rows_;
278 matrix->num_cols = num_cols_;
279 matrix->rows = rows_;
280 matrix->cols = cols_;
281 matrix
326 CompressedRowSparseMatrix* matrix = local
433 CompressedRowSparseMatrix* matrix = local
[all...]
H A Dcompressed_row_sparse_matrix_test.cc248 scoped_ptr<CompressedRowSparseMatrix> matrix(
252 EXPECT_EQ(matrix->num_rows(), 5);
253 EXPECT_EQ(matrix->num_cols(), 5);
254 EXPECT_EQ(matrix->num_nonzeros(), 9);
255 EXPECT_EQ(blocks, matrix->row_blocks());
256 EXPECT_EQ(blocks, matrix->col_blocks());
263 matrix->RightMultiply(x.data(), y.data());
269 matrix->LeftMultiply(x.data(), y.data());
275 matrix->ToDenseMatrix(&dense);
349 CompressedRowSparseMatrix matrix(
470 CompressedRowSparseMatrix* matrix = new CompressedRowSparseMatrix(tsm); local
476 ToDenseMatrix(const cs_di* matrix, Matrix* dense_matrix) argument
[all...]
H A Ddense_sparse_matrix.cc88 VectorRef(y, num_rows()) += matrix() * ConstVectorRef(x, num_cols());
93 matrix().transpose() * ConstVectorRef(x, num_rows());
147 ConstColMajorMatrixRef DenseSparseMatrix::matrix() const { function in class:ceres::internal::DenseSparseMatrix
H A Dincomplete_lq_factorization.cc45 inline double NormalizeRow(const int row, CompressedRowSparseMatrix* matrix) { argument
46 const int row_begin = matrix->rows()[row];
47 const int row_end = matrix->rows()[row + 1];
49 double* values = matrix->mutable_values();
111 // vector to matrix.
118 CompressedRowSparseMatrix* matrix) {
119 int* rows = matrix->mutable_rows();
120 int* cols = matrix->mutable_cols();
121 double* values = matrix->mutable_values();
122 int num_nonzeros = rows[matrix
113 DropEntriesAndAddRow(const Vector& dense_row, const int num_entries, const int level_of_fill, const double drop_tolerance, vector<pair<int, double> >* scratch, CompressedRowSparseMatrix* matrix) argument
164 IncompleteLQFactorization( const CompressedRowSparseMatrix& matrix, const int l_level_of_fill, const double l_drop_tolerance, const int q_level_of_fill, const double q_drop_tolerance) argument
[all...]
H A Dpartitioned_matrix_view.cc52 const BlockSparseMatrix& matrix) {
58 matrix, options.elimination_groups[0]);
64 matrix, options.elimination_groups[0]);
70 matrix, options.elimination_groups[0]);
76 matrix, options.elimination_groups[0]);
82 matrix, options.elimination_groups[0]);
88 matrix, options.elimination_groups[0]);
94 matrix, options.elimination_groups[0]);
100 matrix, options.elimination_groups[0]);
106 matrix, option
51 Create(const LinearSolver::Options& options, const BlockSparseMatrix& matrix) argument
[all...]
H A Dpartitioned_matrix_view_impl.h48 const BlockSparseMatrix& matrix,
50 : matrix_(matrix),
58 // in E maybe less than the number of row blocks in the input matrix
93 // input matrix is constructed. These methods will benefit from
228 // Given a range of columns blocks of a matrix m, compute the block
229 // structure of the block diagonal of the matrix m(:,
292 // Similar to the code in RightMultiplyE, except instead of the matrix
325 // Similar to the code in RightMultiplyF, except instead of the matrix
47 PartitionedMatrixView( const BlockSparseMatrix& matrix, int num_col_blocks_e) argument
H A Dpreconditioner.cc51 const SparseMatrix* matrix)
52 : matrix_(CHECK_NOTNULL(matrix)) {
50 SparseMatrixPreconditionerWrapper( const SparseMatrix* matrix) argument
H A Drotation_test.cc150 // double matrix[9];
151 // EXPECT_THAT(matrix, IsOrthonormal());
154 *result_listener << "Null matrix";
183 *result_listener << "Null matrix";
370 // Transforms a zero axis/angle to a rotation matrix.
373 double matrix[9]; local
375 AngleAxisToRotationMatrix(axis_angle, matrix);
376 EXPECT_THAT(matrix, IsOrthonormal());
377 EXPECT_THAT(matrix, IsNear3x3Matrix(expected));
382 double matrix[ local
392 double matrix[9]; local
407 double matrix[9]; local
420 double matrix[9]; local
504 double matrix[9]; local
539 double matrix[9]; local
572 double matrix[9]; local
[all...]
H A Dsuitesparse.cc131 // matrix dependence choice of supernodal versus simplicial
213 // Arrays storing the compressed column structure of the matrix
256 // distracting when the error (matrix is indefinite) is not a fatal
270 // NON_FATAL_FAILURE (e.g., indefinite matrix) and FATAL_FAILURE
323 bool SuiteSparse::ApproximateMinimumDegreeOrdering(cholmod_sparse* matrix, argument
325 return cholmod_amd(matrix, NULL, 0, ordering, &cc_);
329 cholmod_sparse* matrix,
333 return cholmod_camd(matrix, NULL, 0, constraints, ordering, &cc_);
328 ConstrainedApproximateMinimumDegreeOrdering( cholmod_sparse* matrix, int* constraints, int* ordering) argument
/external/chromium_org/ash/display/
H A Droot_window_transformers.cc39 SkMatrix44& matrix = transform->matrix(); local
42 if (std::abs(SkMScalarToFloat(matrix.get(x, y))) < kEpsilon)
43 matrix.set(x, y, SkFloatToMScalar(0.0f));
/external/chromium_org/cc/animation/
H A Dtransform_operation.h32 gfx::Transform matrix; member in struct:cc::TransformOperation
H A Dtransform_operations.cc35 to_return.PreconcatTransform(operations_[i].matrix);
91 !operations_[i].matrix.IsIdentityOrTranslation())
104 if (!operations_[i].matrix.IsIdentityOrTranslation())
161 if (!operations_[i].matrix.IsIdentityOrTranslation())
207 to_add.matrix.Translate3d(x, y, z);
221 to_add.matrix.RotateAbout(gfx::Vector3dF(x, y, z), degrees);
233 to_add.matrix.Scale3d(x, y, z);
244 to_add.matrix.SkewX(x);
245 to_add.matrix.SkewY(y);
255 to_add.matrix
262 AppendMatrix(const gfx::Transform& matrix) argument
[all...]
/external/chromium_org/cc/layers/
H A Dheads_up_display_layer.cc30 gfx::Transform matrix; local
31 matrix.MakeIdentity();
43 matrix.Translate(device_viewport_in_layout_pixels.width() - size, 0.0);
47 SetTransform(matrix);
H A Dvideo_frame_provider_client_impl.cc33 // This matrix is the default transformation for stream textures, and flips
85 void VideoFrameProviderClientImpl::DidUpdateMatrix(const float* matrix) { argument
87 matrix[0], matrix[4], matrix[8], matrix[12],
88 matrix[1], matrix[5], matrix[9], matrix[1
[all...]
/external/chromium_org/cc/output/
H A Dfilter_operation.cc62 FilterOperation::FilterOperation(FilterType type, SkScalar matrix[20]) argument
70 memcpy(matrix_, matrix, sizeof(matrix_));
152 SkScalar matrix[20]; local
153 memset(matrix, 0, 20 * sizeof(SkScalar));
154 matrix[0] = matrix[6] = matrix[12] = matrix[18] = 1.f;
155 return FilterOperation::CreateColorMatrixFilter(matrix);
280 scoped_ptr<base::ListValue> matrix(ne
[all...]
H A Dfilter_operation.h77 const SkScalar* matrix() const { function in class:cc::FilterOperation
134 static FilterOperation CreateColorMatrixFilter(SkScalar matrix[20]) { argument
135 return FilterOperation(COLOR_MATRIX, matrix);
197 void set_matrix(const SkScalar matrix[20]) { argument
200 matrix_[i] = matrix[i];
233 FilterOperation(FilterType, SkScalar matrix[20]);
H A Dfilter_operations.cc126 const SkScalar* matrix = op.matrix(); local
127 if (matrix[15] ||
128 matrix[16] ||
129 matrix[17] ||
130 matrix[18] != 1 ||
131 matrix[19])
H A Dfilter_operations_unittest.cc86 EXPECT_EQ(a[i], op.matrix()[i]); \
92 EXPECT_NE(a[i], op2.matrix()[i]); \
98 EXPECT_EQ(a[i], op.matrix()[i]); \
136 SkScalar matrix[20] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, local
138 SAVE_RESTORE_MATRIX(ColorMatrix, COLOR_MATRIX, matrix);
H A Dgl_renderer.cc963 // Can only draw surface if device matrix is invertible.
1010 // We have a single color matrix as a filter; apply it locally
1308 float matrix[16]; local
1311 matrix[i * 4 + j] = SkScalarToFloat(color_matrix[j * 5 + i]);
1314 gl_->UniformMatrix4fv(shader_color_matrix_location, 1, false, matrix));
1865 ToGLMatrix(&gl_matrix[0], quad->matrix);
2084 // Generate the transform matrix
2090 quad_rect_matrix.matrix().asColMajorf(m.data);
2188 transform.matrix().asColMajorf(gl_matrix);
H A Dgl_renderer_unittest.cc1276 SkScalar matrix[20]; local
1278 matrix[0] = 0.213f + 0.787f * amount;
1279 matrix[1] = 0.715f - 0.715f * amount;
1280 matrix[2] = 1.f - (matrix[0] + matrix[1]);
1281 matrix[3] = matrix[4] = 0;
1282 matrix[5] = 0.213f - 0.213f * amount;
1283 matrix[
[all...]
H A Drender_surface_filters.cc32 void GetBrightnessMatrix(float amount, SkScalar matrix[20]) { argument
36 memset(matrix, 0, 20 * sizeof(SkScalar));
37 matrix[0] = matrix[6] = matrix[12] = amount;
38 matrix[18] = 1.f;
41 void GetSaturatingBrightnessMatrix(float amount, SkScalar matrix[20]) { argument
44 memset(matrix, 0, 20 * sizeof(SkScalar));
45 matrix[0] = matrix[
49 GetContrastMatrix(float amount, SkScalar matrix[20]) argument
56 GetSaturateMatrix(float amount, SkScalar matrix[20]) argument
75 GetHueRotateMatrix(float hue, SkScalar matrix[20]) argument
97 GetInvertMatrix(float amount, SkScalar matrix[20]) argument
104 GetOpacityMatrix(float amount, SkScalar matrix[20]) argument
110 GetGrayscaleMatrix(float amount, SkScalar matrix[20]) argument
132 GetSepiaMatrix(float amount, SkScalar matrix[20]) argument
152 CreateMatrixImageFilter( const SkScalar matrix[20], const skia::RefPtr<SkImageFilter>& input) argument
167 SkScalar matrix[20]; local
[all...]

Completed in 431 milliseconds

1234567891011>>