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
|
/* readonlysortedset.vala
*
* Copyright (C) 2009 Didier Villevalois, Maciej Piechotka
* Copyright (C) 2011 Maciej Piechotka
*
* 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:
* Maciej Piechotka <uzytkownik2@gmail.com>
*/
/**
* Read-only view for {@link SortedSet} collections.
*
* This class decorates any class which implements the {@link SortedSet} interface
* by making it read only. Any method which normally modify data will throw an
* error.
*
* @see SortedSet
*/
internal class Gee.ReadOnlySortedSet<G> : ReadOnlySet<G>, SortedSet<G> {
/**
* Constructs a read-only set that mirrors the content of the specified set.
*
* @param set the set to decorate.
*/
public ReadOnlySortedSet (SortedSet<G> set) {
base (set);
}
/**
* {@inheritDoc}
*/
public G first () {
return ((SortedSet<G>) _collection).first ();
}
/**
* {@inheritDoc}
*/
public G last () {
return ((SortedSet<G>) _collection).last ();
}
/**
* {@inheritDoc}
*/
public Gee.Iterator<G>? iterator_at (G element) {
var iter = ((SortedSet<G>) _collection).iterator_at (element);
return (iter != null) ? new Iterator<G> (iter) : null;
}
/**
* {@inheritDoc}
*/
public G? lower (G element) {
return ((SortedSet<G>) _collection).lower (element);
}
/**
* {@inheritDoc}
*/
public G? higher (G element) {
return ((SortedSet<G>) _collection).higher (element);
}
/**
* {@inheritDoc}
*/
public G? floor (G element) {
return ((SortedSet<G>) _collection).floor (element);
}
/**
* {@inheritDoc}
*/
public G? ceil (G element) {
return ((SortedSet<G>) _collection).ceil (element);
}
/**
* {@inheritDoc}
*/
public SortedSet<G> head_set (G before) {
return ((SortedSet<G>) _collection).head_set (before).read_only_view;
}
/**
* {@inheritDoc}
*/
public SortedSet<G> tail_set (G after) {
return((SortedSet<G>) _collection).tail_set (after).read_only_view;
}
/**
* {@inheritDoc}
*/
public SortedSet<G> sub_set (G from, G to) {
return ((SortedSet<G>) _collection).sub_set (from, to).read_only_view;
}
/**
* {@inheritDoc}
*/
public new SortedSet<G> read_only_view {
owned get {
return this;
}
}
}
|
