updated nodes for new input structure
Since all NodeInputs will generally only need their data type and default value set once, we place it all into the constructor for cleaner and easier to manage code.
This commit is contained in:
+228
-24
@@ -25,8 +25,9 @@
|
||||
#include "output.h"
|
||||
#include "inputarray.h"
|
||||
|
||||
NodeInput::NodeInput(const QString& id) :
|
||||
NodeInput::NodeInput(const QString& id, const DataType &type, const QVariant &default_value) :
|
||||
NodeParam(id),
|
||||
data_type_(type),
|
||||
keyframable_(true),
|
||||
keyframing_(false),
|
||||
dependent_(true),
|
||||
@@ -34,7 +35,7 @@ NodeInput::NodeInput(const QString& id) :
|
||||
has_maximum_(false)
|
||||
{
|
||||
// Have at least one keyframe/value active at any time
|
||||
keyframes_.append(NodeKeyframe());
|
||||
insert_keyframe(std::make_shared<NodeKeyframe>(0, default_value, NodeKeyframe::kLinear));
|
||||
}
|
||||
|
||||
bool NodeInput::IsArray()
|
||||
@@ -61,11 +62,6 @@ const NodeParam::DataType &NodeInput::data_type() const
|
||||
return data_type_;
|
||||
}
|
||||
|
||||
void NodeInput::set_data_type(const NodeParam::DataType &type)
|
||||
{
|
||||
data_type_ = type;
|
||||
}
|
||||
|
||||
NodeOutput *NodeInput::get_connected_output() const
|
||||
{
|
||||
if (!edges_.isEmpty()) {
|
||||
@@ -89,41 +85,41 @@ Node *NodeInput::get_connected_node() const
|
||||
QVariant NodeInput::get_value_at_time(const rational &time) const
|
||||
{
|
||||
if (is_keyframing()) {
|
||||
if (keyframes_.first().time() >= time) {
|
||||
if (keyframes_.first()->time() >= time) {
|
||||
// This time precedes any keyframe, so we just return the first value
|
||||
return keyframes_.first().value();
|
||||
return keyframes_.first()->value();
|
||||
}
|
||||
|
||||
if (keyframes_.last().time() <= time) {
|
||||
if (keyframes_.last()->time() <= time) {
|
||||
// This time is after any keyframes so we return the last value
|
||||
return keyframes_.last().value();
|
||||
return keyframes_.last()->value();
|
||||
}
|
||||
|
||||
// If we're here, the time must be somewhere in between the keyframes
|
||||
for (int i=0;i<keyframes_.size()-1;i++) {
|
||||
const NodeKeyframe& before = keyframes_.at(i);
|
||||
const NodeKeyframe& after = keyframes_.at(i+1);
|
||||
NodeKeyframePtr before = keyframes_.at(i);
|
||||
NodeKeyframePtr after = keyframes_.at(i+1);
|
||||
|
||||
if (before.time() == time
|
||||
if (before->time() == time
|
||||
|| data_type() != kFloat // FIXME: Expand this to other types that can be interpolated
|
||||
|| (before.time() < time && before.type() == NodeKeyframe::kHold)) {
|
||||
|| (before->time() < time && before->type() == NodeKeyframe::kHold)) {
|
||||
|
||||
// Time == keyframe time, so value is precise
|
||||
return before.value();
|
||||
return before->value();
|
||||
|
||||
} else if (before.time() < time && after.time() > time) {
|
||||
} else if (before->time() < time && after->time() > time) {
|
||||
// We must interpolate between these keyframes
|
||||
|
||||
if (before.type() == NodeKeyframe::kBezier && after.type() == NodeKeyframe::kBezier) {
|
||||
if (before->type() == NodeKeyframe::kBezier && after->type() == NodeKeyframe::kBezier) {
|
||||
// FIXME: Perform a cubic bezier interpolation
|
||||
} else if (before.type() == NodeKeyframe::kLinear && after.type() == NodeKeyframe::kBezier) {
|
||||
} else if (before->type() == NodeKeyframe::kLinear && after->type() == NodeKeyframe::kBezier) {
|
||||
// FIXME: Perform a quadratic bezier interpolation with anchors from the AFTER keyframe
|
||||
} else if (before.type() == NodeKeyframe::kLinear && after.type() == NodeKeyframe::kBezier) {
|
||||
} else if (before->type() == NodeKeyframe::kLinear && after->type() == NodeKeyframe::kBezier) {
|
||||
// FIXME: Perform a quadratic bezier interpolation with anchors from the BEFORE keyframe
|
||||
} else {
|
||||
// To have arrived here, the keyframes must both be linear
|
||||
qreal period_progress = (time.toDouble() - before.time().toDouble()) / (after.time().toDouble() - before.time().toDouble());
|
||||
qreal interpolated_value = lerp(before.value().toDouble(), after.value().toDouble(), period_progress);
|
||||
qreal period_progress = (time.toDouble() - before->time().toDouble()) / (after->time().toDouble() - before->time().toDouble());
|
||||
qreal interpolated_value = lerp(before->value().toDouble(), after->value().toDouble(), period_progress);
|
||||
|
||||
return interpolated_value;
|
||||
}
|
||||
@@ -131,14 +127,167 @@ QVariant NodeInput::get_value_at_time(const rational &time) const
|
||||
}
|
||||
}
|
||||
|
||||
return keyframes_.first().value();
|
||||
return keyframes_.first()->value();
|
||||
}
|
||||
|
||||
void NodeInput::set_value_at_time(const rational &time, const QVariant &value)
|
||||
NodeKeyframePtr NodeInput::get_keyframe_at_time(const rational &time) const
|
||||
{
|
||||
if (!is_keyframing()) {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
foreach (NodeKeyframePtr key, keyframes_) {
|
||||
if (key->time() == time) {
|
||||
return key;
|
||||
}
|
||||
}
|
||||
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
NodeKeyframePtr NodeInput::get_closest_keyframe_to_time(const rational &time) const
|
||||
{
|
||||
if (!is_keyframing()) {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
if (time <= keyframes_.first()->time()) {
|
||||
return keyframes_.first();
|
||||
}
|
||||
|
||||
if (time >= keyframes_.last()->time()) {
|
||||
return keyframes_.last();
|
||||
}
|
||||
|
||||
for (int i=1;i<keyframes_.size();i++) {
|
||||
NodeKeyframePtr prev_key = keyframes_.at(i-1);
|
||||
NodeKeyframePtr next_key = keyframes_.at(i);
|
||||
|
||||
if (prev_key->time() <= time && next_key->time() >= time) {
|
||||
// Return whichever is closer
|
||||
rational prev_diff = time - prev_key->time();
|
||||
rational next_diff = next_key->time() - time;
|
||||
|
||||
if (next_diff < prev_diff) {
|
||||
return next_key;
|
||||
} else {
|
||||
return prev_key;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
void NodeInput::insert_keyframe(NodeKeyframePtr key)
|
||||
{
|
||||
insert_keyframe_internal(key);
|
||||
|
||||
connect(key.get(), &NodeKeyframe::TimeChanged, this, &NodeInput::KeyframeTimeChanged);
|
||||
connect(key.get(), &NodeKeyframe::ValueChanged, this, &NodeInput::KeyframeValueChanged);
|
||||
|
||||
emit KeyframeAdded(key);
|
||||
}
|
||||
|
||||
void NodeInput::remove_keyframe(NodeKeyframePtr key)
|
||||
{
|
||||
Q_ASSERT(keyframes_.size() > 1);
|
||||
|
||||
disconnect(key.get(), &NodeKeyframe::TimeChanged, this, &NodeInput::KeyframeTimeChanged);
|
||||
disconnect(key.get(), &NodeKeyframe::ValueChanged, this, &NodeInput::KeyframeValueChanged);
|
||||
|
||||
keyframes_.removeOne(key);
|
||||
|
||||
emit KeyframeRemoved(key);
|
||||
}
|
||||
|
||||
void NodeInput::KeyframeTimeChanged()
|
||||
{
|
||||
NodeKeyframe* key = static_cast<NodeKeyframe*>(sender());
|
||||
int keyframe_index = FindIndexOfKeyframeFromRawPtr(key);
|
||||
|
||||
Q_ASSERT(keyframe_index > -1);
|
||||
|
||||
if ((keyframe_index > 0 && keyframes_.at(keyframe_index - 1)->time() > key->time())
|
||||
|| (keyframe_index < keyframes_.size() - 1 && keyframes_.at(keyframe_index + 1)->time() < key->time())) {
|
||||
// This keyframe needs resorting, store it and remove it from the list
|
||||
NodeKeyframePtr key_shared_ptr = keyframes_.at(keyframe_index);
|
||||
keyframes_.removeAt(keyframe_index);
|
||||
|
||||
// Automatically insertion sort
|
||||
insert_keyframe_internal(key_shared_ptr);
|
||||
}
|
||||
}
|
||||
|
||||
void NodeInput::KeyframeValueChanged()
|
||||
{
|
||||
//NodeKeyframe* key = static_cast<NodeKeyframe*>(sender());
|
||||
//int keyframe_index = FindIndexOfKeyframeFromRawPtr(key);
|
||||
|
||||
// FIXME: Finish this partial stub
|
||||
emit ValueChanged(RATIONAL_MIN, RATIONAL_MAX);
|
||||
}
|
||||
|
||||
int NodeInput::FindIndexOfKeyframeFromRawPtr(NodeKeyframe *raw_ptr) const
|
||||
{
|
||||
for (int i=0;i<keyframes_.size();i++) {
|
||||
if (keyframes_.at(i).get() == raw_ptr) {
|
||||
return i;
|
||||
}
|
||||
}
|
||||
|
||||
return -1;
|
||||
}
|
||||
|
||||
void NodeInput::insert_keyframe_internal(NodeKeyframePtr key)
|
||||
{
|
||||
for (int i=0;i<keyframes_.size();i++) {
|
||||
NodeKeyframePtr compare = keyframes_.at(i);
|
||||
|
||||
// Ensure we aren't trying to insert two keyframes at the same time
|
||||
Q_ASSERT(compare->time() != key->time());
|
||||
|
||||
if (compare->time() > key->time()) {
|
||||
keyframes_.insert(i, key);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
keyframes_.append(key);
|
||||
}
|
||||
|
||||
bool NodeInput::has_keyframe_at_time(const rational &time) const
|
||||
{
|
||||
// If we aren't keyframing, there definitely isn't a keyframe at a given time
|
||||
if (!is_keyframing()) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// Loop through keyframes to see if any match
|
||||
foreach (NodeKeyframePtr key, keyframes_) {
|
||||
if (key->time() == time) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
// None match
|
||||
return false;
|
||||
}
|
||||
|
||||
/*void NodeInput::set_default_value(const QVariant &value)
|
||||
{
|
||||
if (parentNode() != nullptr)
|
||||
parentNode()->LockUserInput();
|
||||
|
||||
set_is_keyframing(false);
|
||||
keyframes_.clear();
|
||||
keyframes_.append(NodeKeyframe(0, value, NodeKeyframe::kLinear));
|
||||
|
||||
if (parentNode() != nullptr)
|
||||
parentNode()->UnlockUserInput();
|
||||
|
||||
emit ValueChanged(RATIONAL_MIN, RATIONAL_MAX);
|
||||
|
||||
// We set up these variables in advance (see end of function)
|
||||
bool signal_vc = false;
|
||||
TimeRange signal_vc_range;
|
||||
@@ -230,8 +379,49 @@ void NodeInput::set_value_at_time(const rational &time, const QVariant &value)
|
||||
// tries to relock this node before it's unlocked here
|
||||
if (signal_vc)
|
||||
emit ValueChanged(signal_vc_range.in(), signal_vc_range.out());
|
||||
|
||||
}*/
|
||||
|
||||
/*void NodeInput::set_keyframe_data(const QList<NodeKeyframe> keyframes)
|
||||
{
|
||||
keyframes_ = keyframes;
|
||||
}
|
||||
|
||||
void NodeInput::insert_keyframe(const NodeKeyframe &key)
|
||||
{
|
||||
Q_ASSERT(is_keyframing());
|
||||
|
||||
for (int i=0;i<keyframes_.size();i++) {
|
||||
const NodeKeyframe& compare = keyframes_.at(i);
|
||||
|
||||
// Try to order the keyframe by time
|
||||
if (compare.time() == key.time()) {
|
||||
emit KeyframeRemoved(compare);
|
||||
keyframes_.replace(i, key);
|
||||
emit KeyframeAdded(key);
|
||||
return;
|
||||
} else if (compare.time() > key.time()) {
|
||||
keyframes_.insert(i, key);
|
||||
emit KeyframeAdded(key);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
keyframes_.append(key);
|
||||
emit KeyframeAdded(key);
|
||||
}
|
||||
|
||||
void NodeInput::remove_keyframe_at_time(const rational &time)
|
||||
{
|
||||
for (int i=0;i<keyframes_.size();i++) {
|
||||
if (keyframes_.at(i).time() == time) {
|
||||
emit KeyframeRemoved(keyframes_.at(i));
|
||||
keyframes_.removeAt(i);
|
||||
break;
|
||||
}
|
||||
}
|
||||
}*/
|
||||
|
||||
bool NodeInput::is_keyframing() const
|
||||
{
|
||||
return keyframing_;
|
||||
@@ -240,6 +430,8 @@ bool NodeInput::is_keyframing() const
|
||||
void NodeInput::set_is_keyframing(bool k)
|
||||
{
|
||||
keyframing_ = k;
|
||||
|
||||
emit KeyframeEnableChanged(keyframing_);
|
||||
}
|
||||
|
||||
bool NodeInput::is_keyframable() const
|
||||
@@ -247,6 +439,18 @@ bool NodeInput::is_keyframable() const
|
||||
return keyframable_;
|
||||
}
|
||||
|
||||
void NodeInput::set_override_value(const QVariant &value)
|
||||
{
|
||||
Q_ASSERT(!is_keyframable());
|
||||
|
||||
keyframes_.first()->set_value(value);
|
||||
}
|
||||
|
||||
const QList<NodeKeyframePtr> &NodeInput::keyframes() const
|
||||
{
|
||||
return keyframes_;
|
||||
}
|
||||
|
||||
void NodeInput::set_is_keyframable(bool k)
|
||||
{
|
||||
keyframable_ = k;
|
||||
|
||||
Reference in New Issue
Block a user