sequenzo 0.1.18__cp310-cp310-macosx_10_9_universal2.whl → 0.1.19__cp310-cp310-macosx_10_9_universal2.whl

sequenzo/dissimilarity_measures/src/eigen/blas/PackedTriangularSolverVector.h

@@ -1,88 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2012 Chen-Pang He <jdh8@ms63.hinet.net>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#ifndef EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H
-#define EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H
-
-namespace internal {
-
-template<typename LhsScalar, typename RhsScalar, typename Index, int Side, int Mode, bool Conjugate, int StorageOrder>
-struct packed_triangular_solve_vector;
-
-// forward and backward substitution, row-major, rhs is a vector
-template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate>
-struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, RowMajor>
-{
-  enum {
-    IsLower = (Mode&Lower)==Lower
-  };
-  static void run(Index size, const LhsScalar* lhs, RhsScalar* rhs)
-  {
-    internal::conj_if<Conjugate> cj;
-    typedef Map<const Matrix<LhsScalar,Dynamic,1> > LhsMap;
-    typedef typename conj_expr_if<Conjugate,LhsMap>::type ConjLhsType;
-
-    lhs += IsLower ? 0 : (size*(size+1)>>1)-1;
-    for(Index pi=0; pi<size; ++pi)
-    {
-      Index i = IsLower ? pi : size-pi-1;
-      Index s = IsLower ? 0 : 1;
-      if (pi>0)
-	rhs[i] -= (ConjLhsType(LhsMap(lhs+s,pi))
-	    .cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+(IsLower ? 0 : i+1),pi))).sum();
-      if (!(Mode & UnitDiag))
-	rhs[i] /= cj(lhs[IsLower ? i : 0]);
-      IsLower ? lhs += pi+1 : lhs -= pi+2;
-    }
-  }
-};
-
-// forward and backward substitution, column-major, rhs is a vector
-template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate>
-struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheLeft, Mode, Conjugate, ColMajor>
-{
-  enum {
-    IsLower = (Mode&Lower)==Lower
-  };
-  static void run(Index size, const LhsScalar* lhs, RhsScalar* rhs)
-  {
-    internal::conj_if<Conjugate> cj;
-    typedef Map<const Matrix<LhsScalar,Dynamic,1> > LhsMap;
-    typedef typename conj_expr_if<Conjugate,LhsMap>::type ConjLhsType;
-
-    lhs += IsLower ? 0 : size*(size-1)>>1;
-    for(Index pi=0; pi<size; ++pi)
-    {
-      Index i = IsLower ? pi : size-pi-1;
-      Index r = size - pi - 1;
-      if (!(Mode & UnitDiag))
-	rhs[i] /= cj(lhs[IsLower ? 0 : i]);
-      if (r>0)
-	Map<Matrix<RhsScalar,Dynamic,1> >(rhs+(IsLower? i+1 : 0),r) -=
-	    rhs[i] * ConjLhsType(LhsMap(lhs+(IsLower? 1 : 0),r));
-      IsLower ? lhs += size-pi : lhs -= r;
-    }
-  }
-};
-
-template<typename LhsScalar, typename RhsScalar, typename Index, int Mode, bool Conjugate, int StorageOrder>
-struct packed_triangular_solve_vector<LhsScalar, RhsScalar, Index, OnTheRight, Mode, Conjugate, StorageOrder>
-{
-  static void run(Index size, const LhsScalar* lhs, RhsScalar* rhs)
-  {
-    packed_triangular_solve_vector<LhsScalar,RhsScalar,Index,OnTheLeft,
-	((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
-	Conjugate,StorageOrder==RowMajor?ColMajor:RowMajor
-      >::run(size, lhs, rhs);
-  }
-};
-
-} // end namespace internal
-
-#endif // EIGEN_PACKED_TRIANGULAR_SOLVER_VECTOR_H

sequenzo/dissimilarity_measures/src/eigen/blas/Rank2Update.h

@@ -1,57 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2012 Chen-Pang He <jdh8@ms63.hinet.net>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#ifndef EIGEN_RANK2UPDATE_H
-#define EIGEN_RANK2UPDATE_H
-
-namespace internal {
-
-/* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu'
- * This is the low-level version of SelfadjointRank2Update.h
- */
-template<typename Scalar, typename Index, int UpLo>
-struct rank2_update_selector
-{
-  static void run(Index size, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
-  {
-    typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
-    for (Index i=0; i<size; ++i)
-    {
-      Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) +=
-      numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
-                + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
-    }
-  }
-};
-
-/* Optimized selfadjoint matrix += alpha * uv' + conj(alpha)*vu'
- * The matrix is in packed form.
- */
-template<typename Scalar, typename Index, int UpLo>
-struct packed_rank2_update_selector
-{
-  static void run(Index size, Scalar* mat, const Scalar* u, const Scalar* v, Scalar alpha)
-  {
-    typedef Map<const Matrix<Scalar,Dynamic,1> > OtherMap;
-    Index offset = 0;
-    for (Index i=0; i<size; ++i)
-    {
-      Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) +=
-      numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
-                + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
-      //FIXME This should be handled outside.
-      mat[offset+(UpLo==Lower ? 0 : i)] = numext::real(mat[offset+(UpLo==Lower ? 0 : i)]);
-      offset += UpLo==Lower ? size-i : (i+1);
-    }
-  }
-};
-
-} // end namespace internal
-
-#endif // EIGEN_RANK2UPDATE_H

