void virtual_edition_c::retimeSubChapters( virtual_chapter_c * p_vchap )
{
mtime_t i_mk_stop_time = p_vchap->i_mk_virtual_stop_time;
for( size_t i = p_vchap->sub_chapters.size(); i-- > 0; )
{
virtual_chapter_c * p_vsubchap = p_vchap->sub_chapters[i];
//p_vsubchap->i_mk_virtual_start_time += p_vchap->i_mk_virtual_start_time;
/*FIXME we artificially extend stop time if they were there before...*/
/* Just for comfort*/
p_vsubchap->i_mk_virtual_stop_time = i_mk_stop_time;
i_mk_stop_time = p_vsubchap->i_mk_virtual_start_time;
retimeSubChapters( p_vsubchap );
}
}
void virtual_edition_c::retimeChapters()
{
/* This function is just meant to be used on unordered chapters */
if( b_ordered )
return;
i_duration = 0;
/* On non ordered editions we have one top chapter == one segment */
for( size_t i = 0; i < chapters.size(); i++ )
{
virtual_chapter_c * p_vchap = chapters[i];
p_vchap->i_mk_virtual_start_time = i_duration;
i_duration += p_vchap->p_segment->i_duration * 1000;
p_vchap->i_mk_virtual_stop_time = i_duration;
retimeSubChapters( p_vchap );
}
}
void virtual_edition_c::retimeChapters()
{
/* This function is just meant to be used on unordered chapters */
if( b_ordered )
return;
i_duration = 0;
/* Sort by start time */
if( chapters.size() > 1 )
std::sort( chapters.begin(), chapters.end(), virtual_chapter_c::CompareTimecode );
/* On non ordered editions we have one top chapter == one segment */
for( size_t i = 0; i < chapters.size(); i++ )
{
virtual_chapter_c * p_vchap = chapters[i];
p_vchap->i_virtual_start_time = i_duration;
i_duration += p_vchap->p_segment->i_duration * 1000;
p_vchap->i_virtual_stop_time = i_duration;
retimeSubChapters( p_vchap );
}
}
