/*
    Copyright (C) 2012 Bartosz Broda, Jacek Bochenek, Łukasz Biłeńkij, 
    Damian Jaworski, Wojciech Mazur, Dominik Piasecki, Maciej Piasecki, 
    Radosław Ramocki
    
    This program is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at your option)
any later version.

    This program is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. 

    See the LICENSE and COPYING files for more details.
*/

#pragma once
#include "../comparator_stdheaders.h"
#include "LocalSimilarityFunction.h"


namespace smartcomparator
{
	namespace simfunctions
	{
		/**
		Przeskalowany kosinus do wartosci [0,1]  (1+cos) /2
		*/
		class SMART_COMPARATOR_API LocalCosineSimilarity : public LocalSimilarityFunction 
		{
		public:
			LocalCosineSimilarity(bool isNormalized, bool doFilter, double percentInter = 0.1, size_t minInter = 2);
			virtual ~LocalCosineSimilarity(void);


			virtual double CountSimilarity(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2,
				std::set<size_t> &v1Ind, std::set<size_t> &v2Ind);

			virtual double CountSimilarity(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2);

		private:
			double m_dPrecentIntersec;
			size_t m_stMinIntersec;

			bool m_bIsNormalized;
			bool m_bDoFilter;


			double CountFilteredSimilarity(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2,
				const std::set<size_t> &v1Ind, const std::set<size_t> &v2Ind);
			double CountSimilarityWithoutFilter(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2,
				const std::set<size_t> &v1Ind, const std::set<size_t> &v2Ind);

			double CountFilteredSimilarity(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2);
			double CountSimilarityWithoutFilter(Matrices::CompressedVector& v1, Matrices::CompressedVector& v2);

		};
	}
}
