| /external/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
64 // Inverse - This class is used as a little marker class to tell the graph
65 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
66 // Not all graphs define an inverse ordering, and if they do, it depends on
74 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
78 struct Inverse {
81 inline Inverse(const GraphType &G) : Graph(G) {}
84 // Provide a partial specialization of GraphTraits so that the inverse of an
85 // inverse falls back to the original graph
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
61 // Inverse - This class is used as a little marker class to tell the graph
62 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
63 // Not all graphs define an inverse ordering, and if they do, it depends on
71 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
75 struct Inverse {
78 inline Inverse(const GraphType &G) : Graph(G) {}
81 // Provide a partial specialization of GraphTraits so that the inverse of an
82 // inverse falls back to the original graph
[all...] |
| /external/webrtc/webrtc/common_audio/ |
| real_fourier_ooura.cc | 64 void RealFourierOoura::Inverse(const complex<float>* src, float* dest) const {
|
| real_fourier_openmax.cc | 61 void RealFourierOpenmax::Inverse(const complex<float>* src, float* dest) const {
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
67 // Inverse - This class is used as a little marker class to tell the graph
68 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
69 // Not all graphs define an inverse ordering, and if they do, it depends on
77 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
81 struct Inverse {
84 inline Inverse(const GraphType &G) : Graph(G) {}
87 // Provide a partial specialization of GraphTraits so that the inverse of an
88 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
67 // Inverse - This class is used as a little marker class to tell the graph
68 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
69 // Not all graphs define an inverse ordering, and if they do, it depends on
77 // df_iterator<Inverse<Method*> > I = idf_begin(M), E = idf_end(M);
81 struct Inverse {
84 inline Inverse(const GraphType &G) : Graph(G) {}
87 // Provide a partial specialization of GraphTraits so that the inverse of an
88 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| GraphTraits.h | 13 // This file also defines the marker class Inverse that is used to iterate over
14 // graphs in a graph defined, inverse ordering...
62 // Inverse - This class is used as a little marker class to tell the graph
63 // iterator to iterate over the graph in a graph defined "Inverse" ordering.
64 // Not all graphs define an inverse ordering, and if they do, it depends on
72 // df_iterator<Inverse<Method*>> I = idf_begin(M), E = idf_end(M);
76 struct Inverse {
79 inline Inverse(const GraphType &G) : Graph(G) {}
82 // Provide a partial specialization of GraphTraits so that the inverse of an
83 // inverse falls back to the original graph
[all...] |
| /external/pdfium/fxbarcode/common/reedsolomon/ |
| BC_ReedSolomonGF256.cpp | 117 int32_t CBC_ReedSolomonGF256::Inverse(int32_t a, int32_t& e) {
|
| /frameworks/native/libs/vr/libdvrcommon/include/private/dvr/ |
| pose.h | 29 rotation_ = rotation_.inverse();
33 Pose Inverse() const {
96 // The transfrom from the reference is the inverse of the pose.
97 Eigen::AffineMatrix<T, 4> matrix(rotation_.inverse().toRotationMatrix());
|
| /external/eigen/Eigen/src/Core/ |
| Inverse.h | 20 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>
51 typedef typename internal::ref_selector<Inverse>::type Nested;
54 explicit EIGEN_DEVICE_FUNC Inverse(const XprType &xpr)
70 : public internal::generic_xpr_base<Inverse<XprType> >::type
73 typedef typename internal::generic_xpr_base<Inverse<XprType> >::type Base
[all...] |
| /prebuilts/ndk/r16/sources/android/ndk_helper/ |
| vecmath.cpp | 115 Mat4 Mat4::Inverse()
172 /* Calculate -C * inverse(A) */
|
| /prebuilts/go/darwin-x86/src/crypto/elliptic/ |
| p256_s390x.go | 114 func (curve p256CurveFast) Inverse(k *big.Int) *big.Int {
209 // R×R mod p. See comment in Inverse about how this is used.
|
| /prebuilts/go/linux-x86/src/crypto/elliptic/ |
| p256_s390x.go | 114 func (curve p256CurveFast) Inverse(k *big.Int) *big.Int {
209 // R×R mod p. See comment in Inverse about how this is used.
|
| /external/pdfium/fxbarcode/pdf417/ |
| BC_PDF417HighLevelEncoder.cpp | 53 Inverse();
127 void CBC_PDF417HighLevelEncoder::Inverse() {
|
