rute 0.0.4

UI library implemented on top of Qt
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

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// This file is auto-generated by rute_gen. DO NOT EDIT
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

#include "../rute_base.h"
#include "../rute_manual.h"
#include <QPolygonF>
#include "polygon_f_ffi.h"

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static void polygon_f_swap(struct RUBase* self_c, struct RUBase* other) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    qt_value->swap(*((QPolygonF*)other));
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static struct RUPolygon polygon_f_to_polygon(struct RUBase* self_c) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->toPolygon();
    WRPolygon* new_val = new WRPolygon();
    *new_val = ret_value;
    struct RUPolygon ctl;
    ctl.qt_data = (struct RUBase*)new_val;
    ctl.host_data = (struct RUBase*)s_host_data_lookup[(void*)new_val];
    ctl.all_funcs = &s_polygon_all_funcs;
    return ctl;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static bool polygon_f_is_closed(struct RUBase* self_c) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->isClosed();
    return ret_value;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static struct RURectF polygon_f_bounding_rect(struct RUBase* self_c) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->boundingRect();
    WRRectF* new_val = new WRRectF();
    *new_val = ret_value;
    struct RURectF ctl;
    ctl.qt_data = (struct RUBase*)new_val;
    ctl.host_data = (struct RUBase*)s_host_data_lookup[(void*)new_val];
    ctl.all_funcs = &s_rect_f_all_funcs;
    return ctl;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static bool polygon_f_contains_point(struct RUBase* self_c, struct RUBase* pt, int fill_rule) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->containsPoint(*((QPointF*)pt), (Qt::FillRule)s_fill_rule_lookup[fill_rule]);
    return ret_value;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static struct RUPolygonF polygon_f_united(struct RUBase* self_c, struct RUBase* r) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->united(*((QPolygonF*)r));
    WRPolygonF* new_val = new WRPolygonF();
    *new_val = ret_value;
    struct RUPolygonF ctl;
    ctl.qt_data = (struct RUBase*)new_val;
    ctl.host_data = (struct RUBase*)s_host_data_lookup[(void*)new_val];
    ctl.all_funcs = &s_polygon_f_all_funcs;
    return ctl;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static struct RUPolygonF polygon_f_intersected(struct RUBase* self_c, struct RUBase* r) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->intersected(*((QPolygonF*)r));
    WRPolygonF* new_val = new WRPolygonF();
    *new_val = ret_value;
    struct RUPolygonF ctl;
    ctl.qt_data = (struct RUBase*)new_val;
    ctl.host_data = (struct RUBase*)s_host_data_lookup[(void*)new_val];
    ctl.all_funcs = &s_polygon_f_all_funcs;
    return ctl;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static bool polygon_f_intersects(struct RUBase* self_c, struct RUBase* r) {
    WRPolygonF* qt_value = (WRPolygonF*)self_c;
    auto ret_value = qt_value->intersects(*((QPolygonF*)r));
    return ret_value;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static struct RUPolygonF create_polygon_f(
    struct RUBase* priv_data,
    RUDeleteCallback delete_callback,
    void* private_user_data)
{
    auto ctl = generic_create_func_with_delete<struct RUPolygonF, WRPolygonF>(priv_data, delete_callback, private_user_data);
    ctl.all_funcs = &s_polygon_f_all_funcs;
    return ctl;
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

static void destroy_polygon_f(struct RUBase* priv_data) {
    destroy_generic<WRPolygonF>(priv_data);
}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

struct RUPolygonFFuncs s_polygon_f_funcs = {
    destroy_polygon_f,
    polygon_f_swap,
    polygon_f_to_polygon,
    polygon_f_is_closed,
    polygon_f_bounding_rect,
    polygon_f_contains_point,
    polygon_f_united,
    polygon_f_intersected,
    polygon_f_intersects,
};

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

struct RUPolygonFAllFuncs s_polygon_f_all_funcs = {
    &s_polygon_f_funcs,
};