| /external/eigen/test/ |
| product_small.cpp | 36 for(Index i=0;i<C.rows();++i)
43 template<typename T, int Rows, int Cols, int Depth, int OC, int OA, int OB>
44 typename internal::enable_if<! ( (Rows ==1&&Depth!=1&&OA==ColMajor)
45 || (Depth==1&&Rows !=1&&OA==RowMajor)
48 || (Rows ==1&&Cols !=1&&OC==ColMajor)
49 || (Cols ==1&&Rows !=1&&OC==RowMajor)),void>::type
50 test_lazy_single(int rows, int cols, int depth)
52 Matrix<T,Rows,Depth,OA> A(rows,depth); A.setRandom();
54 Matrix<T,Rows,Cols,OC> C(rows,cols); C.setRandom()
86 int rows = internal::random<int>(1,12); local
115 int rows = internal::random<int>(1,12); local
151 int rows = internal::random<int>(1,12); local
[all...] |
| adjoint.cpp | 80 Index rows = m.rows(); local
83 MatrixType m1 = MatrixType::Random(rows, cols),
84 m2 = MatrixType::Random(rows, cols),
85 m3(rows, cols),
86 square = SquareMatrixType::Random(rows, rows);
87 VectorType v1 = VectorType::Random(rows),
88 v2 = VectorType::Random(rows),
89 v3 = VectorType::Random(rows),
[all...] |
| /external/ImageMagick/MagickCore/ |
| paint.c | 126 if ((((up)+(delta)) >= 0) && (((up)+(delta)) < (ssize_t) image->rows)) \
179 if ((y_offset < 0) || (y_offset >= (ssize_t) image->rows))
191 floodplane_image=CloneImage(image,image->columns,image->rows,MagickTrue,
327 magick_threads(floodplane_image,image,floodplane_image->rows,1)
329 for (y=0; y < (ssize_t) image->rows; y++)
440 gradient->bounding_box.height=image->rows;
445 gradient->gradient_vector.y2=(double) image->rows-1.0;
459 gradient->gradient_vector.y1=(double) image->rows-1.0;
467 gradient->gradient_vector.y1=(double) image->rows-1.0;
475 gradient->gradient_vector.y1=(double) image->rows-1.0
[all...] |
| /external/opencv/cv/src/ |
| cvtemplmatch.cpp | 103 if( img->cols < templ->cols || img->rows < templ->rows )
107 if( corr->rows > img->rows + templ->rows - 1 ||
115 blocksize.height = cvRound(templ->rows*block_scale);
116 blocksize.height = MAX( blocksize.height, min_block_size - templ->rows + 1 );
117 blocksize.height = MIN( blocksize.height, corr->rows );
122 dftsize.height = cvGetOptimalDFTSize(blocksize.height + templ->rows - 1);
129 blocksize.height = dftsize.height - templ->rows + 1
[all...] |
| /external/doclava/res/assets/templates/ |
| diff.cs | 71 if (tr.rowIndex + 1 < table.rows.length) {
72 var tbody = table.rows[tr.rowIndex + 1].parentNode;
79 if (tr.rowIndex + 1 < table.rows.length
80 && $(table.rows[tr.rowIndex + 1]).hasClass("class-entry")) {
81 var tbody = table.rows[tr.rowIndex + 1].parentNode;
99 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry")) {
100 $(table.rows[i++]).show();
107 while (i < table.rows.length && $(table.rows[i]).hasClass("method-entry"))
[all...] |
| /external/clang/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /external/clang/tools/scan-build-py/libscanbuild/resources/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 211 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows());
212 result.setZero(T.rows(), T.rows());
216 result += weight * (MatrixType::Identity(T.rows(), T.rows()) + node * TminusI)
243 RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum().maxCoeff();
283 MatrixType result(A.rows(), A.rows());
345 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixLogarithmReturnValue
[all...] |
| /frameworks/base/tools/preload/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-2812033/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3016494/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3217047/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3289846/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3362437/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3688880/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3859424/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-2812033/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3016494/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3217047/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3289846/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3362437/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3688880/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3859424/tools/scan-build/share/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/misc/darwin-x86/analyzer/tools/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
| /prebuilts/misc/linux-x86/analyzer/tools/scan-build/ |
| sorttable.js | 47 the.appendChild(table.rows[0]);
53 if (table.tHead.rows.length != 1) return; // can't cope with two header rows
55 // Sorttable v1 put rows with a class of "sortbottom" at the bottom (as
56 // "total" rows, for example). This is B&R, since what you're supposed
57 // to do is put them in a tfoot. So, if there are sortbottom rows,
60 for (var i=0; i<table.rows.length; i++) {
61 if (table.rows[i].className.search(/\bsortbottom\b/) != -1) {
62 sortbottomrows[sortbottomrows.length] = table.rows[i];
78 headrow = table.tHead.rows[0].cells
[all...] |
