File: queue.h

package info (click to toggle)
mixviews 1.20-10.1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 2,928 kB
  • ctags: 5,960
  • sloc: cpp: 32,879; ansic: 2,110; makefile: 445; sh: 17
file content (71 lines) | stat: -rw-r--r-- 1,897 bytes parent folder | download | duplicates (4)
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
// queue.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.
 *
 ******************************************************************************/


// FIFO queue implementation used for QueuedOutputFunction class.

#ifndef QUEUE_H
#ifdef __GNUG__
#pragma interface
#endif
#define QUEUE_H

#include "buffer.h"

class Queue : public Buffer {
	typedef Buffer Super;
public:
	Queue(int size);
	redefined void reset();
	void setQueueSize(int len);
	Queue& addTo(double value);
	double takeFrom();
	boolean full();
	boolean empty();
protected:
	int currentQueue;
};

inline boolean
Queue::full() { return currentQueue == maxQueue; }

inline boolean
Queue::empty() { return currentQueue == 0; }

inline Queue&
Queue::addTo(double value) {
	*inputPointer = value;
	incrementInput();
	currentQueue++;
	return *this;
}

inline double
Queue::takeFrom() {
	incrementOutput();
	currentQueue--;
	return *outputPointer;
}

#endif