eko/envelope.cpp at master · manul-pointer/eko · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
#include <QRect>
#include <QDebug>

#include <algorithm>

#include "utils.h"
#include "envelope.h"


bool comp_ep (CEnvelopePoint *e1, CEnvelopePoint *e2)
{
  return e1->position_frames < e2->position_frames;
}


CEnvelopePoint* CEnvelope::find (int frame, int y, int height, int frames_per_section)
{
  //foreach (CEnvelopePoint *t, points)
  for (auto *t: points)
          {
           int t_y = get_fvalue (height, t->value);
           int t_x = t->position_frames;

           QRect rectangle (t_x, t_y, frames_per_section * ENVELOPE_SIDE, ENVELOPE_SIDE);

           if (rectangle.contains (frame, y))
               return t;
          }

  return 0;
}


CEnvelopePoint* CEnvelope::get_selected()
{
  CEnvelopePoint *p = 0;

  for (int i = 0; i < points.size(); i++)
      {
       if (points[i]->selected)
          {
           p = points[i];
           break;
          }
      }

  return p;
}


void CEnvelope::clear()
{
  for (int i = 0; i < points.size(); i++)
       delete points[i];

  points.clear();
}


void CEnvelope::select_point (CEnvelopePoint *e)
{
//  foreach (CEnvelopePoint *t, points)
  for (auto *t: points)
          {
           t->selected = false;
          }

   e->selected = true;
}


CEnvelope::~CEnvelope()
{
  for (int i = 0; i < points.size(); i++)
     delete points[i];
}


void CEnvelope::insert_wise (int x, int y, int height, size_t maximum)
{
  CEnvelopePoint *e = new CEnvelopePoint;

  e->position_frames = x;

  if (points.size() == 0)
     e->value = 50;
  else
      e->value = get_percent (height, (float)y);

  if (points.size() == 0)
     {
      CEnvelopePoint *point_start = new CEnvelopePoint;

      point_start->position_frames = 0;
      point_start->value = 50.0f;

      CEnvelopePoint *point_end = new CEnvelopePoint;

      point_end->position_frames = maximum;
      point_end->value = 50.0f;

      points.append (point_start);
      points.append (e);
      points.append (point_end);

      std::stable_sort  (points.begin(), points.end(), comp_ep);

      return;
     }

  //is there duplicated position? if yes, replace it with a new item
  for (int i = 0; i < points.size(); i++)
      {
       if (e->position_frames == points[i]->position_frames)
          {
           delete points[i];
           points.removeAt (i);
           break;
          }
      }

  points << e;

  std::stable_sort (points.begin(), points.end(), comp_ep);

  int idx = points.indexOf (e);

  if (idx == 1)
      points[0]->value = e->value;

  if (idx == points.size() - 2)
      points[points.size()-1]->value = e->value;
}


void CEnvelope::point_move (CEnvelopePoint *p, int x, int y, int height)
{
  if (! p)
     return;

  int idx = points.indexOf (p);

  if ((idx != points.size() - 1) && (idx != 0))
     {
      p->position_frames = x;
      p->value = get_percent (height, (float)y);
     }
  else
      p->value = get_percent (height, (float)y);


  //if (idx == 1)
    //  points[0]->value = p->value;


  if (idx == points.size() - 2)
      points[points.size() - 1]->value = p->value;

  std::stable_sort (points.begin(), points.end(), comp_ep);
}