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
|
//
// File: sort_CompInt_Impl.hh
// Symbol: sort.CompInt-v0.1
// Symbol Type: class
// Babel Version: 0.10.2
// Description: Server-side implementation for sort.CompInt
//
// WARNING: Automatically generated; only changes within splicers preserved
//
// babel-version = 0.10.2
//
#ifndef included_sort_CompInt_Impl_hh
#define included_sort_CompInt_Impl_hh
#ifndef included_sidl_ucxx_hh
#include "sidl_ucxx.hh"
#endif
#ifndef included_sort_CompInt_IOR_h
#include "sort_CompInt_IOR.h"
#endif
#ifndef included_sidl_BaseClass_hh
#include "sidl_BaseClass.hh"
#endif
#ifndef included_sort_CompInt_hh
#include "sort_CompInt.hh"
#endif
#ifndef included_sort_Comparator_hh
#include "sort_Comparator.hh"
#endif
#line 33 "../../../../babel/regression/sort/libUCxx/sort_CompInt_Impl.hh"
// DO-NOT-DELETE splicer.begin(sort.CompInt._includes)
// Put additional includes or other arbitrary code here...
// DO-NOT-DELETE splicer.end(sort.CompInt._includes)
#line 37 "sort_CompInt_Impl.hh"
namespace sort {
/**
* Symbol "sort.CompInt" (version 0.1)
*
* Compare two Integer's. By default, this will sort in increasing order.
*/
class CompInt_impl : public virtual ::ucxx::sort::CompInt
#line 45 "../../../../babel/regression/sort/libUCxx/sort_CompInt_Impl.hh"
// DO-NOT-DELETE splicer.begin(sort.CompInt._inherits)
// Put additional inheritance here...
// DO-NOT-DELETE splicer.end(sort.CompInt._inherits)
#line 51 "sort_CompInt_Impl.hh"
{
// All data marked protected will be accessable by
// descendant Impl classes
protected:
#line 54 "../../../../babel/regression/sort/libUCxx/sort_CompInt_Impl.hh"
// DO-NOT-DELETE splicer.begin(sort.CompInt._implementation)
bool d_increasing;
// DO-NOT-DELETE splicer.end(sort.CompInt._implementation)
#line 62 "sort_CompInt_Impl.hh"
public:
// default constructor, shouldn't be used (required)
CompInt_impl() : StubBase(0,true) { }
// sidl constructor (required)
// Note: alternate Skel constructor doesn't call addref()
// (fixes bug #275)
CompInt_impl( struct sort_CompInt__object * s ) : StubBase(s,
true) { _ctor(); }
// user defined construction
void _ctor();
// virtual destructor (required)
virtual ~CompInt_impl() { _dtor(); }
// user defined destruction
void _dtor();
// static class initializer
static void _load();
public:
/**
* If increasing is true, this will cause the comparator to
* report a normal definition of less than; otherwise, it will
* reverse the normal ordering.
*/
void
setSortIncreasing_impl (
/* in */bool increasing
)
throw ()
;
/**
* This method is used to define an ordering of objects. This method
* will return -1 if i1 < i2, 0 if i1 = i2; and 1 if i1 > i2.
*/
int32_t
compare_impl (
/* in */::ucxx::sidl::BaseInterface i1,
/* in */::ucxx::sidl::BaseInterface i2
)
throw ()
;
}; // end class CompInt_impl
} // end namespace sort
#line 112 "../../../../babel/regression/sort/libUCxx/sort_CompInt_Impl.hh"
// DO-NOT-DELETE splicer.begin(sort.CompInt._misc)
// Put miscellaneous things here...
// DO-NOT-DELETE splicer.end(sort.CompInt._misc)
#line 122 "sort_CompInt_Impl.hh"
#endif
|
