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
|
/* gee.vapi generated by valac, do not modify. */
namespace Vala {
[CCode (cheader_filename = "valagee.h")]
public class ArrayList<G> : Vala.List<G> {
public ArrayList (GLib.EqualFunc<G> equal_func = GLib.direct_equal);
public override bool add (G item);
public override void clear ();
public override bool contains (G item);
public override G @get (int index);
public override GLib.Type get_element_type ();
public override int index_of (G item);
public override void insert (int index, G item);
public override Vala.Iterator<G> iterator ();
public override bool remove (G item);
public override G remove_at (int index);
public override void @set (int index, G item);
public GLib.EqualFunc<G> equal_func { set; }
public override int size { get; }
}
[CCode (cheader_filename = "valagee.h")]
public abstract class Collection<G> : Vala.Iterable<G> {
protected Collection ();
public abstract bool add (G item);
public virtual bool add_all (Vala.Collection<G> collection);
public abstract void clear ();
public abstract bool contains (G item);
public abstract bool remove (G item);
public virtual G[] to_array ();
public virtual bool is_empty { get; }
public abstract int size { get; }
}
[CCode (cheader_filename = "valagee.h")]
public class HashMap<K,V> : Vala.Map<K,V> {
public HashMap (GLib.HashFunc<K> key_hash_func = GLib.direct_hash, GLib.EqualFunc<K> key_equal_func = GLib.direct_equal, GLib.EqualFunc<V> value_equal_func = GLib.direct_equal);
public override void clear ();
public override bool contains (K key);
public override V @get (K key);
public override Vala.Set<K> get_keys ();
public override Vala.Collection<V> get_values ();
public override Vala.MapIterator<K,V> map_iterator ();
public override bool remove (K key);
public override void @set (K key, V value);
public GLib.EqualFunc<K> key_equal_func { set; }
public GLib.HashFunc<K> key_hash_func { set; }
public override int size { get; }
public GLib.EqualFunc<V> value_equal_func { set; }
}
[CCode (cheader_filename = "valagee.h")]
public class HashSet<G> : Vala.Set<G> {
public HashSet (GLib.HashFunc<G> hash_func = GLib.direct_hash, GLib.EqualFunc<G> equal_func = GLib.direct_equal);
public override bool add (G key);
public override void clear ();
public override bool contains (G key);
public override GLib.Type get_element_type ();
public override Vala.Iterator<G> iterator ();
public override bool remove (G key);
public GLib.EqualFunc<G> equal_func { set; }
public GLib.HashFunc<G> hash_func { set; }
public override int size { get; }
}
[CCode (cheader_filename = "valagee.h")]
public abstract class Iterable<G> {
protected Iterable ();
public abstract GLib.Type get_element_type ();
public abstract Vala.Iterator<G> iterator ();
}
[CCode (cheader_filename = "valagee.h")]
public abstract class Iterator<G> {
protected Iterator ();
public abstract G @get ();
public abstract bool has_next ();
public abstract bool next ();
public abstract void remove ();
public abstract bool valid { get; }
}
[CCode (cheader_filename = "valagee.h")]
public abstract class List<G> : Vala.Collection<G> {
protected List ();
public virtual G first ();
public abstract 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, Vala.Collection<G> collection);
public virtual G last ();
public abstract G remove_at (int index);
public abstract void @set (int index, G item);
public virtual void sort (owned GLib.CompareDataFunc<G> compare_func);
}
[CCode (cheader_filename = "valagee.h")]
public abstract class Map<K,V> {
protected Map ();
public abstract void clear ();
public abstract bool contains (K key);
public abstract V @get (K key);
public abstract Vala.Set<K> get_keys ();
public abstract Vala.Collection<V> get_values ();
public abstract Vala.MapIterator<K,V> map_iterator ();
public abstract bool remove (K key);
public abstract void @set (K key, V value);
public abstract int size { get; }
}
[CCode (cheader_filename = "valagee.h")]
public abstract class MapIterator<K,V> {
protected MapIterator ();
public abstract K get_key ();
public abstract V get_value ();
public abstract bool next ();
}
[CCode (cheader_filename = "valagee.h")]
public abstract class Set<G> : Vala.Collection<G> {
protected Set ();
}
}
|
