/external/eigen/doc/snippets/ |
H A D | Cwise_inverse.cpp | 2 cout << v.inverse() << endl;
|
H A D | 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;
|
H A D | MatrixBase_computeInverseWithCheck.cpp | 3 Matrix3d inverse; variable 5 m.computeInverseWithCheck(inverse,invertible); 7 cout << "It is invertible, and its inverse is:" << endl << inverse << endl;
|
H A D | MatrixBase_inverse.cpp | 3 cout << "Its inverse is:" << endl << m.inverse() << endl;
|
H A D | Tutorial_solve_matrix_inverse.cpp | 5 Vector3f x = A.inverse() * b;
|
H A D | ComplexSchur_compute.cpp | 5 schur.compute(A.inverse());
|
H A D | RealSchur_compute.cpp | 5 schur.compute(A.inverse(), /* computeU = */ false);
|
H A D | 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;
|
/external/eigen/test/eigen2/ |
H A D | eigen2_inverse.cpp | 14 template<typename MatrixType> void inverse(const MatrixType& m) function 35 m2 = m1.inverse(); 36 VERIFY_IS_APPROX(m1, m2.inverse() ); 39 VERIFY_IS_APPROX(m1, m2.inverse() ); 41 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5)); 43 VERIFY_IS_APPROX(identity, m1.inverse() * m1 ); 44 VERIFY_IS_APPROX(identity, m1 * m1.inverse() ); 46 VERIFY_IS_APPROX(m1, m1.inverse().inverse() ); [all...] |
/external/eigen/test/ |
H A D | inverse.cpp | 14 template<typename MatrixType> void inverse(const MatrixType& m) function 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() ); 41 VERIFY_IS_APPROX(MatrixType(m1.transpose().inverse()), MatrixTyp [all...] |
H A D | 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()) [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | 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; 43 RegularImmutableBiMap(ImmutableMap<K, V> delegate, ImmutableBiMap<V, K> inverse) argument
|
H A D | SingletonImmutableBiMap.java | 39 transient SingletonImmutableBiMap<V, K> inverse; field in class:SingletonImmutableBiMap 48 K key, V value, SingletonImmutableBiMap<V, K> inverse) { 52 this.inverse = inverse; 56 public ImmutableBiMap<V, K> inverse() { method in class:SingletonImmutableBiMap 57 ImmutableBiMap<V, K> result = inverse; 59 return inverse = new SingletonImmutableBiMap<V, K>(singleValue, singleKey, this); 47 SingletonImmutableBiMap( K key, V value, SingletonImmutableBiMap<V, K> inverse) argument
|
H A D | EmptyImmutableBiMap.java | 33 @Override public ImmutableBiMap<Object, Object> inverse() { method in class:EmptyImmutableBiMap
|
H A D | AbstractBiMap.java | 49 transient AbstractBiMap<V, K> inverse; field in class:AbstractBiMap 56 /** Private constructor for inverse bimap. */ 59 inverse = forward; 86 checkState(inverse == null); 91 inverse = new Inverse<V, K>(backward, this); 94 void setInverse(AbstractBiMap<V, K> inverse) { argument 95 this.inverse = inverse; 101 return inverse.containsKey(value); 123 inverse() 170 public BiMap<V, K> inverse() { method in class:AbstractBiMap [all...] |
/external/eigen/doc/examples/ |
H A D | TutorialLinAlgInverseDeterminant.cpp | 15 cout << "The inverse of A is:\n" << A.inverse() << endl;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | SingletonImmutableBiMap.java | 45 ImmutableBiMap<V, K> inverse) { 48 this.inverse = inverse; 86 transient ImmutableBiMap<V, K> inverse; field in class:SingletonImmutableBiMap 89 public ImmutableBiMap<V, K> inverse() { method in class:SingletonImmutableBiMap 91 ImmutableBiMap<V, K> result = inverse; 93 return inverse = new SingletonImmutableBiMap<V, K>( 44 SingletonImmutableBiMap(K singleKey, V singleValue, ImmutableBiMap<V, K> inverse) argument
|
/external/guava/guava-gwt/test-super/com/google/common/collect/testing/google/super/com/google/common/collect/testing/google/ |
H A D | BiMapInverseTester.java | 29 * Tests for the {@code inverse} view of a BiMap. 31 * <p>This assumes that {@code bimap.inverse().inverse() == bimap}, which is not technically 40 assertSame(getMap(), getMap().inverse().inverse()); 49 assertSame(copy.backward, copy.forward.inverse()); 50 assertSame(copy.forward, copy.backward.inverse()); 59 this.backward = original.inverse();
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
H A D | BiMapClearTester.java | 34 BiMap<V, K> inv = getMap().inverse(); 42 BiMap<V, K> inv = getMap().inverse(); 50 BiMap<V, K> inv = getMap().inverse(); 58 BiMap<V, K> inv = getMap().inverse(); 66 BiMap<V, K> inv = getMap().inverse(); 74 BiMap<V, K> inv = getMap().inverse();
|
H A D | BiMapInverseTester.java | 34 * Tests for the {@code inverse} view of a BiMap. 36 * <p>This assumes that {@code bimap.inverse().inverse() == bimap}, which is not technically 45 assertSame(getMap(), getMap().inverse().inverse()); 54 assertSame(copy.backward, copy.forward.inverse()); 55 assertSame(copy.forward, copy.backward.inverse()); 64 this.backward = original.inverse(); 71 * Returns {@link Method} instances for the tests that assume that the inverse will be the same
|
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/ |
H A D | MockWidget.java | 7 @MockClass(realClass = Widget.class, inverse = false)
|
/external/iptables/include/linux/netfilter/ |
H A D | xt_connlimit.h | 24 unsigned int inverse; member in union:xt_connlimit_info::__anon7648
|
/external/skia/src/pdf/ |
H A D | SkPDFFormXObject.cpp | 34 SkMatrix inverse; local 35 if (!device->initialTransform().invert(&inverse)) { 38 inverse.reset(); 40 this->insertObject("Matrix", SkPDFUtils::MatrixToArray(inverse));
|
/external/webp/src/dsp/ |
H A D | 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); 84 int inverse, uint8_t* out) { 91 preds = inverse ? out : in; 97 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 31 PredictLine(const uint8_t* src, const uint8_t* pred, uint8_t* dst, int length, int inverse) argument 44 DoHorizontalFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument 81 DoVerticalFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument 124 DoGradientFilter(const uint8_t* in, int width, int height, int stride, int row, int num_rows, int inverse, uint8_t* out) argument [all...] |
/external/opencv3/3rdparty/libwebp/utils/ |
H A D | filters.c | 34 uint8_t* dst, int length, int inverse) { 36 if (inverse) { 48 int inverse, uint8_t* out) { 50 const uint8_t* preds = (inverse ? out : in); 59 PredictLine(in, preds - stride, out, 1, inverse); 61 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 83 int inverse, uint8_t* out) { 85 const uint8_t* preds = (inverse ? out : in); 91 PredictLine(in + 1, preds, out + 1, width - 1, inverse); 97 PredictLine(in, preds, out, width, inverse); 33 PredictLine(const uint8_t* src, const uint8_t* pred, uint8_t* dst, int length, int inverse) argument 46 DoHorizontalFilter(const uint8_t* in, int width, int height, int stride, int inverse, uint8_t* out) argument 81 DoVerticalFilter(const uint8_t* in, int width, int height, int stride, int inverse, uint8_t* out) argument 120 DoGradientFilter(const uint8_t* in, int width, int height, int stride, int inverse, uint8_t* out) argument [all...] |