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
|
/*
* [The "BSD licence"]
* Copyright (c) 2005-2008 Terence Parr
* All rights reserved.
*
* Conversion to C#:
* Copyright (c) 2008 Sam Harwell, Pixel Mine, Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
using System;
using System.Collections.Generic;
using System.Linq;
using ICollection = System.Collections.ICollection;
using IEnumerable = System.Collections.IEnumerable;
using IList = System.Collections.IList;
namespace Antlr.Runtime.JavaExtensions
{
public static class ListExtensions
{
#if DEBUG
[Obsolete]
public static bool add( this IList list, object value )
{
int count = list.Count;
list.Add( value );
return list.Count == count + 1;
}
[Obsolete]
public static void add<T>( this ICollection<T> list, T value )
{
list.Add( value );
}
[Obsolete]
public static void add<T>( this List<T> list, T value )
{
list.Add( value );
}
[Obsolete]
public static void add( this IList list, int index, object value )
{
list.Insert( index, value );
}
[Obsolete]
public static void addAll( this List<object> list, IEnumerable items )
{
list.AddRange( items.Cast<object>() );
}
#endif
public static void addAll( this IList list, IEnumerable items )
{
foreach ( object item in items )
list.Add( item );
}
public static void addAll<T>( this ICollection<T> list, IEnumerable<T> items )
{
foreach ( T item in items )
list.Add( item );
}
#if DEBUG
[Obsolete]
public static void addElement( this List<object> list, object value )
{
list.Add( value );
}
[Obsolete]
public static void clear( this IList list )
{
list.Clear();
}
[Obsolete]
public static bool contains( this IList list, object value )
{
return list.Contains( value );
}
[Obsolete]
public static bool contains<T>( this ICollection<T> list, T value )
{
return list.Contains( value );
}
[Obsolete]
public static T elementAt<T>( this IList<T> list, int index )
{
return list[index];
}
[Obsolete]
public static object get( this IList list, int index )
{
return list[index];
}
[Obsolete]
public static T get<T>( this IList<T> list, int index )
{
return list[index];
}
// disambiguate
[Obsolete]
public static T get<T>( this List<T> list, int index )
{
return list[index];
}
[Obsolete]
public static object remove( this IList list, int index )
{
object o = list[index];
list.RemoveAt( index );
return o;
}
[Obsolete]
public static void remove<T>( this IList<T> list, T item )
{
list.Remove( item );
}
[Obsolete]
public static void set( this IList list, int index, object value )
{
list[index] = value;
}
[Obsolete]
public static void set<T>( this IList<T> list, int index, T value )
{
list[index] = value;
}
[Obsolete]
public static void set<T>( this List<T> list, int index, T value )
{
list[index] = value;
}
#endif
public static void setSize<T>( this List<T> list, int size )
{
if ( list.Count < size )
{
list.AddRange( Enumerable.Repeat( default( T ), size - list.Count ) );
}
else if ( list.Count > size )
{
list.RemoveRange(size, list.Count - size);
}
}
#if DEBUG
[Obsolete]
public static int size( this ICollection collection )
{
return collection.Count;
}
[Obsolete]
public static int size<T>( this ICollection<T> collection )
{
return collection.Count;
}
[Obsolete]
public static int size<T>( this List<T> list )
{
return list.Count;
}
#endif
public static IList subList( this IList list, int fromIndex, int toIndex )
{
return new SubList( list, fromIndex, toIndex );
//return
// list
// .Cast<object>()
// .Skip( fromIndex )
// .Take( toIndex - fromIndex + 1 )
// .ToList();
}
public static IList<T> subList<T>( this IList<T> list, int fromIndex, int toIndex )
{
return new SubList<T>( list, fromIndex, toIndex );
//return
// list
// .Skip( fromIndex )
// .Take( toIndex - fromIndex + 1 )
// .ToList();
}
public static IList<T> subList<T>( this List<T> list, int fromIndex, int toIndex )
{
return new SubList<T>( list, fromIndex, toIndex );
//return
// list
// .Skip( fromIndex )
// .Take( toIndex - fromIndex + 1 )
// .ToList();
}
}
}
|
