Searched defs:square (Results 1 - 25 of 40) sorted by relevance

12

/external/chromium_org/third_party/flot/
H A Djquery.flot.symbol.min.js10 symbol: "square" // or "diamond", "triangle", "cross"
14 */(function(e){function t(e,t,n){var r={square:function(e,t,n,r,i){var s=r*Math.sqrt(Math.PI)/2;e.rect(t-s,n-s,s+s,s+s)},diamond:function(e,t,n,r (…) method
/external/chromium_org/v8/test/mjsunit/harmony/
H A Darrow-functions.js34 var square = x => x * x; variable
35 assertEquals(9, square(3));
/external/eigen/Eigen/src/plugins/
H A DArrayCwiseUnaryOps.h21 * \sa abs(), square()
55 /** \returns an expression of the coefficient-wise square root of *this.
60 * \sa pow(), square()
163 /** \returns an expression of the coefficient-wise square of *this.
171 square() const function
181 * \sa square(), pow()
/external/eigen/test/
H A Ddontalign.cpp31 SquareMatrixType square = SquareMatrixType::Random(rows,rows); local
34 VERIFY_IS_APPROX(v, square * square.colPivHouseholderQr().solve(v));
35 square = square.inverse().eval();
36 a = square * a;
37 square = square*square;
38 v = square *
[all...]
H A Dadjoint.cpp18 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) { argument
23 VERIFY(test_isApproxWithRef(v1.dot(square * v2), (square.adjoint() * v1).dot(v2), 0));
29 static void run(const Vec& v1, const Vec& v2, Vec& v3, const Mat& square, Scalar s1, Scalar s2) { argument
47 ref = NumTraits<Scalar>::IsInteger ? 0 : (std::max)((std::max)(v1.norm(),v2.norm()),(std::max)((square * v2).norm(),(square.adjoint() * v1).norm()));
48 VERIFY(internal::isMuchSmallerThan(abs(v1.dot(square * v2) - (square.adjoint() * v1).dot(v2)), ref, test_precision<Scalar>()));
74 square = SquareMatrixType::Random(rows, rows); local
95 adjoint_specific<NumTraits<Scalar>::IsInteger>::run(v1, v2, v3, square, s
[all...]
H A Dinteger_types.cpp73 square = SquareMatrixType::Random(rows, rows); local
131 VERIFY_IS_APPROX(square * (m1 + m2), square * m1 + square * m2);
132 VERIFY_IS_APPROX((m1 + m2).transpose() * square, m1.transpose() * square + m2.transpose() * square);
H A Dproduct.h44 square = RowSquareMatrixType::Random(rows, rows), local
68 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2);
69 VERIFY_IS_APPROX(square*(m1 - m2), square*m1-square*m2);
72 VERIFY_IS_APPROX(s1*(square*m1), (s1*square)*m1);
73 VERIFY_IS_APPROX(s1*(square*m
[all...]
H A Dbasicstuff.cpp30 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows); local
73 square.col(r) = square.row(r).eval();
76 rv = square.row(r);
77 cv = square.col(r);
H A Dproduct_extra.cpp29 square = MatrixType::Random(rows, rows), local
42 VERIFY_IS_APPROX(m3.noalias() = m1.adjoint() * square.adjoint(), m1.adjoint().eval() * square.adjoint().eval());
/external/eigen/test/eigen2/
H A Deigen2_miscmatrices.cpp31 square = v1.asDiagonal(); local
32 if(r==r2) VERIFY_IS_APPROX(square(r,r2), v1[r]);
33 else VERIFY_IS_MUCH_SMALLER_THAN(square(r,r2), static_cast<Scalar>(1));
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
36 VERIFY_IS_APPROX(square, MatrixType::Identity(rows, rows));
H A Deigen2_basicstuff.cpp28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows); local
71 square.col(r) = square.row(r).eval();
74 rv = square.row(r);
75 cv = square.col(r);
H A Deigen2_adjoint.cpp34 square = SquareMatrixType::Random(rows, rows); local
64 VERIFY(ei_isApprox(v1.eigen2_dot(square * v2), (square.adjoint() * v1).eigen2_dot(v2), largerEps));
H A Deigen2_cwiseop.cpp39 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows); local
80 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square());
101 VERIFY_IS_APPROX(m3.cwise().square(), m1.cwise().abs());
102 VERIFY_IS_APPROX(m1.cwise().square().cwise().sqrt(), m1.cwise().abs());
105 VERIFY_IS_APPROX(m1.cwise().pow(2), m1.cwise().square());
112 VERIFY_IS_APPROX(mones, m1.cwise().sin().cwise().square() + m1.cwise().cos().cwise().square());
H A Deigen2_nomalloc.cpp39 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> local
H A Deigen2_triangular.cpp33 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> local
H A Deigen2_submatrices.cpp58 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime> local
74 VERIFY_IS_APPROX(square.row(r1).eigen2_dot(m1.col(c1)), (square.lazy() * m1.conjugate())(r1,c1));
H A Dproduct.h47 square = RowSquareMatrixType::Random(rows, rows), local
73 VERIFY_IS_APPROX(square*(m1 + m2), square*m1+square*m2);
74 VERIFY_IS_APPROX(square*(m1 - m2), square*m1-square*m2);
77 VERIFY_IS_APPROX(s1*(square*m1), (s1*square)*m1);
78 VERIFY_IS_APPROX(s1*(square*m
[all...]
/external/chromium_org/third_party/WebKit/Source/core/animation/animatable/
H A DAnimatableColor.cpp39 double square(double x) function in namespace:__anon10997
89 return sqrt(square(m_red - other.m_red)
90 + square(m_green - other.m_green)
91 + square(m_blue - other.m_blue)
92 + square(m_alpha - other.m_alpha));
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_context_tree.c14 static const BLOCK_SIZE square[] = { variable
86 // This function sets up a tree of contexts such that at each square
118 tree->block_size = square[0];
131 tree->block_size = square[square_index];
/external/chromium_org/ppapi/examples/2d/
H A Dpaint_manager_example.cc17 // Number of pixels to each side of the center of the square that we draw.
20 // We identify our square by the center point. This computes the rect for the
21 // square given that point.
55 // Update the square on a mouse down.
64 // Update the square on a drag.
112 // Paint the square black. Because we're lazy, we do this outside of the
114 pp::Rect square = SquareForPoint(last_x_, last_y_); local
116 square.x() - paint_bounds.x(),
117 square.y() - paint_bounds.y(),
118 square
[all...]
/external/chromium_org/ppapi/examples/input/
H A Dpointer_event_input.cc17 // Number of pixels to each side of the center of the square that we draw.
20 // We identify our square by the center point. This computes the rect for the
21 // square given that point.
55 // Update the square on a mouse down.
64 // Update the square on a drag.
74 // Update the square on a touch down.
130 // Paint the square black. Because we're lazy, we do this outside of the
132 pp::Rect square = SquareForPoint(last_x_, last_y_); local
134 square.x() - paint_bounds.x(),
135 square
[all...]
/external/chromium_org/v8/test/mjsunit/
H A Dkeyed-call-generic.js49 Number.prototype.square = function() { return this * this; }
50 Number.prototype.power4 = function() { return this.square().square(); }
69 testOne(2, 'square', 4);
/external/eigen/Eigen/src/Eigen2Support/
H A DCwiseOperators.h135 /** \deprecated ArrayBase::square() */
138 Cwise<ExpressionType>::square() const function in class:Eigen::Cwise
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DECFieldElement.java21 public abstract ECFieldElement square(); method in class:ECFieldElement
199 public ECFieldElement square() method in class:ECFieldElement.Fp
230 return z.square().equals(this) ? z : null;
792 // public ECFieldElement square()
1208 public ECFieldElement square() method in class:ECFieldElement.F2m
/external/clang/test/CXX/dcl.dcl/dcl.spec/dcl.constexpr/
H A Dp1.cpp100 constexpr int square(int x); // expected-note {{declared here}}
110 : x(square(a)), y(square(a)) // expected-note {{undefined function 'square' cannot be used in a constant expression}}
115 constexpr int square(int x) { function

Completed in 429 milliseconds

12