diff options
Diffstat (limited to 'libdino/src/util/weak_map.vala')
| -rw-r--r-- | libdino/src/util/weak_map.vala | 119 |
1 files changed, 0 insertions, 119 deletions
diff --git a/libdino/src/util/weak_map.vala b/libdino/src/util/weak_map.vala deleted file mode 100644 index a7f4bc44..00000000 --- a/libdino/src/util/weak_map.vala +++ /dev/null @@ -1,119 +0,0 @@ -using Gee; - -public class WeakMap<K, V> : Gee.AbstractMap<K, V> { - - private HashMap<K, weak V> hash_map; - private HashMap<K, WeakNotifyWrapper> notify_map; - - public HashDataFunc<K>? key_hash_func = null; - public EqualDataFunc<K>? key_equal_func = null; - public EqualDataFunc<V>? value_equal_func = null; - - public WeakMap(owned HashDataFunc<K>? key_hash_func = null, owned EqualDataFunc<K>? key_equal_func = null, owned EqualDataFunc<V>? value_equal_func = null) { - if (!typeof(V).is_object()) { - error("WeakMap only takes values that are Objects"); - } - - this.key_hash_func = (owned)key_hash_func; - this.key_equal_func = (owned)key_equal_func; - this.value_equal_func = (owned)value_equal_func; - - if (this.key_equal_func == null || this.key_equal_func == null || this.value_equal_func == null) { - hash_map = new HashMap<K, weak V>(); - notify_map = new HashMap<K, WeakNotifyWrapper>(); - } else { - hash_map = new HashMap<K, weak V>((v) => { return this.key_hash_func != null ? this.key_hash_func(v) : 0; }, - (a, b) => { return this.key_equal_func != null ? this.key_equal_func(a, b) : a == b; }, - (a, b) => { return this.value_equal_func != null ? this.value_equal_func(a, b) : a == b; }); - notify_map = new HashMap<K, WeakNotifyWrapper>((v) => { return this.key_hash_func != null ? this.key_hash_func(v) : 0; }, - (a, b) => { return this.key_equal_func != null ? this.key_equal_func(a, b) : a == b; }); - } - } - - public override void clear() { - foreach (K key in notify_map.keys) { - Object o = (Object) hash_map[key]; - o.weak_unref(notify_map[key].func); - } - hash_map.clear(); - notify_map.clear(); - } - - public override V @get(K key) { - if (!hash_map.has_key(key)) return null; - - var v = hash_map[key]; - - return (owned) v; - } - - public override bool has(K key, V value) { - return has_key(key) && (this.value_equal_func != null ? this.value_equal_func(hash_map[key], value) : hash_map[key] == value); - } - - public override bool has_key(K key) { - return hash_map.has_key(key); - } - - public override Gee.MapIterator<K,V> map_iterator() { - assert_not_reached(); - } - - public override void @set(K key, V value) { - assert(value != null); - - unset(key); - - Object v_obj = (Object) value; - var notify_wrap = new WeakNotifyWrapper((obj) => { - hash_map.unset(key); - notify_map.unset(key); - }); - notify_map[key] = notify_wrap; - v_obj.weak_ref(notify_wrap.func); - - hash_map[key] = value; - } - - public override bool unset(K key, out V value = null) { - if (!hash_map.has_key(key)) { - value = null; - return false; - } - - Object v_obj = (Object) hash_map[key]; - v_obj.weak_unref(notify_map[key].func); - notify_map.unset(key); - return hash_map.unset(key, out value); - } - public override Gee.Set<Gee.Map.Entry<K,V>> entries { owned get; } - - public override Gee.Set<K> keys { - owned get { return hash_map.keys; } - } - - public override bool read_only { get { assert_not_reached(); } } - - public override int size { get { return hash_map.size; } } - - public override Gee.Collection<V> values { - owned get { - assert_not_reached(); - } - } - - public override void dispose() { - foreach (K key in notify_map.keys) { - Object o = (Object) hash_map[key]; - o.weak_unref(notify_map[key].func); - } - } -} - -internal class WeakNotifyWrapper { - public WeakNotify func; - - public WeakNotifyWrapper(owned WeakNotify func) { - this.func = (owned) func; - } -}
\ No newline at end of file |
