/*
 * =====================================================================================
 *
 *       Filename:  sparse_vector_test.cc
 *
 *    Description:  
 *
 *        Version:  1.0
 *        Created:  12/04/2007 08:20:52 PM EST
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:  Nikolaos Vasiloglou (NV), nvasil@ieee.org
 *        Company:  Georgia Tech Fastlab-ESP Lab
 *
 * =====================================================================================
 */
#include <limits>
#include <vector>
#include <map>
#include "fastlib/fastlib.h"
#include "u/nvasil/test/test.h"
#include "u/nvasil/sparse_matrix/sparse_vector.h"

class SparseVectorTest {
 public:
	SparseVectorTest() {
	}
	~SparseVectorTest() {
    Init();
    delete []ind1_;
    delete []val1_;		
	}
	void Init() {
    dim_  = 100;
	  ind1_	= new index_t[10];
		val1_ = new double[10];
		val2_.Init(5);
		dim_  = 40;
		for(index_t i=0; i<10; i++) {
		  ind1_[i] = 2*i+1;
			val1_[i] = 3*i+1;
		}
		
		for(index_t i=0; i<5; i++) {
		  ind2_.push_back(2*i+1);
			val2_[i] = 4*i+1;
		}
    v1_.Init(ind1_, val1_, 10, dim_);
    v2_.Init(ind2_, val2_, dim_);
	}
  
	void Destruct() {
	  v1_.Destruct();
		v2_.Destruct();
		delete []ind1_;
		delete []val1_;
		ind2_.clear();
		val2_.Destruct();
	}
  
	void TestInit1() {
	  Init();
		for(index_t i=0; i<10; i++) {
		  TEST_DOUBLE_APPROX(v1_.get(2*i+1), 
			  	               3*i+1,
				                 std::numeric_limits<double>::epsilon());
		}
		TEST_DOUBLE_APPROX(v1_.get(0), 0,  std::numeric_limits<double>::epsilon());
	  TEST_DOUBLE_APPROX(v1_.get(4), 0,  std::numeric_limits<double>::epsilon());
		TEST_DOUBLE_APPROX(v1_.get(24), 0,  std::numeric_limits<double>::epsilon());
     Destruct();
		 NONFATAL("TestInit1: success\n");
	}

	void TestInit2() {
		Init();
	  std::map<index_t, double> mp;
    for(index_t i=0; i<5; i++) {
		  mp[2*i+1]=4*i+1;
		}
    SparseVector v;
    v.Init(mp, dim_);
		for(index_t i=0; i<dim_; i++) {
		  TEST_DOUBLE_APPROX(v.get(i), v2_.get(i), std::numeric_limits<double>::epsilon());
		}
		Destruct();
		NONFATAL("TestInit2: success\n");
	}
  void TestCopyConstructor() {
		Init();
		v1_.Lock();
	  SparseVector v(v1_);
    for(index_t i=0; i<dim_; i++) {
		  TEST_DOUBLE_APPROX(v.get(i), v1_.get(i), std::numeric_limits<double>::epsilon());
	  }
		Destruct();
		NONFATAL("TestCopyConstructor: success\n");

	}
	void TestSet() {
		Init();
    for(index_t i=0; i<dim_; i++) {
		  v1_.set(i, i);
		}
		for(index_t i=0; i<dim_; i++) {
		  TEST_DOUBLE_APPROX(v1_.get(i), i, std::numeric_limits<double>::epsilon());
	  }
		Destruct();
  	NONFATAL("TestSet: success\n");
	}
	
	void TestAdd() {
		Init();
    SparseVector v;
    Sparsev::AddVectors(v1_, v2_, &v);
		double expected_result[dim_];
		memset(expected_result, 0, dim_*sizeof(double));
    for(index_t i=0; i<10; i++) {
		  expected_result[2*i+1]+= 3*i+1;
		}
    for(index_t i=0; i<5; i++) {
		  expected_result[2*i+1]+= 4*i+1;
		}
    for(index_t i=0; i<dim_; i++) {
 		  TEST_DOUBLE_APPROX(v.get(i), expected_result[i], 
					               std::numeric_limits<double>::epsilon());
		}
		Destruct();
  	NONFATAL("TestAdd: success\n");
	}
	
	void TestSubtract() {
	  Init();
		SparseVector v;
		Sparsev::SubtractVectors(v1_, v2_, &v);
    double expected_result[dim_];
		memset(expected_result, 0, dim_*sizeof(double));
    for(index_t i=0; i<10; i++) {
		  expected_result[2*i+1]+= 3*i+1;
		}
    for(index_t i=0; i<5; i++) {
		  expected_result[2*i+1]-= 4*i+1;
		}
    for(index_t i=0; i<dim_; i++) {
 		  TEST_DOUBLE_APPROX(v.get(i), expected_result[i], 
					               std::numeric_limits<double>::epsilon());
		}
		Destruct();
	  NONFATAL("TestSubtract: success\n")		;
	}
	
	void TestPointProduct() {
	  Init();
		SparseVector v;
		Sparsev::PointProductVectors(v1_, v2_, &v);
    double expected_result[dim_];
		memset(expected_result, 0, dim_*sizeof(double));
    for(index_t i=0; i<5; i++) {
		  expected_result[2*i+1]+= (3*i+1) * (4*i+1);
		}
    for(index_t i=0; i<dim_; i++) {
 		  TEST_DOUBLE_APPROX(v.get(i), expected_result[i], 
					               std::numeric_limits<double>::epsilon());
		}
		Destruct();
		NONFATAL("TestPointProduct: success\n");
	}
	
	void TestDotProduct() {
	  Init();
		double dot_prod;
		Sparsev::DotProductVectors(v1_, v2_, &dot_prod);
    double expected_result[dim_];
		memset(expected_result, 0, dim_*sizeof(double));
    for(index_t i=0; i<5; i++) {
		  expected_result[2*i+1]+= (3*i+1)*(4*i+1);
		}
		double expected_dot_prod=0;
    for(index_t i=0; i<dim_; i++) {
			expected_dot_prod+=expected_result[i];
 		}
    TEST_DOUBLE_APPROX(dot_prod, 
				               expected_dot_prod,
					             std::numeric_limits<double>::epsilon());
    Destruct();
		NONFATAL("TestDotProduct: success\n");
	}
	
	void TestDistance() {
	  Init();
		double dist;
		Sparsev::DistanceSqEuclideanVector(v1_, v2_, &dist);
    double expected_result[dim_];
		memset(expected_result, 0, dim_*sizeof(double));
    for(index_t i=0; i<10; i++) {
		  expected_result[2*i+1]+= 3*i+1;
		}
    for(index_t i=0; i<5; i++) {
		  expected_result[2*i+1]-= 4*i+1;
		}
		double distance=0;
    for(index_t i=0; i<dim_; i++) {
			distance += expected_result[i] * expected_result[i];
 		}
    TEST_DOUBLE_APPROX(distance, 
				               dist,
					             std::numeric_limits<double>::epsilon());
		Destruct();
		NONFATAL("TestDistance: success\n");
	}
	
	void TestAll() {
		TestInit1(); 
		TestInit2();
    TestCopyConstructor();
	  TestSet();
	  TestAdd();
	  TestSubtract();
	  TestPointProduct();
	  TestDotProduct();
	  TestDistance();
	}

 private:
  SparseVector            v1_;
	SparseVector            v2_;
	index_t              *ind1_;
	std::vector<index_t>  ind2_;
  double                *val1_;	
	Vector                 val2_;
	index_t                dim_;
};

int main() {
  SparseVectorTest test;
	test.TestAll();
}