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
|
/*
Copyright (C) 1997,1998 Shigeru Chiba, University of Tsukuba.
Permission to use, copy, distribute and modify this software and
its documentation for any purpose is hereby granted without fee,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation.
Shigeru Chiba makes no representations about the suitability of this
software for any purpose. It is provided "as is" without express or
implied warranty.
July 1997: rewritten by Toru Takimoto for version 2.5.
*/
/*
Copyright (c) 1995, 1996 Xerox Corporation.
All Rights Reserved.
Use and copying of this software and preparation of derivative works
based upon this software are permitted. Any copy of this software or
of any derivative work must include the above copyright notice of
Xerox Corporation, this paragraph and the one after it. Any
distribution of this software or derivative works must comply with all
applicable United States export control laws.
This software is made available AS IS, and XEROX CORPORATION DISCLAIMS
ALL WARRANTIES, EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE, AND NOTWITHSTANDING ANY OTHER PROVISION CONTAINED HEREIN, ANY
LIABILITY FOR DAMAGES RESULTING FROM THE SOFTWARE OR ITS USE IS
EXPRESSLY DISCLAIMED, WHETHER ARISING IN CONTRACT, TORT (INCLUDING
NEGLIGENCE) OR STRICT LIABILITY, EVEN IF XEROX CORPORATION IS ADVISED
OF THE POSSIBILITY OF SUCH DAMAGES.
*/
#include <stdio.h>
metaclass BeforeClass Queue;
const SIZE = 8;
class Queue {
public:
Queue(){ i = 0; }
void Put(int);
void before_Put();
int Peek();
private:
int buffer[SIZE];
int i;
};
void Queue::Put(int x)
{
puts("Put() is invoked.");
buffer[i++ % SIZE] = x;
}
// before_Put() should be automatically invoked before Put() is invoked.
void Queue::before_Put()
{
puts("before_Put() is invoked.");
puts("synchronize... suspend the thread while the buffer is full.");
}
int Queue::Peek()
{
puts("Peek() is invoked.");
return buffer[(i - 1) % SIZE];
}
void main()
{
Queue q;
puts("call q.Put(3)");
q.Put(3);
puts("call q.Peek(3)");
int k = q.Peek();
}
|
