Files
oak-editor/app/common/timerange.cpp
T
itsmattkc 16ac2fc0e1 sweeping node graph changes for new rendering pipeline
The new rendering pipeline strives to simplify the nodes themselves as much
as possible and move much of the logic to an external rendering engine. This
change removes all of the responsibilities that no longer belong to the
nodes themselves and will soon be folded into the renderer.
2019-11-02 01:39:37 +11:00

90 lines
1.3 KiB
C++

#include "timerange.h"
TimeRange::TimeRange()
{
}
TimeRange::TimeRange(const rational &in, const rational &out) :
in_(in),
out_(out)
{
normalize();
}
const rational &TimeRange::in() const
{
return in_;
}
const rational &TimeRange::out() const
{
return out_;
}
const rational &TimeRange::length() const
{
return length_;
}
void TimeRange::set_in(const rational &in)
{
in_ = in;
normalize();
}
void TimeRange::set_out(const rational &out)
{
out_ = out;
normalize();
}
void TimeRange::set_range(const rational &in, const rational &out)
{
in_ = in;
out_ = out;
normalize();
}
bool TimeRange::operator<(const TimeRange &r) const
{
return length() < r.length();
}
bool TimeRange::operator<=(const TimeRange &r) const
{
return length() <= r.length();
}
bool TimeRange::operator>(const TimeRange &r) const
{
return length() > r.length();
}
bool TimeRange::operator>=(const TimeRange &r) const
{
return length() >= r.length();
}
bool TimeRange::operator==(const TimeRange &r) const
{
return length() == r.length();
}
bool TimeRange::operator!=(const TimeRange &r) const
{
return length() != r.length();
}
void TimeRange::normalize()
{
// If `out` is earlier than `in`, swap them
if (out_ < in_) {
rational temp = in_;
in_ = out_;
out_ = temp;
}
// Calculate length
length_ = out_ - in_;
}