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
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
|
/* gee-1.0.vapi generated by valac 0.18.0, do not modify. */
[CCode (gir_namespace = "Gee", gir_version = "1.0")]
namespace Gee {
namespace Functions {
[CCode (cheader_filename = "gee.h")]
public static GLib.CompareFunc get_compare_func_for (GLib.Type t);
[CCode (cheader_filename = "gee.h")]
public static GLib.EqualFunc get_equal_func_for (GLib.Type t);
[CCode (cheader_filename = "gee.h")]
public static GLib.HashFunc get_hash_func_for (GLib.Type t);
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractCollection<G> : GLib.Object, Gee.Iterable<G>, Gee.Collection<G> {
public AbstractCollection ();
public abstract bool add (G item);
public virtual bool add_all (Gee.Collection<G> collection);
public abstract void clear ();
public abstract bool contains (G item);
public virtual bool contains_all (Gee.Collection<G> collection);
public abstract Gee.Iterator<G> iterator ();
public abstract bool remove (G item);
public virtual bool remove_all (Gee.Collection<G> collection);
public virtual bool retain_all (Gee.Collection<G> collection);
public virtual G[] to_array ();
public virtual bool is_empty { get; }
public virtual Gee.Collection<G> read_only_view { owned get; }
public abstract int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractList<G> : Gee.AbstractCollection<G>, Gee.List<G> {
public AbstractList ();
public virtual G first ();
public abstract new G @get (int index);
public abstract int index_of (G item);
public abstract void insert (int index, G item);
public virtual void insert_all (int index, Gee.Collection<G> collection);
public virtual G last ();
public abstract Gee.ListIterator<G> list_iterator ();
public abstract G remove_at (int index);
public abstract new void @set (int index, G item);
public abstract Gee.List<G>? slice (int start, int stop);
public virtual Gee.List<G> read_only_view { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractMap<K,V> : GLib.Object, Gee.Iterable<Gee.Map.Entry<K,V>>, Gee.Map<K,V> {
public AbstractMap ();
public abstract void clear ();
public abstract new V @get (K key);
public abstract bool has (K key, V value);
public virtual bool has_all (Gee.Map<K,V> map);
public abstract bool has_key (K key);
public abstract Gee.MapIterator<K,V> map_iterator ();
public abstract new void @set (K key, V value);
public virtual void set_all (Gee.Map<K,V> map);
public abstract bool unset (K key, out V value = null);
public virtual bool unset_all (Gee.Map<K,V> map);
public abstract Gee.Set<Gee.Map.Entry<K,V>> entries { owned get; }
public virtual bool is_empty { get; }
public abstract Gee.Set<K> keys { owned get; }
public virtual Gee.Map<K,V> read_only_view { owned get; }
public abstract int size { get; }
public abstract Gee.Collection<V> values { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractMultiMap<K,V> : GLib.Object, Gee.MultiMap<K,V> {
protected Gee.Map<K,Gee.Collection<V>> _storage_map;
public AbstractMultiMap (Gee.Map<K,Gee.Collection<V>> storage_map);
protected abstract Gee.MultiSet<K> create_multi_key_set ();
protected abstract Gee.Collection<V> create_value_storage ();
protected abstract GLib.EqualFunc get_value_equal_func ();
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractMultiSet<G> : Gee.AbstractCollection<G>, Gee.MultiSet<G> {
protected Gee.Map<G,int> _storage_map;
public AbstractMultiSet (Gee.Map<G,int> storage_map);
public override bool add (G item);
public override void clear ();
public override bool contains (G item);
public override Gee.Iterator<G> iterator ();
public override bool remove (G item);
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractQueue<G> : Gee.AbstractCollection<G>, Gee.Queue<G> {
public AbstractQueue ();
public abstract int drain (Gee.Collection<G> recipient, int amount = -1);
public abstract bool offer (G element);
public abstract G peek ();
public abstract G poll ();
public abstract int capacity { get; }
public abstract bool is_full { get; }
public abstract int remaining_capacity { get; }
}
[CCode (cheader_filename = "gee.h")]
public abstract class AbstractSet<G> : Gee.AbstractCollection<G>, Gee.Set<G> {
public AbstractSet ();
public virtual Gee.Set<G> read_only_view { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public class ArrayList<G> : Gee.AbstractList<G> {
public ArrayList (GLib.EqualFunc? equal_func = null);
public override bool add (G item);
public override bool add_all (Gee.Collection<G> collection);
public override void clear ();
public override bool contains (G item);
public override G @get (int index);
public override int index_of (G item);
public override void insert (int index, G item);
public override Gee.Iterator<G> iterator ();
public override Gee.ListIterator<G> list_iterator ();
public override bool remove (G item);
public override G remove_at (int index);
public override void @set (int index, G item);
public override Gee.List<G>? slice (int start, int stop);
public void sort_with_data (GLib.CompareDataFunc compare);
public GLib.EqualFunc equal_func { get; private set; }
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public class HashMap<K,V> : Gee.AbstractMap<K,V> {
public HashMap (GLib.HashFunc? key_hash_func = null, GLib.EqualFunc? key_equal_func = null, GLib.EqualFunc? value_equal_func = null);
public override void clear ();
public override V @get (K key);
public override bool has (K key, V value);
public override bool has_key (K key);
public override Gee.MapIterator<K,V> map_iterator ();
public override void @set (K key, V value);
public override bool unset (K key, out V value = null);
public override Gee.Set<Gee.Map.Entry<K,V>> entries { owned get; }
public GLib.EqualFunc key_equal_func { get; private set; }
public GLib.HashFunc key_hash_func { get; private set; }
public override Gee.Set<K> keys { owned get; }
public override int size { get; }
public GLib.EqualFunc value_equal_func { get; private set; }
public override Gee.Collection<V> values { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public class HashMultiMap<K,V> : Gee.AbstractMultiMap<K,V> {
public HashMultiMap (GLib.HashFunc? key_hash_func = null, GLib.EqualFunc? key_equal_func = null, GLib.HashFunc? value_hash_func = null, GLib.EqualFunc? value_equal_func = null);
protected override Gee.MultiSet<K> create_multi_key_set ();
protected override Gee.Collection<V> create_value_storage ();
protected override GLib.EqualFunc get_value_equal_func ();
public GLib.EqualFunc key_equal_func { get; }
public GLib.HashFunc key_hash_func { get; }
public GLib.EqualFunc value_equal_func { get; private set; }
public GLib.HashFunc value_hash_func { get; private set; }
}
[CCode (cheader_filename = "gee.h")]
public class HashMultiSet<G> : Gee.AbstractMultiSet<G> {
public HashMultiSet (GLib.HashFunc? hash_func = null, GLib.EqualFunc? equal_func = null);
public GLib.EqualFunc equal_func { get; }
public GLib.HashFunc hash_func { get; }
}
[CCode (cheader_filename = "gee.h")]
public class HashSet<G> : Gee.AbstractSet<G> {
public HashSet (GLib.HashFunc? hash_func = null, GLib.EqualFunc? equal_func = null);
public override bool add (G key);
public override void clear ();
public override bool contains (G key);
public override Gee.Iterator<G> iterator ();
public override bool remove (G key);
public GLib.EqualFunc equal_func { get; private set; }
public GLib.HashFunc hash_func { get; private set; }
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public class LinkedList<G> : Gee.AbstractList<G>, Gee.Queue<G>, Gee.Deque<G> {
public LinkedList (GLib.EqualFunc? equal_func = null);
public override bool add (G item);
public override void clear ();
public override bool contains (G item);
public override G first ();
public override G @get (int index);
public override int index_of (G item);
public override void insert (int index, G item);
public override Gee.Iterator<G> iterator ();
public override G last ();
public override Gee.ListIterator<G> list_iterator ();
public override bool remove (G item);
public override G remove_at (int index);
public override void @set (int index, G item);
public override Gee.List<G>? slice (int start, int stop);
public GLib.EqualFunc equal_func { get; private set; }
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public class PriorityQueue<G> : Gee.AbstractQueue<G> {
public PriorityQueue (GLib.CompareFunc? compare_func = null);
public override bool add (G item);
public override void clear ();
public override bool contains (G item);
public override int drain (Gee.Collection<G> recipient, int amount = -1);
public override Gee.Iterator<G> iterator ();
public override bool offer (G element);
public override G peek ();
public override G poll ();
public override bool remove (G item);
public override int capacity { get; }
public GLib.CompareFunc compare_func { get; private set; }
public override bool is_full { get; }
public override int remaining_capacity { get; }
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public class TreeMap<K,V> : Gee.AbstractMap<K,V> {
public TreeMap (GLib.CompareFunc? key_compare_func = null, GLib.EqualFunc? value_equal_func = null);
public override void clear ();
public override V @get (K key);
public override bool has (K key, V value);
public override bool has_key (K key);
public override Gee.MapIterator<K,V> map_iterator ();
public override void @set (K key, V value);
public override bool unset (K key, out V value = null);
public override Gee.Set<Gee.Map.Entry<K,V>> entries { owned get; }
public GLib.CompareFunc key_compare_func { get; private set; }
public override Gee.Set<K> keys { owned get; }
public override int size { get; }
public GLib.EqualFunc value_equal_func { get; private set; }
public override Gee.Collection<V> values { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public class TreeMultiMap<K,V> : Gee.AbstractMultiMap<K,V> {
public TreeMultiMap (GLib.CompareFunc? key_compare_func = null, GLib.CompareFunc? value_compare_func = null);
protected override Gee.MultiSet<K> create_multi_key_set ();
protected override Gee.Collection<V> create_value_storage ();
protected override GLib.EqualFunc get_value_equal_func ();
public GLib.CompareFunc key_compare_func { get; }
public GLib.CompareFunc value_compare_func { get; private set; }
}
[CCode (cheader_filename = "gee.h")]
public class TreeMultiSet<G> : Gee.AbstractMultiSet<G> {
public TreeMultiSet (GLib.CompareFunc? compare_func = null);
public GLib.CompareFunc compare_func { get; }
}
[CCode (cheader_filename = "gee.h")]
public class TreeSet<G> : Gee.AbstractSet<G>, Gee.SortedSet<G> {
public TreeSet (GLib.CompareFunc? compare_func = null);
public override bool add (G item);
public override void clear ();
public override bool contains (G item);
public override Gee.Iterator<G> iterator ();
public override bool remove (G item);
public GLib.CompareFunc compare_func { get; private set; }
public override int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public interface BidirIterator<G> : Gee.Iterator<G> {
public abstract bool has_previous ();
public abstract bool last ();
public abstract bool previous ();
}
[CCode (cheader_filename = "gee.h")]
public interface Collection<G> : Gee.Iterable<G> {
public abstract bool add (G item);
public abstract bool add_all (Gee.Collection<G> collection);
public abstract void clear ();
public abstract bool contains (G item);
public abstract bool contains_all (Gee.Collection<G> collection);
public static Gee.Collection<G> empty<G> ();
public abstract bool remove (G item);
public abstract bool remove_all (Gee.Collection<G> collection);
public abstract bool retain_all (Gee.Collection<G> collection);
public abstract G[] to_array ();
public abstract bool is_empty { get; }
public abstract Gee.Collection<G> read_only_view { owned get; }
public abstract int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public interface Comparable<G> : GLib.Object {
public abstract int compare_to (G object);
}
[CCode (cheader_filename = "gee.h")]
public interface Deque<G> : Gee.Queue<G> {
public abstract int drain_head (Gee.Collection<G> recipient, int amount = -1);
public abstract int drain_tail (Gee.Collection<G> recipient, int amount = -1);
public abstract bool offer_head (G element);
public abstract bool offer_tail (G element);
public abstract G peek_head ();
public abstract G peek_tail ();
public abstract G poll_head ();
public abstract G poll_tail ();
}
[CCode (cheader_filename = "gee.h")]
public interface Iterable<G> : GLib.Object {
public abstract Gee.Iterator<G> iterator ();
public abstract GLib.Type element_type { get; }
}
[CCode (cheader_filename = "gee.h")]
public interface Iterator<G> : GLib.Object {
public abstract bool first ();
public abstract G @get ();
public abstract bool has_next ();
public abstract bool next ();
public abstract void remove ();
}
[CCode (cheader_filename = "gee.h")]
public interface List<G> : Gee.Collection<G> {
public static Gee.List<G> empty<G> ();
public abstract G first ();
public abstract G @get (int index);
public abstract int index_of (G item);
public abstract void insert (int index, G item);
public abstract void insert_all (int index, Gee.Collection<G> collection);
public abstract G last ();
public abstract new Gee.ListIterator<G> list_iterator ();
public abstract G remove_at (int index);
public abstract void @set (int index, G item);
public abstract Gee.List<G>? slice (int start, int stop);
public abstract void sort (GLib.CompareFunc? compare_func = null);
public abstract Gee.List<G> read_only_view { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public interface ListIterator<G> : Gee.BidirIterator<G> {
public abstract void add (G item);
public abstract int index ();
public abstract void insert (G item);
public abstract void @set (G item);
}
[CCode (cheader_filename = "gee.h")]
public interface Map<K,V> : GLib.Object, Gee.Iterable<Gee.Map.Entry<K,V>> {
public abstract class Entry<K,V> : GLib.Object {
public Entry ();
public abstract K key { get; }
public abstract V value { get; set; }
}
public abstract void clear ();
[Deprecated]
public abstract bool contains (K key);
[Deprecated]
public abstract bool contains_all (Gee.Map<K,V> map);
public static Gee.Map<K,V> empty<K,V> ();
public abstract V @get (K key);
public abstract bool has (K key, V value);
public abstract bool has_all (Gee.Map<K,V> map);
public abstract bool has_key (K key);
public abstract Gee.MapIterator<K,V> map_iterator ();
[Deprecated]
public abstract bool remove (K key, out V value = null);
[Deprecated]
public abstract bool remove_all (Gee.Map<K,V> map);
public abstract void @set (K key, V value);
public abstract void set_all (Gee.Map<K,V> map);
public abstract bool unset (K key, out V value = null);
public abstract bool unset_all (Gee.Map<K,V> map);
public abstract Gee.Set<Gee.Map.Entry<K,V>> entries { owned get; }
public abstract bool is_empty { get; }
public abstract GLib.Type key_type { get; }
public abstract Gee.Set<K> keys { owned get; }
public abstract Gee.Map<K,V> read_only_view { owned get; }
public abstract int size { get; }
public abstract GLib.Type value_type { get; }
public abstract Gee.Collection<V> values { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public interface MapIterator<K,V> : GLib.Object {
public abstract bool first ();
public abstract K get_key ();
public abstract V get_value ();
public abstract bool has_next ();
public abstract bool next ();
public abstract void set_value (V value);
public abstract void unset ();
}
[CCode (cheader_filename = "gee.h")]
public interface MultiMap<K,V> : GLib.Object {
public abstract void clear ();
public abstract bool contains (K key);
public abstract Gee.Collection<V> @get (K key);
public abstract Gee.MultiSet<K> get_all_keys ();
public abstract Gee.Set<K> get_keys ();
public abstract Gee.Collection<V> get_values ();
public abstract bool remove (K key, V value);
public abstract bool remove_all (K key);
public abstract void @set (K key, V value);
public abstract int size { get; }
}
[CCode (cheader_filename = "gee.h")]
public interface MultiSet<G> : Gee.Collection<G> {
public abstract int count (G item);
}
[CCode (cheader_filename = "gee.h")]
public interface Queue<G> : Gee.Collection<G> {
public const int UNBOUNDED_CAPACITY;
public abstract int drain (Gee.Collection<G> recipient, int amount = -1);
public abstract bool offer (G element);
public abstract G peek ();
public abstract G poll ();
public abstract int capacity { get; }
public abstract bool is_full { get; }
public abstract int remaining_capacity { get; }
}
[CCode (cheader_filename = "gee.h")]
public interface Set<G> : Gee.Collection<G> {
public static Gee.Set<G> empty<G> ();
public abstract Gee.Set<G> read_only_view { owned get; }
}
[CCode (cheader_filename = "gee.h")]
public interface SortedSet<G> : Gee.Set<G> {
public abstract Gee.BidirIterator<G> bidir_iterator ();
public abstract G ceil (G element);
public abstract G first ();
public abstract G floor (G element);
public abstract Gee.SortedSet<G> head_set (G before);
public abstract G higher (G element);
public abstract Gee.BidirIterator<G>? iterator_at (G element);
public abstract G last ();
public abstract G lower (G element);
public abstract Gee.SortedSet<G> sub_set (G from, G to);
public abstract Gee.SortedSet<G> tail_set (G after);
}
[CCode (cheader_filename = "gee.h")]
public static int direct_compare (void* _val1, void* _val2);
}
|
