Welcome to mirror list, hosted at ThFree Co, Russian Federation.

Wrappers.cs « Mono.C5 « class « mcs - github.com/mono/mono.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: fed4fa7eeaf120a4678efda357c560ba45c29f2c (plain)
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
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
#if NET_2_0
/*
 Copyright (c) 2003-2004 Niels Kokholm <kokholm@itu.dk> and Peter Sestoft <sestoft@dina.kvl.dk>
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
 in the Software without restriction, including without limitation the rights
 to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:
 
 The above copyright notice and this permission notice shall be included in
 all copies or substantial portions of the Software.
 
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
*/

using System;
using System.Diagnostics;
using MSG = System.Collections.Generic;
using SC = System.Collections;
namespace C5
{
	/// <summary>
	/// A read-only wrapper class for a generic enumerator
	/// </summary>
	public class GuardedEnumerator<T>: MSG.IEnumerator<T>
	{
		#region Fields

		MSG.IEnumerator<T> enumerator;

		#endregion

		#region Constructor

		/// <summary>
		/// Create a wrapper around a generic enumerator
		/// </summary>
		/// <param name="enumerator">The enumerator to wrap</param>
		public GuardedEnumerator(MSG.IEnumerator<T> enumerator)
		{ this.enumerator = enumerator; }

		#endregion

		#region IEnumerator<T> Members

		/// <summary>
		/// Move wrapped enumerator to next item, or the first item if
		/// this is the first call to MoveNext. 
		/// </summary>
		/// <returns>True if enumerator is valid now</returns>
		public bool MoveNext() { return enumerator.MoveNext(); }


		/// <summary>
		/// Undefined if enumerator is not valid (MoveNext hash been called returning true)
		/// </summary>
		/// <value>The current item of the wrapped enumerator.</value>
		public T Current { get { return enumerator.Current; } }

		void SC.IEnumerator.Reset ()
		{
			enumerator.Reset ();
		}

		object SC.IEnumerator.Current {
			get { return enumerator.Current; }
		}

		#endregion

		#region IDisposable Members

		/// <summary>
		/// Dispose wrapped enumerator
		/// </summary>
		public void Dispose() { enumerator.Dispose(); }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper class for a generic enumerable
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedEnumerable<T>: MSG.IEnumerable<T>
	{
		#region Fields

		MSG.IEnumerable<T> enumerable;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap an enumerable in a read-only wrapper
		/// </summary>
		/// <param name="enumerable">The enumerable to wrap</param>
		public GuardedEnumerable(MSG.IEnumerable<T> enumerable)
		{ this.enumerable = enumerable; }

		#endregion

		#region MSG.IEnumerable<T> Members

		/// <summary>
		/// Get an enumerator from the wrapped enumerable
		/// </summary>
		/// <returns>The enumerator (itself wrapped)</returns>
		public MSG.IEnumerator<T> GetEnumerator()
		{ return new GuardedEnumerator<T>(enumerable.GetEnumerator()); }

		#endregion

		SC.IEnumerator SC.IEnumerable.GetEnumerator()
		{ return GetEnumerator (); }
	}



