//***************************************************************************
//* Copyright (c) 2015 Saint Petersburg State University
//* Copyright (c) 2011-2014 Saint Petersburg Academic University
//* All Rights Reserved
//* See file LICENSE for details.
//***************************************************************************

/*
 * coverage.hpp
 *
 *  Created on: Jun 21, 2011
 *      Author: sergey
 */

#pragma once

#include "logger/logger.hpp"
#include <iostream>
#include <vector>
#include <algorithm>
#include "../xmath.h"
namespace omnigraph {

using std::vector;
//todo save/load absolute coverage
template<class Graph>
class CoverageIndex : public GraphActionHandler<Graph> {
    typedef typename Graph::VertexId VertexId;
    typedef typename Graph::EdgeId EdgeId;
    //typedef unordered_map<EdgeId, int> map_type;

    Graph& g_;
//	map_type storage_;

//    size_t KPlusOneMerCoverage(EdgeId edge) const {
//        return (size_t) math::round(coverage(edge) * (double) this->g().length(edge));
//    }

//    template<class ReadThreader>
//    Path<EdgeId> ProcessSequence(const ReadThreader& threader,
//                                 const Sequence& sequence) const {
//        return threader.MapSequence(sequence);
//    }

//    void AddPathsToGraph(const Path<EdgeId>& path) {
//
//        if (path.sequence().size() == 0)
//            return;
//
//        const vector<EdgeId>& edges_list = path.sequence();
//
//        for (auto it = edges_list.cbegin(); it != edges_list.cend(); ++it) {
//            IncCoverage(*it, this->g().length(*it));
//        }
//        IncCoverage(edges_list[0], -int(path.start_pos()));
//        EdgeId last = edges_list[edges_list.size() - 1];
//        IncCoverage(last, int(path.end_pos()) - int(this->g().length(last)));
//    }

//    void IncCoverageInMap(EdgeId edge, int toAdd, map_type& map) {
//        //VERIFY(toAdd >= 0);
//        map[edge] += toAdd;
//        VERIFY(map[edge] >= 0);
//    }
//
//    void AddPathsToMap(const Path<EdgeId>& path, map_type& map) {
//
//        if (path.sequence().size() == 0)
//            return;
//
//        const vector<EdgeId>& edges_list = path.sequence();
//
//        for (auto it = edges_list.cbegin(); it != edges_list.cend(); ++it) {
//            IncCoverageInMap(*it, this->g().length(*it), map);
//        }
//        IncCoverageInMap(edges_list[0], -int(path.start_pos()), map);
//        EdgeId last = edges_list[edges_list.size() - 1];
//        IncCoverageInMap(last,
//                         int(path.end_pos()) - int(this->g().length(last)),
//                         map);
//    }

 public:
    CoverageIndex(Graph &g)
            : GraphActionHandler<Graph>(g, "CoverageIndex"), g_(g) {
    }

    virtual ~CoverageIndex() {
    }

    /**
     * In NON averaged units
     */
    void SetRawCoverage(EdgeId e, unsigned cov) {
        g_.data(e).set_raw_coverage(cov);
    }

    void IncRawCoverage(EdgeId e, unsigned count) {
        g_.data(e).inc_raw_coverage((int)count);
    }

    void SetAvgCoverage(EdgeId e, double cov) {
        g_.data(e).set_raw_coverage((int) math::round(cov * (double) this->g().length(e)));
    }

    /**
     * Returns average coverage of the edge
     */
    double coverage(EdgeId edge) const {
        return (double) RawCoverage(edge) / (double) this->g().length(edge);
    }