sequenzo/dissimilarity_measures/src/eigen/blas/common.h

@@ -1,175 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2009-2015 Gael Guennebaud <gael.guennebaud@inria.fr>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#ifndef EIGEN_BLAS_COMMON_H
-#define EIGEN_BLAS_COMMON_H
-
-#ifdef __GNUC__
-# if __GNUC__<5
-// GCC < 5.0 does not like the global Scalar typedef
-// we just keep shadow-warnings disabled permanently
-#  define EIGEN_PERMANENTLY_DISABLE_STUPID_WARNINGS
-# endif
-#endif
-
-#include "../Eigen/Core"
-#include "../Eigen/Jacobi"
-
-#include <complex>
-
-#ifndef SCALAR
-#error the token SCALAR must be defined to compile this file
-#endif
-
-#include "../Eigen/src/misc/blas.h"
-
-#define NOTR    0
-#define TR      1
-#define ADJ     2
-
-#define LEFT    0
-#define RIGHT   1
-
-#define UP      0
-#define LO      1
-
-#define NUNIT   0
-#define UNIT    1
-
-#define INVALID 0xff
-
-#define OP(X)   (   ((X)=='N' || (X)=='n') ? NOTR   \
-                  : ((X)=='T' || (X)=='t') ? TR     \
-                  : ((X)=='C' || (X)=='c') ? ADJ    \
-                  : INVALID)
-
-#define SIDE(X) (   ((X)=='L' || (X)=='l') ? LEFT   \
-                  : ((X)=='R' || (X)=='r') ? RIGHT  \
-                  : INVALID)
-
-#define UPLO(X) (   ((X)=='U' || (X)=='u') ? UP     \
-                  : ((X)=='L' || (X)=='l') ? LO     \
-                  : INVALID)
-
-#define DIAG(X) (   ((X)=='N' || (X)=='n') ? NUNIT  \
-                  : ((X)=='U' || (X)=='u') ? UNIT   \
-                  : INVALID)
-
-
-inline bool check_op(const char* op)
-{
-  return OP(*op)!=0xff;
-}
-
-inline bool check_side(const char* side)
-{
-  return SIDE(*side)!=0xff;
-}
-
-inline bool check_uplo(const char* uplo)
-{
-  return UPLO(*uplo)!=0xff;
-}
-
-
-namespace Eigen {
-#include "BandTriangularSolver.h"
-#include "GeneralRank1Update.h"
-#include "PackedSelfadjointProduct.h"
-#include "PackedTriangularMatrixVector.h"
-#include "PackedTriangularSolverVector.h"
-#include "Rank2Update.h"
-}
-
-using namespace Eigen;
-
-typedef SCALAR Scalar;
-typedef NumTraits<Scalar>::Real RealScalar;
-typedef std::complex<RealScalar> Complex;
-
-enum
-{
-  IsComplex = Eigen::NumTraits<SCALAR>::IsComplex,
-  Conj = IsComplex
-};
-
-typedef Matrix<Scalar,Dynamic,Dynamic,ColMajor> PlainMatrixType;
-typedef Map<Matrix<Scalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > MatrixType;
-typedef Map<const Matrix<Scalar,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> > ConstMatrixType;
-typedef Map<Matrix<Scalar,Dynamic,1>, 0, InnerStride<Dynamic> > StridedVectorType;
-typedef Map<Matrix<Scalar,Dynamic,1> > CompactVectorType;
-
-template<typename T>
-Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >
-matrix(T* data, int rows, int cols, int stride)
-{
-  return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
-}
-
-template<typename T>
-Map<const Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >
-matrix(const T* data, int rows, int cols, int stride)
-{
-  return Map<const Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
-}
-
-template<typename T>
-Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> > make_vector(T* data, int size, int incr)
-{
-  return Map<Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> >(data, size, InnerStride<Dynamic>(incr));
-}
-
-template<typename T>
-Map<const Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> > make_vector(const T* data, int size, int incr)
-{
-  return Map<const Matrix<T,Dynamic,1>, 0, InnerStride<Dynamic> >(data, size, InnerStride<Dynamic>(incr));
-}
-
-template<typename T>
-Map<Matrix<T,Dynamic,1> > make_vector(T* data, int size)
-{
-  return Map<Matrix<T,Dynamic,1> >(data, size);
-}
-
-template<typename T>
-Map<const Matrix<T,Dynamic,1> > make_vector(const T* data, int size)
-{
-  return Map<const Matrix<T,Dynamic,1> >(data, size);
-}
-
-template<typename T>
-T* get_compact_vector(T* x, int n, int incx)
-{
-  if(incx==1)
-    return x;
-
-  typename Eigen::internal::remove_const<T>::type* ret = new Scalar[n];
-  if(incx<0) make_vector(ret,n) = make_vector(x,n,-incx).reverse();
-  else       make_vector(ret,n) = make_vector(x,n, incx);
-  return ret;
-}
-
-template<typename T>
-T* copy_back(T* x_cpy, T* x, int n, int incx)
-{
-  if(x_cpy==x)
-    return 0;
-
-  if(incx<0) make_vector(x,n,-incx).reverse() = make_vector(x_cpy,n);
-  else       make_vector(x,n, incx)           = make_vector(x_cpy,n);
-  return x_cpy;
-}
-
-#ifndef EIGEN_BLAS_FUNC_SUFFIX
-#define EIGEN_BLAS_FUNC_SUFFIX _
-#endif
-
-#define EIGEN_BLAS_FUNC(X) EIGEN_CAT(SCALAR_SUFFIX, EIGEN_CAT(X, EIGEN_BLAS_FUNC_SUFFIX))
-
-#endif // EIGEN_BLAS_COMMON_H

