Searched refs:inverse (Results 1 - 25 of 211) sorted by relevance

123456789

/external/eigen/doc/snippets/
H A DCwise_inverse.cpp2 cout << v.inverse() << endl;
H A DMatrixBase_computeInverseAndDetWithCheck.cpp3 Matrix3d inverse; variable
6 m.computeInverseAndDetWithCheck(inverse,determinant,invertible);
9 cout << "It is invertible, and its inverse is:" << endl << inverse << endl;
H A DMatrixBase_computeInverseWithCheck.cpp3 Matrix3d inverse; variable
5 m.computeInverseWithCheck(inverse,invertible);
7 cout << "It is invertible, and its inverse is:" << endl << inverse << endl;
H A DMatrixBase_inverse.cpp3 cout << "Its inverse is:" << endl << m.inverse() << endl;
H A DTutorial_solve_matrix_inverse.cpp5 Vector3f x = A.inverse() * b;
H A DComplexSchur_compute.cpp5 schur.compute(A.inverse());
H A DRealSchur_compute.cpp5 schur.compute(A.inverse(), /* computeU = */ false);
H A DSelfAdjointEigenSolver_operatorInverseSqrt.cpp6 cout << "The inverse square root of A is: " << endl;
8 cout << "We can also compute it with operatorSqrt() and inverse(). That yields: " << endl;
9 cout << es.operatorSqrt().inverse() << endl;
H A Dclass_FullPivLU.cpp16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
H A DEigenSolver_pseudoEigenvectors.cpp9 cout << "Finally, V * D * V^(-1) = " << endl << V * D * V.inverse() << endl;
/external/eigen/test/eigen2/
H A Deigen2_inverse.cpp14 template<typename MatrixType> void inverse(const MatrixType& m) function
36 m2 = m1.inverse();
37 VERIFY_IS_APPROX(m1, m2.inverse() );
40 VERIFY_IS_APPROX(m1, m2.inverse() );
42 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
44 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
45 VERIFY_IS_APPROX(identity, m1 * m1.inverse() );
47 VERIFY_IS_APPROX(m1, m1.inverse().inverse() );
[all...]
/external/eigen/test/
H A Dinverse.cpp14 template<typename MatrixType> void inverse(const MatrixType& m) function
31 m2 = m1.inverse();
32 VERIFY_IS_APPROX(m1, m2.inverse() );
34 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
36 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
37 VERIFY_IS_APPROX(identity, m1 * m1.inverse() );
39 VERIFY_IS_APPROX(m1, m1.inverse().inverse() );
42 VERIFY_IS_APPROX(MatrixType(m1.transpose().inverse()), MatrixTyp
[all...]
H A Dsparse_permutations.cpp55 res = mat*p.inverse();
56 res_d = mat*p.inverse();
59 res = p.inverse()*mat;
60 res_d = p.inverse()*mat_d;
64 res_d = (p * mat_d) * p.inverse();
122 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>();
126 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Upper>();
130 res_d = ((p * lo_sym_d) * p.inverse()).eval().template triangularView<Lower>();
134 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Lower>();
139 res_d = ((p * up_sym_d) * p.inverse())
[all...]
H A Dpermutationmatrices.cpp48 VERIFY_IS_APPROX(lp.inverse()*m_permuted*rp.inverse(), m_original);
49 VERIFY_IS_APPROX(lv.asPermutation().inverse()*m_permuted*rv.asPermutation().inverse(), m_original);
50 VERIFY_IS_APPROX(MapLeftPerm(lv.data(),lv.size()).inverse()*m_permuted*MapRightPerm(rv.data(),rv.size()).inverse(), m_original);
52 VERIFY((lp*lp.inverse()).toDenseMatrix().isIdentity());
53 VERIFY((lv.asPermutation()*lv.asPermutation().inverse()).toDenseMatrix().isIdentity());
54 VERIFY((MapLeftPerm(lv.data(),lv.size())*MapLeftPerm(lv.data(),lv.size()).inverse()).toDenseMatrix().isIdentity());
70 m_permuted = lp.inverse() * m_permute
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DInverseBiMapTest.java22 * Unit test covering the inverse view of a {@code BiMap}.
29 BiMap<String, Integer> inverse = HashBiMap.create();
30 return inverse.inverse();
H A DSynchronizedBiMapTest.java61 public BiMap<V, K> inverse() { method in class:SynchronizedBiMapTest.TestBiMap
63 return delegate.inverse();
80 BiMap<Integer, String> inverse = bimap.inverse();
81 assertSame(bimap, inverse.inverse());
82 assertTrue(inverse instanceof SynchronizedBiMap);
83 assertSame(mutex, ((SynchronizedBiMap<?, ?>) inverse).mutex);
104 * If you serialize a synchronized bimap and its inverse together, the
107 * inverse o
[all...]
H A DBiMapMapInterfaceTest.java63 BiMap<Integer, String> inverse = bimap.inverse();
64 assertEquals(bimap.size(), inverse.size());
66 assertEquals(entry.getKey(), inverse.get(entry.getValue()));
68 for (Entry<Integer, String> entry : inverse.entrySet()) {
89 return HashBiMap.<Integer, String>create().inverse();
H A DHashBiMapTest.java44 assertEquals("canada", bimap.inverse().get("dollar"));
55 assertEquals("canada", bimap.inverse().get("dollar"));
62 BiMap<Integer, Integer> inverse = bimap.inverse();
71 assertEquals(2 * i, (int) inverse.get(2 * i + 1));
81 assertEquals(2 * i, (int) inverse.get(2 * i - 1));
106 assertEquals(1, bimap.inverse().size());
121 assertEquals(1, bimap.inverse().size());
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DRegularImmutableBiMap.java30 private ImmutableBiMap<V, K> inverse; field in class:RegularImmutableBiMap
40 this.inverse = new RegularImmutableBiMap<V, K>(backwardMap, this);
44 ImmutableBiMap<V, K> inverse) {
46 this.inverse = inverse;
49 @Override public ImmutableBiMap<V, K> inverse() { method in class:RegularImmutableBiMap
50 return inverse;
43 RegularImmutableBiMap(ImmutableMap<K, V> delegate, ImmutableBiMap<V, K> inverse) argument
/external/guava/guava/src/com/google/common/collect/
H A DRegularImmutableBiMap.java30 final transient ImmutableBiMap<V, K> inverse; field in class:RegularImmutableBiMap
40 this.inverse = new RegularImmutableBiMap<V, K>(backwardMap, this);
44 ImmutableBiMap<V, K> inverse) {
46 this.inverse = inverse;
53 @Override public ImmutableBiMap<V, K> inverse() { method in class:RegularImmutableBiMap
54 return inverse;
58 return delegate.isPartialView() || inverse.delegate().isPartialView();
43 RegularImmutableBiMap(ImmutableMap<K, V> delegate, ImmutableBiMap<V, K> inverse) argument
/external/eigen/doc/examples/
H A DTutorialLinAlgInverseDeterminant.cpp15 cout << "The inverse of A is:\n" << A.inverse() << endl;
/external/iptables/include/linux/netfilter/
H A Dxt_connlimit.h22 unsigned int inverse; member in union:xt_connlimit_info::__anon7321
/external/skia/src/pdf/
H A DSkPDFFormXObject.cpp46 SkMatrix inverse; local
47 if (!device->initialTransform().invert(&inverse)) {
50 inverse.reset();
52 insert("Matrix", SkPDFUtils::MatrixToArray(inverse))->unref();
/external/webp/src/utils/
H A Dfilters.c33 uint8_t* dst, int length, int inverse) {
35 if (inverse) {
46 int width, int height, int bpp, int stride, int inverse, uint8_t* out) {
48 const uint8_t* preds = (inverse ? out : in);
57 PredictLine(in, preds - stride, out, bpp, inverse);
59 PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse);
80 int width, int height, int bpp, int stride, int inverse, uint8_t* out) {
82 const uint8_t* preds = (inverse ? out : in);
88 PredictLine(in + bpp, preds, out + bpp, bpp * (width - 1), inverse);
94 PredictLine(in, preds, out, bpp * width, inverse);
32 PredictLine(const uint8_t* src, const uint8_t* pred, uint8_t* dst, int length, int inverse) argument
45 DoHorizontalFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument
79 DoVerticalFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument
118 DoGradientFilter(const uint8_t* in, int width, int height, int bpp, int stride, int inverse, uint8_t* out) argument
[all...]
/external/webkit/Source/WebCore/rendering/
H A DTransformState.cpp96 return m_accumulatedTransform->inverse().projectPoint(m_lastPlanarPoint);
107 return m_accumulatedTransform->inverse().projectQuad(m_lastPlanarQuad);
117 TransformationMatrix inverseTransform = t.inverse();
157 TransformationMatrix inverseTransform = t.inverse();
167 return m_accumulatedTransform.inverse().projectPoint(m_lastPlanarPoint);
172 return m_accumulatedTransform.inverse().projectQuad(m_lastPlanarQuad);

Completed in 576 milliseconds

123456789