/*****************************************************************************

Copyright (c) 2005, Uwe Schmitt (http://www.procoders.net)
All rights reserved.

Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

    * Redistributions of source code must retain the above copyright notice,
      this list of conditions and the following disclaimer.

    * Redistributions in binary form must reproduce the above copyright notice,
      this list of conditions and the following disclaimer in the documentation
      and/or other materials provided with the distribution.

    * Neither the name of procoders.net nor the names of its contributors may
      be used to endorse or promote products derived from this software without
      specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

******************************************************************************/

#ifndef __PCSVM_PROBLEM__
#define __PCSVM_PROBLEM__

#include <vector>
#include <iostream>
#include <sstream>
#include <exception>
#include "Vector.hpp"

namespace pcsvm {

using namespace pcsvm;



template <class Storage, class LabelT>
class Example
{
        public:
                Example(const SparseVector &vec, LabelT lab): vector(vec), label(lab) {};
                Example(const Vector &vec, LabelT lab): vector(vec), label(lab) {};
                // Example(): vector(), label() {};


                std::string to_str() const;
                VectorBase<Storage> vector;
                LabelT  label;
      
};

template <class Storage, class LabelT>
class Problem 
{
        public:

    // folgendes keine memberfunction, da msvc7 mit geschachtelten klassen  nicht immer
    // zurechtkommt... doof....


    

                typedef std::vector<Example<Storage, LabelT> > ExampleVector;
                typedef typename std::vector<Example<Storage, LabelT> >::iterator iterator;
                typedef typename std::vector<Example<Storage, LabelT> >::const_iterator const_iterator;

                Problem(unsigned int reserve=1000): _exVec() { _exVec.reserve(reserve >= 100 ? reserve: 100);  } 

                // Adapter-Methoden
                
                inline const Example<Storage, LabelT>& operator[](int idx) const { return _exVec[idx]; }
                inline       Example<Storage, LabelT>& operator[](int idx)       { return _exVec[idx]; }

                inline const Example<Storage, LabelT>& at(int idx) const { return _exVec.at(idx); }
                inline       Example<Storage, LabelT>& at(int idx)       { return _exVec.at(idx); }

                inline typename ExampleVector::iterator       begin()       { return _exVec.begin(); }
                inline typename ExampleVector::const_iterator begin() const { return _exVec.begin(); }

                inline typename ExampleVector::iterator       end()       { return _exVec.end(); }
                inline typename ExampleVector::const_iterator end() const { return _exVec.end(); }

                // inline void push_back(const Example& ex) { _exVec.push_back(ex); }
                inline void push_back(const VectorBase<Storage>& ex, const LabelT &label) { _exVec.push_back(Example<Storage, LabelT>(ex,label)); }

                inline bool empty() const   { return _exVec.empty(); }
                inline void clear() { _exVec.clear(); }
                inline std::size_t  size() const { return _exVec.size(); }

                inline void reserve(unsigned int l) { _exVec.reserve(l); }

                inline void swap(int i, int j) { Example<Storage, LabelT> tmp = _exVec[i]; _exVec[i]=_exVec[j]; _exVec[j]=tmp; }

                // Klassenspezielle Mathoden
                
                //operator const char*() const;
                std::string to_str() const;
                void normalize();

                // get and put for mapping via python !
                inline void put(unsigned int idx, Example<Storage, LabelT> ex) { _exVec.at(idx)=ex; }
                inline Example<Storage, LabelT> get(unsigned int idx)  { return _exVec.at(idx); }

        private:
                ExampleVector _exVec;
                
};


template <class Storage, class LabelT>
std::string Problem<Storage,LabelT>::to_str() const
{
        std::ostringstream res;

        res << "<Problem: Labeltype=" << typeid(LabelT).name();
        res << ", size=" << size();
        res << ">";
        return res.str(); //.c_str();
}

template <class Storage,class LabelT>
void Problem<Storage,LabelT>::normalize()
{
        int maxidx=-1;
        int _len;
        iterator it;
        typename VectorBase<Storage>::const_item_iterator iit;

        for (it=begin(); it!=end(); ++it)
        {
                _len = it->vector.lastIndex();
                if (_len>maxidx) maxidx=_len;
        }

        std::vector<float> maxvec(maxidx+1);
        VectorBase<Storage>            * _svp;
        float              _val;
        unsigned int       _idx;

        // vector-weise fuer jede koordinate das absolute maximum bestimmen
        for (it=begin(); it!=end(); ++it)
        {
                _svp = &(it->vector);

                for (iit=_svp->begin(); iit!=_svp->end(); ++iit)
                {
                        _idx = iit->index;
                        _val = std::fabs(iit->value);
                        if (_val>maxvec[_idx]) maxvec[_idx] = _val;
                }
        }

        // fuer jedes example ueber jede koordinate des example-vektors
        // normieren
        float _scal;
        for (it=begin(); it!=end(); ++it)
        {
                _svp = &(it->vector);

                for (iit=_svp->begin(); iit!=_svp->end(); ++iit)
                {
                        _idx = iit->index;
                        _scal= maxvec[_idx];
                        // _scal == 0 dürfte wegen struktur von sparsevector eigentlich nicht passieren 
                        if (_scal) iit->value /= maxvec[_idx]; 
                }
        }


}

template<class S, class T>
std::string Example<S,T>::to_str() const
{
        std::ostringstream res;

        res << "<Example: ";
        res << vector << " -> " << label;
        res << ">";
        return res.str(); // ._cstr();
}

        



template<class Storage, class T>
std::ostream & operator<<(std::ostream & os, const Example<Storage, T> & ex)
{
    os << ex.to_str();
    return os;
}


template<class Storage, class T>
std::ostream & operator<<(std::ostream & os, const  Problem<Storage,T> & ex)
{
    os << ex.to_str();
    return os;
}


typedef Example<FullPolicy,bool>  ClassificationExample;
typedef Example<FullPolicy,float> RegressionExample;
typedef Problem<FullPolicy,bool>  ClassificationProblem;
typedef Problem<FullPolicy,float> RegressionProblem;

typedef Example<SparsePolicy,bool>  SparseClassificationExample;
typedef Example<SparsePolicy,float> SparseRegressionExample;
typedef Problem<SparsePolicy,bool>  SparseClassificationProblem;
typedef Problem<SparsePolicy,float> SparseRegressionProblem;

}

#endif