/*
 *  CERT_Task.h
 *
 *  Copyright (c) 2008 Machine Perception Laboratory
 *  University of California San Diego.
 *
 *	Authors: Andrew Salamon
 *
 * Please read the disclaimer and notes about redistribution
 * at the end of this file.
 *
 */

#ifndef __CERT_TASK_H__
#define __CERT_TASK_H__

#include "rimage.h"

#include <string>
#include <map>
#include <vector>


namespace CERT
{
    class Task
    {
    public:
        static int getNextFrameNum();
        static void resetNextFrameNum( int _frame = 0 );

    public:
        int order;
        RImage<float> rimage;
        std::string path;
        std::string error;
        bool didFindFace;

    public:
        Task() : order(-1), didFindFace(false) { }

        void setNextFrameNum();

        void addResultsForPlugin( const std::string &pluginID, const std::vector<double> &res );
        std::vector<double>  resultsForPlugin( const std::string &pluginID );

        void addResultsForPluginAndLabel( const std::string &pluginID, const std::string &label, const std::vector<double> &res );
        std::vector<double>  resultsForPluginAndLabel( const std::string &pluginID, const std::string &label );

        void clear(); ///< Clear everything

        // Will need a member to store results, probably something like
        typedef std::map< std::string, std::vector<double> > ResultsMap;
        ResultsMap results;
        std::map< std::string, ResultsMap > resultsWithLabels;

        // This should be good enough for everything except feature plugins that have more than one label (e.g. feature improver), not sure what to do about that. One (ugly) possibility is to have the key be pluginID<separator>label.

    public:
        class compare
        {
            public:
            bool operator()( const Task &lhs, const Task &rhs )
            {
                return lhs.order > rhs.order;
            }
        };
    };
}

#endif // __CERT_TASK_H__
/*
 *
 * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
 *
 *    1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
 *    2. 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.
 *    3. The name of the author may not be used to endorse or promote products derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
 *
 */