sequenzo/dissimilarity_measures/src/eigen/blas/f2c/datatypes.h

@@ -1,24 +0,0 @@
-/* This contains a limited subset of the typedefs exposed by f2c
-   for use by the Eigen BLAS C-only implementation.
-*/
-
-#ifndef __EIGEN_DATATYPES_H__
-#define __EIGEN_DATATYPES_H__
-
-typedef int integer;
-typedef unsigned int uinteger;
-typedef float real;
-typedef double doublereal;
-typedef struct { real r, i; } complex;
-typedef struct { doublereal r, i; } doublecomplex;
-typedef int ftnlen;
-typedef int logical;
-
-#define abs(x) ((x) >= 0 ? (x) : -(x))
-#define dabs(x) (doublereal)abs(x)
-#define min(a,b) ((a) <= (b) ? (a) : (b))
-#define max(a,b) ((a) >= (b) ? (a) : (b))
-#define dmin(a,b) (doublereal)min(a,b)
-#define dmax(a,b) (doublereal)max(a,b)
-
-#endif

sequenzo/dissimilarity_measures/src/eigen/blas/level1_cplx_impl.h

@@ -1,155 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2009-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#include "common.h"
-
-struct scalar_norm1_op {
-  typedef RealScalar result_type;
-  EIGEN_EMPTY_STRUCT_CTOR(scalar_norm1_op)
-  inline RealScalar operator() (const Scalar& a) const { return numext::norm1(a); }
-};
-namespace Eigen {
-  namespace internal {
-    template<> struct functor_traits<scalar_norm1_op >
-    {
-      enum { Cost = 3 * NumTraits<Scalar>::AddCost, PacketAccess = 0 };
-    };
-  }
-}
-
-// computes the sum of magnitudes of all vector elements or, for a complex vector x, the sum
-// res = |Rex1| + |Imx1| + |Rex2| + |Imx2| + ... + |Rexn| + |Imxn|, where x is a vector of order n
-RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC(asum))(int *n, RealScalar *px, int *incx)
-{
-//   std::cerr << "__asum " << *n << " " << *incx << "\n";
-  Complex* x = reinterpret_cast<Complex*>(px);
-
-  if(*n<=0) return 0;
-
-  if(*incx==1)  return make_vector(x,*n).unaryExpr<scalar_norm1_op>().sum();
-  else          return make_vector(x,*n,std::abs(*incx)).unaryExpr<scalar_norm1_op>().sum();
-}
-
-int EIGEN_CAT(i, EIGEN_BLAS_FUNC(amax))(int *n, RealScalar *px, int *incx)
-{
-  if(*n<=0) return 0;
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-
-  DenseIndex ret;
-  if(*incx==1)  make_vector(x,*n).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
-  else          make_vector(x,*n,std::abs(*incx)).unaryExpr<scalar_norm1_op>().maxCoeff(&ret);
-  return int(ret)+1;
-}
-
-int EIGEN_CAT(i, EIGEN_BLAS_FUNC(amin))(int *n, RealScalar *px, int *incx)
-{
-  if(*n<=0) return 0;
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-
-  DenseIndex ret;
-  if(*incx==1)  make_vector(x,*n).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
-  else          make_vector(x,*n,std::abs(*incx)).unaryExpr<scalar_norm1_op>().minCoeff(&ret);
-  return int(ret)+1;
-}
-
-// computes a dot product of a conjugated vector with another vector.
-int EIGEN_BLAS_FUNC(dotcw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar* pres)
-{
-//   std::cerr << "_dotc " << *n << " " << *incx << " " << *incy << "\n";
-  Scalar* res = reinterpret_cast<Scalar*>(pres);
-
-  if(*n<=0)
-  {
-    *res = Scalar(0);
-    return 0;
-  }
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-
-  if(*incx==1 && *incy==1)    *res = (make_vector(x,*n).dot(make_vector(y,*n)));
-  else if(*incx>0 && *incy>0) *res = (make_vector(x,*n,*incx).dot(make_vector(y,*n,*incy)));
-  else if(*incx<0 && *incy>0) *res = (make_vector(x,*n,-*incx).reverse().dot(make_vector(y,*n,*incy)));
-  else if(*incx>0 && *incy<0) *res = (make_vector(x,*n,*incx).dot(make_vector(y,*n,-*incy).reverse()));
-  else if(*incx<0 && *incy<0) *res = (make_vector(x,*n,-*incx).reverse().dot(make_vector(y,*n,-*incy).reverse()));
-  return 0;
-}
-
-// computes a vector-vector dot product without complex conjugation.
-int EIGEN_BLAS_FUNC(dotuw)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar* pres)
-{
-  Scalar* res = reinterpret_cast<Scalar*>(pres);
-
-  if(*n<=0)
-  {
-    *res = Scalar(0);
-    return 0;
-  }
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-
-  if(*incx==1 && *incy==1)    *res = (make_vector(x,*n).cwiseProduct(make_vector(y,*n))).sum();
-  else if(*incx>0 && *incy>0) *res = (make_vector(x,*n,*incx).cwiseProduct(make_vector(y,*n,*incy))).sum();
-  else if(*incx<0 && *incy>0) *res = (make_vector(x,*n,-*incx).reverse().cwiseProduct(make_vector(y,*n,*incy))).sum();
-  else if(*incx>0 && *incy<0) *res = (make_vector(x,*n,*incx).cwiseProduct(make_vector(y,*n,-*incy).reverse())).sum();
-  else if(*incx<0 && *incy<0) *res = (make_vector(x,*n,-*incx).reverse().cwiseProduct(make_vector(y,*n,-*incy).reverse())).sum();
-  return 0;
-}
-
-RealScalar EIGEN_CAT(REAL_SCALAR_SUFFIX, EIGEN_BLAS_FUNC(nrm2))(int *n, RealScalar *px, int *incx)
-{
-//   std::cerr << "__nrm2 " << *n << " " << *incx << "\n";
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-
-  if(*incx==1)
-    return make_vector(x,*n).stableNorm();
-
-  return make_vector(x,*n,*incx).stableNorm();
-}
-
-int EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, rot))(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy, RealScalar *pc, RealScalar *ps)
-{
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-  RealScalar c = *pc;
-  RealScalar s = *ps;
-
-  StridedVectorType vx(make_vector(x,*n,std::abs(*incx)));
-  StridedVectorType vy(make_vector(y,*n,std::abs(*incy)));
-
-  Reverse<StridedVectorType> rvx(vx);
-  Reverse<StridedVectorType> rvy(vy);
-
-  // TODO implement mixed real-scalar rotations
-       if(*incx<0 && *incy>0) internal::apply_rotation_in_the_plane(rvx, vy, JacobiRotation<Scalar>(c,s));
-  else if(*incx>0 && *incy<0) internal::apply_rotation_in_the_plane(vx, rvy, JacobiRotation<Scalar>(c,s));
-  else                        internal::apply_rotation_in_the_plane(vx, vy,  JacobiRotation<Scalar>(c,s));
-
-  return 0;
-}
-
-int EIGEN_BLAS_FUNC(EIGEN_CAT(REAL_SCALAR_SUFFIX, scal))(int *n, RealScalar *palpha, RealScalar *px, int *incx)
-{
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  RealScalar alpha = *palpha;
-
-//   std::cerr << "__scal " << *n << " " << alpha << " " << *incx << "\n";
-
-  if(*incx==1)  make_vector(x,*n) *= alpha;
-  else          make_vector(x,*n,std::abs(*incx)) *= alpha;
-
-  return 0;
-}

