slimming diet for the narrow-mixer strip

[ardour.git] / gtk2_ardour / curvetest.cc

diff --git a/gtk2_ardour/curvetest.cc b/gtk2_ardour/curvetest.cc
index 9235fb9ba9e2414fa64a0fffa1af8d87775453ca..b3431e3f395ad128b09f973f2b4b63d0024f7b99 100644 (file)
--- a/gtk2_ardour/curvetest.cc
+++ b/gtk2_ardour/curvetest.cc
@@ -1,5 +1,5 @@
 /*
-    Copyright (C) 2000-2007 Paul Davis 
+    Copyright (C) 2000-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
@@ -22,8 +22,8 @@
 #include <cfloat>
 #include <unistd.h>
 
-#include <ardour/automation_list.h>
-#include <evoral/Curve.hpp>
+#include "ardour/automation_list.h"
+#include "evoral/Curve.hpp"
 
 using namespace std;
 using namespace ARDOUR;
@@ -32,10 +32,15 @@ using namespace PBD;
 int
 curvetest (string filename)
 {
+       // needed to initialize ID objects/counter used
+       // by Curve et al.
+
+       PBD::ID::init ();
+
        ifstream in (filename.c_str());
        stringstream line;
-       //Parameter param(GainAutomation, -1.0, +1.0, 0.0);
-       Parameter param(GainAutomation);
+       //Evoral::Parameter param(GainAutomation, -1.0, +1.0, 0.0);
+       Evoral::Parameter param(GainAutomation);
        AutomationList al (param);
        double minx = DBL_MAX;
        double maxx = DBL_MIN;
@@ -45,7 +50,7 @@ curvetest (string filename)
 
                in >> x;
                in >> y;
-               
+
                if (!in) {
                        break;
                }
@@ -53,11 +58,11 @@ curvetest (string filename)
                if (x < minx) {
                        minx = x;
                }
-               
+
                if (x > maxx) {
                        maxx = x;
                }
-               
+
                al.add (x, y);
        }
 
@@ -65,10 +70,10 @@ curvetest (string filename)
        float foo[1024];
 
        al.curve().get_vector (minx, maxx, foo, 1024);
-       
+
        for (int i = 0; i < 1024; ++i) {
                cout << minx + (((double) i / 1024.0) * (maxx - minx)) << ' ' << foo[i] << endl;
        }
-       
+
        return 0;
 }