////////////////////////////////////////////////////////////////////////////////
//
//  Copyright (C) 2021-     Equinor ASA
//
//  ResInsight is free software: you can redistribute it and/or modify
//  it under the terms of the GNU General Public License as published by
//  the Free Software Foundation, either version 3 of the License, or
//  (at your option) any later version.
//
//  ResInsight 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 General Public License at <http://www.gnu.org/licenses/gpl.html>
//  for more details.
//
/////////////////////////////////////////////////////////////////////////////////

#include "RifSummaryReaderMultipleFiles.h"

#include "RifReaderEclipseSummary.h"

#include "cafAssert.h"

#include <memory>

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
RifSummaryReaderMultipleFiles::RifSummaryReaderMultipleFiles( const std::vector<std::string>& filesOrderedByStartOfHistory )
    : m_fileNames( filesOrderedByStartOfHistory )
{
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
std::vector<time_t> RifSummaryReaderMultipleFiles::timeSteps( const RifEclipseSummaryAddress& resultAddress ) const
{
    return m_aggregatedTimeSteps;
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
bool RifSummaryReaderMultipleFiles::values( const RifEclipseSummaryAddress& resultAddress, std::vector<double>* values ) const
{
    for ( const auto& reader : m_summaryReaders )
    {
        std::vector<double> readerValues;
        reader->values( resultAddress, &readerValues );

        if ( readerValues.empty() )
        {
            // When a well is introduced, no data is present before the time step the well is introduced
            // Add values of zero for this interval
            //
            // This issue was reported for libecl, but it is not relevant now as the low level file readers only handle
            // a single file.
            // https://github.com/OPM/ResInsight/issues/7065

            std::vector<double> zeros( reader->timeSteps( {} ).size(), 0.0 );

            readerValues = zeros;
        }

        auto valueCount = timeStepCount( reader.get() );
        readerValues.resize( valueCount );

        values->insert( values->end(), readerValues.begin(), readerValues.end() );
    }

    CAF_ASSERT( m_aggregatedTimeSteps.size() == values->size() );

    return true;
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
std::string RifSummaryReaderMultipleFiles::unitName( const RifEclipseSummaryAddress& resultAddress ) const
{
    if ( !m_summaryReaders.empty() ) return m_summaryReaders.front()->unitName( resultAddress );

    return "";
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
RiaDefines::EclipseUnitSystem RifSummaryReaderMultipleFiles::unitSystem() const
{
    if ( !m_summaryReaders.empty() ) return m_summaryReaders.front()->unitSystem();

    return RiaDefines::EclipseUnitSystem::UNITS_UNKNOWN;
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
size_t RifSummaryReaderMultipleFiles::timeStepCount( RifSummaryReaderInterface* reader ) const
{
    auto it = m_valueCountForReader.find( reader );
    if ( it != m_valueCountForReader.end() )
    {
        return it->second;
    }

    return 0;
}

//--------------------------------------------------------------------------------------------------
///
//--------------------------------------------------------------------------------------------------
bool RifSummaryReaderMultipleFiles::createReadersAndImportMetaData( RiaThreadSafeLogger* threadSafeLogger )
{
    for ( const auto& fileName : m_fileNames )
    {
        auto candidate = std::make_unique<RifReaderEclipseSummary>();
        auto result    = candidate->open( QString::fromStdString( fileName ), threadSafeLogger );
        if ( result )
        {
            m_summaryReaders.push_back( std::move( candidate ) );
        }
    }

    calculateOverlappingTimeSteps();

    // Aggregate result addresses
    for ( const auto& reader : m_summaryReaders )
    {
        {
            auto resultAddresses = reader->allResultAddresses();
            m_allResultAddresses.insert( resultAddresses.begin(), resultAddresses.end() );
        }

        {
            auto errorResultAddresses = reader->allErrorAddresses();
            m_allErrorAddresses.insert( errorResultAddresses.begin(), errorResultAddresses.end() );
        }
    }

    return true;
}

//--------------------------------------------------------------------------------------------------
///
// Detect any overlapping time steps. Always use data from summary reader with the newest data, so do processing
// from the last reader to the first
//
//--------------------------------------------------------------------------------------------------
void RifSummaryReaderMultipleFiles::calculateOverlappingTimeSteps()
{
    if ( m_summaryReaders.empty() ) return;

    auto lastRestartCase                   = m_summaryReaders.back().get();
    auto lastRestartCaseTimeSteps          = lastRestartCase->timeSteps( {} );
    m_valueCountForReader[lastRestartCase] = lastRestartCaseTimeSteps.size();

    time_t cutOffTime = lastRestartCaseTimeSteps.front();
    for ( int i = static_cast<int>( m_summaryReaders.size() - 2 ); i >= 0; i-- )
    {
        auto currentReader    = m_summaryReaders.at( static_cast<size_t>( i ) ).get();
        auto currentTimeSteps = currentReader->timeSteps( {} );

        size_t timeStepIndex = 0;
        for ( auto t : currentTimeSteps )
        {
            if ( t < cutOffTime ) timeStepIndex++;
        }

        m_valueCountForReader[currentReader] = timeStepIndex;

        if ( currentTimeSteps.front() < cutOffTime )
        {
            cutOffTime = currentTimeSteps.front();
        }
    }

    // Create a vector of increasing time steps with no overlapping time steps
    for ( const auto& reader : m_summaryReaders )
    {
        auto currentTimeSteps = reader->timeSteps( {} );
        auto valueCount       = m_valueCountForReader[reader.get()];
        currentTimeSteps.resize( valueCount );

        m_aggregatedTimeSteps.insert( m_aggregatedTimeSteps.end(), currentTimeSteps.begin(), currentTimeSteps.end() );
    }
}
