Add Content::set_paths().
[dcpomatic.git] / src / lib / dcpomatic_time.h
index da903cf09316e0e34865e62a5443a7ff1ba5b64e..ad5b6768edb1140c9ac04570bab6f8a8af1651b2 100644 (file)
@@ -1,5 +1,5 @@
 /*
-    Copyright (C) 2014-2016 Carl Hetherington <cth@carlh.net>
+    Copyright (C) 2014-2017 Carl Hetherington <cth@carlh.net>
 
     This file is part of DCP-o-matic.
 
 #include "frame_rate_change.h"
 #include "dcpomatic_assert.h"
 #include <boost/optional.hpp>
+#include <boost/foreach.hpp>
 #include <stdint.h>
 #include <cmath>
 #include <ostream>
 #include <iomanip>
 #include <cstdio>
 
-class dcpomatic_round_up_test;
-
 /** A time in seconds, expressed as a number scaled up by Time::HZ.  We want two different
  *  versions of this class, ContentTime and DCPTime, and we want it to be impossible to
  *  convert implicitly between the two.  Hence there's this template hack.  I'm not
@@ -118,10 +117,12 @@ public:
         *  at some sampling rate.
         *  @param r Sampling rate.
         */
-       Time<S, O> round_up (float r) const {
-               Type const n = llrintf (HZ / r);
-               Type const a = _t + n - 1;
-               return Time<S, O> (a - (a % n));
+       Time<S, O> ceil (float r) const {
+               return Time<S, O> (llrint (HZ * frames_ceil(r) / double(r)));
+       }
+
+       Time<S, O> floor (float r) const {
+               return Time<S, O> (llrint (HZ * frames_floor(r) / double(r)));
        }
 
        double seconds () const {
@@ -143,7 +144,7 @@ public:
 
        template <typename T>
        int64_t frames_floor (T r) const {
-               return floor (_t * r / HZ);
+               return ::floor (_t * r / HZ);
        }
 
        template <typename T>
@@ -152,10 +153,16 @@ public:
                   the calculation will round down before we get the chance
                   to ceil().
                */
-               return ceil (_t * double(r) / HZ);
+               return ::ceil (_t * double(r) / HZ);
        }
 
-       /** @param r Frames per second */
+       /** Split a time into hours, minutes, seconds and frames.
+        *  @param r Frames per second.
+        *  @param h Returned hours.
+        *  @param m Returned minutes.
+        *  @param s Returned seconds.
+        *  @param f Returned frames.
+        */
        template <typename T>
        void split (T r, int& h, int& m, int& s, int& f) const
        {
@@ -211,7 +218,8 @@ public:
        }
 
 private:
-       friend struct dcptime_round_up_test;
+       friend struct dcptime_ceil_test;
+       friend struct dcptime_floor_test;
 
        Type _t;
        static const int HZ = 96000;
@@ -257,7 +265,7 @@ public:
                return TimePeriod<T> (from + o, to + o);
        }
 
-       boost::optional<TimePeriod<T> > overlap (TimePeriod<T> const & other) {
+       boost::optional<TimePeriod<T> > overlap (TimePeriod<T> const & other) const {
                T const max_from = std::max (from, other.from);
                T const min_to = std::min (to, other.to);
 
@@ -272,6 +280,13 @@ public:
                return (from <= other && other < to);
        }
 
+       bool operator< (TimePeriod<T> const & o) const {
+               if (from != o.from) {
+                       return from < o.from;
+               }
+               return to < o.to;
+       }
+
        bool operator== (TimePeriod<T> const & other) const {
                return from == other.from && to == other.to;
        }
@@ -281,6 +296,47 @@ public:
        }
 };
 
+/** @param A Period which is subtracted from.
+ *  @param B Periods to subtract from `A', must be in ascending order of start time and must not overlap.
+ */
+template <class T>
+std::list<TimePeriod<T> > subtract (TimePeriod<T> A, std::list<TimePeriod<T> > const & B)
+{
+       std::list<TimePeriod<T> > result;
+       result.push_back (A);
+
+       BOOST_FOREACH (TimePeriod<T> i, B) {
+               std::list<TimePeriod<T> > new_result;
+               BOOST_FOREACH (TimePeriod<T> j, result) {
+                       boost::optional<TimePeriod<T> > ov = i.overlap (j);
+                       if (ov) {
+                               if (*ov == i) {
+                                       /* A contains all of B */
+                                       if (i.from != j.from) {
+                                               new_result.push_back (TimePeriod<T> (j.from, i.from));
+                                       }
+                                       if (i.to != j.to) {
+                                               new_result.push_back (TimePeriod<T> (i.to, j.to));
+                                       }
+                               } else if (*ov == j) {
+                                       /* B contains all of A */
+                               } else if (i.from < j.from) {
+                                       /* B overlaps start of A */
+                                       new_result.push_back (TimePeriod<T> (i.to, j.to));
+                               } else if (i.to > j.to) {
+                                       /* B overlaps end of A */
+                                       new_result.push_back (TimePeriod<T> (j.from, i.from));
+                               }
+                       } else {
+                               new_result.push_back (j);
+                       }
+               }
+               result = new_result;
+       }
+
+       return result;
+}
+
 typedef TimePeriod<ContentTime> ContentTimePeriod;
 typedef TimePeriod<DCPTime> DCPTimePeriod;