File: example.h

package info (click to toggle)
renderdoc 1.27%2Bdfsg-1
  • links: PTS, VCS
  • area: non-free
  • in suites: sid
  • size: 107,796 kB
  • sloc: cpp: 763,519; ansic: 326,847; python: 26,946; xml: 23,189; java: 11,382; cs: 7,181; makefile: 6,707; yacc: 5,682; ruby: 4,648; perl: 3,461; sh: 2,381; php: 2,119; lisp: 1,835; javascript: 1,525; tcl: 1,068; ml: 747
file content (54 lines) | stat: -rw-r--r-- 1,080 bytes parent folder | download | duplicates (13)
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
/* File : example.h */

// A simple exception
class EmptyError { };
class FullError { 
 public:
  int maxsize;
  FullError(int m) : maxsize(m) { }
};

#if defined(_MSC_VER)
  #pragma warning(disable: 4290) // C++ exception specification ignored except to indicate a function is not __declspec(nothrow)
#endif

template<typename T> class Queue {
  int maxsize;
  T   *items;
  int nitems;
  int last;
 public: 
  Queue(int size) {
    maxsize = size;
    items = new T[size];
    nitems = 0;
    last = 0;
  }
  ~Queue() {
    delete [] items;
  }
  void enqueue(T x) throw(FullError) {
    if (nitems == maxsize) {
      throw FullError(maxsize);
    }
    items[last] = x;
    last = (last + 1) % maxsize;
    nitems++;
  }
  T dequeue()  {
    T x;
    if (nitems == 0) throw EmptyError();
    x = items[(last + maxsize - nitems) % maxsize];
    nitems--;
    return x;
  }
  int length() {
    return nitems;
  }
};


#if defined(_MSC_VER)
  #pragma warning(default: 4290) // C++ exception specification ignored except to indicate a function is not __declspec(nothrow)
#endif