keyword stringclasses 7
values | repo_name stringlengths 8 98 | file_path stringlengths 4 244 | file_extension stringclasses 29
values | file_size int64 0 84.1M | line_count int64 0 1.6M | content stringlengths 1 84.1M ⌀ | language stringclasses 14
values |
|---|---|---|---|---|---|---|---|
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/SelfAdjointEigenSolver_SelfAdjointEigenSolver.cpp | .cpp | 362 | 8 | SelfAdjointEigenSolver<Matrix4f> es;
Matrix4f X = Matrix4f::Random(4,4);
Matrix4f A = X + X.transpose();
es.compute(A);
cout << "The eigenvalues of A are: " << es.eigenvalues().transpose() << endl;
es.compute(A + Matrix4f::Identity(4,4)); // re-use es to compute eigenvalues of A+I
cout << "The eigenvalues of A+I are: "... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Matrix_setZero_int.cpp | .cpp | 45 | 4 | VectorXf v;
v.setZero(3);
cout << v << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/MatrixBase_rightCols_int.cpp | .cpp | 239 | 7 | Array44i a = Array44i::Random();
cout << "Here is the array a:" << endl << a << endl;
cout << "Here is a.rightCols(2):" << endl;
cout << a.rightCols(2) << endl;
a.rightCols(2).setZero();
cout << "Now the array a is:" << endl << a << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Matrix_setOnes_int_int.cpp | .cpp | 48 | 4 | MatrixXf m;
m.setOnes(3, 3);
cout << m << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Cwise_log.cpp | .cpp | 43 | 3 | Array3d v(1,2,3);
cout << v.log() << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/MatrixBase_template_int_int_topLeftCorner.cpp | .cpp | 265 | 7 | Matrix4i m = Matrix4i::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is m.topLeftCorner<2,2>():" << endl;
cout << m.topLeftCorner<2,2>() << endl;
m.topLeftCorner<2,2>().setZero();
cout << "Now the matrix m is:" << endl << m << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Cwise_greater_equal.cpp | .cpp | 52 | 3 | Array3d v(1,2,3), w(3,2,1);
cout << (v>=w) << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/DenseBase_setLinSpaced.cpp | .cpp | 60 | 4 | VectorXf v;
v.setLinSpaced(5,0.5f,1.5f);
cout << v << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Cwise_cosh.cpp | .cpp | 64 | 3 | ArrayXd v = ArrayXd::LinSpaced(5,0,1);
cout << cosh(v) << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/ComplexSchur_matrixT.cpp | .cpp | 263 | 5 | MatrixXcf A = MatrixXcf::Random(4,4);
cout << "Here is a random 4x4 matrix, A:" << endl << A << endl << endl;
ComplexSchur<MatrixXcf> schurOfA(A, false); // false means do not compute U
cout << "The triangular matrix T is:" << endl << schurOfA.matrixT() << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/DirectionWise_replicate_int.cpp | .cpp | 179 | 5 | Vector3i v = Vector3i::Random();
cout << "Here is the vector v:" << endl << v << endl;
cout << "v.rowwise().replicate(5) = ..." << endl;
cout << v.rowwise().replicate(5) << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/MatrixBase_replicate_int_int.cpp | .cpp | 163 | 5 | Vector3i v = Vector3i::Random();
cout << "Here is the vector v:" << endl << v << endl;
cout << "v.replicate(2,5) = ..." << endl;
cout << v.replicate(2,5) << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/MatrixBase_cwiseProduct.cpp | .cpp | 153 | 5 | Matrix3i a = Matrix3i::Random(), b = Matrix3i::Random();
Matrix3i c = a.cwiseProduct(b);
cout << "a:\n" << a << "\nb:\n" << b << "\nc:\n" << c << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/MatrixBase_cwiseEqual.cpp | .cpp | 276 | 8 | MatrixXi m(2,2);
m << 1, 0,
1, 1;
cout << "Comparing m with identity matrix:" << endl;
cout << m.cwiseEqual(MatrixXi::Identity(2,2)) << endl;
Index count = m.cwiseEqual(MatrixXi::Identity(2,2)).count();
cout << "Number of coefficients that are equal: " << count << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/Cwise_exp.cpp | .cpp | 43 | 3 | Array3d v(1,2,3);
cout << v.exp() << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/snippets/ComplexSchur_compute.cpp | .cpp | 301 | 7 | MatrixXcf A = MatrixXcf::Random(4,4);
ComplexSchur<MatrixXcf> schur(4);
schur.compute(A);
cout << "The matrix T in the decomposition of A is:" << endl << schur.matrixT() << endl;
schur.compute(A.inverse());
cout << "The matrix T in the decomposition of A^(-1) is:" << endl << schur.matrixT() << endl;
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_broadcast_1nn.cpp | .cpp | 440 | 25 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Eigen::MatrixXf m(2,4);
Eigen::VectorXf v(2);
m << 1, 23, 6, 9,
3, 11, 7, 2;
v << 2,
3;
MatrixXf::Index index;
// find nearest neighbour
(m.colwise() - v).colwise().squaredNorm()... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/DenseBase_template_int_middleCols.cpp | .cpp | 283 | 16 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(:,1..3) =\n" << A.middleCols<3>(1) << endl;
return 0;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_arithmetic_redux_basic.cpp | .cpp | 529 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::Matrix2d mat;
mat << 1, 2,
3, 4;
cout << "Here is mat.sum(): " << mat.sum() << endl;
cout << "Here is mat.prod(): " << mat.prod() << endl;
cout << "Here is mat.mean(): " << mat.mean() ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_arithmetic_matrix_mul.cpp | .cpp | 612 | 20 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d mat;
mat << 1, 2,
3, 4;
Vector2d u(-1,1), v(2,0);
std::cout << "Here is mat*mat:\n" << mat*mat << std::endl;
std::cout << "Here is mat*u:\n" << mat*u << std::endl;
std::cout << "Here is u^T*mat:\n" << u.transpo... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_rowwise.cpp | .cpp | 244 | 14 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
std::cout << "Row's maximum: " << std::endl
<< mat.rowwise().maxCoeff() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_arithmetic_dot_cross.cpp | .cpp | 393 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
Vector3d v(1,2,3);
Vector3d w(0,1,2);
cout << "Dot product: " << v.dot(w) << endl;
double dp = v.adjoint()*w; // automatic conversion of the inner product to a scalar
cout << "Dot product via a matrix product... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_reductions_operatornorm.cpp | .cpp | 447 | 19 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXf m(2,2);
m << 1,-2,
-3,4;
cout << "1-norm(m) = " << m.cwiseAbs().colwise().sum().maxCoeff()
<< " == " << m.colwise().lpNorm<1>().maxCoeff() << endl;
cout << "infty-norm(m... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_visitors.cpp | .cpp | 531 | 27 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Eigen::MatrixXf m(2,2);
m << 1, 2,
3, 4;
//get location of maximum
MatrixXf::Index maxRow, maxCol;
float max = m.maxCoeff(&maxRow, &maxCol);
//get location of minimum
MatrixXf::Index minRow, m... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_BlockOperations_colrow.cpp | .cpp | 390 | 18 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(3,3);
m << 1,2,3,
4,5,6,
7,8,9;
cout << "Here is the matrix m:" << endl << m << endl;
cout << "2nd Row: " << m.row(1) << endl;
m.col(2) += 3 * m.col(0);
cout << "After adding 3 times the first colu... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_CwiseBinaryOp.cpp | .cpp | 526 | 19 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define a custom template binary functor
template<typename Scalar> struct MakeComplexOp {
EIGEN_EMPTY_STRUCT_CTOR(MakeComplexOp)
typedef complex<Scalar> result_type;
complex<Scalar> operator()(const Scalar& a, const Scalar& b... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_addition.cpp | .cpp | 400 | 24 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXXf a(3,3);
ArrayXXf b(3,3);
a << 1,2,3,
4,5,6,
7,8,9;
b << 1,2,3,
1,2,3,
1,2,3;
// Adding two arrays
cout << "a + b = " << endl << a + b << endl << endl;
// Subt... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/make_circulant2.cpp | .cpp | 1,320 | 53 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
// [circulant_func]
template<class ArgType>
class circulant_functor {
const ArgType &m_vec;
public:
circulant_functor(const ArgType& arg) : m_vec(arg) {}
const typename ArgType::Scalar& operator() (Index row, Index col) const {
Index index = ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgSVDSolve.cpp | .cpp | 405 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXf A = MatrixXf::Random(3, 2);
cout << "Here is the matrix A:\n" << A << endl;
VectorXf b = VectorXf::Random(3);
cout << "Here is the right hand side b:\n" << b << endl;
cout << "The least-squares ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_cwise_other.cpp | .cpp | 410 | 20 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXf a = ArrayXf::Random(5);
a *= 2;
cout << "a =" << endl
<< a << endl;
cout << "a.abs() =" << endl
<< a.abs() << endl;
cout << "a.abs().sqrt() =" << endl
<< a.abs().sqrt() << endl... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/QuickStart_example.cpp | .cpp | 206 | 15 | #include <iostream>
#include <Eigen/Dense>
using Eigen::MatrixXd;
int main()
{
MatrixXd m(2,2);
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,1) = m(1,0) + m(0,1);
std::cout << m << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/matrixfree_cg.cpp | .cpp | 4,275 | 130 | #include <iostream>
#include <Eigen/Core>
#include <Eigen/Dense>
#include <Eigen/IterativeLinearSolvers>
#include <unsupported/Eigen/IterativeSolvers>
class MatrixReplacement;
using Eigen::SparseMatrix;
namespace Eigen {
namespace internal {
// MatrixReplacement looks-like a SparseMatrix, so let's inherits its trai... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/DenseBase_middleRows_int.cpp | .cpp | 282 | 16 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(2..3,:) =\n" << A.middleRows(2,2) << endl;
return 0;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Cwise_erf.cpp | .cpp | 189 | 10 | #include <Eigen/Core>
#include <unsupported/Eigen/SpecialFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
Array4d v(-0.5,2,0,-7);
std::cout << v.erf() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_mult.cpp | .cpp | 237 | 17 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXXf a(2,2);
ArrayXXf b(2,2);
a << 1,2,
3,4;
b << 5,6,
7,8;
cout << "a * b = " << endl << a * b << endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/DenseBase_template_int_middleRows.cpp | .cpp | 283 | 16 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(1..3,:) =\n" << A.middleRows<3>(1) << endl;
return 0;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_FixedVectorBlock.cpp | .cpp | 673 | 28 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::VectorBlock<Derived, 2>
firstTwo(MatrixBase<Derived>& v)
{
return Eigen::VectorBlock<Derived, 2>(v.derived(), 0);
}
template<typename Derived>
const Eigen::VectorBlock<const Derived, 2>
firstTwo(c... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Cwise_erfc.cpp | .cpp | 190 | 10 | #include <Eigen/Core>
#include <unsupported/Eigen/SpecialFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
Array4d v(-0.5,2,0,-7);
std::cout << v.erfc() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgExComputeSolveError.cpp | .cpp | 371 | 15 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXd A = MatrixXd::Random(100,100);
MatrixXd b = MatrixXd::Random(100,50);
MatrixXd x = A.fullPivLu().solve(b);
double relative_error = (A*x - b).norm() / b.norm(); // norm() is L2 norm
cout << "The ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_interop.cpp | .cpp | 444 | 23 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXf m(2,2);
MatrixXf n(2,2);
MatrixXf result(2,2);
m << 1,2,
3,4;
n << 5,6,
7,8;
result = (m.array() + 4).matrix() * m;
cout << "-- Combination 1: --" << endl << result << endl << e... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/make_circulant.cpp | .cpp | 366 | 12 | /*
This program is presented in several fragments in the doc page.
Every fragment is in its own file; this file simply combines them.
*/
#include "make_circulant.cpp.preamble"
#include "make_circulant.cpp.traits"
#include "make_circulant.cpp.expression"
#include "make_circulant.cpp.evaluator"
#include "make_circulant.... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_matrix_resize.cpp | .cpp | 489 | 19 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
MatrixXd m(2,5);
m.resize(4,3);
std::cout << "The matrix m is of size "
<< m.rows() << "x" << m.cols() << std::endl;
std::cout << "It has " << m.size() << " coefficients" << std::endl;
VectorXd v(2);
v.resize(5);
... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_BlockOperations_corner.cpp | .cpp | 448 | 18 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::Matrix4f m;
m << 1, 2, 3, 4,
5, 6, 7, 8,
9, 10,11,12,
13,14,15,16;
cout << "m.leftCols(2) =" << endl << m.leftCols(2) << endl << endl;
cout << "m.bottomRows<2>() =" << endl << m.bottomRows<2>() << endl << ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgExSolveLDLT.cpp | .cpp | 356 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A, b;
A << 2, -1, -1, 3;
b << 1, 2, 3, 1;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the right hand side b:\n" << b << endl;
Matrix2f x = A.ldlt().solve(b);
cout << "... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp | .cpp | 502 | 21 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXf mat(2,4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
MatrixXf::Index maxIndex;
float maxNorm = mat.colwise().sum().maxCoeff(&maxIndex);
std::cout << "Maximum sum at position " << maxIndex << std:... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_VectorBlock.cpp | .cpp | 775 | 28 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::VectorBlock<Derived>
segmentFromRange(MatrixBase<Derived>& v, int start, int end)
{
return Eigen::VectorBlock<Derived>(v.derived(), start, end-start);
}
template<typename Derived>
const Eigen::Vec... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Cwise_lgamma.cpp | .cpp | 192 | 10 | #include <Eigen/Core>
#include <unsupported/Eigen/SpecialFunctions>
#include <iostream>
using namespace Eigen;
int main()
{
Array4d v(0.5,10,0,-1);
std::cout << v.lgamma() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_Block.cpp | .cpp | 737 | 28 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::Block<Derived>
topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
{
return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
}
template<typename Derived>
const Eigen::Block<const Derive... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_BlockOperations_block_assignment.cpp | .cpp | 523 | 19 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
Array22f m;
m << 1,2,
3,4;
Array44f a = Array44f::Constant(0.6);
cout << "Here is the array a:" << endl << a << endl << endl;
a.block<2,2>(1,1) = m;
cout << "Here is now a with m copied into its cent... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_broadcast_simple.cpp | .cpp | 356 | 22 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(2);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,
1;
//add v to each column of m
mat.colwise() += v;
std::cout << "Broadcasting result: " << std::endl;... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_arithmetic_add_sub.cpp | .cpp | 471 | 23 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d a;
a << 1, 2,
3, 4;
MatrixXd b(2,2);
b << 2, 3,
1, 4;
std::cout << "a + b =\n" << a + b << std::endl;
std::cout << "a - b =\n" << a - b << std::endl;
std::cout << "Doing a += b;" << std::endl;
a += b;... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_broadcast_simple_rowwise.cpp | .cpp | 361 | 21 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
Eigen::VectorXf v(4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
v << 0,1,2,3;
//add v to each row of m
mat.rowwise() += v.transpose();
std::cout << "Broadcasting result: " << std::... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_FixedBlock.cpp | .cpp | 697 | 28 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
template<typename Derived>
Eigen::Block<Derived, 2, 2>
topLeft2x2Corner(MatrixBase<Derived>& m)
{
return Eigen::Block<Derived, 2, 2>(m.derived(), 0, 0);
}
template<typename Derived>
const Eigen::Block<const Derived, 2, 2>
topLeft2... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_arithmetic_scalar_mul_div.cpp | .cpp | 353 | 18 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix2d a;
a << 1, 2,
3, 4;
Vector3d v(1,2,3);
std::cout << "a * 2.5 =\n" << a * 2.5 << std::endl;
std::cout << "0.1 * v =\n" << 0.1 * v << std::endl;
std::cout << "Doing v *= 2;" << std::endl;
v *= 2;
std::cout << ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/function_taking_ref.cpp | .cpp | 594 | 20 | #include <iostream>
#include <Eigen/SVD>
using namespace Eigen;
using namespace std;
float inv_cond(const Ref<const MatrixXf>& a)
{
const VectorXf sing_vals = a.jacobiSvd().singularValues();
return sing_vals(sing_vals.size()-1) / sing_vals(0);
}
int main()
{
Matrix4f m = Matrix4f::Random();
cout << "matrix m:... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgRankRevealing.cpp | .cpp | 600 | 21 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
A << 1, 2, 5,
2, 1, 4,
3, 0, 3;
cout << "Here is the matrix A:\n" << A << endl;
FullPivLU<Matrix3f> lu_decomp(A);
cout << "The rank of A is " << lu_decomp.rank() << endl;
c... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_CwiseUnaryOp_ptrfun.cpp | .cpp | 371 | 21 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define function to be applied coefficient-wise
double ramp(double x)
{
if (x > 0)
return x;
else
return 0;
}
int main(int, char**)
{
Matrix4d m1 = Matrix4d::Random();
cout << m1 << endl << "becomes: " << endl << ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/function_taking_eigenbase.cpp | .cpp | 418 | 19 | #include <iostream>
#include <Eigen/Core>
using namespace Eigen;
template <typename Derived>
void print_size(const EigenBase<Derived>& b)
{
std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
<< ", " << b.cols() << ")" << std::endl;
}
int main()
{
Vector3f v;
print_size(v);
//... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_matrix_resize_fixed_size.cpp | .cpp | 229 | 13 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
Matrix4d m;
m.resize(4,4); // no operation
std::cout << "The matrix m is of size "
<< m.rows() << "x" << m.cols() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_simple_example_dynamic_size.cpp | .cpp | 680 | 23 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
int main()
{
for (int size=1; size<=4; ++size)
{
MatrixXi m(size,size+1); // a (size)x(size+1)-matrix of int's
for (int j=0; j<m.cols(); ++j) // loop over columns
for (int i=0; i<m.rows(); ++i) // loop over rows
m(i,j... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgComputeTwice.cpp | .cpp | 622 | 24 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A, b;
LLT<Matrix2f> llt;
A << 2, -1, -1, 3;
b << 1, 2, 3, 1;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the right hand side b:\n" << b << endl;
cout << "Computing LLT... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgSelfAdjointEigenSolver.cpp | .cpp | 534 | 19 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2f A;
A << 1, 2, 2, 3;
cout << "Here is the matrix A:\n" << A << endl;
SelfAdjointEigenSolver<Matrix2f> eigensolver(A);
if (eigensolver.info() != Success) abort();
cout << "The eigenvalues of A ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/QuickStart_example2_dynamic.cpp | .cpp | 305 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXd m = MatrixXd::Random(3,3);
m = (m + MatrixXd::Constant(3,3,1.2)) * 50;
cout << "m =" << endl << m << endl;
VectorXd v(3);
v << 1, 2, 3;
cout << "m * v =" << endl << m * v << endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_interop_matrix.cpp | .cpp | 591 | 27 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
MatrixXf m(2,2);
MatrixXf n(2,2);
MatrixXf result(2,2);
m << 1,2,
3,4;
n << 5,6,
7,8;
result = m * n;
cout << "-- Matrix m*n: --" << endl << result << endl << endl;
result = m.array() * ... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TemplateKeyword_simple.cpp | .cpp | 508 | 21 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
void copyUpperTriangularPart(MatrixXf& dst, const MatrixXf& src)
{
dst.triangularView<Upper>() = src.triangularView<Upper>();
}
int main()
{
MatrixXf m1 = MatrixXf::Ones(4,4);
MatrixXf m2 = MatrixXf::Random(4,4);
std::cout << "m2 before copy:"... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_PartialLU_solve.cpp | .cpp | 401 | 19 | #include <Eigen/Core>
#include <Eigen/LU>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
Vector3f b;
A << 1,2,3, 4,5,6, 7,8,10;
b << 3, 3, 4;
cout << "Here is the matrix A:" << endl << A << endl;
cout << "Here is the vector b:" << endl << b << endl;
Vec... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_simple_example_fixed_size.cpp | .cpp | 282 | 16 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
int main()
{
Matrix3f m3;
m3 << 1, 2, 3, 4, 5, 6, 7, 8, 9;
Matrix4f m4 = Matrix4f::Identity();
Vector4i v4(1, 2, 3, 4);
std::cout << "m3\n" << m3 << "\nm4:\n"
<< m4 << "\nv4:\n" << v4 << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_BlockOperations_print_block.cpp | .cpp | 413 | 21 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::MatrixXf m(4,4);
m << 1, 2, 3, 4,
5, 6, 7, 8,
9,10,11,12,
13,14,15,16;
cout << "Block in the middle" << endl;
cout << m.block<2,2>(1,1) << endl << endl;
for (int i = 1; i <= 3; ++i)
{
cout << "B... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/QuickStart_example2_fixed.cpp | .cpp | 289 | 16 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
using namespace std;
int main()
{
Matrix3d m = Matrix3d::Random();
m = (m + Matrix3d::Constant(1.2)) * 50;
cout << "m =" << endl << m << endl;
Vector3d v(1,2,3);
cout << "m * v =" << endl << m * v << endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/CustomizingEigen_Inheritance.cpp | .cpp | 766 | 31 | #include <Eigen/Core>
#include <iostream>
class MyVectorType : public Eigen::VectorXd
{
public:
MyVectorType(void):Eigen::VectorXd() {}
// This constructor allows you to construct MyVectorType from Eigen expressions
template<typename OtherDerived>
MyVectorType(const Eigen::MatrixBase<OtherDerived>& ot... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialInplaceLU.cpp | .cpp | 1,589 | 62 | #include <iostream>
struct init {
init() { std::cout << "[" << "init" << "]" << std::endl; }
};
init init_obj;
// [init]
#include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
MatrixXd A(2,2);
A << 2, -1, 1, 3;
cout << "Here is the input matrix A before decompositi... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgExSolveColPivHouseholderQR.cpp | .cpp | 381 | 18 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
Vector3f b;
A << 1,2,3, 4,5,6, 7,8,10;
b << 3, 3, 4;
cout << "Here is the matrix A:\n" << A << endl;
cout << "Here is the vector b:\n" << b << endl;
Vector3f x = A.colPivHouseholderQr... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_reductions_norm.cpp | .cpp | 675 | 29 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
VectorXf v(2);
MatrixXf m(2,2), n(2,2);
v << -1,
2;
m << 1,-2,
-3,4;
cout << "v.squaredNorm() = " << v.squaredNorm() << endl;
cout << "v.norm() = " << v.norm() << endl;
cout << "v.lpN... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/tut_matrix_coefficient_accessors.cpp | .cpp | 343 | 19 | #include <iostream>
#include <Eigen/Dense>
using namespace Eigen;
int main()
{
MatrixXd m(2,2);
m(0,0) = 3;
m(1,0) = 2.5;
m(0,1) = -1;
m(1,1) = m(1,0) + m(0,1);
std::cout << "Here is the matrix m:\n" << m << std::endl;
VectorXd v(2);
v(0) = 4;
v(1) = v(0) - 1;
std::cout << "Here is the vector v:\n... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgInverseDeterminant.cpp | .cpp | 348 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix3f A;
A << 1, 2, 1,
2, 1, 0,
-1, 1, 2;
cout << "Here is the matrix A:\n" << A << endl;
cout << "The determinant of A is " << A.determinant() << endl;
cout << "The inverse of A is:\n... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/DenseBase_middleCols_int.cpp | .cpp | 282 | 16 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
int main(void)
{
int const N = 5;
MatrixXi A(N,N);
A.setRandom();
cout << "A =\n" << A << '\n' << endl;
cout << "A(1..3,:) =\n" << A.middleCols(1,3) << endl;
return 0;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_colwise.cpp | .cpp | 247 | 14 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
int main()
{
Eigen::MatrixXf mat(2,4);
mat << 1, 2, 6, 9,
3, 1, 7, 2;
std::cout << "Column's maximum: " << std::endl
<< mat.colwise().maxCoeff() << std::endl;
}
| C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TemplateKeyword_flexible.cpp | .cpp | 677 | 23 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
template <typename Derived1, typename Derived2>
void copyUpperTriangularPart(MatrixBase<Derived1>& dst, const MatrixBase<Derived2>& src)
{
/* Note the 'template' keywords in the following line! */
dst.template triangularView<Upper>() = src.template... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/TutorialLinAlgSetThreshold.cpp | .cpp | 377 | 17 | #include <iostream>
#include <Eigen/Dense>
using namespace std;
using namespace Eigen;
int main()
{
Matrix2d A;
A << 2, 1,
2, 0.9999999999;
FullPivLU<Matrix2d> lu(A);
cout << "By default, the rank of A is found to be " << lu.rank() << endl;
lu.setThreshold(1e-5);
cout << "With threshold 1e-5... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/class_CwiseUnaryOp.cpp | .cpp | 561 | 20 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
using namespace std;
// define a custom template unary functor
template<typename Scalar>
struct CwiseClampOp {
CwiseClampOp(const Scalar& inf, const Scalar& sup) : m_inf(inf), m_sup(sup) {}
const Scalar operator()(const Scalar& x) const { return x<m_... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ReductionsVisitorsBroadcasting_reductions_bool.cpp | .cpp | 513 | 22 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
using namespace Eigen;
int main()
{
ArrayXXf a(2,2);
a << 1,2,
3,4;
cout << "(a > 0).all() = " << (a > 0).all() << endl;
cout << "(a > 0).any() = " << (a > 0).any() << endl;
cout << "(a > 0).count() = " << (a > 0).count() << endl... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_ArrayClass_accessors.cpp | .cpp | 466 | 25 | #include <Eigen/Dense>
#include <iostream>
using namespace Eigen;
using namespace std;
int main()
{
ArrayXXf m(2,2);
// assign some values coefficient by coefficient
m(0,0) = 1.0; m(0,1) = 2.0;
m(1,0) = 3.0; m(1,1) = m(0,1) + m(1,0);
// print values to standard output
cout << m << endl << endl;
... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/Tutorial_BlockOperations_vector.cpp | .cpp | 348 | 15 | #include <Eigen/Dense>
#include <iostream>
using namespace std;
int main()
{
Eigen::ArrayXf v(6);
v << 1, 2, 3, 4, 5, 6;
cout << "v.head(3) =" << endl << v.head(3) << endl << endl;
cout << "v.tail<3>() = " << endl << v.tail<3>() << endl << endl;
v.segment(1,4) *= 2;
cout << "after 'v.segment(1,4) *= 2', v... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/doc/examples/nullary_indexing.cpp | .cpp | 2,438 | 67 | #include <Eigen/Core>
#include <iostream>
using namespace Eigen;
// [functor]
template<class ArgType, class RowIndexType, class ColIndexType>
class indexing_functor {
const ArgType &m_arg;
const RowIndexType &m_rowIndices;
const ColIndexType &m_colIndices;
public:
typedef Matrix<typename ArgType::Scalar,
... | C++ |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/OrderingMethods/Ordering.h | .h | 5,229 | 158 |
// This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this fil... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/OrderingMethods/Amd.h | .h | 16,396 | 446 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2010 Gael Guennebaud <gael.guennebaud@inria.fr>
/*
NOTE: this routine has been adapted from the CSparse library:
Copyright (c) 2006, Timothy A. Davis.
http://www.suitesparse.com
CSparse is free software; you... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/OrderingMethods/Eigen_Colamd.h | .h | 62,266 | 1,844 | // // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2012 Desire Nuentsa Wakam <desire.nuentsa_wakam@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this fil... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/CholmodSupport/CholmodSupport.h | .h | 22,307 | 640 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You c... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/Cholesky/LLT_LAPACKE.h | .h | 3,974 | 100 | /*
Copyright (c) 2011, Intel Corporation. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the ... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/Cholesky/LDLT.h | .h | 24,480 | 674 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008-2011 Gael Guennebaud <gael.guennebaud@inria.fr>
// Copyright (C) 2009 Keir Mierle <mierle@gmail.com>
// Copyright (C) 2009 Benoit Jacob <jacob.benoit.1@gmail.com>
// Copyright (C) 2011 Timothy E. Holy <tim.... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/Cholesky/LLT.h | .h | 18,395 | 543 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can ob... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/LeastSquareConjugateGradient.h | .h | 7,762 | 217 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can ob... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h | .h | 15,234 | 463 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
// Copyright (C) 2014 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. ... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/IncompleteCholesky.h | .h | 15,062 | 401 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
// Copyright (C) 2015 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. ... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | .h | 7,253 | 229 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
// Copyright (C) 2012 Désiré Nuentsa-Wakam <desire.nuentsa_wakam@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public Licens... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/ConjugateGradient.h | .h | 9,289 | 247 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You c... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/SolveWithGuess.h | .h | 4,158 | 116 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2014 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You can ob... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/BasicPreconditioners.h | .h | 6,755 | 227 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You c... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/IterativeLinearSolvers/IterativeSolverBase.h | .h | 11,527 | 395 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2011-2014 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You c... | Unknown |
2D | JaeHyunLee94/mpm2d | external/eigen-3.3.9/Eigen/src/SparseCholesky/SimplicialCholesky.h | .h | 24,017 | 690 | // This file is part of Eigen, a lightweight C++ template library
// for linear algebra.
//
// Copyright (C) 2008-2012 Gael Guennebaud <gael.guennebaud@inria.fr>
//
// This Source Code Form is subject to the terms of the Mozilla
// Public License v. 2.0. If a copy of the MPL was not distributed
// with this file, You c... | Unknown |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.