/*
    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.
*/

#ifndef SMARTCOMPARATOR_RWFLINFILTEREDWEIGHT
#define SMARTCOMPARATOR_RWFLINFILTEREDWEIGHT
#include "../comparator_stdheaders.h"
#include "RWFLinWeight.h"

namespace smartcomparator
{
	namespace weights
	{
		class SMART_COMPARATOR_API RWFLinFilteredWeight : public RWFLinWeight
		{
		public:
			/**
			 * Rank weight based on MI. Works almost like RWFLinWeight.
			 * The difference is that additional filtering is performed based on min value for porb. estimation
			 *
			 * \param operatorIndices indices of columns of last occurances of operators.
			 * Includes firstoperator, so in matrix created with only one operator the vector
			 * will contain only matrix.NumberOfColumns().
			 * \param miFilter filtering of columns (like in Geffet and Dagan)
			*/
			RWFLinFilteredWeight(Matrices::SuperMatrixPtr m, RankBuilderPtr pRankBuilder, double treshold = 0);

			virtual ~RWFLinFilteredWeight();

		protected:
			virtual void DoWeight(size_t rowindex, Matrices::CompressedVector *v, std::set<size_t> &filteredIndices,
					std::multimap<double, size_t> &val_to_col_no );

			bool IsFiltered(size_t row_index, size_t column_index);



		};
	}//namespace weights

}//namespace smartcomparator

#endif //SMARTCOMPARATOR_RWFLINFILTEREDWEIGHT
