Home
last modified time | relevance | path

Searched full:inverse (Results 1 – 25 of 6535) sorted by relevance

12345678910>>...262

/aosp_15_r20/hardware/google/gfxstream/third-party/glm/include/glm/gtc/
Dmatrix_inverse.inl9 tmat2x2<T, P> const Inv(inverse(tmat2x2<T, P>(m)));
20 tmat3x3<T, P> const Inv(inverse(tmat3x3<T, P>(m)));
34 tmat2x2<T, P> Inverse( local
40 return Inverse;
51 tmat3x3<T, P> Inverse(uninitialize); local
52 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
53 Inverse[0][1] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
54 Inverse[0][2] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
55 Inverse[1][0] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]);
56 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]);
[all …]
/aosp_15_r20/external/oboe/samples/RhythmGame/third_party/glm/gtc/
H A Dmatrix_inverse.inl9 tmat2x2<T, P> const Inv(inverse(tmat2x2<T, P>(m)));
20 tmat3x3<T, P> const Inv(inverse(tmat3x3<T, P>(m)));
34 tmat2x2<T, P> Inverse( local
40 return Inverse;
51 tmat3x3<T, P> Inverse(uninitialize); local
52 Inverse[0][0] = + (m[1][1] * m[2][2] - m[2][1] * m[1][2]);
53 Inverse[0][1] = - (m[1][0] * m[2][2] - m[2][0] * m[1][2]);
54 Inverse[0][2] = + (m[1][0] * m[2][1] - m[2][0] * m[1][1]);
55 Inverse[1][0] = - (m[0][1] * m[2][2] - m[2][1] * m[0][2]);
56 Inverse[1][1] = + (m[0][0] * m[2][2] - m[2][0] * m[0][2]);
[all …]
/aosp_15_r20/external/eigen/test/
H A Dinverse.cpp60 …m5.template topLeftCorner<MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime>().inverse(); in inverse_for_fixed_size()
61 …late topLeftCorner<MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime>()), m2.inverse() ); in inverse_for_fixed_size()
65 template<typename MatrixType> void inverse(const MatrixType& m) in inverse() function
68 Inverse.h in inverse()
79 m2 = m1.inverse(); in inverse()
80 VERIFY_IS_APPROX(m1, m2.inverse() ); in inverse()
82 VERIFY_IS_APPROX((Scalar(2)*m2).inverse(), m2.inverse()*Scalar(0.5)); in inverse()
84 VERIFY_IS_APPROX(identity, m1.inverse() * m1 ); in inverse()
85 VERIFY_IS_APPROX(identity, m1 * m1.inverse() ); in inverse()
87 VERIFY_IS_APPROX(m1, m1.inverse().inverse() ); in inverse()
[all …]
H A Dpermutationmatrices.cpp59 lpi = lp.inverse(); in permutationmatrices()
60 VERIFY_IS_APPROX(lpi*m_permuted,lp.inverse()*m_permuted); in permutationmatrices()
62 VERIFY_IS_APPROX(lp.inverse()*m_permuted*rp.inverse(), m_original); in permutationmatrices()
63 …VERIFY_IS_APPROX(lv.asPermutation().inverse()*m_permuted*rv.asPermutation().inverse(), m_original); in permutationmatrices()
64 …Y_IS_APPROX(MapLeftPerm(lv.data(),lv.size()).inverse()*m_permuted*MapRightPerm(rv.data(),rv.size()… in permutationmatrices()
66 VERIFY((lp*lp.inverse()).toDenseMatrix().isIdentity()); in permutationmatrices()
67 VERIFY((lv.asPermutation()*lv.asPermutation().inverse()).toDenseMatrix().isIdentity()); in permutationmatrices()
68 …VERIFY((MapLeftPerm(lv.data(),lv.size())*MapLeftPerm(lv.data(),lv.size()).inverse()).toDenseMatrix… in permutationmatrices()
84 …VERIFY_EVALUATION_COUNT(m_permuted.noalias()= lp.inverse() * m_permuted, 1); // 1 temp to allocate… in permutationmatrices()
85 VERIFY_IS_APPROX(m_permuted, lp.inverse()*m_original); in permutationmatrices()
[all …]
H A Dsparse_permutations.cpp93 VERIFY( is_sorted( res = mat*p.inverse() )); in sparse_permutations()
94 VERIFY_TRANSPOSITION_COUNT( ::eval(mat*p.inverse()), 0); in sparse_permutations()
95 res_d = mat*p.inverse(); in sparse_permutations()
99 VERIFY( is_sorted( res = p.inverse()*mat )); in sparse_permutations()
100 VERIFY_TRANSPOSITION_COUNT( ::eval(p.inverse()*mat), 0); in sparse_permutations()
101 res_d = p.inverse()*mat_d; in sparse_permutations()
104 VERIFY( is_sorted( (p * mat * p.inverse()).eval() )); in sparse_permutations()
106 VERIFY_TRANSPOSITION_COUNT( ::eval(p * mat * p.inverse()), 0); in sparse_permutations()
107 res_d = (p * mat_d) * p.inverse(); in sparse_permutations()
165 res_d = ((p * up_sym_d) * p.inverse()).eval().template triangularView<Upper>(); in sparse_permutations()
[all …]
/aosp_15_r20/external/guava/guava/src/com/google/common/collect/
H A DAbstractBiMap.java63 transient AbstractBiMap<V, K> inverse; field in AbstractBiMap
70 /** Private constructor for inverse bimap. */
73 inverse = forward; in AbstractBiMap()
101 checkState(inverse == null); in setDelegates()
106 inverse = makeInverse(backward); in setDelegates()
110 return new Inverse<>(backward, this); in makeInverse()
113 void setInverse(AbstractBiMap<V, K> inverse) { in setInverse() argument
114 this.inverse = inverse; in setInverse()
121 return inverse.containsKey(value); in containsValue()
149 inverse().remove(value); in putInBothMaps()
[all …]
/aosp_15_r20/external/guava/android/guava/src/com/google/common/collect/
H A DAbstractBiMap.java62 transient AbstractBiMap<V, K> inverse; field in AbstractBiMap
69 /** Private constructor for inverse bimap. */
72 inverse = forward; in AbstractBiMap()
100 checkState(inverse == null); in setDelegates()
105 inverse = makeInverse(backward); in setDelegates()
109 return new Inverse<>(backward, this); in makeInverse()
112 void setInverse(AbstractBiMap<V, K> inverse) { in setInverse() argument
113 this.inverse = inverse; in setInverse()
120 return inverse.containsKey(value); in containsValue()
148 inverse().remove(value); in putInBothMaps()
[all …]
/aosp_15_r20/external/guava/guava/src/com/google/common/math/
H A DLinearTransformation.java104 * (The inverse of this will be a horizontal transformation.)
113 * (The inverse of this will be a vertical transformation.)
124 * #transform} methods all return {@link Double#NaN}. The {@link #inverse} method returns the same
151 * Returns the inverse linear transformation. The inverse of a horizontal transformation is a
152 * vertical transformation, and vice versa. The inverse of the {@link #forNaN} transformation is
153 * itself. In all other cases, the inverse is a transformation such that applying both the
154 * original transformation and its inverse to a value gives you the original value give-or-take
159 public abstract LinearTransformation inverse(); in inverse() method in LinearTransformation
166 @CheckForNull @LazyInit LinearTransformation inverse; field in LinearTransformation.RegularLinearTransformation
171 this.inverse = null; // to be lazily initialized in RegularLinearTransformation()
[all …]
/aosp_15_r20/external/guava/android/guava/src/com/google/common/math/
H A DLinearTransformation.java104 * (The inverse of this will be a horizontal transformation.)
113 * (The inverse of this will be a vertical transformation.)
124 * #transform} methods all return {@link Double#NaN}. The {@link #inverse} method returns the same
151 * Returns the inverse linear transformation. The inverse of a horizontal transformation is a
152 * vertical transformation, and vice versa. The inverse of the {@link #forNaN} transformation is
153 * itself. In all other cases, the inverse is a transformation such that applying both the
154 * original transformation and its inverse to a value gives you the original value give-or-take
159 public abstract LinearTransformation inverse(); in inverse() method in LinearTransformation
166 @CheckForNull @LazyInit LinearTransformation inverse; field in LinearTransformation.RegularLinearTransformation
171 this.inverse = null; // to be lazily initialized in RegularLinearTransformation()
[all …]
/aosp_15_r20/external/eigen/Eigen/src/LU/
H A DInverseImpl.h28 result = matrix.partialPivLu().inverse(); in run()
106 ResultType& inverse,
117 compute_inverse_size2_helper(matrix, invdet, inverse);
185 ResultType& inverse,
199 compute_inverse_size3_helper(matrix, invdet, cofactors_col0, inverse);
273 ResultType& inverse,
281 if(invertible && extract_data(matrix) != extract_data(inverse)) {
282 compute_inverse<MatrixType, ResultType>::run(matrix, inverse);
286 compute_inverse<MatrixType, ResultType>::run(matrix_t, inverse);
299 // Specialization for "dense = dense_xpr.inverse()"
[all …]
/aosp_15_r20/external/eigen/Eigen/src/Core/
H A DInverse.h20 struct traits<Inverse<XprType> >
32 /** \class Inverse
34 * \brief Expression of the inverse of another expression
36 * \tparam XprType the type of the expression we are taking the inverse
38 * This class represents an abstract expression of A.inverse()
43 class Inverse : public InverseImpl<XprType,typename internal::traits<XprType>::StorageKind>
50 typedef typename internal::ref_selector<Inverse>::type Nested;
53 explicit EIGEN_DEVICE_FUNC Inverse(const XprType &xpr)
69 : public internal::generic_xpr_base<Inverse<XprType> >::type
72 typedef typename internal::generic_xpr_base<Inverse<XprType> >::type Base;
[all …]
/aosp_15_r20/external/guava/guava-tests/test/com/google/common/math/
H A DStatsTesting.java404 * {@code transformation} and its inverse). Since the transformation is expected to be diagonal,
413 assertThat(transformation.inverse().isHorizontal()).isFalse(); in assertDiagonalLinearTransformation()
414 assertThat(transformation.inverse().isVertical()).isFalse(); in assertDiagonalLinearTransformation()
417 assertThat(transformation.inverse().transform(y1)).isWithin(ALLOWED_ERROR).of(x1); in assertDiagonalLinearTransformation()
418 assertThat(transformation.inverse().transform(y1 + yDelta)) in assertDiagonalLinearTransformation()
422 assertThat(transformation.inverse().slope()).isWithin(ALLOWED_ERROR).of(xDelta / yDelta); in assertDiagonalLinearTransformation()
423 assertThat(transformation.inverse()).isSameInstanceAs(transformation.inverse()); in assertDiagonalLinearTransformation()
424 assertThat(transformation.inverse().inverse()).isSameInstanceAs(transformation); in assertDiagonalLinearTransformation()
431 * its inverse throws as expected.
436 assertThat(transformation.inverse().isHorizontal()).isFalse(); in assertHorizontalLinearTransformation()
[all …]
/aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/math/
H A DStatsTesting.java374 * {@code transformation} and its inverse). Since the transformation is expected to be diagonal,
383 assertThat(transformation.inverse().isHorizontal()).isFalse(); in assertDiagonalLinearTransformation()
384 assertThat(transformation.inverse().isVertical()).isFalse(); in assertDiagonalLinearTransformation()
387 assertThat(transformation.inverse().transform(y1)).isWithin(ALLOWED_ERROR).of(x1); in assertDiagonalLinearTransformation()
388 assertThat(transformation.inverse().transform(y1 + yDelta)) in assertDiagonalLinearTransformation()
392 assertThat(transformation.inverse().slope()).isWithin(ALLOWED_ERROR).of(xDelta / yDelta); in assertDiagonalLinearTransformation()
393 assertThat(transformation.inverse()).isSameInstanceAs(transformation.inverse()); in assertDiagonalLinearTransformation()
394 assertThat(transformation.inverse().inverse()).isSameInstanceAs(transformation); in assertDiagonalLinearTransformation()
401 * its inverse throws as expected.
406 assertThat(transformation.inverse().isHorizontal()).isFalse(); in assertHorizontalLinearTransformation()
[all …]
/aosp_15_r20/frameworks/base/core/res/res/values/
H A Dstyles_device_defaults.xml153 …<style name="Widget.DeviceDefault.ProgressBar.Inverse" parent="Widget.Material.ProgressBar.Inverse…
154 …e name="Widget.DeviceDefault.ProgressBar.Large.Inverse" parent="Widget.Material.ProgressBar.Large.…
155 …e name="Widget.DeviceDefault.ProgressBar.Small.Inverse" parent="Widget.Material.ProgressBar.Small.…
197 …e name="Widget.DeviceDefault.Light.ProgressBar.Inverse" parent="Widget.Material.Light.ProgressBar.…
198 …idget.DeviceDefault.Light.ProgressBar.Small.Inverse" parent="Widget.Material.Light.ProgressBar.Sma…
199 …idget.DeviceDefault.Light.ProgressBar.Large.Inverse" parent="Widget.Material.Light.ProgressBar.Lar…
233 …me="Widget.DeviceDefault.Light.ActionBar.Solid.Inverse" parent="Widget.Holo.Light.ActionBar.Solid.…
235 …e="Widget.DeviceDefault.Light.ActionBar.TabBar.Inverse" parent="Widget.Holo.Light.ActionBar.TabBar…
237 …"Widget.DeviceDefault.Light.ActionBar.TabView.Inverse" parent="Widget.Holo.Light.ActionBar.TabView…
239 …"Widget.DeviceDefault.Light.ActionBar.TabText.Inverse" parent="Widget.Holo.Light.ActionBar.TabText…
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/ADT/
DGraphTraits.h14 /// This file also defines the marker class Inverse that is used to iterate over
15 /// graphs in a graph defined, inverse ordering...
83 // Inverse - This class is used as a little marker class to tell the graph
84 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
85 // Not all graphs define an inverse ordering, and if they do, it depends on
93 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 // Provide a partial specialization of GraphTraits so that the inverse of an
104 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/ADT/
DGraphTraits.h14 /// This file also defines the marker class Inverse that is used to iterate over
15 /// graphs in a graph defined, inverse ordering...
83 // Inverse - This class is used as a little marker class to tell the graph
84 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
85 // Not all graphs define an inverse ordering, and if they do, it depends on
93 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 // Provide a partial specialization of GraphTraits so that the inverse of an
104 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DGraphTraits.h12 // This file also defines the marker class Inverse that is used to iterate over
13 // graphs in a graph defined, inverse ordering...
81 // Inverse - This class is used as a little marker class to tell the graph
82 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
83 // Not all graphs define an inverse ordering, and if they do, it depends on
91 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
95 struct Inverse { struct
98 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
101 // Provide a partial specialization of GraphTraits so that the inverse of an
102 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/llvm/ADT/
DGraphTraits.h14 /// This file also defines the marker class Inverse that is used to iterate over
15 /// graphs in a graph defined, inverse ordering...
83 // Inverse - This class is used as a little marker class to tell the graph
84 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
85 // Not all graphs define an inverse ordering, and if they do, it depends on
93 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 // Provide a partial specialization of GraphTraits so that the inverse of an
104 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/ADT/
H A DGraphTraits.h14 /// This file also defines the marker class Inverse that is used to iterate over
15 /// graphs in a graph defined, inverse ordering...
83 // Inverse - This class is used as a little marker class to tell the graph
84 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
85 // Not all graphs define an inverse ordering, and if they do, it depends on
93 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() function
103 // Provide a partial specialization of GraphTraits so that the inverse of an
104 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/ADT/
DGraphTraits.h14 /// This file also defines the marker class Inverse that is used to iterate over
15 /// graphs in a graph defined, inverse ordering...
83 // Inverse - This class is used as a little marker class to tell the graph
84 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
85 // Not all graphs define an inverse ordering, and if they do, it depends on
93 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
97 struct Inverse { struct
100 inline Inverse(const GraphType &G) : Graph(G) {} in Inverse() argument
103 // Provide a partial specialization of GraphTraits so that the inverse of an
104 // inverse falls back to the original graph.
[all …]
/aosp_15_r20/external/tensorflow/tensorflow/python/ops/distributions/
H A Dbijector_impl.py49 y: `Tensor`. Inverse.
51 representing the inverse log det jacobian.
53 forward/inverse/etc functions.
77 y: `Tensor`. Inverse.
79 representing the inverse log det jacobian.
81 forward/inverse/etc functions.
153 2. Inverse
161 first-order partial derivatives of the inverse function."
176 inverse is useful for computing probabilities.
186 x == my_bijector.inverse(fwd_x)
[all …]
/aosp_15_r20/external/libavc/common/
H A Dih264_iquant_itrans_recon.c27 * Contains definition of functions for h264 inverse quantization,
28 * inverse transformation and recon
72 * The quantized residue is first inverse quantized, then inverse transformed.
73 * This inverse transformed content is added to the prediction buffer to recon-
92 * pointer to inverse scaling matrix
136 /* inverse quant */ in ih264_iquant_itrans_recon_4x4()
137 /* horizontal inverse transform */ in ih264_iquant_itrans_recon_4x4()
174 /* vertical inverse transform */ in ih264_iquant_itrans_recon_4x4()
186 /* inverse prediction */ in ih264_iquant_itrans_recon_4x4()
226 * The quantized residue is first inverse quantized, then inverse transformed.
[all …]
/aosp_15_r20/external/guava/android/guava-tests/test/com/google/common/collect/
H A DImmutableBiMapTest.java103 assertEquals(Collections.<Integer, String>emptyMap(), map.inverse()); in testEmptyBuilder()
110 assertMapEquals(map.inverse(), 1, "one"); in testSingletonBuilder()
129 assertMapEquals(map.inverse(), 1, "one", 2, "two", 3, "three", 4, "four", 5, "five"); in testBuilder()
158 assertMapEquals(map.inverse(), 1, "one", 2, "two", 3, "three", 4, "four", 5, "five"); in testBuilder_orderEntriesByValue()
199 assertMapEquals(map.inverse(), 1, "one", 2, "two", 3, "three", 4, "four", 5, "five"); in testBuilderPutAll()
208 assertMapEquals(mapOne.inverse(), 1, "one", 2, "two"); in testBuilderReuse()
210 assertMapEquals(mapTwo.inverse(), 1, "one", 2, "two", 3, "three", 4, "four"); in testBuilderReuse()
266 assertMapEquals(ImmutableBiMap.of("one", 1).inverse(), 1, "one"); in testOf()
268 assertMapEquals(ImmutableBiMap.of("one", 1, "two", 2).inverse(), 1, "one", 2, "two"); in testOf()
272 ImmutableBiMap.of("one", 1, "two", 2, "three", 3).inverse(), in testOf()
[all …]
/aosp_15_r20/external/libhevc/common/
H A Dihevc_iquant_itrans_recon.c24 * Contains function definitions for inverse quantization, inverse
57 * This function performs inverse quantization, inverse transform
61 * Performs inverse quantization , inverse transform type 1 and adds
68 * Temporary 4x4 buffer for storing inverse
123 /* Inverse Quant and Inverse Transform and Reconstruction */ in ihevc_iquant_itrans_recon_4x4_ttype1()
131 /* Inverse Quantization constants */ in ihevc_iquant_itrans_recon_4x4_ttype1()
143 /* Inverse Transform 1st stage */ in ihevc_iquant_itrans_recon_4x4_ttype1()
225 /* Inverse Transform 2nd stage */ in ihevc_iquant_itrans_recon_4x4_ttype1()
265 * This function performs inverse quantization, inverse transform and
269 * Performs inverse quantization , inverse transform and adds the
[all …]
/aosp_15_r20/external/ktfmt/website/
H A Dall.css103 .navbar-inverse .navbar-inner {
109 .navbar-inverse.home .navbar-inner {
113 .navbar-inverse .btn-navbar {
118 .navbar-inverse .btn-navbar:hover,
119 .navbar-inverse .btn-navbar:focus,
120 .navbar-inverse .btn-navbar:active,
121 .navbar-inverse .btn-navbar.active,
122 .navbar-inverse .btn-navbar.disabled,
123 .navbar-inverse .btn-navbar[disabled] {
187 .navbar-inverse .nav-collapse .nav>li>a {
[all …]

12345678910>>...262