/*
    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 "SimilarityFunction.h"

namespace smartcomparator
{
	namespace simfunctions
	{
		/**
		Odległość euklidesowa
		Źródło: Bartosz Broda, "Mechanizmy grupowania dokumentów w automatycznej ekstrakcji sieci semantycznych dla
		języka polskiego", str. 7
		*/
		class SMART_COMPARATOR_API EuclidianDist : public SimilarityFunction
		{
		public:
			EuclidianDist(Matrices::SuperMatrixPtr m);
			virtual ~EuclidianDist(void);

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

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

			double MinValue() const;
		};
	}
}
