aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc
diff options
context:
space:
mode:
Diffstat (limited to 'doc')
-rw-r--r--doc/Mainpage.dox6
-rw-r--r--doc/echelon.cpp10
2 files changed, 8 insertions, 8 deletions
diff --git a/doc/Mainpage.dox b/doc/Mainpage.dox
index b82e60c60..a64c9286e 100644
--- a/doc/Mainpage.dox
+++ b/doc/Mainpage.dox
@@ -75,7 +75,7 @@ Eigen is well tested with recent versions of GCC and ICC. Both GCC 4.2 and ICC g
For best performance, we recommend the following compilation flags:
<ul>
- <li>\b GCC: \c -O3 \c -DNDEBUG \c -finline-limit=10000 </li>
+ <li>\b GCC: \c -O3 \c -DNDEBUG \c -finline-limit=1000 </li>
<li>\b ICC: \c -O3 \c -DNDEBUG \c -xT \c -ipo \c -no-prec-div \c -no-inline-max-size </li>
</ul>
@@ -120,8 +120,8 @@ standalone "demos".
TODO: update this section; make web links
-Currently: Kalzium, Avogadro, KSpread(a bit), Krita(a bit)
-Planned: much more use in KOffice 2.1, Step (if we make Eigen good enough!)
+Currently: Kalzium, Avogadro, KSpread(a bit), Krita(a bit), KGLLib<br>
+Planned: much more use in KOffice 2.1, Step (if we make Eigen good enough!), OpenBabel (maybe)
Please tell us if you know of other interesting projects using Eigen!
diff --git a/doc/echelon.cpp b/doc/echelon.cpp
index 677fd4af7..5b07db421 100644
--- a/doc/echelon.cpp
+++ b/doc/echelon.cpp
@@ -28,17 +28,17 @@ void doSomeRankPreservingOperations(MatrixBase<Derived>& m)
{
for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
{
- double d = Eigen::ei_random<double>(-1,1);
- int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
+ double d = ei_random<double>(-1,1);
+ int i = ei_random<int>(0,m.rows()-1); // i is a random row number
int j;
do {
- j = Eigen::ei_random<int>(0,m.rows()-1);
+ j = ei_random<int>(0,m.rows()-1);
} while (i==j); // j is another one (must be different)
m.row(i) += d * m.row(j);
- i = Eigen::ei_random<int>(0,m.cols()-1); // i is a random column number
+ i = ei_random<int>(0,m.cols()-1); // i is a random column number
do {
- j = Eigen::ei_random<int>(0,m.cols()-1);
+ j = ei_random<int>(0,m.cols()-1);
} while (i==j); // j is another one (must be different)
m.col(i) += d * m.col(j);
}