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
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666 | /* ****************************************************************************
*
* Copyright (c) Microsoft Corporation.
*
* This source code is subject to terms and conditions of the Apache License, Version 2.0. A
* copy of the license can be found in the License.html file at the root of this distribution. If
* you cannot locate the Apache License, Version 2.0, please send an email to
* dlr@microsoft.com. By using this source code in any fashion, you are agreeing to be bound
* by the terms of the Apache License, Version 2.0.
*
* You must not remove this notice, or any other, from this software.
*
*
* ***************************************************************************/
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Runtime.InteropServices;
using System.Text;
using System.Threading;
using Microsoft.Scripting;
using Microsoft.Scripting.Generation;
using Microsoft.Scripting.Runtime;
using Microsoft.Scripting.Utils;
using IronPython.Runtime.Exceptions;
using IronPython.Runtime.Operations;
using IronPython.Runtime.Types;
#if FEATURE_NUMERICS
using System.Numerics;
#else
using Microsoft.Scripting.Math;
#endif
using SpecialNameAttribute = System.Runtime.CompilerServices.SpecialNameAttribute;
namespace IronPython.Runtime {
[PythonType("list"), Serializable, System.Diagnostics.CodeAnalysis.SuppressMessage("Microsoft.Naming", "CA1710:IdentifiersShouldHaveCorrectSuffix")]
[DebuggerTypeProxy(typeof(ObjectCollectionDebugProxy)), DebuggerDisplay("list, {Count} items")]
public class List : IList, ICodeFormattable, IList<object>, IReversible, IStructuralEquatable, IStructuralComparable
#if CLR2
, IValueEquality
#endif
{
private const int INITIAL_SIZE = 20;
internal int _size;
internal volatile object[] _data;
public void __init__() {
_data = new object[8];
_size = 0;
}
public void __init__([NotNull] IEnumerable enumerable) {
__init__();
foreach (object o in enumerable) {
AddNoLock(o);
}
}
public void __init__([NotNull] ICollection sequence) {
_data = new object[sequence.Count];
int i = 0;
foreach (object item in sequence) {
_data[i++] = item;
}
_size = i;
}
public void __init__([NotNull] SetCollection sequence) {
List list = sequence._items.GetItems();
_size = list._size;
_data = list._data;
}
public void __init__([NotNull] FrozenSetCollection sequence) {
List list = sequence._items.GetItems();
_size = list._size;
_data = list._data;
}
public void __init__([NotNull] List sequence) {
if (this == sequence) {
// list.__init__(l, l) resets l
_size = 0;
return;
}
_data = new object[sequence._size];
object[] data = sequence._data;
for (int i = 0; i < _data.Length; i++) {
_data[i] = data[i];
}
_size = _data.Length;
}
public void __init__([NotNull] string sequence) {
_data = new object[sequence.Length];
_size = sequence.Length;
for (int i = 0; i < sequence.Length; i++) {
_data[i] = ScriptingRuntimeHelpers.CharToString(sequence[i]);
}
}
public void __init__(CodeContext context, object sequence) {
try {
object len;
if (PythonTypeOps.TryInvokeUnaryOperator(context, sequence, "__len__", out len)) {
int ilen = PythonContext.GetContext(context).ConvertToInt32(len);
_data = new object[ilen];
_size = 0;
extend(sequence);
} else {
_data = new object[INITIAL_SIZE];
_size = 0;
extend(sequence);
}
} catch (MissingMemberException) {
_data = new object[INITIAL_SIZE];
_size = 0;
extend(sequence);
}
}
public static object __new__(CodeContext/*!*/ context, PythonType cls) {
if (cls == TypeCache.List) {
return new List();
}
return cls.CreateInstance(context);
}
public static object __new__(CodeContext/*!*/ context, PythonType cls, object arg) {
return __new__(context, cls);
}
public static object __new__(CodeContext/*!*/ context, PythonType cls, params object[] args\u00F8) {
return __new__(context, cls);
}
public static object __new__(CodeContext/*!*/ context, PythonType cls, [ParamDictionary]IDictionary<object, object> kwArgs\u00F8, params object[] args\u00F8) {
return __new__(context, cls);
}
private List(IEnumerator e)
: this(10) {
while (e.MoveNext()) AddNoLock(e.Current);
}
internal List(int capacity) {
if (capacity == 0) {
_data = ArrayUtils.EmptyObjects;
} else {
_data = new object[capacity];
}
}
private List(params object[] items) {
_data = items;
_size = _data.Length;
}
public List()
: this(0) {
}
#if ALLOC_DEBUG
private static int total, totalSize, cnt, growthCnt, growthSize;
~List() {
total += _data.Length;
totalSize += _size;
cnt++;
Console.Error.WriteLine("List: allocated {0} used {1} total wasted {2} - grand total wasted {3}", _data.Length, _size, total-totalSize, growthSize + total - totalSize);
Console.Error.WriteLine(" Growing {0} {1} avg {2}", growthCnt, growthSize, growthSize / growthCnt);
}
#endif
internal List(object sequence) {
ICollection items = sequence as ICollection;
object len;
if (items != null) {
_data = new object[items.Count];
int i = 0;
foreach (object item in items) {
_data[i++] = item;
}
_size = i;
} else if (PythonTypeOps.TryInvokeUnaryOperator(DefaultContext.Default,
sequence,
"__len__",
out len)) {
int ilen = Converter.ConvertToInt32(len);
_data = new object[ilen];
extend(sequence);
} else {
_data = new object[INITIAL_SIZE];
extend(sequence);
}
}
internal List(ICollection items)
: this(items.Count) {
int i = 0;
foreach (object item in items) {
_data[i++] = item;
}
_size = i;
}
/// <summary>
/// Creates a new list with the data in the array and a size
/// the same as the length of the array. The array is held
/// onto and may be mutated in the future by the list.
/// </summary>
/// <param name="data">params array to use for lists storage</param>
internal static List FromArrayNoCopy(params object[] data) {
return new List(data);
}
internal object[] GetObjectArray() {
lock (this) {
return ArrayOps.CopyArray(_data, _size);
}
}
#region binary operators
public static List operator +([NotNull]List l1, [NotNull]List l2) {
object[] ret;
int size;
lock (l1) {
ret = ArrayOps.CopyArray(l1._data, GetAddSize(l1._size, l2._size));
size = l1._size;
}
lock (l2) {
if (l2._size + size > ret.Length) {
ret = ArrayOps.CopyArray(ret, GetAddSize(size, l2._size));
}
Array.Copy(l2._data, 0, ret, size, l2._size);
List lret = new List(ret);
lret._size = size + l2._size;
return lret;
}
}
/// <summary>
/// Gets a reasonable size for the addition of two arrays. We round
/// to a power of two so that we usually have some extra space if
/// the resulting array gets added to.
/// </summary>
private static int GetAddSize(int s1, int s2) {
int length = s1 + s2;
return GetNewSize(length);
}
private static int GetNewSize(int length) {
if (length > 256) {
return length + (128 - 1) & ~(128 - 1);
}
return length + (16 - 1) & ~(16 - 1);
}
public static List operator *([NotNull]List l, int count) {
return MultiplyWorker(l, count);
}
public static List operator *(int count, List l) {
return MultiplyWorker(l, count);
}
public static object operator *([NotNull]List self, [NotNull]Index count) {
return PythonOps.MultiplySequence<List>(MultiplyWorker, self, count, true);
}
public static object operator *([NotNull]Index count, [NotNull]List self) {
return PythonOps.MultiplySequence<List>(MultiplyWorker, self, count, false);
}
public static object operator *([NotNull]List self, object count) {
int index;
if (Converter.TryConvertToIndex(count, out index)) {
return self * index;
}
throw PythonOps.TypeErrorForUnIndexableObject(count);
}
public static object operator *(object count, [NotNull]List self) {
int index;
if (Converter.TryConvertToIndex(count, out index)) {
return index * self;
}
throw PythonOps.TypeErrorForUnIndexableObject(count);
}
private static List MultiplyWorker(List self, int count) {
if (count <= 0) return PythonOps.MakeEmptyList(0);
int n, newCount;
object[] ret;
lock (self) {
n = self._size;
//??? is this useful optimization
//???if (n == 1) return new List(Array.ArrayList.Repeat(this[0], count));
newCount = checked(n * count);
ret = ArrayOps.CopyArray(self._data, newCount);
}
// this should be extremely fast for large count as it uses the same algoithim as efficient integer powers
// ??? need to test to see how large count and n need to be for this to be fastest approach
int block = n;
int pos = n;
while (pos < newCount) {
Array.Copy(ret, 0, ret, pos, Math.Min(block, newCount - pos));
pos += block;
block *= 2;
}
return new List(ret);
}
#endregion
public virtual int __len__() {
return _size;
}
public virtual IEnumerator __iter__() {
// return type is strongly typed to IEnumerator so that
// we can call it w/o requiring an explicit conversion. If the
// user overrides this we'll place a conversion in the wrapper
// helper
return new ListIterator(this);
}
public virtual IEnumerator __reversed__() {
return new ListReverseIterator(this);
}
public virtual bool __contains__(object value) {
return ContainsWorker(value);
}
internal bool ContainsWorker(object value) {
bool lockTaken = false;
try {
MonitorUtils.Enter(this, ref lockTaken);
for (int i = 0; i < _size; i++) {
object thisIndex = _data[i];
// release the lock while we may call user code...
MonitorUtils.Exit(this, ref lockTaken);
try {
if (PythonOps.EqualRetBool(thisIndex, value))
return true;
} finally {
MonitorUtils.Enter(this, ref lockTaken);
}
}
} finally {
if (lockTaken) {
Monitor.Exit(this);
}
}
return false;
}
#region ISequence Members
internal void AddRange<T>(ICollection<T> otherList) {
foreach (object o in otherList) append(o);
}
[SpecialName]
public virtual object InPlaceAdd(object other) {
if (!Object.ReferenceEquals(this, other)) {
IEnumerator e = PythonOps.GetEnumerator(other);
while (e.MoveNext()) {
append(e.Current);
}
} else {
InPlaceMultiply(2);
}
return this;
}
[SpecialName]
public List InPlaceMultiply(int count) {
lock (this) {
int n = this._size;
int newCount = checked(n * count);
EnsureSize(newCount);
int block = n;
int pos = n;
while (pos < newCount) {
Array.Copy(_data, 0, _data, pos, Math.Min(block, newCount - pos));
pos += block;
block *= 2;
}
this._size = newCount;
}
return this;
}
[SpecialName]
public object InPlaceMultiply(Index count) {
return PythonOps.MultiplySequence<List>(InPlaceMultiplyWorker, this, count, true);
}
[SpecialName]
public object InPlaceMultiply(object count) {
int index;
if (Converter.TryConvertToIndex(count, out index)) {
return InPlaceMultiply(index);
}
throw PythonOps.TypeErrorForUnIndexableObject(count);
}
private static List InPlaceMultiplyWorker(List self, int count) {
return self.InPlaceMultiply(count);
}
public virtual object __getslice__(int start, int stop) {
lock (this) {
Slice.FixSliceArguments(_size, ref start, ref stop);
object[] ret = ArrayOps.GetSlice(_data, start, stop);
return new List(ret);
}
}
internal object[] GetSliceAsArray(int start, int stop) {
if (start < 0) start = 0;
if (stop > Count) stop = Count;
lock (this) return ArrayOps.GetSlice(_data, start, stop);
}
public virtual void __setslice__(int start, int stop, object value) {
Slice.FixSliceArguments(_size, ref start, ref stop);
if (value is List) {
SliceNoStep(start, stop, (List)value);
} else {
SliceNoStep(start, stop, value);
}
}
public virtual void __delslice__(int start, int stop) {
lock (this) {
Slice.FixSliceArguments(_size, ref start, ref stop);
if (start > stop) return;
int i = start;
for (int j = stop; j < _size; j++, i++) {
_data[i] = _data[j];
}
_size -= stop - start;
}
}
private static readonly object _boxedOne = ScriptingRuntimeHelpers.Int32ToObject(1);
public virtual object this[Slice slice] {
get {
if (slice == null) throw PythonOps.TypeError("list indices must be integer or slice, not None");
int start, stop, step;
slice.indices(_size, out start, out stop, out step);
if ((step > 0 && start >= stop) || (step < 0 && start <= stop)) return new List();
if (step == 1) {
object[] ret;
lock (this) ret = ArrayOps.GetSlice(_data, start, stop);
return new List(ret);
} else {
// start/stop/step could be near Int32.MaxValue, and simply addition could cause overflow
int n = (int)(step > 0 ? (0L + stop - start + step - 1) / step : (0L + stop - start + step + 1) / step);
object[] ret = new object[n];
lock (this) {
int ri = 0;
for (int i = 0, index = start; i < n; i++, index += step) {
ret[ri++] = _data[index];
}
}
return new List(ret);
}
}
set {
if (slice == null) throw PythonOps.TypeError("list indices must be integer or slice, not None");
if (slice.step != null && (!(slice.step is int) || !slice.step.Equals(_boxedOne))) {
// try to assign back to self: make a copy first
if (this == value) value = new List(value);
if (ValueRequiresNoLocks(value)) {
// we don't need to worry about lock ordering of accesses to the
// RHS & ourselves. We can lock once and avoid repeatedly locking/unlocking
// on each assign.
lock (this) {
slice.DoSliceAssign(this.SliceAssignNoLock, _size, value);
}
} else {
slice.DoSliceAssign(this.SliceAssign, _size, value);
}
} else {
int start, stop, step;
slice.indices(_size, out start, out stop, out step);
List lstVal = value as List;
if (lstVal != null) {
SliceNoStep(start, stop, lstVal);
} else {
SliceNoStep(start, stop, value);
}
}
}
}
private static bool ValueRequiresNoLocks(object value) {
return value is PythonTuple || value is Array || value is FrozenSetCollection;
}
private void SliceNoStep(int start, int stop, List other) {
// We don't lock other here - instead we read it's object array
// and size therefore having a stable view even if it resizes.
// This means if we had a multithreaded app like:
//
// T1 T2 T3
// l1[:] = [1] * 100 l1[:] = [2] * 100 l3[:] = l1[:]
//
// we can end up with both 1s and 2s in the array. This is the
// same as if our set was implemented on top of get/set item where
// we'd take and release the locks repeatedly.
int otherSize = other._size;
object[] otherData = other._data;
lock (this) {
if ((stop - start) == otherSize) {
// we are simply replacing values, this is fast...
for (int i = 0; i < otherSize; i++) {
_data[i + start] = otherData[i];
}
} else {
// we are resizing the array (either bigger or smaller), we
// will copy the data array and replace it all at once.
stop = Math.Max(stop, start);
int newSize = _size - (stop - start) + otherSize;
object[] newData = new object[GetNewSize(newSize)];
for (int i = 0; i < start; i++) {
newData[i] = _data[i];
}
for (int i = 0; i < otherSize; i++) {
newData[i + start] = otherData[i];
}
int writeOffset = otherSize - (stop - start);
for (int i = stop; i < _size; i++) {
newData[i + writeOffset] = _data[i];
}
_size = newSize;
_data = newData;
}
}
}
private void SliceNoStep(int start, int stop, object value) {
// always copy from a List object, even if it's a copy of some user defined enumerator. This
// makes it easy to hold the lock for the duration fo the copy.
IList<object> other = value as IList<object> ?? new List(PythonOps.GetEnumerator(value));
lock (this) {
if ((stop - start) == other.Count) {
// we are simply replacing values, this is fast...
for (int i = 0; i < other.Count; i++) {
_data[i + start] = other[i];
}
} else {
// we are resizing the array (either bigger or smaller), we
// will copy the data array and replace it all at once.
stop = Math.Max(stop, start);
int newSize = _size - (stop - start) + other.Count;
object[] newData = new object[GetNewSize(newSize)];
for (int i = 0; i < start; i++) {
newData[i] = _data[i];
}
for (int i = 0; i < other.Count; i++) {
newData[i + start] = other[i];
}
int writeOffset = other.Count - (stop - start);
for (int i = stop; i < _size; i++) {
newData[i + writeOffset] = _data[i];
}
_size = newSize;
_data = newData;
}
}
}
private void SliceAssign(int index, object value) {
this[index] = value;
}
private void SliceAssignNoLock(int index, object value) {
_data[index] = value;
}
public virtual void __delitem__(int index) {
lock (this) RawDelete(PythonOps.FixIndex(index, _size));
}
public virtual void __delitem__(object index) {
__delitem__(Converter.ConvertToIndex(index));
}
public void __delitem__(Slice slice) {
if (slice == null) throw PythonOps.TypeError("list indices must be integers or slices");
lock (this) {
int start, stop, step;
// slice is sealed, indices can't be user code...
slice.indices(_size, out start, out stop, out step);
if (step > 0 && (start >= stop)) return;
if (step < 0 && (start <= stop)) return;
if (step == 1) {
int i = start;
for (int j = stop; j < _size; j++, i++) {
_data[i] = _data[j];
}
_size -= stop - start;
return;
}
if (step == -1) {
int i = stop + 1;
for (int j = start + 1; j < _size; j++, i++) {
_data[i] = _data[j];
}
_size -= start - stop;
return;
}
if (step < 0) {
// find "start" we will skip in the 1,2,3,... order
int i = start;
while (i > stop) {
i += step;
}
i -= step;
// swap start/stop, make step positive
stop = start + 1;
start = i;
step = -step;
}
int curr, skip, move;
// skip: the next position we should skip
// curr: the next position we should fill in data
// move: the next position we will check
curr = skip = move = start;
while (curr < stop && move < stop) {
if (move != skip) {
_data[curr++] = _data[move];
} else
skip += step;
move++;
}
while (stop < _size) {
_data[curr++] = _data[stop++];
}
_size = curr;
}
}
#endregion
private void RawDelete(int index) {
int len = _size - 1;
_size = len;
object[] tempData = _data;
for (int i = index; i < len; i++) {
tempData[i] = tempData[i + 1];
}
tempData[len] = null;
}
internal void EnsureSize(int needed) {
if (_data.Length >= needed) return;
if (_data.Length == 0) {
// free growth, we wasted nothing
_data = new object[4];
return;
}
int newSize = Math.Max(_size * 3, 10);
while (newSize < needed) newSize *= 2;
#if ALLOC_DEBUG
growthCnt++;
growthSize += _size;
Console.Error.WriteLine("Growing {3} {0} {1} avg {2}", growthCnt, growthSize, growthSize/growthCnt, newSize - _size);
#endif
_data = ArrayOps.CopyArray(_data, newSize);
}
public void append(object item) {
lock (this) {
AddNoLock(item);
}
}
/// <summary>
/// Non-thread safe adder, should only be used by internal callers that
/// haven't yet exposed their list.
/// </summary>
internal void AddNoLock(object item) {
EnsureSize(_size + 1);
_data[_size] = item;
_size += 1;
}
internal void AddNoLockNoDups(object item) {
for (int i = 0; i < _size; i++) {
if (PythonOps.EqualRetBool(_data[i], item)) {
return;
}
}
AddNoLock(item);
}
internal void AppendListNoLockNoDups(List list) {
if (list != null) {
foreach (object item in list) {
AddNoLockNoDups(item);
}
}
}
public int count(object item) {
bool lockTaken = false;
try {
MonitorUtils.Enter(this, ref lockTaken);
int cnt = 0;
for (int i = 0, len = _size; i < len; i++) {
object val = _data[i];
MonitorUtils.Exit(this, ref lockTaken);
try {
if (PythonOps.EqualRetBool(val, item)) cnt++;
} finally {
MonitorUtils.Enter(this, ref lockTaken);
}
}
return cnt;
} finally {
if (lockTaken) {
Monitor.Exit(this);
}
}
}
public void extend([NotNull]List/*!*/ seq) {
using(new OrderedLocker(this, seq)) {
// use the original count for if we're extending this w/ this
int count = seq.Count;
EnsureSize(Count + count);
for (int i = 0; i < count; i++) {
AddNoLock(seq[i]);
}
}
}
public void extend([NotNull]PythonTuple/*!*/ seq) {
lock (this) {
EnsureSize(Count + seq.Count);
for (int i = 0; i < seq.Count; i++) {
AddNoLock(seq[i]);
}
}
}
public void extend(object seq) {
IEnumerator i = PythonOps.GetEnumerator(seq);
if (seq == (object)this) {
List other = new List(i);
i = ((IEnumerable)other).GetEnumerator();
}
while (i.MoveNext()) append(i.Current);
}
public int index(object item) {
return index(item, 0, _size);
}
public int index(object item, int start) {
return index(item, start, _size);
}
public int index(object item, int start, int stop) {
// CPython behavior for index is to only look at the
// original items. If new items are added they
// are ignored, but if items are removed they
// aren't iterated. We therefore get a stable view
// of our data, and then go with the minimum between
// our starting size and ending size.
object[] locData;
int locSize;
lock (this) {
// get a stable view on size / data...
locData = _data;
locSize = _size;
}
start = PythonOps.FixSliceIndex(start, locSize);
stop = PythonOps.FixSliceIndex(stop, locSize);
for (int i = start; i < Math.Min(stop, Math.Min(locSize, _size)); i++) {
if (PythonOps.EqualRetBool(locData[i], item)) return i;
}
throw PythonOps.ValueError("list.index(item): item not in list");
}
public int index(object item, object start) {
return index(item, Converter.ConvertToIndex(start), _size);
}
public int index(object item, object start, object stop) {
return index(item, Converter.ConvertToIndex(start), Converter.ConvertToIndex(stop));
}
public void insert(int index, object value) {
if (index >= _size) {
append(value);
return;
}
lock (this) {
index = PythonOps.FixSliceIndex(index, _size);
EnsureSize(_size + 1);
_size += 1;
for (int i = _size - 1; i > index; i--) {
_data[i] = _data[i - 1];
}
_data[index] = value;
}
}
[PythonHidden]
public void Insert(int index, object value) {
insert(index, value);
}
public object pop() {
if (this._size == 0) throw PythonOps.IndexError("pop off of empty list");
lock (this) {
this._size -= 1;
return _data[this._size];
}
}
public object pop(int index) {
lock (this) {
index = PythonOps.FixIndex(index, _size);
if (_size == 0) throw PythonOps.IndexError("pop off of empty list");
object ret = _data[index];
_size -= 1;
for (int i = index; i < _size; i++) {
_data[i] = _data[i + 1];
}
return ret;
}
}
public void remove(object value) {
lock (this) RawDelete(index(value));
}
void IList.Remove(object value) {
remove(value);
}
public void reverse() {
lock (this) Array.Reverse(_data, 0, _size);
}
internal void reverse(int index, int count) {
lock (this) Array.Reverse(_data, index, count);
}
public void sort(CodeContext/*!*/ context) {
sort(context, null, null, false);
}
public void sort(CodeContext/*!*/ context, object cmp) {
sort(context, cmp, null, false);
}
public void sort(CodeContext/*!*/ context, object cmp, object key) {
sort(context, cmp, key, false);
}
public void sort(CodeContext/*!*/ context,
[DefaultParameterValue(null)] object cmp,
[DefaultParameterValue(null)] object key,
[DefaultParameterValue(false)] bool reverse) {
// the empty list is already sorted
if (_size != 0) {
IComparer comparer = PythonContext.GetContext(context).GetComparer(
cmp,
GetComparisonType());
DoSort(context, comparer, key, reverse, 0, _size);
}
}
private Type GetComparisonType() {
if (_size >= 4000) {
// we're big, we can afford a custom comparison call site.
return null;
}
if (_data.Length > 0) {
// use the 1st index to determine the type - we're assuming lists are
// homogeneous
return CompilerHelpers.GetType(_data[0]);
}
return typeof(object);
}
internal void DoSort(CodeContext/*!*/ context, IComparer cmp, object key, bool reverse, int index, int count) {
lock (this) {
object[] sortData = _data;
int sortSize = _size;
try {
// make the list appear empty for the duration of the sort...
_data = ArrayUtils.EmptyObjects;
_size = 0;
if (key != null) {
object[] keys = new object[sortSize];
for (int i = 0; i < sortSize; i++) {
Debug.Assert(_data.Length == 0);
keys[i] = PythonCalls.Call(context, key, sortData[i]);
if (_data.Length != 0) throw PythonOps.ValueError("list mutated while determing keys");
}
sortData = ListMergeSort(sortData, keys, cmp, index, count, reverse);
} else {
sortData = ListMergeSort(sortData, cmp, index, count, reverse);
}
} finally {
// restore the list to it's old data & size (which is now supported appropriately)
_data = sortData;
_size = sortSize;
}
}
}
internal object[] ListMergeSort(object[] sortData, IComparer cmp, int index, int count, bool reverse) {
return ListMergeSort(sortData, null, cmp, index, count, reverse);
}
internal object[] ListMergeSort(object[] sortData, object[] keys, IComparer cmp, int index, int count, bool reverse) {
if (count - index < 2) return sortData; // 1 or less items, we're sorted, quit now...
if (keys == null) keys = sortData;
// list merge sort - stable sort w/ a minimum # of comparisons.
int len = count - index;
// prepare the two lists.
int[] lists = new int[len + 2]; //0 and count + 1 are auxillary fields
lists[0] = 1;
lists[len + 1] = 2;
for (int i = 1; i <= len - 2; i++) {
lists[i] = -(i + 2);
}
lists[len - 1] = lists[len] = 0;
// new pass
for (; ; ) {
// p & q traverse the lists during each pass.
// s is usually the most most recently processed record of the current sublist
// t points to the end of the previously output sublist
int s = 0;
int t = len + 1;
int p = lists[s];
int q = lists[t];
if (q == 0) break; // we're done
for (; ; ) {
// Indexes into the array here are 1 based. 0 is a
// virtual element and so is (len - 1) - they only exist in
// the length array.
if ((p < 1) || (q <= len && DoCompare(keys, cmp, p + index - 1, q + index - 1, reverse))) {
// advance p
if (lists[s] < 0) lists[s] = Math.Abs(p) * -1;
else lists[s] = Math.Abs(p);
s = p;
p = lists[p];
if (p > 0) continue;
// complete the sublist
lists[s] = q;
s = t;
do {
t = q;
q = lists[q];
} while (q > 0);
} else {
// advance q
if (lists[s] < 0) lists[s] = Math.Abs(q) * -1;
else lists[s] = Math.Abs(q);
s = q;
q = lists[q];
if (q > 0) continue;
// Complete the sublist
lists[s] = p;
s = t;
do {
t = p;
p = lists[p];
} while (p > 0);
}
Debug.Assert(p <= 0);
Debug.Assert(q <= 0);
p *= -1;
q *= -1;
if (q == 0) {
if (lists[s] < 0) lists[s] = Math.Abs(p) * -1;
else lists[s] = Math.Abs(p);
lists[t] = 0;
// go back to new pass
break;
} // else keep going
}
}
// use the resulting indices to
// extract the order.
object[] newData = new object[len];
int start = lists[0];
int outIndex = 0;
while (start != 0) {
newData[outIndex++] = sortData[start + index - 1];
start = lists[start];
}
if (sortData.Length != count || index != 0) {
for (int j = 0; j < count; j++) {
sortData[j + index] = newData[j];
}
} else {
sortData = newData;
}
return sortData;
}
/// <summary>
/// Compares the two specified keys
/// </summary>
private bool DoCompare(object[] keys, IComparer cmp, int p, int q, bool reverse) {
Debug.Assert(_data.Length == 0);
int result = cmp.Compare(keys[p], keys[q]);
bool ret = reverse ? (result >= 0) : (result <= 0);
if (_data.Length != 0) throw PythonOps.ValueError("list mutated during sort");
return ret;
}
internal int BinarySearch(int index, int count, object value, IComparer comparer) {
lock (this) return Array.BinarySearch(_data, index, count, value, comparer);
}
internal bool EqualsWorker(List l, IEqualityComparer comparer) {
using (new OrderedLocker(this, l)) {
if (comparer == null) {
return PythonOps.ArraysEqual(_data, _size, l._data, l._size);
} else {
return PythonOps.ArraysEqual(_data, _size, l._data, l._size, comparer);
}
}
}
internal int CompareToWorker(List l) {
return CompareToWorker(l, null);
}
internal int CompareToWorker(List l, IComparer comparer) {
using (new OrderedLocker(this, l)) {
if (comparer == null) {
return PythonOps.CompareArrays(_data, _size, l._data, l._size);
} else {
return PythonOps.CompareArrays(_data, _size, l._data, l._size, comparer);
}
}
}
internal bool FastSwap(int i, int j) {
// ensure i <= j
if (i > j) {
int tmp = i;
i = j;
j = tmp;
}
// bounds checking
if (i < 0 || j >= _size) {
return false;
} else if (i == j) {
return true;
}
object temp = _data[i];
_data[i] = _data[j];
_data[j] = temp;
return true;
}
#region IList Members
bool IList.IsReadOnly {
get { return false; }
}
public virtual object this[int index] {
get {
// no locks works here, we either return an
// old item (as if we were called first) or return
// a current item...
// force reading the array first, _size can change after
object[] data = GetData();
return data[PythonOps.FixIndex(index, _size)];
}
set {
// but we need a lock here incase we're assigning
// while re-sizing.
lock (this) _data[PythonOps.FixIndex(index, _size)] = value;
}
}
public virtual object this[BigInteger index] {
get {
return this[(int)index];
}
set {
this[(int)index] = value;
}
}
/// <summary>
/// Supports __index__ on arbitrary types, also prevents __float__
/// </summary>
public virtual object this[object index] {
get {
return this[Converter.ConvertToIndex(index)];
}
set {
this[Converter.ConvertToIndex(index)] = value;
}
}
[System.Runtime.CompilerServices.MethodImpl(System.Runtime.CompilerServices.MethodImplOptions.NoInlining)]
private object[] GetData() {
return _data;
}
[PythonHidden]
public void RemoveAt(int index) {
lock (this) RawDelete(index);
}
[PythonHidden]
public bool Contains(object value) {
return __contains__(value);
}
[PythonHidden]
public void Clear() {
lock (this) _size = 0;
}
[PythonHidden]
public int IndexOf(object value) {
// we get a stable view of the list, and if user code
// clears it then we'll stop iterating.
object[] locData;
int locSize;
lock (this) {
locData = _data;
locSize = _size;
}
for (int i = 0; i < Math.Min(locSize, _size); i++) {
if (PythonOps.EqualRetBool(locData[i], value)) return i;
}
return -1;
}
[PythonHidden]
public int Add(object value) {
lock (this) {
AddNoLock(value);
return _size - 1;
}
}
bool IList.IsFixedSize {
get { return false; }
}
#endregion
#region ICollection Members
bool ICollection.IsSynchronized {
get { return false; }
}
public int Count {
[PythonHidden]
get { return _size; }
}
[PythonHidden]
public void CopyTo(Array array, int index) {
Array.Copy(_data, 0, array, index, _size);
}
internal void CopyTo(Array array, int index, int arrayIndex, int count) {
Array.Copy(_data, index, array, arrayIndex, count);
}
object ICollection.SyncRoot {
get {
return this;
}
}
#endregion
#region IEnumerable Members
[PythonHidden]
public IEnumerator GetEnumerator() {
return __iter__();
}
#endregion
#region ICodeFormattable Members
public virtual string/*!*/ __repr__(CodeContext/*!*/ context) {
List<object> infinite = PythonOps.GetAndCheckInfinite(this);
if (infinite == null) {
return "[...]";
}
int index = infinite.Count;
infinite.Add(this);
try {
StringBuilder buf = new StringBuilder();
buf.Append("[");
for (int i = 0; i < _size; i++) {
if (i > 0) buf.Append(", ");
buf.Append(PythonOps.Repr(context, _data[i]));
}
buf.Append("]");
return buf.ToString();
} finally {
System.Diagnostics.Debug.Assert(index == infinite.Count - 1);
infinite.RemoveAt(index);
}
}
#endregion
#region IValueEquality Members
#if CLR2
int IValueEquality.GetValueHashCode() {
throw PythonOps.TypeError("list object is unhashable");
}
bool IValueEquality.ValueEquals(object other) {
if (Object.ReferenceEquals(this, other)) return true;
List l = other as List;
if (l == null || l.Count != Count) return false;
return Equals(l);
}
#endif
#endregion
#region IStructuralEquatable Members
public const object __hash__ = null;
int IStructuralEquatable.GetHashCode(IEqualityComparer comparer) {
if (CompareUtil.Check(this)) {
return 0;
}
int res;
CompareUtil.Push(this);
try {
res = ((IStructuralEquatable)new PythonTuple(this)).GetHashCode(comparer);
} finally {
CompareUtil.Pop(this);
}
return res;
}
bool IStructuralEquatable.Equals(object other, IEqualityComparer comparer) {
if (Object.ReferenceEquals(this, other)) return true;
List l = other as List;
if (l == null || l.Count != Count) return false;
return Equals(l, comparer);
}
#endregion
#region ICollection<object> Members
void ICollection<object>.Add(object item) {
append(item);
}
public void CopyTo(object[] array, int arrayIndex) {
for (int i = 0; i < Count; i++) {
array[arrayIndex + i] = this[i];
}
}
bool ICollection<object>.IsReadOnly {
get { return ((IList)this).IsReadOnly; }
}
[PythonHidden]
public bool Remove(object item) {
if (this.__contains__(item)) {
this.remove(item);
return true;
}
return false;
}
#endregion
#region IEnumerable<object> Members
IEnumerator<object> IEnumerable<object>.GetEnumerator() {
return new IEnumeratorOfTWrapper<object>(((IEnumerable)this).GetEnumerator());
}
#endregion
private bool Equals(List other) {
return Equals(other, null);
}
private bool Equals(List other, IEqualityComparer comparer) {
CompareUtil.Push(this, other);
try {
return EqualsWorker(other, comparer);
} finally {
CompareUtil.Pop(this, other);
}
}
internal int CompareTo(List other) {
return CompareTo(other, null);
}
internal int CompareTo(List other, IComparer comparer) {
CompareUtil.Push(this, other);
try {
return CompareToWorker(other, comparer);
} finally {
CompareUtil.Pop(this, other);
}
}
#region Rich Comparison Members
[return: MaybeNotImplemented]
public static object operator > (List self, object other) {
List l = other as List;
if (l == null) return NotImplementedType.Value;
return self.CompareTo(l) > 0 ? ScriptingRuntimeHelpers.True : ScriptingRuntimeHelpers.False;
}
[return: MaybeNotImplemented]
public static object operator <(List self, object other) {
List l = other as List;
if (l == null) return NotImplementedType.Value;
return self.CompareTo(l) < 0 ? ScriptingRuntimeHelpers.True : ScriptingRuntimeHelpers.False;
}
[return: MaybeNotImplemented]
public static object operator >=(List self, object other) {
List l = other as List;
if (l == null) return NotImplementedType.Value;
return self.CompareTo(l) >= 0 ? ScriptingRuntimeHelpers.True : ScriptingRuntimeHelpers.False;
}
[return: MaybeNotImplemented]
public static object operator <=(List self, object other) {
List l = other as List;
if (l == null) return NotImplementedType.Value;
return self.CompareTo(l) <= 0 ? ScriptingRuntimeHelpers.True : ScriptingRuntimeHelpers.False;
}
#endregion
#region IStructuralComparable Members
int IStructuralComparable.CompareTo(object other, IComparer comparer) {
List l = other as List;
if (l == null) {
throw new ValueErrorException("expected List");
}
return CompareTo(l, comparer);
}
#endregion
}
[PythonType("listiterator")]
public sealed class ListIterator : IEnumerator, IEnumerable, IEnumerable<object>, IEnumerator<object> {
private int _index;
private readonly List _list;
private bool _iterating;
public ListIterator(List l) {
_list = l;
Reset();
}
#region IEnumerator Members
public void Reset() {
_index = -1;
_iterating = true;
}
public object Current {
get {
return _list._data[_index];
}
}
public bool MoveNext() {
if (_iterating) {
_index++;
_iterating = (_index < _list._size);
}
return _iterating;
}
#endregion
#region IEnumerable Members
public IEnumerator GetEnumerator() {
return this;
}
#endregion
#region IDisposable Members
public void Dispose() {
}
#endregion
#region IEnumerable<object> Members
IEnumerator<object> IEnumerable<object>.GetEnumerator() {
return this;
}
#endregion
}
[PythonType("listreverseiterator")]
public sealed class ListReverseIterator : IEnumerator, IEnumerable, IEnumerable<object>, IEnumerator<object> {
private int _index;
private readonly List _list;
private bool _iterating;
public ListReverseIterator(List l) {
_list = l;
Reset();
}
#region IEnumerator Members
public void Reset() {
_index = 0;
_iterating = true;
}
public object Current {
get {
return _list._data[_list._size - _index];
}
}
public bool MoveNext() {
if (_iterating) {
_index++;
_iterating = (_index <= _list._size);
}
return _iterating;
}
#endregion
#region IEnumerable Members
public IEnumerator GetEnumerator() {
return this;
}
#endregion
#region IDisposable Members
public void Dispose() {
}
#endregion
#region IEnumerable<object> Members
IEnumerator<object> IEnumerable<object>.GetEnumerator() {
return this;
}
#endregion
}
/// <summary>
/// we need to lock both objects (or copy all of one's data w/ it's lock held, and
/// then compare, which is bad). Therefore we have a strong order for locking on
/// the two objects based upon the hash code or object identity in case of a collision
/// </summary>
public struct OrderedLocker : IDisposable {
private readonly object _one, _two;
private bool _oneLocked, _twoLocked;
public OrderedLocker(object/*!*/ one, object/*!*/ two) {
Debug.Assert(one != null); Debug.Assert(two != null);
_one = one;
_two = two;
_oneLocked = false;
_twoLocked = false;
if (one == two) {
try { } finally {
MonitorUtils.Enter(one, ref _oneLocked);
}
return;
}
int hc1 = System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode(_one);
int hc2 = System.Runtime.CompilerServices.RuntimeHelpers.GetHashCode(_two);
if (hc1 < hc2) {
MonitorUtils.Enter(_one, ref _oneLocked);
MonitorUtils.Enter(_two, ref _twoLocked);
} else if (hc1 != hc2) {
MonitorUtils.Enter(_two, ref _twoLocked);
MonitorUtils.Enter(_one, ref _oneLocked);
} else {
// rare, but possible. We need a second opinion
if (IdDispenser.GetId(_one) < IdDispenser.GetId(_two)) {
MonitorUtils.Enter(_one, ref _oneLocked);
MonitorUtils.Enter(_two, ref _twoLocked);
} else {
MonitorUtils.Enter(_two, ref _twoLocked);
MonitorUtils.Enter(_one, ref _oneLocked);
}
}
}
#region IDisposable Members
public void Dispose() {
MonitorUtils.Exit(_one, ref _oneLocked);
if (_one != _two) {
MonitorUtils.Exit(_two, ref _twoLocked);
}
}
#endregion
}
}
|