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
|
%module template_typedef_rec
%inline %{
// --- includes required to compile the wrapper code ---
typedef size_t MY_sizeT;
typedef long MY_intT;
typedef double MY_floatT;
class test_Array
{
public:
typedef MY_intT intT;
typedef MY_sizeT sizeT;
};
template <typename T>
class ArrayIterator_
{
public:
typedef test_Array::intT intT;
};
template <typename T>
class ArrayReverseIterator
{
public:
typedef test_Array::intT intT;
};
template <typename T>
class ArrayPrimitiveT
: public test_Array
{
public:
typedef T ValueT;
typedef T valueT;
typedef ArrayIterator_<T> Iterator;
typedef ArrayIterator_<const T> ConstIterator;
typedef ArrayReverseIterator<T> ReverseIterator;
typedef ArrayReverseIterator<const T> ConstReverseIterator;
};
template <class T>
class TreeNode
{
public:
typedef T ValueT;
typedef T valueT;
typedef MY_intT intT;
typedef MY_sizeT sizeT;
};
template <class T>
struct ArrayPointerT
{
};
template <class T>
class TreeIterator
{
public:
typedef MY_intT intT;
typedef MY_sizeT sizeT;
typedef ArrayPointerT< T* > NodeArrayT;
};
template <class T>
class Tree
{
public:
typedef T ValueT;
typedef T valueT;
typedef MY_intT intT;
typedef MY_sizeT sizeT;
typedef TreeNode<T> NodeT;
typedef ArrayPointerT< NodeT* > NodeArrayT;
typedef TreeIterator<NodeT> Iterator;
typedef TreeIterator<NodeT> ConstIterator;
};
class ModelNode
{
typedef MY_intT intT;
typedef MY_floatT floatT;
typedef MY_sizeT sizeT;
};
class Model
{
typedef MY_intT intT;
typedef MY_sizeT sizeT;
typedef Tree<ModelNode> TreeT;
typedef TreeT::NodeT TreeNodeT;
typedef TreeT::Iterator TreeIteratorT;
};
%}
// --- define ANSI C/C++ declarations to be interfaced ---
%template(ModelTree) Tree<ModelNode>;
|
