* the Upper->UpperTriangular change
* finally get ei_add_test right
diff --git a/doc/snippets/MatrixBase_extract.cpp b/doc/snippets/MatrixBase_extract.cpp
index bedf4df..02f44c8 100644
--- a/doc/snippets/MatrixBase_extract.cpp
+++ b/doc/snippets/MatrixBase_extract.cpp
@@ -1,8 +1,8 @@
Matrix3i m = Matrix3i::Random();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "Here is the upper-triangular matrix extracted from m:" << endl
- << m.part<Eigen::Upper>() << endl;
+ << m.part<Eigen::UpperTriangular>() << endl;
cout << "Here is the strictly-upper-triangular matrix extracted from m:" << endl
- << m.part<Eigen::StrictlyUpper>() << endl;
+ << m.part<Eigen::StrictlyUpperTriangular>() << endl;
cout << "Here is the unit-lower-triangular matrix extracted from m:" << endl
- << m.part<Eigen::UnitLower>() << endl;
+ << m.part<Eigen::UnitLowerTriangular>() << endl;
diff --git a/doc/snippets/MatrixBase_marked.cpp b/doc/snippets/MatrixBase_marked.cpp
index d4c11c6..5c05ce8 100644
--- a/doc/snippets/MatrixBase_marked.cpp
+++ b/doc/snippets/MatrixBase_marked.cpp
@@ -1,9 +1,9 @@
Matrix3d m = Matrix3d::Zero();
-m.part<Eigen::Upper>().setOnes();
+m.part<Eigen::UpperTriangular>().setOnes();
cout << "Here is the matrix m:" << endl << m << endl;
Matrix3d n = Matrix3d::Ones();
-n.part<Eigen::Lower>() *= 2;
+n.part<Eigen::LowerTriangular>() *= 2;
cout << "Here is the matrix n:" << endl << n << endl;
cout << "And now here is m.inverse()*n, taking advantage of the fact that"
" m is upper-triangular:" << endl
- << m.marked<Eigen::Upper>().solveTriangular(n);
+ << m.marked<Eigen::UpperTriangular>().solveTriangular(n);
diff --git a/doc/snippets/MatrixBase_part.cpp b/doc/snippets/MatrixBase_part.cpp
index fbc55b1..1abbd68 100644
--- a/doc/snippets/MatrixBase_part.cpp
+++ b/doc/snippets/MatrixBase_part.cpp
@@ -1,5 +1,5 @@
Matrix3d m = Matrix3i::Zero();
-m.part<Eigen::StrictlyUpper>().setOnes();
+m.part<Eigen::StrictlyUpperTriangular>().setOnes();
cout << "Here is the matrix m:" << endl << m << endl;
cout << "And let us now compute m*m.adjoint() in a very optimized way" << endl
<< "taking advantage of the symmetry." << endl;
diff --git a/doc/snippets/class_LU_2.cpp b/doc/snippets/class_LU_2.cpp
index ccf89a9..0c72d34 100644
--- a/doc/snippets/class_LU_2.cpp
+++ b/doc/snippets/class_LU_2.cpp
@@ -7,7 +7,7 @@
<< endl << lu.matrixLU() << endl;
cout << "Here is the actual L matrix in this decomposition:" << endl;
Matrix5x5 l = Matrix5x5::Identity();
-l.block<5,3>(0,0).part<StrictlyLower>() = lu.matrixLU();
+l.block<5,3>(0,0).part<StrictlyLowerTriangular>() = lu.matrixLU();
cout << l << endl;
cout << "Let us now reconstruct the original matrix m:" << endl;
Matrix5x3 x = l * lu.matrixU();