games/netpanzer/files/patch-src-Lib-ArrayUtil-QueueTemplate.hpp


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

--- src/Lib/ArrayUtil/QueueTemplate.hpp.orig    Sun Dec 21 01:48:03 2003
+++ src/Lib/ArrayUtil/QueueTemplate.hpp Thu Aug 19 16:34:31 2004
@@ -42,8 +42,8 @@
 
     bool enqueue(const TYPE& object )
     {
-        add( object, (rear + 1) % size );
-        rear = (rear + 1) % size;
+        add( object, (rear + 1) % this->size );
+        rear = (rear + 1) % this->size;
 
         if ( front == rear )
             return( false );
@@ -55,29 +55,29 @@
     {
         assert( front != rear );
 
-        front = ( front + 1 ) % size;
-        return( array[ front ] );
+        front = ( front + 1 ) % this->size;
+        return( this->array[ front ] );
     }
 
     void pop()
     {
         assert( front != rear );
 
-        front = ( front + 1 ) % size;
+        front = ( front + 1 ) % this->size;
     }
 
     TYPE getFirst()
     {
         assert( front != rear );
 
-        return( array[ (( front + 1 ) % size) ] );
+        return( this->array[ (( front + 1 ) % this->size) ] );
     }
 
     TYPE * getFirstPtr()
     {
         assert( front != rear );
 
-        return( &(array[ (( front + 1 ) % size) ]) );
+        return( &(this->array[ (( front + 1 ) % this->size) ]) );
     }
 
 
@@ -88,7 +88,7 @@
 
     bool isFull () const
     {
-        return front == (rear + 1) % size;
+        return front == (rear + 1) % this->size;
     }
 
     bool isReady() const
@@ -99,7 +99,7 @@
     unsigned long itemCount() const
     {
         if ( front > rear )
-            return ( (rear+1) + ( (size-1) - front ) );
+            return ( (rear+1) + ( (this->size-1) - front ) );
         else
             return ( rear - front );
     }