4 Commits

Author	SHA1	Message	Date
Benoit Jacob	d1a29d6319	-new: recursive costs system, useful to determine automatically ... when to evaluate arguments and when to meta-unroll. -use it in Product to determine when to eval args. not yet used to determine when to unroll. for now, not used anywhere else but that'll follow. -fix badness of my last commit	2008-04-03 11:10:17 +00:00
Benoit Jacob	cff5e3ce9c	Make use of the LazyBit, introduce .lazy(), remove lazyProduct.	2008-03-31 16:20:06 +00:00
Benoit Jacob	f279162ec4	* introducte recursive Flags system for the expressions ... -- currently 3 flags: RowMajor, Lazy and Large -- only RowMajor actually used for now * many minor improvements	2008-03-30 18:43:22 +00:00
Gael Guennebaud	612350e3f8	* Added a generic *redux* mini framework allowing custom redux operations ... as well as partial redux (vertical or horizontal redux). Includes shortcuts for: sum, minCoeff and maxCoeff. There is no shortcut for the partial redux. * Added a generic *visitor* mini framework. A visitor is a custom object sequentially applied on each coefficient with knowledge of its value and coordinates. It is currentlly used to implement minCoeff(int*,int*) and maxCoeff(int*,int*). findBiggestCoeff is now a shortcut for "this->cwiseAbs().maxCoeff(i,j)" * Added coeff-wise min and max. * fixed an issue with ei_pow(int,int) and gcc < 4.3 or ICC	2008-03-16 14:36:25 +00:00