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
|
// Programmed by Jedidiah Barber
// Released into the public domain
#include <FL/Fl_Valuator.H>
#include "c_fl_valuator.h"
// Exports from Ada
extern "C" void widget_draw_hook(void * ud);
extern "C" int widget_handle_hook(void * ud, int e);
// Non-friend protected access
class Friend_Valuator : Fl_Valuator {
public:
using Fl_Valuator::value_damage;
};
// Attaching all relevant hooks and friends
class My_Valuator : public Fl_Valuator {
public:
using Fl_Valuator::Fl_Valuator;
friend VALUATOR new_fl_valuator(int x, int y, int w, int h, char* label);
friend void fl_valuator_draw(VALUATOR v);
friend int fl_valuator_handle(VALUATOR v, int e);
void draw();
int handle(int e);
};
void My_Valuator::draw() {
widget_draw_hook(this->user_data());
}
int My_Valuator::handle(int e) {
return widget_handle_hook(this->user_data(), e);
}
// Flattened C API
VALUATOR new_fl_valuator(int x, int y, int w, int h, char* label) {
My_Valuator *v = new My_Valuator(x, y, w, h, label);
return v;
}
void free_fl_valuator(VALUATOR v) {
delete reinterpret_cast<My_Valuator*>(v);
}
double fl_valuator_clamp(VALUATOR v, double a) {
return reinterpret_cast<Fl_Valuator*>(v)->clamp(a);
}
double fl_valuator_round(VALUATOR v, double a) {
return reinterpret_cast<Fl_Valuator*>(v)->round(a);
}
double fl_valuator_increment(VALUATOR v, double a, int s) {
return reinterpret_cast<Fl_Valuator*>(v)->increment(a,s);
}
double fl_valuator_get_minimum(VALUATOR v) {
return reinterpret_cast<Fl_Valuator*>(v)->minimum();
}
void fl_valuator_set_minimum(VALUATOR v, double t) {
reinterpret_cast<Fl_Valuator*>(v)->minimum(t);
}
double fl_valuator_get_maximum(VALUATOR v) {
return reinterpret_cast<Fl_Valuator*>(v)->maximum();
}
void fl_valuator_set_maximum(VALUATOR v, double t) {
reinterpret_cast<Fl_Valuator*>(v)->maximum(t);
}
double fl_valuator_get_step(VALUATOR v) {
return reinterpret_cast<Fl_Valuator*>(v)->step();
}
void fl_valuator_set_step_top(VALUATOR v, double t) {
reinterpret_cast<Fl_Valuator*>(v)->step(t);
}
void fl_valuator_set_step_bottom(VALUATOR v, int b) {
reinterpret_cast<Fl_Valuator*>(v)->step(b);
}
void fl_valuator_set_step(VALUATOR v, double t, int b) {
reinterpret_cast<Fl_Valuator*>(v)->step(t, b);
}
double fl_valuator_get_value(VALUATOR v) {
return reinterpret_cast<Fl_Valuator*>(v)->value();
}
void fl_valuator_set_value(VALUATOR v, double t) {
reinterpret_cast<Fl_Valuator*>(v)->value(t);
}
void fl_valuator_bounds(VALUATOR v, double a, double b) {
reinterpret_cast<Fl_Valuator*>(v)->bounds(a,b);
}
void fl_valuator_precision(VALUATOR v, int s) {
reinterpret_cast<Fl_Valuator*>(v)->precision(s);
}
void fl_valuator_range(VALUATOR v, double a, double b) {
reinterpret_cast<Fl_Valuator*>(v)->range(a,b);
}
void fl_valuator_value_damage(VALUATOR v) {
(reinterpret_cast<Fl_Valuator*>(v)->*(&Friend_Valuator::value_damage))();
}
void fl_valuator_draw(VALUATOR v) {
// The Fl_Valuator draw method doesn't technically exist, so...
(void)(v);
// It is more convenient for this function to exist, however,
// even though it will likely never be called, because it simplifies
// and makes uniform the implementation of the Ada Valuator Draw subprogram.
}
int fl_valuator_handle(VALUATOR v, int e) {
return reinterpret_cast<My_Valuator*>(v)->Fl_Valuator::handle(e);
}
|
