Menu

[r513]: / phprpc_3.0 / dotNET / AssocArray.cs  Maximize  Restore  History

Download this file

459 lines (414 with data), 14.8 kB

  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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
/**********************************************************\
| |
| The implementation of PHPRPC Protocol 3.0 |
| |
| AssocArray.cs |
| |
| Release 3.0.1 |
| Copyright (c) 2005-2008 by Team-PHPRPC |
| |
| WebSite: http://www.phprpc.org/ |
| http://www.phprpc.net/ |
| http://www.phprpc.com/ |
| http://sourceforge.net/projects/php-rpc/ |
| |
| Authors: Ma Bingyao <andot@ujn.edu.cn> |
| |
| This file may be distributed and/or modified under the |
| terms of the GNU Lesser General Public License (LGPL) |
| version 3.0 as published by the Free Software Foundation |
| and appearing in the included file LICENSE. |
| |
\**********************************************************/
/* AssocArray class.
*
* Copyright (C) 2005-2008 Ma Bingyao <andot@ujn.edu.cn>
* Version: 3.0
* LastModified: Dec 24, 2008
* This library is free. You can redistribute it and/or modify it.
*/
namespace org.phprpc.util {
using System;
using System.Collections;
using System.Globalization;
public class AssocArray : IDictionary, IList, ICollection, IEnumerable
#if !SILVERLIGHT
, ICloneable
#endif
{
private static readonly IFormatProvider provider = CultureInfo.InvariantCulture;
private ArrayList arrayList;
private Hashtable hashtable;
private Int32 arrayLength;
private Int32 maxNumber;
public AssocArray() {
arrayList = new ArrayList();
hashtable = new Hashtable();
arrayLength = 0;
maxNumber = -1;
}
public AssocArray(Int32 capacity) {
arrayList = new ArrayList(capacity);
hashtable = new Hashtable(capacity);
arrayLength = 0;
maxNumber = -1;
}
public AssocArray(Int32 capacity, Single loadFactor) {
arrayList = new ArrayList(capacity);
hashtable = new Hashtable(capacity, loadFactor);
arrayLength = 0;
maxNumber = -1;
}
public AssocArray(ICollection c) {
arrayList = new ArrayList(c);
arrayLength = arrayList.Count;
maxNumber = arrayLength - 1;
hashtable = new Hashtable(arrayLength);
for (Int32 i = 0; i < arrayLength; i++) {
hashtable[i] = arrayList[i];
}
}
public AssocArray(IDictionary d) {
Int32 len = d.Count;
arrayList = new ArrayList(len);
hashtable = new Hashtable(len);
arrayLength = 0;
maxNumber = -1;
if (len == 0) {
return;
}
IEnumerator keys = d.Keys.GetEnumerator();
keys.Reset();
while (keys.MoveNext()) {
Object key = keys.Current;
if ((key is Int32) ||
(key is SByte) ||
(key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
Int32 k;
try {
k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
}
catch (InvalidCastException) {
continue;
}
if (k > -1) {
arrayLength++;
if (maxNumber < k) {
maxNumber = k;
}
}
hashtable[k] = d[key];
}
else if (key is String) {
hashtable[key] = d[key];
}
}
setArrayList();
}
public virtual Object this[String key] {
get {
return hashtable[key];
}
set {
hashtable[key] = value;
}
}
private void setArrayList() {
Int32 len = arrayList.Count;
if (len < arrayLength) {
if (maxNumber + 1 == arrayLength) {
for (Int32 i = len; i < arrayLength; i++) {
arrayList.Add(hashtable[i]);
}
}
else {
while (hashtable.ContainsKey(len)) {
arrayList.Add(hashtable[len++]);
}
}
}
}
public virtual ArrayList toArrayList() {
setArrayList();
return arrayList;
}
public virtual Hashtable toHashtable() {
return hashtable;
}
#region IDictionary & IList Members
public virtual void Clear() {
hashtable.Clear();
arrayList.Clear();
arrayLength = 0;
maxNumber = -1;
}
public virtual Boolean IsFixedSize {
get {
return false;
}
}
public virtual Boolean IsReadOnly {
get {
return false;
}
}
#endregion
#region IDictionary Members
public void Add(Object key, Object value) {
if ((key is Int32) ||
(key is SByte) ||
(key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
Int32 k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
hashtable.Add(k, value);
if (k > -1) {
arrayLength++;
if (maxNumber < k) {
maxNumber = k;
}
}
}
else {
hashtable.Add(key.ToString(), value);
}
}
public virtual Boolean Contains(Object key) {
if (key is Int32) {
return hashtable.Contains(key);
}
else if ((key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
try {
Int32 k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
return hashtable.Contains(k);
}
catch (InvalidCastException) {
return false;
}
}
return hashtable.Contains(key.ToString());
}
public virtual IDictionaryEnumerator GetEnumerator() {
return hashtable.GetEnumerator();
}
public virtual ICollection Keys {
get {
return hashtable.Keys;
}
}
public virtual void Remove(Object key) {
if ((key is Int32) ||
(key is SByte) ||
(key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
Int32 k;
try {
k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
}
catch (InvalidCastException) {
return;
}
((IList)this).RemoveAt(k);
}
else {
hashtable.Remove(key.ToString());
}
}
public virtual ICollection Values {
get {
return hashtable.Values;
}
}
public virtual Object this[Object key] {
get {
if ((key is String) || (key is Int32)) {
return hashtable[key];
}
else if ((key is SByte) ||
(key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
Int32 k;
try {
k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
}
catch (InvalidCastException) {
return null;
}
return hashtable[k];
}
return hashtable[key.ToString()];
}
set {
if (key is String) {
hashtable[key] = value;
}
if ((key is Int32) ||
(key is SByte) ||
(key is Byte) ||
(key is Int16) ||
(key is UInt16) ||
(key is UInt32) ||
(key is Int64) ||
(key is UInt64)) {
Int32 k = (Int32)Convert.ChangeType(key, TypeCode.Int32, provider);
this[k] = value;
}
else {
hashtable[key.ToString()] = value;
}
}
}
#endregion
#region ICollection Members
public virtual void CopyTo(Array array, Int32 index) {
hashtable.CopyTo(array, index);
}
public virtual Int32 Count {
get {
return hashtable.Count;
}
}
public virtual Boolean IsSynchronized {
get {
return false;
}
}
public virtual Object SyncRoot {
get {
return hashtable.SyncRoot;
}
}
#endregion
#region IList Members
public virtual Int32 Add(Object value) {
Int32 key = arrayList.Count;
arrayList.Add(value);
if (!hashtable.ContainsKey(key)) {
arrayLength++;
if (maxNumber < key) {
maxNumber = key;
}
}
hashtable[key] = value;
return key;
}
public virtual Int32 IndexOf(Object value) {
setArrayList();
return arrayList.IndexOf(value);
}
public virtual void Insert(Int32 index, Object value) {
setArrayList();
arrayList.Insert(index, value);
arrayLength++;
if (maxNumber < index) {
maxNumber = index;
}
for (Int32 i = arrayList.Count - 1; i >= index; i--) {
hashtable[i] = arrayList[i];
}
}
public virtual void RemoveAt(Int32 index) {
if (index > -1) {
if (hashtable.ContainsKey(index)) {
arrayLength--;
Int32 lastIndex = arrayList.Count - 1;
if (index <= lastIndex) {
for (Int32 i = lastIndex; i >= index; i--) {
arrayList.Remove(i);
}
if (maxNumber == index) {
maxNumber--;
}
}
else if (maxNumber == index) {
do {
index--;
} while ((index > lastIndex) && !hashtable.ContainsKey(index));
maxNumber = index;
}
}
else {
return;
}
}
hashtable.Remove(index);
}
public virtual Object this[Int32 index] {
get {
return hashtable[index];
}
set {
if (index > -1) {
if (index < arrayList.Count) {
arrayList[index] = value;
}
else if (!hashtable.ContainsKey(index)) {
arrayLength++;
if (maxNumber < index) {
maxNumber = index;
}
}
}
hashtable[index] = value;
}
}
Boolean IList.Contains(Object value) {
setArrayList();
return arrayList.Contains(value);
}
void IList.Remove(Object value) {
Int32 index = this.IndexOf(value);
if (index > -1) {
arrayList.Remove(value);
arrayLength--;
if (maxNumber == index) {
maxNumber--;
}
Int32 lastIndex = arrayList.Count;
for (Int32 i = index; i < lastIndex; i++) {
hashtable[i] = arrayList[i];
}
hashtable.Remove(lastIndex);
}
}
#endregion
#if !SILVERLIGHT
#region ICloneable Members
public virtual Object Clone() {
AssocArray result = new AssocArray();
result.arrayList = (ArrayList)arrayList.Clone();
result.hashtable = (Hashtable)hashtable.Clone();
result.arrayLength = arrayLength;
result.maxNumber = maxNumber;
return result;
}
#endregion
#endif
#region IEnumerable Members
IEnumerator IEnumerable.GetEnumerator() {
return hashtable.GetEnumerator();
}
#endregion
}
}
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.