| /external/eigen/doc/snippets/ |
| Cwise_inverse.cpp | 2 cout << v.inverse() << endl;
|
| MatrixBase_computeInverseAndDetWithCheck.cpp | 3 Matrix3d inverse; variable
6 m.computeInverseAndDetWithCheck(inverse,determinant,invertible);
9 cout << "It is invertible, and its inverse is:" << endl << inverse << endl;
|
| MatrixBase_computeInverseWithCheck.cpp | 3 Matrix3d inverse; variable
5 m.computeInverseWithCheck(inverse,invertible);
7 cout << "It is invertible, and its inverse is:" << endl << inverse << endl;
|
| MatrixBase_inverse.cpp | 3 cout << "Its inverse is:" << endl << m.inverse() << endl;
|
| Tutorial_solve_matrix_inverse.cpp | 5 Vector3f x = A.inverse() * b;
|
| ComplexSchur_compute.cpp | 5 schur.compute(A.inverse());
|
| RealSchur_compute.cpp | 5 schur.compute(A.inverse(), /* computeU = */ false);
|
| SelfAdjointEigenSolver_operatorInverseSqrt.cpp | 6 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;
|
| class_FullPivLU.cpp | 16 cout << lu.permutationP().inverse() * l * u * lu.permutationQ().inverse() << endl;
|
| /external/eigen/test/eigen2/ |
| eigen2_inverse.cpp | 14 template<typename MatrixType> void inverse(const MatrixType& m) function
17 Inverse.h
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/ |
| inverse.cpp | 14 template<typename MatrixType> void inverse(const MatrixType& m) function
19 Inverse.h
30 m2 = m1.inverse();
31 VERIFY_IS_APPROX(m1, m2.inverse() );
33 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5));
35 VERIFY_IS_APPROX(identity, m1.inverse() * m1 );
36 VERIFY_IS_APPROX(identity, m1 * m1.inverse() );
38 VERIFY_IS_APPROX(m1, m1.inverse().inverse() );
[all...] |
| sparse_permutations.cpp | 55 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()).eval().template triangularView<Upper>()
[all...] |
| permutationmatrices.cpp | 47 VERIFY_IS_APPROX(lp.inverse()*m_permuted*rp.inverse(), m_original);
48 VERIFY_IS_APPROX(lv.asPermutation().inverse()*m_permuted*rv.asPermutation().inverse(), m_original);
49 VERIFY_IS_APPROX(MapLeftPerm(lv.data(),lv.size()).inverse()*m_permuted*MapRightPerm(rv.data(),rv.size()).inverse(), m_original);
51 VERIFY((lp*lp.inverse()).toDenseMatrix().isIdentity());
52 VERIFY((lv.asPermutation()*lv.asPermutation().inverse()).toDenseMatrix().isIdentity());
53 VERIFY((MapLeftPerm(lv.data(),lv.size())*MapLeftPerm(lv.data(),lv.size()).inverse()).toDenseMatrix().isIdentity());
69 m_permuted = lp.inverse() * m_permuted
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| InverseBiMapTest.java | 22 * Unit test covering the inverse view of a {@code BiMap}.
29 BiMap<String, Integer> inverse = HashBiMap.create(); local
30 return inverse.inverse();
|
| SynchronizedBiMapTest.java | 61 public BiMap<V, K> inverse() { method in class:SynchronizedBiMapTest.TestBiMap
63 return delegate.inverse();
80 BiMap<Integer, String> inverse = bimap.inverse(); local
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 of one won't be the same as the other
[all...] |
| BiMapMapInterfaceTest.java | 63 BiMap<Integer, String> inverse = bimap.inverse(); local
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();
|
| HashBiMapTest.java | 44 assertEquals("canada", bimap.inverse().get("dollar"));
55 assertEquals("canada", bimap.inverse().get("dollar"));
62 BiMap<Integer, Integer> inverse = bimap.inverse(); local
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/ |
| RegularImmutableBiMap.java | 30 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;
|
| /external/guava/guava/src/com/google/common/collect/ |
| RegularImmutableBiMap.java | 30 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();
|
| /external/eigen/doc/examples/ |
| TutorialLinAlgInverseDeterminant.cpp | 15 cout << "The inverse of A is:\n" << A.inverse() << endl;
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| HitTestingTransformState.cpp | 59 TransformationMatrix inverseTransform = t.inverse();
70 return m_accumulatedTransform.inverse().projectPoint(m_lastPlanarPoint);
75 return m_accumulatedTransform.inverse().projectQuad(m_lastPlanarQuad);
80 return m_accumulatedTransform.inverse().projectQuad(m_lastPlanarArea);
85 return m_accumulatedTransform.inverse().clampedBoundsOfProjectedQuad(m_lastPlanarArea);
|
| /external/chromium_org/third_party/skia/src/pdf/ |
| SkPDFFormXObject.cpp | 38 SkMatrix inverse; local
39 if (!device->initialTransform().invert(&inverse)) {
42 inverse.reset();
44 insert("Matrix", SkPDFUtils::MatrixToArray(inverse))->unref();
|
| /external/iptables/include/linux/netfilter/ |
| xt_connlimit.h | 24 unsigned int inverse; member in union:xt_connlimit_info::__anon2150
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkMatrix44.cpp | 451 bool SkMatrix44::invert(SkMatrix44* inverse) const {
453 if (inverse) {
454 inverse->setIdentity();
460 if (inverse) {
461 inverse->setTranslate(-fMat[3][0], -fMat[3][1], -fMat[3][2]);
471 if (inverse) {
476 inverse->fMat[0][0] = invXScale;
477 inverse->fMat[0][1] = 0;
478 inverse->fMat[0][2] = 0;
479 inverse->fMat[0][3] = 0
[all...] |
| /external/chromium_org/third_party/libwebp/utils/ |
| filters.c | 32 uint8_t* dst, int length, int inverse) {
34 if (inverse) {
47 int inverse, uint8_t* out) {
54 preds = inverse ? out : in;
59 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
69 PredictLine(in, preds - stride, out, 1, inverse);
70 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
94 int inverse, uint8_t* out) {
101 preds = inverse ? out : in;
107 PredictLine(in + 1, preds, out + 1, width - 1, inverse);
[all...] |
