| /external/ceres-solver/internal/ceres/ |
| implicit_schur_complement_test.cc | 141 if ((y - z).norm() > kEpsilon) {
150 if ((isc.rhs() - rhs).norm() > kEpsilon) {
165 if ((sol - reference_solution).norm() > kEpsilon) {
|
| compressed_row_sparse_matrix_test.cc | 62 EXPECT_EQ((y_a - y_b).norm(), 0);
103 EXPECT_EQ((b1 - b2).norm(), 0);
114 EXPECT_EQ((b1 - b2).norm(), 0);
180 EXPECT_EQ((tsm_dense - crsm_dense).norm(), 0.0);
|
| iterative_schur_complement_solver_test.cc | 99 double diff = (isc_sol - reference_solution).norm();
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.h | 64 // 4. its L0 norm is close to zero.
71 void SetNormalizer(const double norm) {
72 normalizer_ = norm;
142 // L-x norm. eg. L1, L2.
156 // Reproject using the given norm.
158 int32 Reproject(const double norm, const RegularizationType r);
|
| stochastic_linear_ranker.h | 117 void SetNormConstraint(const double norm) {
118 norm_constraint_ = norm;
|
| /external/eigen/bench/ |
| quat_slerp.cpp | 92 theta = /*M_PI -*/ Scalar(2)*std::asin( (a.coeffs()+b.coeffs()).norm()/2 );
94 theta = Scalar(2)*std::asin( (a.coeffs()-b.coeffs()).norm()/2 );
115 // theta = Scalar(2) * atan2((a.coeffs()-b.coeffs()).norm(),(a.coeffs()+b.coeffs()).norm());
120 theta = /*M_PI -*/ Scalar(2)*std::asin( (-a.coeffs()-b.coeffs()).norm()/2 );
122 theta = Scalar(2)*std::asin( (a.coeffs()-b.coeffs()).norm()/2 );
199 err[0] = (cr.coeffs()-refc.cast<RefScalar>().coeffs()).norm();
203 err[k+1] = (c[k].coeffs()-refc.coeffs()).norm();
|
| /external/eigen/test/eigen2/ |
| eigen2_prec_inverse_4x4.cpp | 42 double error = double( (m*inv-MatrixType::Identity()).norm() / epsilon<Scalar>() );
62 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() );
|
| eigen2_hyperplane.cpp | 93 while (u.norm() < 1e-4) u = Vector::Random();
94 while (v.norm() < 1e-4) v = Vector::Random();
100 VERIFY_IS_APPROX(line_u.normal().norm(), Scalar(1));
101 VERIFY_IS_APPROX(line_v.normal().norm(), Scalar(1));
|
| eigen2_parametrizedline.cpp | 41 VERIFY_IS_APPROX( (l0.projection(p1)-p1).norm(), l0.distance(p1) );
|
| /external/eigen/unsupported/test/ |
| alignedvector3.cpp | 43 VERIFY_IS_APPROX(f2.norm(),r2.norm());
|
| /external/icu4c/tools/gennorm2/ |
| n2builder.h | 34 struct Norm;
78 Norm *allocNorm();
79 Norm *getNorm(UChar32 c);
80 Norm *createNorm(UChar32 c);
81 Norm *checkNormForMapping(Norm *p, UChar32 c); // check for permitted overrides
83 const Norm &getNormRef(UChar32 c) const;
85 UBool combinesWithCCBetween(const Norm &norm, uint8_t lowCC, uint8_t highCC) const;
86 UChar32 combine(const Norm &norm, UChar32 trail) const
[all...] |
| n2builder.cpp | 98 struct Norm {
176 normMem=utm_open("gennorm2 normalization structs", 10000, 0x110100, sizeof(Norm));
177 norms=allocNorm(); // unused Norm struct at index 0
211 Norm *Normalizer2DataBuilder::allocNorm() {
212 Norm *p=(Norm *)utm_alloc(normMem);
213 norms=(Norm *)utm_getStart(normMem); // in case it got reallocated
217 /* get an existing Norm unit */
218 Norm *Normalizer2DataBuilder::getNorm(UChar32 c) {
226 const Norm &Normalizer2DataBuilder::getNormRef(UChar32 c) const
449 Norm &norm=norms[value]; local
1057 const Norm &norm=norms[i]; local
[all...] |
| /external/opencv/cxcore/src/ |
| _cxipp.h | 316 ( const srctype* img, int imgstep, CvSize size, double* norm )) \
319 ( const srctype* img, int imgstep, CvSize size, double* norm )) \
322 ( const srctype* img, int imgstep, CvSize size, double* norm )) \
327 CvSize size, double* norm )) \
332 CvSize size, double* norm )) \
337 CvSize size, double* norm ))
343 CvSize size, double* norm )) \
347 CvSize size, double* norm, CvHintAlgorithm )) \
351 CvSize size, double* norm, CvHintAlgorithm )) \
356 CvSize size, double* norm )) \
[all...] |
| cxutils.cpp | 716 double norm = 0, v; local
728 norm += v*v;
730 norm = sqrt(norm);
736 norm += v;
742 norm = MAX(norm,v);
745 norm = norm > DBL_EPSILON ? 1./norm : 0.
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Dot.h | 58 * \sa squaredNorm(), norm()
104 //---------- implementation of L2 norm and related functions ----------
106 /** \returns, for vectors, the squared \em l2 norm of \c *this, and for matrices the Frobenius norm.
110 * \sa dot(), norm()
118 /** \returns, for vectors, the \em l2 norm of \c *this, and for matrices the Frobenius norm.
125 inline typename NumTraits<typename internal::traits<Derived>::Scalar>::Real MatrixBase<Derived>::norm() const function in class:Eigen::MatrixBase
130 /** \returns an expression of the quotient of *this by its own norm.
134 * \sa norm(), normalize(
[all...] |
| /external/eigen/test/ |
| geo_hyperplane.cpp | 94 while (u.norm() < 1e-4) u = Vector::Random();
95 while (v.norm() < 1e-4) v = Vector::Random();
101 VERIFY_IS_APPROX(line_u.normal().norm(), Scalar(1));
102 VERIFY_IS_APPROX(line_v.normal().norm(), Scalar(1));
|
| geo_orthomethods.cpp | 80 VERIFY_IS_APPROX(v0.unitOrthogonal().norm(), RealScalar(1));
88 VERIFY_IS_APPROX(v0.unitOrthogonal().norm(), RealScalar(1));
|
| /external/srec/srec/crec/ |
| get_fram.c | 438 void convert_adjustment_to_imelda(norm_info *norm, preprocessed *prep)
444 ASSERT(norm);
446 fram[ii] = (imeldata) norm->adjust[ii]; /* TODO: review types */
453 norm->imelda_adjust[ii] = fram[ii];
455 log_report("NORM AUX: ");
456 for (ii = 0; ii < norm->dim; ii++)
457 log_report("%d ", (int)norm->imelda_adjust[ii]);
460 norm->adj_valid = True;
|
| /external/jmonkeyengine/engine/src/tools/jme3tools/optimize/ |
| GeometryBatchFactory.java | 46 Vector3f norm = new Vector3f(); local
53 norm.x = inBuf.get(i * 3 + 0);
54 norm.y = inBuf.get(i * 3 + 1);
55 norm.z = inBuf.get(i * 3 + 2);
57 transform.multNormal(norm, norm);
59 outBuf.put(offset + i * 3 + 0, norm.x);
60 outBuf.put(offset + i * 3 + 1, norm.y);
61 outBuf.put(offset + i * 3 + 2, norm.z);
|
| /external/eigen/demos/opengl/ |
| gpuhelper.cpp | 60 float length = vec.norm();
81 float length = vec.norm();
|
| /external/stlport/src/ |
| num_get_float.cpp | 232 static void _Stl_norm_and_round(uint64& p, int& norm, uint64 prodhi, uint64 prodlo) {
233 norm = 0;
247 norm = 1;
300 int norm; /* number of bits of normalization */ local
308 _Stl_norm_and_round(p, norm, prodhi, prodlo);
309 bexp += _Stl_twoexp[hi] - norm;
315 _Stl_norm_and_round(p, norm, prodhi, prodlo);
316 bexp += _Stl_twoexp[lo] - norm;
|
| /frameworks/rs/ |
| rsComponent.cpp | 29 void Component::set(RsDataType dt, RsDataKind dk, bool norm, uint32_t vecSize) {
32 mNormalized = norm;
|
| /ndk/sources/cxx-stl/stlport/src/ |
| num_get_float.cpp | 232 static void _Stl_norm_and_round(uint64& p, int& norm, uint64 prodhi, uint64 prodlo) {
233 norm = 0;
247 norm = 1;
300 int norm; /* number of bits of normalization */ local
308 _Stl_norm_and_round(p, norm, prodhi, prodlo);
309 bexp += _Stl_twoexp[hi] - norm;
315 _Stl_norm_and_round(p, norm, prodhi, prodlo);
316 bexp += _Stl_twoexp[lo] - norm;
|
| /external/srec/srec/include/ |
| c42mul.h | 102 void convert_adjustment_to_imelda(norm_info *norm, preprocessed *prep);
|
| /external/eigen/Eigen/src/Geometry/ |
| OrthoMethods.h | 143 RealScalar invnm = RealScalar(1)/(Vector2() << src.coeff(sndi),src.coeff(maxi)).finished().norm();
170 RealScalar invnm = RealScalar(1)/src.template head<2>().norm();
181 RealScalar invnm = RealScalar(1)/src.template tail<2>().norm();
|