    unsigned RawCoverage(EdgeId edge) const {
        return g_.data(edge).raw_coverage();
    }
//    /**
//     * Returns average coverage of the edge
//     */
//    double operator[](EdgeId e) const {
//        return coverage(e);
//    }

//    /**
//     * Method increases coverage value
//     */
//    void IncCoverage(EdgeId edge, int to_add) {
//        edge->IncCoverage(to_add);
//        VERIFY(edge->GetRawCoverage() >= 0);
//    }
//
//    /**
//     * Method increases coverage value by 1
//     */
//    void IncCoverage(EdgeId edge) {
//        IncCoverage(edge, 1);
//    }

//    template<class ReadThreader, class Read>
//    void Fill(io::IReader<Read>& stream, const ReadThreader& threader) {
//
//        INFO("Processing reads (takes a while)");
//        size_t counter = 0;
//        stream.reset();
//
//        while (!stream.eof()) {
//            Read r;
//            stream >> r;
//            Path<EdgeId> path = ProcessSequence(threader, r.sequence());
//            AddPathsToGraph(path);
//
//            VERBOSE_POWER(++counter, " reads processed");
//        }
//
//        INFO("DeBruijn graph coverage counted, reads used: " << counter);
//    }
//
//    template<class ReadThreader, class Read>
//    void FillParallel(io::ReadStreamVector<io::IReader<Read> >& streams,
//                           const ReadThreader& threader, size_t buffer_size) {
//
//        INFO("Processing reads (takes a while)");
//        perf_counter pc;
//        size_t counter = 0;
//
//        size_t nthreads = streams.size();
//        size_t buf_size = buffer_size
//                / (nthreads * (sizeof(Path<EdgeId> ) + 32));
//
//#pragma omp parallel num_threads(nthreads)
//        {
//#pragma omp for reduction(+ : counter)
//            for (size_t i = 0; i < nthreads; ++i) {
//
//                Read r;
//                io::IReader<Read>& stream = streams[i];
//                stream.reset();
//                std::vector<Path<EdgeId> > buffer(buf_size);
//
//                size_t j = 0;
//                while (!stream.eof()) {
//                    stream >> r;
//                    ++counter;
//                    buffer[j++] = ProcessSequence(threader, r.sequence());
//
//                    if (j == buf_size) {
//                        j = 0;
//
//#pragma omp critical
//                        {
//                            for (size_t l = 0; l < buf_size; ++l) {
//                                AddPathsToGraph(buffer[l]);
//                            }
//                        }
//                    }
//                }
//
//#pragma omp critical
//                {
//                    for (size_t l = 0; l < j; ++l) {
//                        AddPathsToGraph(buffer[l]);
//                    }
//                }
//            }
//
//        }
//
//        INFO("DeBruijn graph coverage counted, reads used: " << counter);
//
//        INFO("Elapsed time: " << pc.time_ms());
//    }
//
//    template<class ReadThreader, class Read>
//    void FillFastParallel(
//            io::ReadStreamVector<io::IReader<Read> >& streams,
//            const ReadThreader& threader) {
//
//        INFO("Processing reads (takes a while)");
//        perf_counter pc;
//        size_t counter = 0;
//
//        size_t nthreads = streams.size();
////
//        std::vector<map_type*> maps(nthreads);
////        maps[0] = &storage_;
//
//        for (size_t i = 0; i < nthreads; ++i) {
//            maps[i] = new map_type();
//        }
//
//#pragma omp parallel num_threads(nthreads)
//        {
//#pragma omp for reduction(+ : counter)
//            for (size_t i = 0; i < nthreads; ++i) {
//
//                Read r;
//                io::IReader<Read>& stream = streams[i];
//                stream.reset();
//                Path<EdgeId> path;
//
//                while (!stream.eof()) {
//                    stream >> r;
//                    ++counter;
//                    path = ProcessSequence(threader, r.sequence());
//
//                    AddPathsToMap(path, *maps[i]);
//                }
//            }
//        }
//
//        INFO("Merging maps");
//        for (size_t i = 0; i < nthreads; ++i) {
//            for (auto it = maps[i]->begin(); it != maps[i]->end(); ++it) {
//                it->first->IncCoverage(it->second);
//            }
//            delete maps[i];
//        }
//
//        INFO("DeBruijn graph coverage counted, reads used: " << counter);
//
//        INFO("Elapsed time: " << pc.time_ms());
//    }

//    template<class Index>
//    void FillFromIndex(Index& index) {
//        for (auto I = index.value_cbegin(), E = index.value_cend();
//                I != E; ++I) {
//            const auto& edge_info = *I;
//            VERIFY(edge_info.offset != -1u);
//            VERIFY(edge_info.edge_id.get() != NULL);
//            IncRawCoverage(edge_info.edge_id, edge_info.count);
//        }
//
//        DEBUG("Coverage counted");
//    }

    virtual void HandleDelete(EdgeId edge) {
        SetRawCoverage(edge, 0);
    }

    virtual void HandleMerge(const vector<EdgeId>& old_edges, EdgeId new_edge) {
        unsigned coverage = 0;
        for (auto it = old_edges.begin(); it != old_edges.end(); ++it) {
            coverage += RawCoverage(*it);
        }
        SetRawCoverage(new_edge, coverage);
    }

    virtual void HandleGlue(EdgeId new_edge, EdgeId edge1, EdgeId edge2) {
        SetRawCoverage(new_edge, RawCoverage(edge1) + RawCoverage(edge2));
    }

    virtual void HandleSplit(EdgeId old_edge, EdgeId new_edge1, EdgeId new_edge2) {
//		size_t length1 = this->g().length(newEdge1);
//		size_t length = this->g().length(oldEdge);
//		size_t coverage = KPlusOneMerCoverage(oldEdge);
//		size_t coverage1 = coverage * length1 / length;
//		if (coverage1 == 0)
//			coverage1 = 1;
//		size_t coverage2 = coverage - coverage1;
//		if (coverage2 == 0)
//			coverage2 = 1;
//		SetCoverage(newEdge1, coverage1);
//		SetCoverage(newEdge2, coverage2);
        double avg_cov = coverage(old_edge);
        if (old_edge == g_.conjugate(old_edge)) {
            int raw1 = std::max(1, (int) math::round(avg_cov * (double) this->g().length(new_edge1)));
            SetRawCoverage(new_edge1, raw1);
            SetRawCoverage(g_.conjugate(new_edge1), raw1);
            SetRawCoverage(new_edge2, std::max(1, (int) math::round(avg_cov * (double) this->g().length(new_edge2))));
        } else {
            SetRawCoverage(new_edge1, std::max(1, (int) math::round(avg_cov * (double) this->g().length(new_edge1))));
            SetRawCoverage(new_edge2, std::max(1, (int) math::round(avg_cov * (double) this->g().length(new_edge2))));
        }
    }

    void Save(EdgeId e, std::ostream& out) const {
        out << fmt::format("{:.6f}", coverage(e));
    }

    void Load(EdgeId e, std::istream& in) {
        double cov;
        in >> cov;
        SetAvgCoverage(e, cov);
    }

    /*
     * Is thread safe if different threads process different edges.
     */
    bool IsThreadSafe() const {
        return true;
    }
};

//todo discuss with Anton
template<class Graph>
class AbstractFlankingCoverage {
public:
	virtual double GetInCov(typename Graph::EdgeId edge) const = 0;
	virtual double GetOutCov(typename Graph::EdgeId edge) const = 0;
};

}
