Graph_private.hpp

/*
 *  Copyright 2011, 2012 Lukas Jirkovsky
 *
 *  This file is part of FotoSHOCKcore.
 *
 *  FotoSHOCKcore 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, version 3 of the License.
 *
 *  FotoSHOCKcore 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
 *  GNU Lesser General Public License for more details.
 *
 *  You should have received a copy of the GNU Lesser General Public License
 *  along with FotoSHOCKcore.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef GRAPH_PRIVATE
#define GRAPH_PRIVATE

#include "ImageOperation.hpp"

#include <map>
#include <list>

namespace boost {
class thread;
}

namespace FotoSHOCKcore {

class GraphManager;
class GraphNode;

class Graph_private {
    friend class GraphManager;
    friend class GraphNode;

    public:
        ~Graph_private();

    protected:
        Graph_private();


        void recalculate(GraphNode* node);

        // TODO: doc
        void interruptRecalculate();


        bool tryEnable(GraphNode* node);


        void confirmOperation(GraphNode* node);

        boost::shared_ptr<UpdateInfo> addROI(GraphNode* node, UpdateInfo ROI);
        boost::shared_ptr<UpdateInfo> addROI(GraphNode* node, ROIinfo ROI);
        boost::shared_ptr<UpdateInfo> addROI(GraphNode* node, unsigned int x, unsigned int y, unsigned int sizeX, unsigned int sizeY, const int mipmapLevel = 0);


        vector<boost::shared_ptr<UpdateInfo> >::iterator deleteROI(boost::shared_ptr<UpdateInfo> ROI);
//    private:
        vector<GraphNode*> m_roots;
        unsigned int m_tileExtent;

        unsigned int m_nodeIDcounter;


        std::map<uint64_t, ImageOperationDescriptor*> m_registeredOperations;


        boost::thread* m_recalculateThread;

        double m_timingSheer;
        double m_timingCurvature;


        void recalculate_impl(GraphNode* node);


        // TODO: reenable
        void checkFormat(ImageOperationDescriptor* operation, vector<GraphNode*>& parents, vector<GraphNode*>&  children);


        void createCache(vector<GraphNode*>& parents, GraphNode* node, bool allocateTiles = true);


        void removeNode(vector<GraphNode*>& vect, GraphNode* node);


        void topologicalSort(GraphNode* node, std::list<GraphNode*>& sorted);
        void topologicalSort_impl(GraphNode* node, std::list<GraphNode*>& sorted);


        void updateParentsCache(GraphNode* node);


        void updateChildrenBuffer(GraphNode* node);

        void cleanupVisited(GraphNode* node);

        void addROI_impl(GraphNode* node, boost::shared_ptr<UpdateInfo> ROI);

        // addition of ROI is missed in case when the user doesn't specify parents
        // but it should never happen, because otherwise a new root would be created

        void insertROIForNodes(GraphNode* node, GraphNode* parent, GraphNode* child);

        void insertROIForNodes(GraphNode* node, vector<GraphNode*>& parents, GraphNode* child);

        void updateDistance(GraphNode* node);
        double computeTimeLimit(double a, double b, double distance);


        void cleanupCache();
        void cleanupCache_impl(GraphNode* node, float time);

        void invalidateChildrenStamp(GraphNode* node);


        void disableChildren(GraphNode* node, bool cleanBuffer);
};

}

#endif