HomeSort by relevance Sort by last modified time
    Searched refs:Dense (Results 1 - 25 of 63) sorted by null

1 2 3

  /external/eigen/doc/examples/
QuickStart_example.cpp 2 #include <Eigen/Dense>
TutorialLinAlgInverseDeterminant.cpp 2 #include <Eigen/Dense>
Tutorial_ArrayClass_mult.cpp 1 #include <Eigen/Dense>
Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp 2 #include <Eigen/Dense>
Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp 2 #include <Eigen/Dense>
tut_matrix_resize_fixed_size.cpp 2 #include <Eigen/Dense>
QuickStart_example2_dynamic.cpp 2 #include <Eigen/Dense>
QuickStart_example2_fixed.cpp 2 #include <Eigen/Dense>
TutorialLinAlgExComputeSolveError.cpp 2 #include <Eigen/Dense>
TutorialLinAlgExSolveColPivHouseholderQR.cpp 2 #include <Eigen/Dense>
TutorialLinAlgExSolveLDLT.cpp 2 #include <Eigen/Dense>
TutorialLinAlgRankRevealing.cpp 2 #include <Eigen/Dense>
TutorialLinAlgSVDSolve.cpp 2 #include <Eigen/Dense>
TutorialLinAlgSelfAdjointEigenSolver.cpp 2 #include <Eigen/Dense>
TutorialLinAlgSetThreshold.cpp 2 #include <Eigen/Dense>
Tutorial_ArrayClass_accessors.cpp 1 #include <Eigen/Dense>
Tutorial_ArrayClass_addition.cpp 1 #include <Eigen/Dense>
Tutorial_BlockOperations_colrow.cpp 1 #include <Eigen/Dense>
Tutorial_BlockOperations_corner.cpp 1 #include <Eigen/Dense>
Tutorial_BlockOperations_print_block.cpp 1 #include <Eigen/Dense>
Tutorial_BlockOperations_vector.cpp 1 #include <Eigen/Dense>
Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp 2 #include <Eigen/Dense>
Tutorial_ReductionsVisitorsBroadcasting_broadcast_simple.cpp 2 #include <Eigen/Dense>
  /external/llvm/include/llvm/ADT/
SparseSet.h 97 /// SparseSet contains a dense vector holding all the objects and a sparse
98 /// array holding indexes into the dense vector. Most of the memory is used by
128 DenseT Dense;
174 const_iterator begin() const { return Dense.begin(); }
175 const_iterator end() const { return Dense.end(); }
176 iterator begin() { return Dense.begin(); }
177 iterator end() { return Dense.end(); }
183 bool empty() const { return Dense.empty(); }
190 size_type size() const { return Dense.size(); }
196 Dense.clear()
    [all...]
SparseMultiSet.h 47 /// SparseMultiSet contains a dense vector holding all the objects and a sparse
48 /// array holding indexes into the dense vector. Most of the memory is used by
63 /// that are inlined in the dense vector. SparseMultiSet is a good choice when
115 DenseT Dense;
123 /// erasure, iterator preservation, and dense size.
144 return Dense[D.Prev].isTail();
152 return &Dense[N.Prev] == &N;
159 Dense.push_back(SMSNode(V, Prev, Next));
160 return Dense.size() - 1;
165 unsigned NextFree = Dense[Idx].Next
    [all...]

Completed in 341 milliseconds

1 2 3