ardour/livetrax
13
0
Fork 0
Code

Remove unneeded cruft from Curve.

Browse Source 
git-svn-id: svn://localhost/ardour2/trunk@2108 d708f5d6-7413-0410-9779-e7cbd77b26cf
This commit is contained in:
David Robillard 2007-07-05 01:31:43 +00:00
parent b57510a3a9
commit 912346057c
2 changed files with 9 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
libs/ardour/ardour/curve.h
View File

@ -1,5 +1,5 @@
/*
Copyright (C) 2001-2003 Paul Davis
Copyright (C) 2001-2007 Paul Davis
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
@ -21,6 +21,7 @@
#define __ardour_curve_h__
#include <sys/types.h>
#include <boost/utility.hpp>
#include <sigc++/signal.h>
#include <glibmm/thread.h>
#include <pbd/undo.h>
@ -30,14 +31,10 @@
namespace ARDOUR {
class Curve
class Curve : public boost::noncopyable
{
public:
Curve (const AutomationList& al);
~Curve ();
Curve (const Curve& other);
//Curve (const Curve& other, double start, double end);
/*Curve (const XMLNode&, Parameter id);*/
bool rt_safe_get_vector (double x0, double x1, float *arg, int32_t veclen);
void get_vector (double x0, double x1, float *arg, int32_t veclen);
@ -50,10 +47,10 @@ class Curve
void _get_vector (double x0, double x1, float *arg, int32_t veclen);
const AutomationList& _list;
void on_list_dirty() { _dirty = true; }
bool _dirty;
bool _dirty;
const AutomationList& _list;
};
} // namespace ARDOUR

33
libs/ardour/curve.cc
View File

@ -1,5 +1,5 @@
/*
Copyright (C) 2001-2003 Paul Davis
Copyright (C) 2001-2007 Paul Davis
Contains ideas derived from "Constrained Cubic Spline Interpolation"
by CJC Kruger (www.korf.co.uk/spline.pdf).
@ -41,39 +41,12 @@ using namespace sigc;
using namespace PBD;
Curve::Curve (const AutomationList& al)
: _list (al)
, _dirty (true)
: _dirty (true)
, _list (al)
{
_list.Dirty.connect(mem_fun(*this, &Curve::on_list_dirty));
}
Curve::Curve (const Curve& other)
: _list (other._list)
, _dirty (true)
{
_list.Dirty.connect(mem_fun(*this, &Curve::on_list_dirty));
}
#if 0
Curve::Curve (const Curve& other, double start, double end)
: _list (other._list)
{
_min_yval = other._min_yval;
_max_yval = other._max_yval;
}
/** \a id is used for legacy sessions where the type is not present
* in or below the <AutomationList> node. It is used if \a id is non-null.
*/
Curve::Curve (const XMLNode& node, Parameter id)
: AutomationList (node, id)
{
}
#endif
Curve::~Curve ()
{
}
void
Curve::solve ()
{