X-Git-Url: https://git.carlh.net/gitweb/?a=blobdiff_plain;f=src%2Flib%2Fdcpomatic_time.h;h=c538357ccbe12c57093fb59bbc91758f8e1a1138;hb=3828baf56467224f5d44049bf1e7a7ed11f43a05;hp=792eb2c97cb9c793762a701d4a1cd5c32606ab51;hpb=14e4bc18e65378332604016bd6239861a083d5bf;p=dcpomatic.git diff --git a/src/lib/dcpomatic_time.h b/src/lib/dcpomatic_time.h index 792eb2c97..c538357cc 100644 --- a/src/lib/dcpomatic_time.h +++ b/src/lib/dcpomatic_time.h @@ -1,19 +1,20 @@ /* Copyright (C) 2014-2015 Carl Hetherington - This program is free software; you can redistribute it and/or modify + 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. - This program is distributed in the hope that it will be useful, + 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 this program; if not, write to the Free Software - Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + along with DCP-o-matic. If not, see . */ @@ -116,7 +117,7 @@ public: * at some sampling rate. * @param r Sampling rate. */ - Time round_up (float r) { + Time round_up (float r) const { Type const n = llrintf (HZ / r); Type const a = _t + n - 1; return Time (a - (a % n)); @@ -132,7 +133,11 @@ public: template int64_t frames_round (T r) const { - return llrint (_t * r / HZ); + /* We must cast to double here otherwise if T is integer + the calculation will round down before we get the chance + to llrint(). + */ + return llrint (_t * double(r) / HZ); } template @@ -140,6 +145,15 @@ public: return floor (_t * r / HZ); } + template + int64_t frames_ceil (T r) const { + /* We must cast to double here otherwise if T is integer + the calculation will round down before we get the chance + to ceil(). + */ + return ceil (_t * double(r) / HZ); + } + /** @param r Frames per second */ template void split (T r, int& h, int& m, int& s, int& f) const @@ -223,36 +237,52 @@ typedef Time ContentTime; /** Time relative to the start of the output DCP in its frame rate */ typedef Time DCPTime; -class ContentTimePeriod +template +class TimePeriod { public: - ContentTimePeriod () {} + TimePeriod () {} - ContentTimePeriod (ContentTime f, ContentTime t) + TimePeriod (T f, T t) : from (f) , to (t) {} - ContentTime from; - ContentTime to; + /** start time of sampling interval that the period is from */ + T from; + /** start time of next sampling interval after the period */ + T to; - ContentTimePeriod operator+ (ContentTime const & o) const { - return ContentTimePeriod (from + o, to + o); + T duration () const { + return to - from; } - bool overlaps (ContentTimePeriod const & o) const; - bool contains (ContentTime const & o) const; + TimePeriod operator+ (T const & o) const { + return TimePeriod (from + o, to + o); + } + + bool overlaps (TimePeriod const & other) const { + return (from < other.to && to > other.from); + } - bool operator== (ContentTimePeriod const & o) const { - return from == o.from && to == o.to; + bool contains (T const & other) const { + return (from <= other && other < to); + } + + bool operator== (TimePeriod const & other) const { + return from == other.from && to == other.to; } }; +typedef TimePeriod ContentTimePeriod; +typedef TimePeriod DCPTimePeriod; + DCPTime min (DCPTime a, DCPTime b); DCPTime max (DCPTime a, DCPTime b); ContentTime min (ContentTime a, ContentTime b); ContentTime max (ContentTime a, ContentTime b); std::ostream& operator<< (std::ostream& s, ContentTime t); std::ostream& operator<< (std::ostream& s, DCPTime t); +std::ostream& operator<< (std::ostream& s, DCPTimePeriod p); #endif