X-Git-Url: https://git.carlh.net/gitweb/?a=blobdiff_plain;f=src%2Flib%2Fdcpomatic_time.h;h=7dbde46b7b2698f73724d518d7298eb3ff17433e;hb=b1dc9c3a2f7e55c9afc5bf2d5b465371b048e14f;hp=437b78f627bc7e51f5c59701f3fe7a59b3528924;hpb=23b69b228ed5b34b59e1789de4bff052bc905ae4;p=dcpomatic.git diff --git a/src/lib/dcpomatic_time.h b/src/lib/dcpomatic_time.h index 437b78f62..7dbde46b7 100644 --- a/src/lib/dcpomatic_time.h +++ b/src/lib/dcpomatic_time.h @@ -1,19 +1,20 @@ /* - Copyright (C) 2014-2015 Carl Hetherington + Copyright (C) 2014-2016 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 . */ @@ -25,12 +26,11 @@ #define DCPOMATIC_TIME_H #include "frame_rate_change.h" -#include "safe_stringstream.h" #include "dcpomatic_assert.h" +#include #include #include #include -#include #include class dcpomatic_round_up_test; @@ -117,8 +117,8 @@ public: * at some sampling rate. * @param r Sampling rate. */ - Time round_up (float r) { - Type const n = rint (HZ / 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,8 +132,26 @@ public: } template - int64_t frames (T r) const { - return rint (double (_t) * r / HZ); + int64_t frames_round (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 llrint(). + */ + return llrint (_t * double(r) / HZ); + } + + template + int64_t frames_floor (T r) const { + 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 */ @@ -143,7 +161,7 @@ public: /* Do this calculation with frames so that we can round to a frame boundary at the start rather than the end. */ - int64_t ff = frames (r); + int64_t ff = frames_round (r); h = ff / (3600 * r); ff -= h * 3600 * r; @@ -163,19 +181,14 @@ public: int f; split (r, h, m, s, f); - SafeStringStream o; - o.width (2); - o.fill ('0'); - o << std::setw(2) << std::setfill('0') << h << ":" - << std::setw(2) << std::setfill('0') << m << ":" - << std::setw(2) << std::setfill('0') << s << ":" - << std::setw(2) << std::setfill('0') << f; - return o.str (); + char buffer[128]; + snprintf (buffer, sizeof (buffer), "%02d:%02d:%02d:%02d", h, m, s, f); + return buffer; } static Time from_seconds (double s) { - return Time (rint (s * HZ)); + return Time (llrint (s * HZ)); } template @@ -219,32 +232,59 @@ 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); + } + + boost::optional > overlap (TimePeriod const & other) { + T const max_from = std::max (from, other.from); + T const min_to = std::min (to, other.to); + + if (max_from >= min_to) { + return boost::optional > (); + } + + return TimePeriod (max_from, min_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::string to_string (ContentTime t); +std::string to_string (DCPTime t); +std::string to_string (DCPTimePeriod p); #endif