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
|
// delay.h
/******************************************************************************
*
* MiXViews - an X window system based sound & data editor/processor
*
* Copyright (c) 1993, 1994 Regents of the University of California
*
* Author: Douglas Scott
* Date: December 13, 1994
*
* Permission to use, copy and modify this software and its documentation
* for research and/or educational purposes and without fee is hereby granted,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation. The author reserves the right to distribute this
* software and its documentation. The University of California and the author
* make no representations about the suitability of this software for any
* purpose, and in no event shall University of California be liable for any
* damage, loss of data, or profits resulting from its use.
* It is provided "as is" without express or implied warranty.
*
******************************************************************************/
// The Delay class is an implementation of a simple pipe delay with a transfer
// function f(x) = f(x-n), where 'n' is variable from 0 - whatever.
#ifndef DELAY_H
#ifdef __GNUG__
#pragma interface
#endif
#define DELAY_H
#include "localdefs.h"
#include "processfun.h"
class Request;
class Delay : public SimpleFunction {
typedef SimpleFunction Super;
public:
Delay(Data* output, int nsamps);
Delay(Data* output);
static Modifier* create(class DataEditor*);
virtual ~Delay();
redefined double operator () (double input);
redefined void restoreState();
redefined const char* message() { return "Adding delay..."; }
redefined Modifier* createUnDo();
protected:
friend class CombFilter;
redefined Requester* createRequester();
redefined void initialize();
int wrap(int val);
void increment() { counter = (counter + 1) % stackSize; }
void push(double top);
double getPast(int delayed);
double getPast(void);
private:
void clear();
private:
double *stack;
int counter;
int stackSize;
int stackMax;
};
inline int
Delay::wrap(int val) {
return (val < 0) ? val + stackSize :
(val >= stackSize) ? val - stackSize : val;
}
inline void
Delay::push(double top) { stack[counter] = top; }
inline double
Delay::getPast(int delayed) { return stack[wrap(counter - delayed)]; }
inline double
Delay::getPast(void) { return stack[wrap(counter - stackMax)]; }
#endif
|
