31
|
1 |
|
|
2 |
// STLport regression testsuite component.
|
|
3 |
// To compile as a separate example, please #define MAIN.
|
|
4 |
|
|
5 |
#include <iostream>
|
|
6 |
#include <algorithm>
|
|
7 |
#include <iterator>
|
|
8 |
#include <memory>
|
|
9 |
|
|
10 |
#ifdef MAIN
|
|
11 |
#define rawiter_test main
|
|
12 |
#endif
|
|
13 |
|
|
14 |
#include "rawiter.hpp"
|
|
15 |
|
|
16 |
#if !defined (STLPORT) || defined(__STL_USE_NAMESPACES)
|
|
17 |
using namespace std;
|
|
18 |
#endif
|
|
19 |
|
|
20 |
int rawiter_test(int, char**)
|
|
21 |
{
|
|
22 |
cout<<"Results of rawiter_test:"<<endl;
|
|
23 |
|
|
24 |
allocator<X> a;
|
|
25 |
typedef X* x_pointer;
|
|
26 |
x_pointer save_p, p;
|
|
27 |
int array[5];
|
|
28 |
int failures = 0;
|
|
29 |
p = a.allocate(5);
|
|
30 |
save_p=p;
|
|
31 |
raw_storage_iterator<X*, X> r(p);
|
|
32 |
int i;
|
|
33 |
for(i = 0; i < 5; i++)
|
|
34 |
*r++ = X(i);
|
|
35 |
for(i = 0; i < 5; i++)
|
|
36 |
{
|
|
37 |
cout << *p << endl;
|
|
38 |
array[i] = *p;
|
|
39 |
*p++;
|
|
40 |
}
|
|
41 |
# ifdef __STLPORT_VERSION
|
|
42 |
a.deallocate(save_p,5);
|
|
43 |
# else
|
|
44 |
a.deallocate(save_p);
|
|
45 |
# endif
|
|
46 |
|
|
47 |
if(array[0] != 0 )
|
|
48 |
failures++;
|
|
49 |
if(array[1] != 1)
|
|
50 |
failures++;
|
|
51 |
if(array[2] != 2)
|
|
52 |
failures++;
|
|
53 |
if(array[3] != 3)
|
|
54 |
failures++;
|
|
55 |
if(array[4] != 4)
|
|
56 |
failures++;
|
|
57 |
|
|
58 |
return failures;
|
|
59 |
}
|