blob: 79a93c10ed1b21628a34175626827a407dff3460 (
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
|
/**
* @file
*
* @brief Smoke test (basically just compile) the unbounded sequences
* for primitive and other self-managed types.
*
* $Id$
*
* @author Carlos O'Ryan
*/
#include "tao/Unbounded_Value_Sequence_T.h"
struct Foo
{
int x;
};
int ACE_TMAIN (int, ACE_TCHAR *[])
{
typedef TAO::unbounded_value_sequence<int> int_sequence;
int_sequence a;
int_sequence b(23);
int_sequence c(32, 0, int_sequence::allocbuf(32), true);
a = b;
a.length(c.maximum());
if (a.release())
{
b.length(a.length());
}
a[0] = 0;
b[0] = a[0];
int_sequence const & d = a;
try
{
c[0] = d[0];
#if defined (TAO_CHECKED_SEQUENCE_INDEXING) && (TAO_CHECKED_SEQUENCE_INDEXING == 1)
return 1;
#endif
}
catch (const ::CORBA::BAD_PARAM &)
{
// c has length = 0, so there is an exception when we try
// to access element above length.
}
b.replace(64, 0, int_sequence::allocbuf(64), true);
int const * x = d.get_buffer();
if (x != 0)
{
int_sequence::freebuf(a.get_buffer(true));
}
x = b.get_buffer();
int_sequence e(c);
typedef TAO::unbounded_value_sequence<Foo> Foo_sequence;
Foo_sequence u;
Foo_sequence v(32);
u = v;
return 0;
}
|