summaryrefslogtreecommitdiff
path: root/support/dktools/test-container.cpp
blob: 0bb8e573bd84afa17fcb9752e54550580b09e91b (plain)
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/*
	WARNING: This file was generated by the dkct program (see
	http://dktools.sourceforge.net/ for details).
	Changes you make here will be lost if dkct is run again!
	You should modify the original source and run dkct on it.
	Original source: test-container.cpt
*/


#line 1 "test-container.cpt"



/**	@file	test-container.c	Sorted storage demo.

This program demonstrates how to use the Dk4Comparable and Dk4Container
classes for sorted storage.

*/


#include "dk4conf.h"

#if DK4_HAVE_STDLIB_H
#include <stdlib.h>
#endif
#if DK4_HAVE_UNISTD_H
#include <unistd.h>
#endif
#if DK4_TIME_WITH_SYS_TIME
#include <sys/time.h>
#include <time.h>
#else
#if DK4_HAVE_TIME_H
#include <time.h>
#else
#if DK4_HAVE_SYS_TIME_H
#include <sys/time.h>
#endif
#endif
#endif

#include "Dk4Comparable.h"
#include "Dk4Container.h"

/**	Random numbers to store.
*/
class RandomNumber: public DkTools4::Comparable
{
	private:

		/**	Random number.
		*/

		int i;

	public:

		/**	Constructor.
		*/

		RandomNumber(void);


		/**	Destructor.
		*/

		~RandomNumber();


		/**	Retrieve stored number.
			@return	The stored number.
		*/

		int getNumber() const;


		/**	Compare against some data.
			@param	data	Data to compare against (address of a RandomNumber).
			@param	cr		Comparison criteria (ignored).
			@return	Comparison result.
		*/

		int compareAgainst(void const *data, int cr) const;

};



RandomNumber::RandomNumber(void)
{
	i = rand();
}



RandomNumber::~RandomNumber()
{
	fputs("Destructor for RandomNumber\n", stdout);
}



int
RandomNumber::getNumber() const
{
	return i;
}



int
RandomNumber::compareAgainst(void const *data, int cr) const
{
	int					 back	= 0;
	int					 j;
	RandomNumber const	*pr		= (RandomNumber const *)data;

	j = pr->getNumber();
	if(i > j) {
		back = 1;
	}
	else {
		if(i < j) {
			back = -1;
		}
	}
	return back;
}



int main(int argc, char *argv[])
{
	int		i;
	time_t	timer;
	RandomNumber	*rndn;

	time(&timer);
	srand(timer);
	try {
		DkTools4::Container<RandomNumber>	container(0, true);
		DkTools4::Iterator<RandomNumber>	iterator(container);
		for(i = 0; i < 100; i++) {
			printf("Generate random number %03d\n", i);
			RandomNumber *rndn = new RandomNumber();
			if(!container.add(rndn)) {
				delete rndn ;
			}
		}
		container.reset();
		i = 0;
		while(NULL != (rndn = container.next())) {
			printf("%04d:   %d\n", ++i, rndn->getNumber());
#if 0
			if (50 == i) { throw(std::bad_alloc()); }
#endif
		}
		printf("Pass 2\n");
		iterator.reset();
		while (NULL != (rndn = iterator.next())) {
			printf("%04d:   %d\n", ++i, rndn->getNumber());
		}
	}
	catch(...) {
		printf("Poese Exception beim Container\n");
	}
	return 0;
}



/* vim: set ai sw=4 ts=4 : */