/external/robolectric/lib/main/ |
H A D | android.jar | META-INF/ META-INF/MANIFEST.MF com/ com/android/ com/android/internal/ com/android/internal/util/ ... |
/external/qemu/android/skin/ |
H A D | trackball.c | 28 typedef double* Vector; typedef 64 fixedvector_from_vector( Fix16Vector f, Vector v ) 483 fixedvector_from_vector( (Fix16Vector)&faxes[0], (Vector)&ball->axes[0] ); 484 fixedvector_from_vector( (Fix16Vector)&faxes[1], (Vector)&ball->axes[1] ); 485 fixedvector_from_vector( (Fix16Vector)&faxes[2], (Vector)&ball->axes[2] );
|
/external/protobuf/gtest/src/ |
H A D | gtest-internal-inl.h | 242 // Vector is an ordered container that supports random access to the 252 class Vector { class in namespace:testing::internal 254 // Creates an empty Vector. 255 Vector() : elements_(NULL), capacity_(0), size_(0) {} function in class:testing::internal::Vector 258 virtual ~Vector() { Clear(); } 260 // Clears the Vector. 276 // Adds an element to the end of the Vector. A copy of the element 278 // Vector. Changes made to the element in the Vector doesn't affect 282 // Adds an element to the beginning of this Vector [all...] |
/external/protobuf/gtest/test/ |
H A D | gtest-typed-test_test.cc | 62 typedef std::vector<T> Vector; typedef in class:CommonTest 104 typename TestFixture::Vector empty;
|
/external/lzma/CPP/7zip/Common/ |
H A D | LimitedStreams.h | 77 CRecordVector<UInt32> Vector;
member in class:CClusterInStream 86 if (Vector.Size() > 0)
88 _physPos = StartOffset + (Vector[0] << BlockSizeLog);
|
/external/llvm/bindings/ocaml/llvm/ |
H A D | llvm.ml | 36 | Vector Constructor in type:TypeKind/t
|
/external/llvm/include/llvm/ADT/ |
H A D | FoldingSet.h | 297 /// Bits - Vector of all the data bits that make the node unique. 582 VectorT Vector; member in class:llvm::FoldingSetVector 590 iterator begin() { return Vector.begin(); } 591 iterator end() { return Vector.end(); } 595 const_iterator begin() const { return Vector.begin(); } 596 const_iterator end() const { return Vector.end(); } 599 void clear() { Set.clear(); Vector.clear(); } 613 if (Result == N) Vector.push_back(N); 622 Vector.push_back(N); 629 Vector [all...] |
H A D | MapVector.h | 35 VectorType Vector; member in class:llvm::MapVector 42 return Vector.size(); 46 return Vector.begin(); 50 return Vector.begin(); 54 return Vector.end(); 58 return Vector.end(); 62 return Vector.empty(); 65 std::pair<KeyT, ValueT> &front() { return Vector.front(); } 66 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } 67 std::pair<KeyT, ValueT> &back() { return Vector [all...] |
H A D | SmallSet.h | 35 SmallVector<T, N> Vector; member in class:llvm::SmallSet 44 return Vector.empty() && Set.empty(); 48 return isSmall() ? Vector.size() : Set.size(); 55 return vfind(V) == Vector.end() ? 0 : 1; 68 if (I != Vector.end()) // Don't reinsert if it already exists. 70 if (Vector.size() < N) { 71 Vector.push_back(V); 76 while (!Vector.empty()) { 77 Set.insert(Vector.back()); 78 Vector [all...] |
H A D | UniqueVector.h | 34 // Vector - ID ordered vector of entries. Entries can be indexed by ID - 1. 36 VectorType Vector; member in class:llvm::UniqueVector 49 Val = static_cast<unsigned>(Vector.size()) + 1; 52 Vector.push_back(Entry); 73 return Vector[ID - 1]; 77 iterator begin() { return Vector.begin(); } 80 const_iterator begin() const { return Vector.begin(); } 83 iterator end() { return Vector.end(); } 86 const_iterator end() const { return Vector.end(); } 90 size_t size() const { return Vector [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | CostAllocator.h | 130 typedef VectorT Vector; typedef in class:PBQP::PoolCostAllocator
|
H A D | Graph.h | 53 typedef typename SolverT::Vector Vector; typedef in class:PBQP::Graph 413 const Vector& getNodeCosts(NodeId NId) const { 587 const Vector& V = getNodeCosts(NId);
|
H A D | Math.h | 1 //===------ Math.h - PBQP Vector and Matrix classes -------------*- C++ -*-===// 21 /// \brief PBQP Vector class. 22 class Vector { class in namespace:PBQP 27 explicit Vector(unsigned Length) function in class:PBQP::Vector 29 // llvm::dbgs() << "Constructing PBQP::Vector " 34 Vector(unsigned Length, PBQPNum InitVal) function in class:PBQP::Vector 36 // llvm::dbgs() << "Constructing PBQP::Vector " 43 Vector(const Vector &V) function in class:PBQP::Vector 45 // llvm::dbgs() << "Copy-constructing PBQP::Vector " << thi 51 Vector(Vector &&V) function in class:PBQP::Vector [all...] |
H A D | ReductionRules.h | 31 typedef typename GraphT::Vector Vector; typedef 42 const Vector &XCosts = G.getNodeCosts(NId); 75 typedef typename GraphT::Vector Vector; typedef 82 const Vector &XCosts = G.getNodeCosts(NId);
|
H A D | RegAllocSolver.h | 92 void setup(const Vector& Costs) { 133 typedef PBQP::Vector RawVector; 135 typedef PBQP::Vector Vector; typedef in class:PBQP::RegAlloc::RegAllocSolverImpl 138 Vector, PBQP::VectorComparator, 165 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
|
/external/llvm/include/llvm/IR/ |
H A D | Intrinsics.h | 84 Integer, Vector, Pointer, Struct, enumerator in enum:llvm::Intrinsic::IITDescriptor::IITDescriptorKind
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ISelLowering.cpp | 342 // Vector add and sub nodes may conceal a high-half opportunity. 7393 SDValue Vector = N->getOperand(0); local 7408 if (User->isPredecessorOf(Vector.getNode())) 7424 Ops.push_back(Vector); // The vector to be inserted
|
/external/llvm/lib/Target/Mips/ |
H A D | MipsSEISelLowering.cpp | 2383 SDValue Vector = DAG.getUNDEF(ResTy); local 2385 Vector = DAG.getNode(ISD::INSERT_VECTOR_ELT, DL, ResTy, Vector, 2389 return Vector;
|
/external/llvm/lib/Target/R600/ |
H A D | R600ISelLowering.cpp | 963 SDValue Vector) const { 965 SDLoc DL(Vector); 966 EVT VecVT = Vector.getValueType(); 973 Vector, DAG.getConstant(i, getVectorIdxTy()))); 983 SDValue Vector = Op.getOperand(0); local 987 Vector.getOpcode() == AMDGPUISD::BUILD_VERTICAL_VECTOR) 990 Vector = vectorToVerticalVector(DAG, Vector); 992 Vector, Index); 998 SDValue Vector local [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 56 /// Map keys to indices in Vector. 62 VectorTy Vector; member in class:__anon26262::MapVector 67 iterator begin() { return Vector.begin(); } 68 iterator end() { return Vector.end(); } 69 const_iterator begin() const { return Vector.begin(); } 70 const_iterator end() const { return Vector.end(); } 74 assert(Vector.size() >= Map.size()); // May differ due to blotting. 77 assert(I->second < Vector.size()); 78 assert(Vector[I->second].first == I->first); 80 for (typename VectorTy::const_iterator I = Vector [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | ScalarReplAggregates.cpp | 281 Vector, enumerator in enum:__anon26334::ConvertToScalarInfo::__anon26335 344 if (ScalarKind == Vector && VectorTy->getBitWidth() != AllocaSize * 8) 354 if (ScalarKind == Vector) { 453 ScalarKind = Vector;
|
/external/lldb/include/lldb/Core/ |
H A D | Value.h | 57 struct Vector struct in class:lldb_private::Value 64 Vector() : function in struct:lldb_private::Value::Vector 70 Vector(const Vector& vector) function in struct:lldb_private::Value::Vector 73 const Vector& 74 operator=(const Vector& vector) 103 // Returns a default constructed Scalar if the Vector data is internally inconsistent. 126 Value(const Vector& vector); 193 const Vector & 205 Vector [all...] |
/external/lldb/tools/debugserver/source/ |
H A D | DNBDefs.h | 177 Vector // vector registers enumerator in enum:DNBRegisterType
|
/external/gtest/test/ |
H A D | gtest-typed-test_test.cc | 62 typedef std::vector<T> Vector; typedef in class:CommonTest 104 typename TestFixture::Vector empty;
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BasicPreconditioners.h | 36 typedef Matrix<Scalar,Dynamic,1> Vector; typedef in class:Eigen::DiagonalPreconditioner 37 typedef typename Vector::Index Index; 99 Vector m_invdiag;
|