| /external/eigen/Eigen/src/Core/util/ |
| BlasUtil.h | 178 typedef blas_traits<NestedXpr> Base;
180 typedef typename Base::ExtractType ExtractType;
184 NeedToConjugate = Base::NeedToConjugate ? 0 : IsComplex
186 static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); }
187 static inline Scalar extractScalarFactor(const XprType& x) { return conj(Base::extractScalarFactor(x.nestedExpression())); }
195 typedef blas_traits<NestedXpr> Base;
197 typedef typename Base::ExtractType ExtractType;
198 static inline ExtractType extract(const XprType& x) { return Base::extract(x.nestedExpression()); }
200 { return x.functor().m_other * Base::extractScalarFactor(x.nestedExpression()); }
208 typedef blas_traits<NestedXpr> Base;
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| AngleAxis.h | 51 typedef RotationBase<AngleAxis<_Scalar>,3> Base;
55 using Base::operator*;
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 147 typedef IterativeSolverBase<ConjugateGradient> Base;
148 using Base::mp_matrix;
149 using Base::m_error;
150 using Base::m_iterations;
151 using Base::m_info;
152 using Base::m_isInitialized;
167 ConjugateGradient() : Base() {}
179 ConjugateGradient(const MatrixType& A) : Base(A) {}
193 eigen_assert(Base::rows()==b.rows()
207 m_iterations = Base::maxIterations()
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseCwiseBinaryOp.h | 74 BinaryOp,Lhs,Rhs, InnerIterator> Base;
78 : Base(binOp.derived(),outer)
|
| SparseTriangularView.h | 68 typedef typename MatrixTypeNestedCleaned::InnerIterator Base;
73 : Base(view.nestedExpression(), outer), m_returnOne(false)
78 Base::operator++();
82 else if(HasUnitDiag && ((!Base::operator bool()) || Base::index()>=Base::outer()))
84 if((!SkipFirst) && Base::operator bool())
85 Base::operator++();
96 Base::operator++();
97 if(HasUnitDiag && (!SkipFirst) && ((!Base::operator bool()) || Base::index()>=Base::outer())
[all...] |
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 201 typedef IterativeSolverBase<MINRES> Base;
202 using Base::mp_matrix;
203 using Base::m_error;
204 using Base::m_iterations;
205 using Base::m_info;
206 using Base::m_isInitialized;
219 MINRES() : Base() {}
231 MINRES(const MatrixType& A) : Base(A) {}
246 eigen_assert(Base::rows()==b.rows()
261 m_iterations = Base::maxIterations()
[all...] |
| /external/gmock/test/ |
| gmock-internal-utils_test.cc | 126 class Base {};
127 class Derived : public Base {};
162 EXPECT_EQ(kOther, GMOCK_KIND_OF_(Base)); // NOLINT
|
| /external/google-breakpad/src/testing/test/ |
| gmock-internal-utils_test.cc | 126 class Base {};
127 class Derived : public Base {};
162 EXPECT_EQ(kOther, GMOCK_KIND_OF_(Base)); // NOLINT
|
| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 28 /// DominanceFrontierBase - Common base class for computing forward and inverse
96 /// compare - Return true if the other dominance frontier base matches
97 /// this dominance frontier base. Otherwise return false.
137 ForwardDominanceFrontierBase<BasicBlock> Base;
150 ForwardDominanceFrontierBase<BasicBlock> &getBase() { return Base; }
153 return Base.getRoots();
156 BasicBlock *getRoot() const { return Base.getRoot(); }
158 bool isPostDominator() const { return Base.isPostDominator(); }
160 iterator begin() { return Base.begin(); }
162 const_iterator begin() const { return Base.begin();
[all...] |
| PtrUseVisitor.h | 39 /// usage. This class is just a helper base class which is not templated and
149 /// Note that the constructor is protected because this class must be a base
167 /// \brief A base class for visitors over the uses of a pointer value.
175 /// subclass, as well as the current offset from the original base pointer if
182 /// multiple, different uses of pointers derived from the same base.
196 typedef InstVisitor<DerivedT> Base;
267 return Base::visitIntrinsicInst(II);
279 Base::visitCallSite(CS);
|
| /external/llvm/include/llvm/IR/ |
| Dominators.h | 85 typedef DominatorTreeBase<BasicBlock> Base;
93 : Base(std::move(static_cast<Base &>(Arg))) {}
95 Base::operator=(std::move(static_cast<Base &>(RHS)));
108 if (Base::compare(Other))
114 // Ensure base-class overloads are visible.
115 using Base::dominates;
127 // Ensure base class overloads are visible.
128 using Base::isReachableFromEntry
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 10 // This implements the ScheduleDAG class, which is a base class used by
198 /// This function finds loads of the same base and different offsets. If the
211 // the same base pointer and different offsets.
216 SDNode *Base = Node;
226 if (!TII->areLoadsFromSameBasePtr(Base, User, Offset1, Offset2) ||
231 if (O2SMap.insert(std::make_pair(Offset1, Base)).second)
236 Base = User;
[all...] |
| /external/llvm/lib/Target/SystemZ/MCTargetDesc/ |
| SystemZMCCodeEmitter.cpp | 57 // The index or length, if any, is encoded first, followed by the base,
151 uint64_t Base = getMachineOpValue(MI, MI.getOperand(OpNum), Fixups, STI);
153 assert(isUInt<4>(Base) && isUInt<12>(Disp));
154 return (Base << 12) | Disp;
161 uint64_t Base = getMachineOpValue(MI, MI.getOperand(OpNum), Fixups, STI);
163 assert(isUInt<4>(Base) && isInt<20>(Disp));
164 return (Base << 20) | ((Disp & 0xfff) << 8) | ((Disp & 0xff000) >> 12);
171 uint64_t Base = getMachineOpValue(MI, MI.getOperand(OpNum), Fixups, STI);
174 assert(isUInt<4>(Base) && isUInt<12>(Disp) && isUInt<4>(Index));
175 return (Index << 16) | (Base << 12) | Disp
[all...] |
| /external/lzma/CS/7zip/Compress/LZMA/ |
| LzmaBase.cs | 5 internal abstract class Base
|
| /external/lzma/Java/SevenZip/Compression/LZMA/ |
| Base.java | 0 // Base.java
5 public class Base
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashIterator.h | 251 typedef IteratorBase Base;
286 this->Base::advance();
292 this->Base::advance();
|
| /external/eigen/Eigen/src/Core/ |
| GeneralProduct.h | 204 typedef Matrix<typename internal::scalar_product_traits<typename Lhs::Scalar, typename Rhs::Scalar>::ReturnType,1,1> Base;
211 Base::coeffRef(0,0) = (lhs.transpose().cwiseProduct(rhs)).sum();
215 operator const typename Base::Scalar() const {
216 return Base::coeff(0,0);
265 GeneralProduct(const Lhs& lhs, const Rhs& rhs) : Base(lhs,rhs)
336 GeneralProduct(const Lhs& a_lhs, const Rhs& a_rhs) : Base(a_lhs,a_rhs)
559 * Implementation of matrix base methods
|
| /art/compiler/utils/arm/ |
| assembler_arm_test.h | 33 typedef AssemblerTest<Ass, Reg, FPReg, Imm> Base;
35 using Base::GetRegisters;
36 using Base::GetRegName;
37 using Base::CreateImmediate;
38 using Base::WarnOnCombinations;
107 std::string base = after_cond; local
109 size_t imm1_index = base.find(IMM1_TOKEN);
114 base.replace(imm1_index, ConstexprStrLen(IMM1_TOKEN), imm_string);
118 std::string base2 = base;
133 while ((reg1_index = base3.find(Base::REG1_TOKEN)) != std::string::npos)
[all...] |
| /art/compiler/utils/x86_64/ |
| assembler_x86_64_test.cc | 23 #include "base/bit_utils.h"
24 #include "base/stl_util.h"
131 x86_64::XmmRegister, x86_64::Immediate> Base;
363 std::string shll_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
386 std::string shlq_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
409 std::string shrl_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
432 std::string shrq_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
455 std::string sarl_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
478 std::string sarq_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler) {
501 std::string rorl_fn(AssemblerX86_64Test::Base* assembler_test, x86_64::X86_64Assembler* assembler)
[all...] |
| /external/ceres-solver/internal/ceres/ |
| evaluator_test.cc | 59 typedef SizedCostFunction<kNumResiduals, N0, N1, N2> Base;
64 for (int i = 0; i < Base::num_residuals(); ++i) {
68 for (int k = 0; k < Base::parameter_block_sizes().size(); ++k) {
83 Base::num_residuals(),
84 Base::parameter_block_sizes()[k]);
85 for (int j = 0; j < Base::parameter_block_sizes()[k]; ++j) {
|
| /external/clang/include/clang/AST/ |
| CXXInheritance.h | 37 /// base class.
40 /// derived class to one of its direct base classes, along with a
41 /// base "number" that identifies which base subobject of the
44 /// \brief The base specifier that states the link from a derived
45 /// class to a base class, which will be followed by this base
47 const CXXBaseSpecifier *Base;
49 /// \brief The record decl of the class that the base is a base of
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCXXABI.cpp | 94 Address Base, llvm::Value *MemPtr,
98 ->getPointerTo(Base.getAddressSpace());
284 // TODO: Store base specifiers in APValue member pointer paths so we can
292 const CXXRecordDecl *Base = RD;
295 std::swap(Base, Derived);
297 getContext().getASTRecordLayout(Derived).getBaseClassOffset(Base);
|
| /external/clang/test/Analysis/inlining/ |
| path-notes.cpp | 216 struct Base { int *x; };
217 struct Derived : public Base {};
[all...] |
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
| p5-var.cpp | 5 struct Base { };
6 struct Derived : Base { }; // expected-note{{candidate constructor (the implicit copy constructor) not viable}}
11 struct Derived2 : Base { };
15 operator Base&() const;
32 operator Base() const;
51 void bind_lvalue_to_lvalue(Base b, Derived d,
52 const Base bc, const Derived dc,
56 Base &br1 = b;
57 Base &br2 = d;
59 Derived &dr2 = b; // expected-error{{non-const lvalue reference to type 'Derived' cannot bind to a value of unrelated type 'Base'}}
[all...] |
| /external/clang/test/FixIt/ |
| fixit-cxx0x.cpp | 26 struct Base {
29 struct MemberDeclarator : Base {
116 // 'struct' as part of the same enum-base.
|
