Home
last modified time | relevance | path

Searched refs:I_ (Results 1 – 25 of 62) sorted by relevance

123

/external/eigen/unsupported/Eigen/src/EulerAngles/
DEulerSystem.h180 I_ = AlphaAxisAbs - 1,
197 …const Scalar Rsum = sqrt((mat(I_,I_) * mat(I_,I_) + mat(I_,J_) * mat(I_,J_) + mat(J_,K_) * mat(J_,…
198 res[1] = atan2(plusMinus * mat(I_,K_), Rsum);
203 res[2] = atan2(minusPlus * mat(I_, J_), mat(I_, I_));
205 else if(plusMinus * mat(I_, K_) > 0) {// cos(beta) == 0 and sin(beta) == 1
206 Scalar spos = mat(J_, I_) + plusMinus * mat(K_, J_); // 2*sin(alpha + plusMinus * gamma
207 Scalar cpos = mat(J_, J_) + minusPlus * mat(K_, I_); // 2*cos(alpha + plusMinus * gamma)
213 …Scalar sneg = plusMinus * (mat(K_, J_) + minusPlus * mat(J_, I_)); // 2*sin(alpha + minusPlus*gamm…
214 …Scalar cneg = mat(J_, J_) + plusMinus * mat(K_, I_); // 2*cos(alpha + minusPlus*gamm…
233 …Scalar Rsum = sqrt((mat(I_, J_) * mat(I_, J_) + mat(I_, K_) * mat(I_, K_) + mat(J_, I_) * mat(J_, …
[all …]
/external/eigen/test/
Dincomplete_cholesky.cpp15 template<typename T, typename I_> void test_incomplete_cholesky_T() in test_incomplete_cholesky_T()
17 typedef SparseMatrix<T,0,I_> SparseMatrixType; in test_incomplete_cholesky_T()
18 …ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > … in test_incomplete_cholesky_T()
19 …ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, NaturalOrdering<I_> > > … in test_incomplete_cholesky_T()
20 …ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I_> > > … in test_incomplete_cholesky_T()
21 …ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I_> > > … in test_incomplete_cholesky_T()
22 …ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I_> > > … in test_incomplete_cholesky_T()
Dbicgstab.cpp13 template<typename T, typename I_> void test_bicgstab_T() in test_bicgstab_T()
15 BiCGSTAB<SparseMatrix<T,0,I_>, DiagonalPreconditioner<T> > bicgstab_colmajor_diag; in test_bicgstab_T()
16 BiCGSTAB<SparseMatrix<T,0,I_>, IdentityPreconditioner > bicgstab_colmajor_I; in test_bicgstab_T()
17 BiCGSTAB<SparseMatrix<T,0,I_>, IncompleteLUT<T,I_> > bicgstab_colmajor_ilut; in test_bicgstab_T()
Dsimplicial_cholesky.cpp12 template<typename T, typename I_, int flag> void test_simplicial_cholesky_T() in test_simplicial_cholesky_T()
14 typedef SparseMatrix<T,flag,I_> SparseMatrixType; in test_simplicial_cholesky_T()
21 SimplicialLDLT< SparseMatrixType, Lower, NaturalOrdering<I_> > ldlt_colmajor_lower_nat; in test_simplicial_cholesky_T()
22 SimplicialLDLT< SparseMatrixType, Upper, NaturalOrdering<I_> > ldlt_colmajor_upper_nat; in test_simplicial_cholesky_T()
Dconjugate_gradient.cpp13 template<typename T, typename I_> void test_conjugate_gradient_T() in test_conjugate_gradient_T()
15 typedef SparseMatrix<T,0,I_> SparseMatrixType; in test_conjugate_gradient_T()
Dindexed_view.cpp349 const Index I_ = 3, J_ = 4; in check_indexed_view() local
350 VERIFY_IS_APPROX( A(I_,J_), A(3,4) ); in check_indexed_view()
/external/eigen/unsupported/Eigen/CXX11/src/util/
DCXX11Workarounds.h50 template<std::size_t I_, class T> constexpr inline T& array_get(std::vector<T>& a) { re… in array_get()
51 template<std::size_t I_, class T> constexpr inline T&& array_get(std::vector<T>&& a) { re… in array_get()
52 template<std::size_t I_, class T> constexpr inline T const& array_get(std::vector<T> const& a) { re… in array_get()
DEmulateArray.h200 template<std::size_t I_, class T, std::size_t N>
202 return a[I_]; in array_get()
204 template<std::size_t I_, class T, std::size_t N>
206 return a[I_]; in array_get()
243 #define STD_GET_ARR_HACK a._M_instance[I_]
245 #define STD_GET_ARR_HACK a.__elems_[I_]
247 #define STD_GET_ARR_HACK std::template get<I_, T, N>(a)
250 template<std::size_t I_, class T, std::size_t N> constexpr inline T& array_get(std::array<T,N…
251 template<std::size_t I_, class T, std::size_t N> constexpr inline T&& array_get(std::array<T,N…
252 template<std::size_t I_, class T, std::size_t N> constexpr inline T const& array_get(std::array<T,N…
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
DTensorReduction.h429 template <int B, int N, typename S, typename R, typename I_>
430 __global__ EIGEN_HIP_LAUNCH_BOUNDS_1024 void FullReductionKernel(R, const S, I_, typename S::CoeffR…
434 template <typename S, typename R, typename I_>
435 __global__ EIGEN_HIP_LAUNCH_BOUNDS_1024 void ReductionInitFullReduxKernelHalfFloat(R, const S, I_, …
436 template <int B, int N, typename S, typename R, typename I_>
437 __global__ EIGEN_HIP_LAUNCH_BOUNDS_1024 void FullReductionKernelHalfFloat(R, const S, I_, half*, in…
438 template <int NPT, typename S, typename R, typename I_>
439 __global__ EIGEN_HIP_LAUNCH_BOUNDS_1024 void InnerReductionKernelHalfFloat(R, const S, I_, I_, half…
443 template <int NPT, typename S, typename R, typename I_>
444 __global__ EIGEN_HIP_LAUNCH_BOUNDS_1024 void InnerReductionKernel(R, const S, I_, I_, typename S::C…
[all …]
/external/eigen/unsupported/test/
DEulerAngles.cpp75 const Vector3 I_ = EulerAnglesType::AlphaAxisVector(); in verify_euler() local
100 …const Matrix3 mbis(AngleAxisType(ebis.alpha(), I_) * AngleAxisType(ebis.beta(), J_) * AngleAxisTyp… in verify_euler()
/external/libese/libese-teq1/
Dteq1_private.h27 #define I(S, M) I_##S##_##M
/external/pdfium/testing/resources/
Dbigtable_mini.in101 43BRuTX#t%4ekD2_c]pSd*g?I_(dmV-o3k<:Veup,U50*Ylr.i;$bHCc:fghe5L>1a\`<FkpTR<8hEdi
/external/ImageMagick/PerlMagick/t/reference/write/filter/
DOilPaint.miff43 …I_�IhaQhaQhaQibRibRjcSjcSjcSjcSlcTlcTlcTlcTlcTpaU���������<=/?;.=6)=6)?;.�LL�LL�@D�DD�FD�BD�FD�FD�…
DReduceNoise.miff43 …I_�IbyLgdRhcRibRibSjbSjbSkcSlcSlcTlcTlcTpdd��������Ѵ���{jrMC^J<^HB�HC�HE�HF�EE�DE�DD�CB�B?�B>�B=�A…
DMedianFilter.miff43 …I_�IbyLgdRhcRibRibRjbSjbSkcSlcSlcTlcTlcTpdd��������Ѵ���{jrMC^J<^HB�HC�HE�HF�EE�DE�DD�CB�B?�B>�B=�A…
/external/ImageMagick/PerlMagick/t/reference/filter/
DMinify.miff15 …b�`\�VO�B6�=1�:1�9-�>5�GF�BA�6>�4@�37�84�75�6/�5*�5-�BD�Ia�AKWO8avGh�Kj�Md�I_|E:91JF@][plk�Ћ�Ќ��…
DMagnify.miff15 …I_�Ie�Le�L\�G\�Gi`Qi`QjaRjaRlbTlbTjaRjaRjaRjaRkbSkbSkbSkbSkbSkbRlcSlcTlcTlcTpbRpbRpaUpaUf_Rf_RfaPf…
DFlop.miff15 …<�AE�HE^B5?;.<=/3<(7>+}{j������spifZPmaTlcTlcTkbSkbSjbSibRibRjdSibRhaQWwH_�I_�LZ|ETu?n�Ts�YAM/54+-…
DWave.miff15 …B�:/�8*�7/�78�?:�2*�2/�.3�0/�7,�FD�Vn�=gc3<6+.pQ��|BJ7;C1g�Kv�Pp�Nv�W]�Fa�I_�IRmF\gOgdUifWifWheVi…
DConvolve.miff15 …/u9/t9.q6-n4+k3)i4(v?5�OI�WOxZM]XEHR;:F0<F1>G39A05<0491:>/O]8l�Ot�Xc�L]�F`�I_�JhbRhbRibRjcSibRibRj…
/external/eigen/Eigen/src/Core/arch/AVX512/
DPacketMath.h432 template<int I_> EIGEN_STRONG_INLINE Packet8f extract256(Packet16f x) { return _mm512_extractf32x8_…
433 template<int I_> EIGEN_STRONG_INLINE Packet2d extract128(Packet8d x) { return _mm512_extractf64x2_p…
437 template<int I_> EIGEN_STRONG_INLINE Packet8f extract256(Packet16f x) {
438 return _mm256_castsi256_ps(_mm512_extracti64x4_epi64( _mm512_castps_si512(x),I_));
442 template<int I_> EIGEN_STRONG_INLINE Packet2d extract128(Packet8d x) {
443 return _mm_castsi128_pd(_mm512_extracti32x4_epi32( _mm512_castpd_si512(x),I_));
/external/ImageMagick/PerlMagick/t/reference/write/read/
Dinput_uyvy.miff41 …I_�Gg_Og_Og_Oh`Ph_Si`Ti_Xi_Xi`Ti`Tk`Ok`OWVEED38D35A0S8 ~cK�XV�NL�;-�8*�;.�=0�>4�>4�>0�C5�E>�JC�KB�…
/external/bzip2/
Dbzip2.1.preformatted90 _B_Z_I_P_2 and _B_Z_I_P_, in that order, and will process them
/external/ImageMagick/PerlMagick/t/reference/jpeg/
Dread_non_interlaced.miff16 …8�94�72�72�7.�3(�4%�<,�<+�:0�50�NT�Ws�8i�Kgi.2GB,%:PaA`oFWw4^�9l�Nk�Oe�M_}I_{Hc�J25"??3FB9VQKljmf…
Dread_plane_interlaced.miff16 …8�94�72�72�7.�3(�4%�<,�<+�:0�50�NT�Ws�8i�Kgi.2GB,%:PaA`oFWw4^�9l�Nk�Oe�M_}I_{Hc�J25"??3FB9VQKljmf…

123