sequenzo/dissimilarity_measures/src/eigen/blas/level1_impl.h

@@ -1,144 +0,0 @@
-// This file is part of Eigen, a lightweight C++ template library
-// for linear algebra.
-//
-// Copyright (C) 2009-2010 Gael Guennebaud <gael.guennebaud@inria.fr>
-//
-// This Source Code Form is subject to the terms of the Mozilla
-// Public License v. 2.0. If a copy of the MPL was not distributed
-// with this file, You can obtain one at http://mozilla.org/MPL/2.0/.
-
-#include "common.h"
-
-int EIGEN_BLAS_FUNC(axpy)(const int *n, const RealScalar *palpha, const RealScalar *px, const int *incx, RealScalar *py, const int *incy)
-{
-  const Scalar* x = reinterpret_cast<const Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-  Scalar alpha  = *reinterpret_cast<const Scalar*>(palpha);
-
-  if(*n<=0) return 0;
-
-  if(*incx==1 && *incy==1)    make_vector(y,*n) += alpha * make_vector(x,*n);
-  else if(*incx>0 && *incy>0) make_vector(y,*n,*incy) += alpha * make_vector(x,*n,*incx);
-  else if(*incx>0 && *incy<0) make_vector(y,*n,-*incy).reverse() += alpha * make_vector(x,*n,*incx);
-  else if(*incx<0 && *incy>0) make_vector(y,*n,*incy) += alpha * make_vector(x,*n,-*incx).reverse();
-  else if(*incx<0 && *incy<0) make_vector(y,*n,-*incy).reverse() += alpha * make_vector(x,*n,-*incx).reverse();
-
-  return 0;
-}
-
-int EIGEN_BLAS_FUNC(copy)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy)
-{
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-
-  // be careful, *incx==0 is allowed !!
-  if(*incx==1 && *incy==1)
-    make_vector(y,*n) = make_vector(x,*n);
-  else
-  {
-    if(*incx<0) x = x - (*n-1)*(*incx);
-    if(*incy<0) y = y - (*n-1)*(*incy);
-    for(int i=0;i<*n;++i)
-    {
-      *y = *x;
-      x += *incx;
-      y += *incy;
-    }
-  }
-
-  return 0;
-}
-
-int EIGEN_BLAS_FUNC(rotg)(RealScalar *pa, RealScalar *pb, RealScalar *pc, RealScalar *ps)
-{
-  using std::sqrt;
-  using std::abs;
-
-  Scalar& a = *reinterpret_cast<Scalar*>(pa);
-  Scalar& b = *reinterpret_cast<Scalar*>(pb);
-  RealScalar* c = pc;
-  Scalar* s = reinterpret_cast<Scalar*>(ps);
-
-  #if !ISCOMPLEX
-  Scalar r,z;
-  Scalar aa = abs(a);
-  Scalar ab = abs(b);
-  if((aa+ab)==Scalar(0))
-  {
-    *c = 1;
-    *s = 0;
-    r = 0;
-    z = 0;
-  }
-  else
-  {
-    r = sqrt(a*a + b*b);
-    Scalar amax = aa>ab ? a : b;
-    r = amax>0 ? r : -r;
-    *c = a/r;
-    *s = b/r;
-    z = 1;
-    if (aa > ab) z = *s;
-    if (ab > aa && *c!=RealScalar(0))
-      z = Scalar(1)/ *c;
-  }
-  *pa = r;
-  *pb = z;
-  #else
-  Scalar alpha;
-  RealScalar norm,scale;
-  if(abs(a)==RealScalar(0))
-  {
-    *c = RealScalar(0);
-    *s = Scalar(1);
-    a = b;
-  }
-  else
-  {
-    scale = abs(a) + abs(b);
-    norm = scale*sqrt((numext::abs2(a/scale)) + (numext::abs2(b/scale)));
-    alpha = a/abs(a);
-    *c = abs(a)/norm;
-    *s = alpha*numext::conj(b)/norm;
-    a = alpha*norm;
-  }
-  #endif
-
-//   JacobiRotation<Scalar> r;
-//   r.makeGivens(a,b);
-//   *c = r.c();
-//   *s = r.s();
-
-  return 0;
-}
-
-int EIGEN_BLAS_FUNC(scal)(int *n, RealScalar *palpha, RealScalar *px, int *incx)
-{
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar alpha = *reinterpret_cast<Scalar*>(palpha);
-
-  if(*incx==1)  make_vector(x,*n) *= alpha;
-  else          make_vector(x,*n,std::abs(*incx)) *= alpha;
-
-  return 0;
-}
-
-int EIGEN_BLAS_FUNC(swap)(int *n, RealScalar *px, int *incx, RealScalar *py, int *incy)
-{
-  if(*n<=0) return 0;
-
-  Scalar* x = reinterpret_cast<Scalar*>(px);
-  Scalar* y = reinterpret_cast<Scalar*>(py);
-
-  if(*incx==1 && *incy==1)    make_vector(y,*n).swap(make_vector(x,*n));
-  else if(*incx>0 && *incy>0) make_vector(y,*n,*incy).swap(make_vector(x,*n,*incx));
-  else if(*incx>0 && *incy<0) make_vector(y,*n,-*incy).reverse().swap(make_vector(x,*n,*incx));
-  else if(*incx<0 && *incy>0) make_vector(y,*n,*incy).swap(make_vector(x,*n,-*incx).reverse());
-  else if(*incx<0 && *incy<0) make_vector(y,*n,-*incy).reverse().swap(make_vector(x,*n,-*incx).reverse());
-
-  return 1;
-}