summaryrefslogtreecommitdiffstats
path: root/swig/plist.i
blob: f4e6df4555c9366076b90dabc14a0d66998ddf7a (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
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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
 /* swig.i */
 %module(package="libplist") PList
 %{
 /* Includes the header in the wrapper code */
 #include <plist/plist.h>
typedef struct {
	plist_t node;
} PListNode;
 %}
/* Parse the header file to generate wrappers */
typedef enum {
	PLIST_BOOLEAN,
	PLIST_UINT,
	PLIST_REAL,
	PLIST_STRING,
	PLIST_UNICODE,
	PLIST_ARRAY,
	PLIST_DICT,
	PLIST_DATE,
	PLIST_DATA,
	PLIST_KEY,
	PLIST_NONE
} plist_type;

typedef struct {
	plist_t node;
} PListNode;

%extend PListNode {             // Attach these functions to struct Vector
	PListNode(plist_type t) {
		PListNode* node = NULL;
		switch (t) {
			case PLIST_ARRAY :
				node = (PListNode*) malloc(sizeof(PListNode));
				node->node = plist_new_array();
				break;
			case PLIST_DICT :
				node = (PListNode*) malloc(sizeof(PListNode));
				node->node = plist_new_dict();
				break;
			default :
				node = NULL;
				break;
		}
		return node;
	}

	PListNode(char* xml) {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist_from_xml(xml, strlen(xml), &plist->node);
		return plist;
	}

	PListNode(char* bin, uint64_t len) {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist_from_bin(bin, len, &plist->node);
		return plist;
	}

	~PListNode() {
		plist_free($self->node);
		free($self);
	}

	void AddSubNode(PListNode* subnode) {
		plist_add_sub_node($self->node, subnode);
	}

	void AddSubKey(char* k) {
		plist_add_sub_key_el($self->node, k);
	}

	void AddSubString(char* s) {
		plist_add_sub_string_el($self->node, s);
	}

	void AddSubBool(char b) {
		plist_add_sub_bool_el($self->node, b);
	}

	void AddSubUInt(uint64_t i) {
		plist_add_sub_uint_el($self->node, i);
	}

	void AddSubReal(double d) {
		plist_add_sub_real_el($self->node, d);
	}

	void AddSubData(char* v, uint64_t l) {
		plist_add_sub_data_el($self->node, v, l);
	}

	PListNode* GetFirstChild() {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist_get_first_child(&$self->node);
		return plist;
	}

	PListNode* GetNextSibling() {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist_get_next_sibling(&$self->node);
		return plist;
	}

	PListNode* GetPrevSibling() {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist_get_prev_sibling(&$self->node);
		return plist;
	}

	char* AsKey() {
		char* k = NULL;
		plist_get_key_val($self->node, &k);
		return k;
	}

	char* AsString() {
		char* s = NULL;
		plist_get_string_val($self->node, &s);
		return s;
	}

	char AsBool() {
		char b;
		plist_get_bool_val($self->node, &b);
		return b;
	}

	uint64_t AsUInt() {
		uint64_t i = 0;
		plist_get_uint_val($self->node, &i);
		return i;
	}

	double AsReal() {
		double d = 0;
		plist_get_real_val($self->node, &d);
		return d;
	}

	char* AsData() {
		char* v;
		uint64_t l;
		plist_get_data_val($self->node, &v, &l);
		return v;
	}

	plist_type GetType() {
		return plist_get_node_type($self->node);
	}

	PListNode* FindSubNodeByString(char* s) {
		PListNode* plist = (PListNode*) malloc(sizeof(PListNode));
		plist = plist_find_node_by_string($self->node, s);
		return plist;
	}

	char* ToXml () {
		char* s = NULL;
		uint32_t l;
		plist_to_xml($self->node, &s, &l);
		return s;
	}

	char* ToBin () {
		char* s = NULL;
		uint32_t l;
		plist_to_bin($self->node, &s, &l);
		return s;
	}
};