Optimizing performance and updating Array class

common/FunctionTable.h

@@ -2,7 +2,7 @@
 #define included_FunctionTable
 
 
-#include "common/Array.h"
+#include "common/ArraySize.h"
 
 #include <functional>
 
@@ -65,17 +65,43 @@ public:
      * @param[out] c            The output array
      */
     template<class TYPE, class FUN>
-    static void multiply(
+    static inline void multiply(
         const Array<TYPE, FUN> &a, const Array<TYPE, FUN> &b, Array<TYPE, FUN> &c );
 
+    /*!
+     * Perform dgemv/dgemm equavalent operation ( C = alpha*A*B + beta*C )
+     * @param[in] alpha         The scalar value alpha
+     * @param[in] A             The first array
+     * @param[in] B             The second array
+     * @param[in] beta          The scalar value alpha
+     * @param[in,out] c         The output array C
+     */
+    template<class TYPE, class FUN>
+    static void gemm( const TYPE alpha, const Array<TYPE, FUN> &A, const Array<TYPE, FUN> &B,
+        const TYPE beta, Array<TYPE, FUN> &C );
+
+    /*!
+     * Perform axpy equavalent operation ( y = alpha*x + y )
+     * @param[in] alpha         The scalar value alpha
+     * @param[in] x             The input array x
+     * @param[in,out] y         The output array y
+     */
+    template<class TYPE, class FUN>
+    static void axpy( const TYPE alpha, const Array<TYPE, FUN> &x, Array<TYPE, FUN> &y );
+
+    /*!
+     * Check if two arrays are approximately equal
+     * @param[in] A             The first array
+     * @param[in] B             The second array
+     * @param[in] tol           The tolerance
+     */
+    template<class TYPE, class FUN>
+    static bool equals( const Array<TYPE, FUN> &A, const Array<TYPE, FUN> &B, TYPE tol );
+
 
 private:
     FunctionTable();
-
-    template<class T>
-    static inline void rand( size_t N, T *x );
 };
 
-#include "common/FunctionTable.hpp"
 
 #endif