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
|
/* abstractmultimap.vala
*
* Copyright (C) 2009 Ali Sabil
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Author:
* Ali Sabil <ali.sabil@gmail.com>
* Didier 'Ptitjes Villevalois <ptitjes@free.fr>
*/
/**
* Skeletal implementation of the {@link MultiMap} interface.
*
* @see HashMultiMap
* @see TreeMultiMap
*/
public abstract class Gee.AbstractMultiMap<K,V> : Object, MultiMap<K,V> {
public int size {
get { return _nitems; }
}
protected Map<K, Collection<V>> _storage_map;
private int _nitems = 0;
private Set<V> _empty_value_set;
public AbstractMultiMap (Map<K, Collection<V>> storage_map) {
this._storage_map = storage_map;
this._empty_value_set = Set.empty<V> ();
}
protected abstract Collection<V> create_value_storage ();
protected abstract MultiSet<K> create_multi_key_set ();
protected abstract EqualFunc get_value_equal_func ();
public Set<K> get_keys () {
return _storage_map.keys;
}
public MultiSet<K> get_all_keys () {
MultiSet<K> result = create_multi_key_set ();
foreach (var entry in _storage_map.entries) {
for (int i = 0; i < entry.value.size; i++) {
result.add (entry.key);
}
}
return result;
}
public Collection<V> get_values () {
var result = new ArrayList<V> (get_value_equal_func ());
foreach (var entry in _storage_map.entries) {
foreach (var value in entry.value) {
result.add (value);
}
}
return result;
}
public bool contains (K key) {
return _storage_map.has_key (key);
}
public new Collection<V> get (K key) {
if (_storage_map.has_key (key)) {
return _storage_map.get (key).read_only_view;
} else {
return _empty_value_set;
}
}
public new void set (K key, V value) {
if (_storage_map.has_key (key)) {
if (_storage_map.get (key).add (value)) {
_nitems++;
}
} else {
var s = create_value_storage ();
s.add (value);
_storage_map.set (key, s);
_nitems++;
}
}
public bool remove (K key, V value) {
if (_storage_map.has_key (key)) {
var values = _storage_map.get (key);
if (values.contains (value)) {
values.remove (value);
_nitems--;
if (values.size == 0) {
_storage_map.unset (key);
}
return true;
}
}
return false;
}
public bool remove_all (K key) {
if (_storage_map.has_key (key)) {
int size = _storage_map.get (key).size;
if (_storage_map.unset (key)) {
_nitems -= size;
return true;
}
}
return false;
}
public void clear () {
_storage_map.clear ();
_nitems = 0;
}
}
|