	/// <summary>
	/// A read-only wrapper for a generic directed enumerable
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedDirectedEnumerable<T>: GuardedEnumerable<T>, IDirectedEnumerable<T>
	{
		#region Fields

		IDirectedEnumerable<T> directedenumerable;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a directed enumerable in a read-only wrapper
		/// </summary>
		/// <param name="directedenumerable">the collection to wrap</param>
		public GuardedDirectedEnumerable(IDirectedEnumerable<T> directedenumerable)
			: base(directedenumerable)
		{ this.directedenumerable = directedenumerable; }

		#endregion

		#region IDirectedEnumerable<T> Members

		/// <summary>
		/// Get a enumerable that enumerates the wrapped collection in the opposite direction
		/// </summary>
		/// <returns>The mirrored enumerable</returns>
		public IDirectedEnumerable<T> Backwards()
		{ return new GuardedDirectedEnumerable<T>(directedenumerable.Backwards()); }


		/// <summary>
		/// <code>Forwards</code> if same, else <code>Backwards</code>
		/// </summary>
		/// <value>The enumeration direction relative to the original collection.</value>
		public EnumerationDirection Direction
		{ get { return directedenumerable.Direction; } }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper for an ICollectionValue&lt;T&gt;
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedCollectionValue<T>: GuardedEnumerable<T>, ICollectionValue<T>
	{
		#region Fields

		ICollectionValue<T> collection;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a ICollectionValue&lt;T&gt; in a read-only wrapper
		/// </summary>
		/// <param name="collection">the collection to wrap</param>
		public GuardedCollectionValue(ICollectionValue<T> collection) : base(collection)
		{ this.collection = collection; }

		#endregion

		#region ICollection<T> Members

		/// <summary>
		/// Get the size of the wrapped collection
		/// </summary>
		/// <value>The size</value>
		public int Count { get { return collection.Count; } }

        /// <summary>
        /// The value is symbolic indicating the type of asymptotic complexity
        /// in terms of the size of this collection (worst-case or amortized as
        /// relevant).
        /// </summary>
        /// <value>A characterization of the speed of the 
        /// <code>Count</code> property in this collection.</value>
        public Speed CountSpeed { get { return collection.CountSpeed; } }

        /// <summary>
		/// Copy the items of the wrapped collection to an array
		/// </summary>
		/// <param name="a">The array</param>
		/// <param name="i">Starting offset</param>
		public void CopyTo(T[] a, int i) { collection.CopyTo(a, i); }

        /// <summary>
        /// Create an array from the items of the wrapped collection
        /// </summary>
        /// <returns>The array</returns>
        public T[] ToArray() { return collection.ToArray(); }

        /// <summary>
        /// Apply a delegate to all items of the wrapped enumerable.
        /// </summary>
        /// <param name="a">The delegate to apply</param>
        //TODO: change this to throw an exception?
        public void Apply(Applier<T> a) { collection.Apply(a); }


        /// <summary>
        /// Check if there exists an item  that satisfies a
        /// specific predicate in the wrapped enumerable.
        /// </summary>
        /// <param name="filter">A filter delegate 
        /// (<see cref="T:C5.Filter!1"/>) defining the predicate</param>
        /// <returns>True is such an item exists</returns>
        public bool Exists(Filter<T> filter) { return collection.Exists(filter); }


        /// <summary>
        /// Check if all items in the wrapped enumerable satisfies a specific predicate.
        /// </summary>
        /// <param name="filter">A filter delegate 
        /// (<see cref="T:C5.Filter!1"/>) defining the predicate</param>
        /// <returns>True if all items satisfies the predicate</returns>
        public bool All(Filter<T> filter) { return collection.All(filter); }
        #endregion
    }



	/// <summary>
	/// A read-only wrapper for a directed collection
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedDirectedCollectionValue<T>: GuardedCollectionValue<T>, IDirectedCollectionValue<T>
	{
		#region Fields

		IDirectedCollectionValue<T> directedcollection;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a directed collection in a read-only wrapper
		/// </summary>
		/// <param name="directedcollection">the collection to wrap</param>
		public GuardedDirectedCollectionValue(IDirectedCollectionValue<T> directedcollection) : 
			base(directedcollection)
		{ this.directedcollection = directedcollection; }

		#endregion

		#region IDirectedCollection<T> Members

		/// <summary>
		/// Get a collection that enumerates the wrapped collection in the opposite direction
		/// </summary>
		/// <returns>The mirrored collection</returns>
		public IDirectedCollectionValue<T> Backwards()
		{ return new GuardedDirectedCollectionValue<T>(directedcollection.Backwards()); }

		#endregion

		#region IDirectedEnumerable<T> Members

		IDirectedEnumerable<T> IDirectedEnumerable<T>.Backwards()
		{ return Backwards(); }


		/// <summary>
		/// <code>Forwards</code> if same, else <code>Backwards</code>
		/// </summary>
		/// <value>The enumeration direction relative to the original collection.</value>
		public EnumerationDirection Direction
		{ get { return directedcollection.Direction; } }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper for an ICollection&lt;T&gt;.
	/// <see cref="T:C5.ICollection!1"/>
	///
	/// <p>Suitable for wrapping hash tables, <see cref="T:C5.HashSet!1"/>
	/// and <see cref="T:C5.HashBag!1"/>  </p>
	/// </summary>
	public class GuardedCollection<T>: GuardedCollectionValue<T>, ICollection<T>
	{
		#region Fields

		ICollection<T> collection;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap an ICollection&lt;T&gt; in a read-only wrapper
		/// </summary>
		/// <param name="collection">the collection to wrap</param>
		public GuardedCollection(ICollection<T> collection)
			:base(collection)
		{ this.collection = collection; }

		#endregion

		#region ICollection<T> Members

		/// <summary>
		/// (This is a read-only wrapper)
		/// </summary>
		/// <value>True</value>
		public bool IsReadOnly { get { return true; } }


		/// <summary> </summary>
		/// <value>Speed of wrapped collection</value>
		public Speed ContainsSpeed { get { return collection.ContainsSpeed; } }


		int ICollection<T>.GetHashCode()
		{ return ((ICollection<T>)collection).GetHashCode(); }


		bool ICollection<T>.Equals(ICollection<T> that)
		{ return ((ICollection<T>)collection).Equals(that); }


		/// <summary>
		/// Check if an item is in the wrapped collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>True if found</returns>
		public bool Contains(T item) { return collection.Contains(item); }


		/// <summary>
		/// Count the number of times an item appears in the wrapped collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>The number of copies</returns>
		public int ContainsCount(T item) { return collection.ContainsCount(item); }


		/// <summary>
		/// Check if all items in the argument is in the wrapped collection
		/// </summary>
		/// <param name="items">The items</param>
		/// <returns>True if so</returns>
		public bool ContainsAll(MSG.IEnumerable<T> items) { return collection.ContainsAll(items); }


		/// <summary>
		/// Search for an item in the wrapped collection
		/// </summary>
		/// <param name="item">On entry the item to look for, on exit the equivalent item found (if any)</param>
		/// <returns></returns>
		public bool Find(ref T item) { return collection.Find(ref item); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool FindOrAdd(ref T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool Update(T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool UpdateOrAdd(T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool Remove(T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool RemoveWithReturn(ref T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		public void RemoveAllCopies(T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="items"></param>
		public void RemoveAll(MSG.IEnumerable<T> items)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		public void Clear()
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="items"></param>
		public void RetainAll(MSG.IEnumerable<T> items)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// Check  wrapped collection for internal consistency
		/// </summary>
		/// <returns>True if check passed</returns>
		public bool Check() { return collection.Check(); }

		#endregion

		#region ISink<T> Members

		/// <summary> </summary>
		/// <value>False if wrapped collection has set semantics</value>
        public bool AllowsDuplicates { get { return collection.AllowsDuplicates; } }


        /// <summary> </summary>
		/// <value>The sync root of the wrapped collection</value>
		public object SyncRoot { get { return collection.SyncRoot; } }


		/// <summary> </summary>
		/// <value>True if wrapped collection is empty</value>
		public bool IsEmpty { get { return collection.IsEmpty; } }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public bool Add(T item)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


        /// <summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// </summary>
        /// <param name="items"></param>
        public void AddAll(MSG.IEnumerable<T> items)
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

        /// <summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// </summary>
        /// <param name="items"></param>
        /*public*/ void C5.IExtensible<T>.AddAll<U>(MSG.IEnumerable<U> items) //where U : T
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

        #endregion
    }


	/// <summary>
	/// A read-only wrapper for a sequenced collection
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedSequenced<T>: GuardedCollection<T>, ISequenced<T>
	{
		#region Fields

		ISequenced<T> sequenced;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a sequenced collection in a read-only wrapper
		/// </summary>
		/// <param name="sorted"></param>
		public GuardedSequenced(ISequenced<T> sorted):base(sorted) { this.sequenced = sorted; }

		#endregion

		#region ISequenced<T> Members

		int ISequenced<T>.GetHashCode()
		{ return ((ISequenced<T>)sequenced).GetHashCode(); }


		bool ISequenced<T>.Equals(ISequenced<T> that)
		{ return ((ISequenced<T>)sequenced).Equals(that); }

		#endregion

		#region IEditableCollection<T> Members

		int ICollection<T>.GetHashCode()
		{ return ((ICollection<T>)sequenced).GetHashCode(); }


		bool ICollection<T>.Equals(ICollection<T> that)
		{ return ((ICollection<T>)sequenced).Equals(that); }

		#endregion

		#region IDirectedCollection<T> Members

		/// <summary>
		/// Get a collection that enumerates the wrapped collection in the opposite direction
		/// </summary>
		/// <returns>The mirrored collection</returns>
		public IDirectedCollectionValue<T> Backwards()
		{ return new GuardedDirectedCollectionValue<T>(sequenced.Backwards()); }

		#endregion

		#region IDirectedEnumerable<T> Members

		IDirectedEnumerable<T> IDirectedEnumerable<T>.Backwards()
		{ return Backwards(); }



		/// <summary>
		/// <code>Forwards</code> if same, else <code>Backwards</code>
		/// </summary>
		/// <value>The enumeration direction relative to the original collection.</value>
		public EnumerationDirection Direction
		{ get { return EnumerationDirection.Forwards; } }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper for a sorted collection
	///
	/// <p>This is mainly interesting as a base of other guard classes</p>
	/// </summary>
	public class GuardedSorted<T>: GuardedSequenced<T>, ISorted<T>
	{
		#region Fields

		ISorted<T> sorted;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a sorted collection in a read-only wrapper
		/// </summary>
		/// <param name="sorted"></param>
		public GuardedSorted(ISorted<T> sorted):base(sorted) { this.sorted = sorted; }

		#endregion

        #region IEditableCollection Members

		int ICollection<T>.GetHashCode()
		{ return ((ICollection<T>)sorted).GetHashCode(); }


		bool ICollection<T>.Equals(ICollection<T> that)
		{ return ((ICollection<T>)sorted).Equals(that); }

		#endregion

		#region ISequenced<T> Members

		int ISequenced<T>.GetHashCode()
		{ return ((ISequenced<T>)sorted).GetHashCode(); }


		bool ISequenced<T>.Equals(ISequenced<T> that)
		{ return ((ISequenced<T>)sorted).Equals(that); }


		#endregion

		#region ISorted<T> Members

		/// <summary>
		/// Find the predecessor of the item in the wrapped sorted collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>The predecessor</returns>
		public T Predecessor(T item) { return sorted.Predecessor(item); }


		/// <summary>
		/// Find the Successor of the item in the wrapped sorted collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>The Successor</returns>
		public T Successor(T item) { return sorted.Successor(item); }


		/// <summary>
		/// Find the weak predecessor of the item in the wrapped sorted collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>The weak predecessor</returns>
		public T WeakPredecessor(T item) { return sorted.WeakPredecessor(item); }


		/// <summary>
		/// Find the weak Successor of the item in the wrapped sorted collection
		/// </summary>
		/// <param name="item">The item</param>
		/// <returns>The weak Successor</returns>
		public T WeakSuccessor(T item) { return sorted.WeakSuccessor(item); }


		/// <summary>
		/// Run Cut on the wrapped sorted collection
		/// </summary>
		/// <param name="c"></param>
		/// <param name="low"></param>
		/// <param name="lval"></param>
		/// <param name="high"></param>
		/// <param name="hval"></param>
		/// <returns></returns>
		public bool Cut(IComparable<T> c, out T low, out bool lval, out T high, out bool hval)
		{ return sorted.Cut(c, out low, out lval, out high, out hval); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="bot"></param>
		/// <returns></returns>
		public IDirectedEnumerable<T> RangeFrom(T bot) { return sorted.RangeFrom(bot); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="bot"></param>
		/// <param name="top"></param>
		/// <returns></returns>
		public IDirectedEnumerable<T> RangeFromTo(T bot, T top)
		{ return sorted.RangeFromTo(bot, top); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="top"></param>
		/// <returns></returns>
		public IDirectedEnumerable<T> RangeTo(T top) { return sorted.RangeTo(top); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <returns></returns>
		public IDirectedCollectionValue<T> RangeAll() { return sorted.RangeAll(); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="items"></param>
		public void AddSorted(MSG.IEnumerable<T> items)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="low"></param>
		public void RemoveRangeFrom(T low)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="low"></param>
		/// <param name="hi"></param>
		public void RemoveRangeFromTo(T low, T hi)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="hi"></param>
		public void RemoveRangeTo(T hi)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

		#endregion

		#region IPriorityQueue<T> Members

		/// <summary>
		/// Find the minimum of the wrapped collection
		/// </summary>
		/// <returns>The minimum</returns>
		public T FindMin() { return sorted.FindMin(); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <returns></returns>
		public T DeleteMin()
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// Find the maximum of the wrapped collection
		/// </summary>
		/// <returns>The maximum</returns>
		public T FindMax() { return sorted.FindMax(); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <returns></returns>
		public T DeleteMax()
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

        /// <summary>
        /// The comparer object supplied at creation time for the underlying collection
        /// </summary>
        /// <value>The comparer</value>
        public IComparer<T> Comparer { get { return sorted.Comparer; } }
        #endregion


		#region IDirectedEnumerable<T> Members

		IDirectedEnumerable<T> IDirectedEnumerable<T>.Backwards()
		{ return Backwards(); }

		#endregion
	}



	/// <summary>
	/// Read-only wrapper for indexed sorted collections
	///
	/// <p>Suitable for wrapping TreeSet, TreeBag and SortedArray</p>
	/// </summary>
	public class GuardedIndexedSorted<T>: GuardedSorted<T>, IIndexedSorted<T>
	{
		#region Fields

		IIndexedSorted<T> indexedsorted;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap an indexed sorted collection in a read-only wrapper
		/// </summary>
		/// <param name="list">the indexed sorted collection</param>
		public GuardedIndexedSorted(IIndexedSorted<T> list):base(list)
		{ this.indexedsorted = list; }

		#endregion

		#region IIndexedSorted<T> Members

		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="bot"></param>
		/// <returns></returns>
		public new IDirectedCollectionValue<T> RangeFrom(T bot)
		{ return indexedsorted.RangeFrom(bot); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="bot"></param>
		/// <param name="top"></param>
		/// <returns></returns>
		public new IDirectedCollectionValue<T> RangeFromTo(T bot, T top)
		{ return indexedsorted.RangeFromTo(bot, top); }


		/// <summary>
		/// Get the specified range from the wrapped collection. 
		/// (The current implementation erroneously does not wrap the result.)
		/// </summary>
		/// <param name="top"></param>
		/// <returns></returns>
		public new IDirectedCollectionValue<T> RangeTo(T top)
		{ return indexedsorted.RangeTo(top); }


		/// <summary>
		/// Report the number of items in the specified range of the wrapped collection
		/// </summary>
		/// <param name="bot"></param>
		/// <returns></returns>
		public int CountFrom(T bot) { return indexedsorted.CountFrom(bot); }


		/// <summary>
		/// Report the number of items in the specified range of the wrapped collection
		/// </summary>
		/// <param name="bot"></param>
		/// <param name="top"></param>
		/// <returns></returns>
		public int CountFromTo(T bot, T top) { return indexedsorted.CountFromTo(bot, top); }


		/// <summary>
		/// Report the number of items in the specified range of the wrapped collection
		/// </summary>
		/// <param name="top"></param>
		/// <returns></returns>
		public int CountTo(T top) { return indexedsorted.CountTo(top); }


		/// <summary>
		/// Run FindAll on the wrapped collection with the indicated filter.
		/// The result will <b>not</b> be read-only.
		/// </summary>
		/// <param name="f"></param>
		/// <returns></returns>
		public IIndexedSorted<T> FindAll(Filter<T> f)
		{ return indexedsorted.FindAll(f); }


		/// <summary>
		/// Run Map on the wrapped collection with the indicated mapper.
		/// The result will <b>not</b> be read-only.
		/// </summary>
		/// <param name="m"></param>
		/// <param name="c">The comparer to use in the result</param>
		/// <returns></returns>
		public IIndexedSorted<V> Map<V>(Mapper<T,V> m, IComparer<V> c)
		{ return indexedsorted.Map<V>(m, c); }

		#endregion

		#region IIndexed<T> Members

		/// <summary>
		/// 
		/// </summary>
		/// <value>The i'th item of the wrapped sorted collection</value>
		public T this[int i] { get { return indexedsorted[i]; } }


		/// <summary> </summary>
		/// <value>A directed collection of the items in the indicated interval of the wrapped collection</value>
		public IDirectedCollectionValue<T> this[int start, int end]
		{ get { return new GuardedDirectedCollectionValue<T>(indexedsorted[start, end]); } }


		/// <summary>
		/// Find the (first) index of an item in the wrapped collection
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public int IndexOf(T item) { return indexedsorted.IndexOf(item); }


		/// <summary>
		/// Find the last index of an item in the wrapped collection
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public int LastIndexOf(T item) { return indexedsorted.LastIndexOf(item); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="i"></param>
		/// <returns></returns>
		public T RemoveAt(int i)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="start"></param>
		/// <param name="count"></param>
		public void RemoveInterval(int start, int count)
		{ throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

		#endregion

		#region ISequenced<T> Members

		int ISequenced<T>.GetHashCode()
		{ return ((ISequenced<T>)indexedsorted).GetHashCode(); }


		bool ISequenced<T>.Equals(ISequenced<T> that)
		{ return ((ISequenced<T>)indexedsorted).Equals(that); }

		#endregion

		#region IEditableCollection<T> Members

		int ICollection<T>.GetHashCode()
		{ return ((ICollection<T>)indexedsorted).GetHashCode(); }


		bool ICollection<T>.Equals(ICollection<T> that)
		{ return ((ICollection<T>)indexedsorted).Equals(that); }

		#endregion

		#region IDirectedEnumerable<T> Members

		IDirectedEnumerable<T> IDirectedEnumerable<T>.Backwards()
		{ return Backwards(); }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper for a generic list collection
	/// <p>Suitable as a wrapper for LinkedList, HashedLinkedList, ArrayList and HashedArray.
	/// <see cref="T:C5.LinkedList!1"/>, 
	/// <see cref="T:C5.HashedLinkedList!1"/>, 
	/// <see cref="T:C5.ArrayList!1"/> or
	/// <see cref="T:C5.HashedArray!1"/>.
	/// </p>
	/// </summary>
	public class GuardedList<T>: GuardedSequenced<T>, IList<T>
	{
		#region Fields

		IList<T> list;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a list in a read-only wrapper
		/// </summary>
		/// <param name="list">The list</param>
		public GuardedList(IList<T> list) : base (list) { this.list = list; }

		#endregion

		#region IList<T> Members

		/// <summary>
		/// 
		/// </summary>
		/// <value>The first item of the wrapped list</value>
		public T First { get { return list.First; } }


		/// <summary>
		/// 
		/// </summary>
		/// <value>The last item of the wrapped list</value>
		public T Last { get { return list.Last; } }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> if used as setter
		/// </summary>
		/// <value>True if wrapped list has FIFO semantics for the Add(T item) and Remove() methods</value>
		public bool FIFO
		{
			get { return list.FIFO; }
			set { throw new InvalidOperationException("List is read only"); }
		}


		/// <summary>
		/// <exception cref="InvalidOperationException"/> if used as setter
		/// </summary>
		/// <value>The i'th item of the wrapped list</value>
		public T this[int i]
		{
			get { return list[i]; }
			set { throw new InvalidOperationException("List is read only"); }
		}


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="i"></param>
		/// <param name="item"></param>
		public void Insert(int i, T item)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		public void InsertFirst(T item)
		{ throw new InvalidOperationException("List is read only"); }

		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		public void InsertLast(T item)
		{ throw new InvalidOperationException("List is read only"); }

		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <param name="target"></param>
		public void InsertBefore(T item, T target)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="item"></param>
		/// <param name="target"></param>
		public void InsertAfter(T item, T target)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="i"></param>
		/// <param name="items"></param>
		public void InsertAll(int i, MSG.IEnumerable<T> items)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// Perform FindAll on the wrapped list. The result is <b>not</b> necessarily read-only.
		/// </summary>
		/// <param name="filter">The filter to use</param>
		/// <returns></returns>
		public IList<T> FindAll(Filter<T> filter) { return list.FindAll(filter); }


		/// <summary>
		/// Perform Map on the wrapped list. The result is <b>not</b> necessarily read-only.
		/// </summary>
        /// <typeparam name="V">The type of items of the new list</typeparam>
        /// <param name="mapper">The mapper to use.</param>
        /// <returns>The mapped list</returns>
        public IList<V> Map<V>(Mapper<T, V> mapper) { return list.Map<V>(mapper); }

        /// <summary>
        /// Perform Map on the wrapped list. The result is <b>not</b> necessarily read-only.
        /// </summary>
        /// <typeparam name="V">The type of items of the new list</typeparam>
        /// <param name="mapper">The delegate defining the map.</param>
        /// <param name="hasher">The hasher to use for the new list</param>
        /// <returns>The new list.</returns>
        public IList<V> Map<V>(Mapper<T, V> mapper, IHasher<V> hasher) { return list.Map<V>(mapper, hasher); }

        /// <summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <returns></returns>
		public T Remove() { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <returns></returns>
		public T RemoveFirst() { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <returns></returns>
		public T RemoveLast() { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// Create the indicated view on the wrapped list and wrap it read-only.
		/// </summary>
		/// <param name="start"></param>
		/// <param name="count"></param>
		/// <returns></returns>
		public IList<T> View(int start, int count)
		{
			return new GuardedList<T>(list.View(start, count));
		}


		//TODO: This is wrong!
		/// <summary>
		/// (This is wrong functionality)
		/// </summary>
        /// <value>The wrapped underlying list of the wrapped view </value>
        public IList<T> Underlying { get { return new GuardedList<T>(list.Underlying); } }


        /// <summary>
		/// 
		/// </summary>
		/// <value>The offset of the wrapped list as a view.</value>
		public int Offset { get { return list.Offset; } }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="offset"></param>
		public void Slide(int offset) { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="offset"></param>
		/// <param name="size"></param>
		public void Slide(int offset, int size) { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		public void Reverse() { throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="start"></param>
		/// <param name="count"></param>
		public void Reverse(int start, int count)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// Check if wrapped list is sorted
		/// </summary>
		/// <param name="c">The sorting order to use</param>
		/// <returns>True if sorted</returns>
		public bool IsSorted(IComparer<T> c) { return list.IsSorted(c); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="c"></param>
		public void Sort(IComparer<T> c)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		public void Shuffle()
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="rnd"></param>
		public void Shuffle(Random rnd)
		{ throw new InvalidOperationException("List is read only"); }

		#endregion

		#region IIndexed<T> Members

		/// <summary> </summary>
		/// <value>A directed collection of the items in the indicated interval of the wrapped collection</value>
		public IDirectedCollectionValue<T> this[int start, int end]
		{ get { return new GuardedDirectedCollectionValue<T>(list[start, end]); } }


		/// <summary>
		/// Find the (first) index of an item in the wrapped collection
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public int IndexOf(T item) { return list.IndexOf(item); }


		/// <summary>
		/// Find the last index of an item in the wrapped collection
		/// </summary>
		/// <param name="item"></param>
		/// <returns></returns>
		public int LastIndexOf(T item) { return list.LastIndexOf(item); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="i"></param>
		/// <returns></returns>
		public T RemoveAt(int i)
		{ throw new InvalidOperationException("List is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="start"></param>
		/// <param name="count"></param>
		public void RemoveInterval(int start, int count)
		{ throw new InvalidOperationException("List is read only"); }

		#endregion

		#region ISequenced<T> Members

		int ISequenced<T>.GetHashCode()
		{ return ((ISequenced<T>)list).GetHashCode(); }


		bool ISequenced<T>.Equals(ISequenced<T> that)
		{ return ((ISequenced<T>)list).Equals(that); }

		#endregion

		#region IEditableCollection<T> Members

		int ICollection<T>.GetHashCode()
		{ return ((ICollection<T>)list).GetHashCode(); }


		bool ICollection<T>.Equals(ICollection<T> that)
		{ return ((ICollection<T>)list).Equals(that); }

		#endregion

		#region IDirectedEnumerable<T> Members

		IDirectedEnumerable<T> IDirectedEnumerable<T>.Backwards()
		{ return Backwards(); }

		#endregion

        #region IStack<T> Members


        /// <summary>
        /// 
        /// </summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// <returns>-</returns>
        public void Push(T item)
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

        /// <summary>
        /// 
        /// </summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// <returns>-</returns>
        public T Pop()
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

                #endregion

        #region IQueue<T> Members

        /// <summary>
        /// 
        /// </summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// <returns>-</returns>
        public void EnQueue(T item)
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

        /// <summary>
        /// 
        /// </summary>
        /// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
        /// <returns>-</returns>
        public T DeQueue()
        { throw new InvalidOperationException("Collection cannot be modified through this guard object"); }

                #endregion

    }



	/// <summary>
	/// A read-only wrapper for a dictionary.
	///
	/// <p>Suitable for wrapping a HashDictionary. <see cref="T:C5.HashDictionary!2"/></p>
	/// </summary>
	public class GuardedDictionary<K,V>: GuardedEnumerable<KeyValuePair<K,V>>, IDictionary<K,V>
	{
		#region Fields

		IDictionary<K,V> dict;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a dictionary in a read-only wrapper
		/// </summary>
		/// <param name="dict">the dictionary</param>
		public GuardedDictionary(IDictionary<K,V> dict) : base(dict) { this.dict = dict; }

		#endregion

		#region IDictionary<K,V> Members

		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a
		/// read-only wrappper if used as a setter
		/// </summary>
		/// <value>Get the value corresponding to a key in the wrapped dictionary</value>
		public V this[K key]
		{
			get { return dict[key]; }
			set { throw new InvalidOperationException("Dictionary is read only"); }
		}


		/// <summary> </summary>
		/// <value>The size of the wrapped dictionary</value>
		public int Count { get { return dict.Count; } }


		/// <summary>
		/// (This is a read-only wrapper)
		/// </summary>
		/// <value>True</value>
		public bool IsReadOnly { get { return true; } }


		/// <summary> </summary>
		/// <value>The sync root of the wrapped dictionary</value>
		public object SyncRoot { get { return dict.SyncRoot; } }


		//TODO: guard with a read-only wrapper? Probably so!
		/// <summary> </summary>
		/// <value>The collection of keys of the wrapped dictionary</value>
		public ICollectionValue<K> Keys
		{ get { return dict.Keys; } }


		/// <summary> </summary>
		/// <value>The collection of values of the wrapped dictionary</value>
		public ICollectionValue<V> Values { get { return dict.Values; } }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <param name="val"></param>
		public void Add(K key, V val)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <returns></returns>
		public bool Remove(K key)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <param name="val"></param>
		/// <returns></returns>
		public bool Remove(K key, out V val)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		public void Clear()
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// Check if the wrapped dictionary contains a specific key
		/// </summary>
		/// <param name="key">The key</param>
		/// <returns>True if it does</returns>
		public bool Contains(K key) { return dict.Contains(key); }


		/// <summary>
		/// Search for a key in the wrapped dictionary, reporting the value if found
		/// </summary>
		/// <param name="key">The key</param>
		/// <param name="val">On exit: the value if found</param>
		/// <returns>True if found</returns>
		public bool Find(K key, out V val) { return dict.Find(key, out val); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <param name="val"></param>
		/// <returns></returns>
		public bool Update(K key, V val)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <param name="val"></param>
		/// <returns></returns>
		public bool FindOrAdd(K key, ref V val)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// <exception cref="InvalidOperationException"/> since this is a read-only wrappper
		/// </summary>
		/// <param name="key"></param>
		/// <param name="val"></param>
		/// <returns></returns>
		public bool UpdateOrAdd(K key, V val)
		{ throw new InvalidOperationException("Dictionary is read only"); }


		/// <summary>
		/// Check the internal consistency of the wrapped dictionary
		/// </summary>
		/// <returns>True if check passed</returns>
		public bool Check() { return dict.Check(); }

		#endregion
	}



	/// <summary>
	/// A read-only wrapper for a sorted dictionary.
	///
	/// <p>Suitable for wrapping a Dictionary. <see cref="T:C5.Dictionary!2"/></p>
	/// </summary>
	public class GuardedSortedDictionary<K,V>: GuardedDictionary<K,V>, ISortedDictionary<K,V>
	{
		#region Fields

		ISortedDictionary<K,V> sorteddict;

		#endregion

		#region Constructor

		/// <summary>
		/// Wrap a sorted dictionary in a read-only wrapper
		/// </summary>
		/// <param name="sorteddict">the dictionary</param>
		public GuardedSortedDictionary(ISortedDictionary<K,V> sorteddict) :base(sorteddict)
		{ this.sorteddict = sorteddict; }

		#endregion

		#region ISortedDictionary<K,V> Members

		/// <summary>
		/// Get the entry in the wrapped dictionary whose key is the
		/// predecessor of a specified key.
		/// </summary>
		/// <param name="key">The key</param>
		/// <returns>The entry</returns>
		public KeyValuePair<K,V> Predecessor(K key)
		{ return sorteddict.Predecessor(key); }


		/// <summary>
		/// Get the entry in the wrapped dictionary whose key is the
		/// successor of a specified key.
		/// </summary>
		/// <param name="key">The key</param>
		/// <returns>The entry</returns>
		public KeyValuePair<K,V> Successor(K key)
		{ return sorteddict.Successor(key); }


		/// <summary>
		/// Get the entry in the wrapped dictionary whose key is the
		/// weak predecessor of a specified key.
		/// </summary>
		/// <param name="key">The key</param>
		/// <returns>The entry</returns>
		public KeyValuePair<K,V> WeakPredecessor(K key)
		{ return sorteddict.WeakPredecessor(key); }


		/// <summary>
		/// Get the entry in the wrapped dictionary whose key is the
		/// weak successor of a specified key.
		/// </summary>
		/// <param name="key">The key</param>
		/// <returns>The entry</returns>
		public KeyValuePair<K,V> WeakSuccessor(K key)
		{ return sorteddict.WeakSuccessor(key); }

		#endregion
	}

}
#endif