/*
    Copyright (C) 2017-2021 Carl Hetherington <cth@carlh.net>

    This file is part of DCP-o-matic.

    DCP-o-matic 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 2 of the License, or
    (at your option) any later version.

    DCP-o-matic 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 for more details.

    You should have received a copy of the GNU General Public License
    along with DCP-o-matic.  If not, see <http://www.gnu.org/licenses/>.

*/


#include "empty.h"
#include "film.h"
#include "playlist.h"
#include "content.h"
#include "content_part.h"
#include "dcp_content.h"
#include "dcpomatic_time_coalesce.h"
#include "piece.h"
#include <iostream>


using std::cout;
using std::list;
using std::shared_ptr;
using std::dynamic_pointer_cast;
using std::function;
using namespace dcpomatic;


Empty::Empty (shared_ptr<const Film> film, shared_ptr<const Playlist> playlist, function<bool (shared_ptr<const Content>)> part, DCPTime length)
{
	list<DCPTimePeriod> full;
	for (auto i: playlist->content()) {
		if (part(i) && i->paths_valid()) {
			full.push_back(i->period(film));
		}
	}

	_periods = subtract (DCPTimePeriod(DCPTime(), length), coalesce(full));

	if (!_periods.empty()) {
		_position = _periods.front().from;
	}
}


void
Empty::set_position (DCPTime position)
{
	_position = position;

	for (auto i: _periods) {
		if (i.contains(_position)) {
			return;
		}
	}

	for (auto i: _periods) {
		if (i.from > _position) {
			_position = i.from;
			return;
		}
	}
}


DCPTimePeriod
Empty::period_at_position () const
{
	for (auto i: _periods) {
		if (i.contains(_position)) {
			return DCPTimePeriod (_position, i.to);
		}
	}

	DCPOMATIC_ASSERT (false);
}


bool
Empty::done () const
{
	DCPTime latest;
	for (auto i: _periods) {
		latest = max (latest, i.to);
	}

	return _position >= latest;
}