aboutsummaryrefslogtreecommitdiffhomepage
path: root/doc/benchmarkX.cpp
diff options
context:
space:
mode:
authorGravatar Benoit Jacob <jacob.benoit.1@gmail.com>2008-01-05 10:57:14 +0000
committerGravatar Benoit Jacob <jacob.benoit.1@gmail.com>2008-01-05 10:57:14 +0000
commitd1d55e67e967a9bd0d447a7ea105ac2771cde557 (patch)
tree53e40f4b87664c47c67f0394bc617999ad64ecf3 /doc/benchmarkX.cpp
parent23ffede3d0d280962bad418a41957cf82e3fadc9 (diff)
- make MatrixBase and all expressions aware of their preferred traversal order.
Honor this preference in operator=. - add several methods to the API - rework API for diagonal matrices - add benchmarking code
Diffstat (limited to 'doc/benchmarkX.cpp')
-rw-r--r--doc/benchmarkX.cpp22
1 files changed, 22 insertions, 0 deletions
diff --git a/doc/benchmarkX.cpp b/doc/benchmarkX.cpp
new file mode 100644
index 000000000..1670341e9
--- /dev/null
+++ b/doc/benchmarkX.cpp
@@ -0,0 +1,22 @@
+// g++ -O3 -DNDEBUG benchmarkX.cpp -o benchmarkX && time ./benchmarkX
+
+#include <Eigen/Core>
+
+using namespace std;
+USING_PART_OF_NAMESPACE_EIGEN
+
+int main(int argc, char *argv[])
+{
+ MatrixXd I = MatrixXd::identity(20);
+ MatrixXd m(20,20);
+ for(int i = 0; i < 20; i++) for(int j = 0; j < 20; j++)
+ {
+ m(i,j) = 0.1 * (i+20*j);
+ }
+ for(int a = 0; a < 1000000; a++)
+ {
+ m = I + 0.00005 * (m + m*m);
+ }
+ cout << m << endl;
+ return 0;
+}