Repository navigation
Expand file tree
/
Copy pathIndexable.cs
More file actions
645 lines (557 loc) · 17.6 KB
/
Copy pathIndexable.cs
File metadata and controls
645 lines (557 loc) · 17.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
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
// Licensed to the .NET Foundation under one or more agreements.
// The .NET Foundation licenses this file to you under the Apache 2.0 License.
// See the LICENSE file in the project root for more information.
using System;
using System.Collections;
using System.Collections.Generic;
namespace IronPythonTest {
public class Tuple {
private object[] val;
public Tuple(object a) {
val = new object[] { a };
}
public Tuple(object a, object b) {
val = new object[] { a, b };
}
public Tuple(object a, object b, object c) {
val = new object[] { a, b, c };
}
public Tuple(object a, object b, object c, object d) {
val = new object[] { a, b, c, d };
}
public Tuple(object a, object b, object c, object d, object e) {
val = new object[] { a, b, c, d, e };
}
private static bool Compare(object x, object y) {
if (x != null) {
if (y != null) {
return x.Equals(y);
} else return false;
} else {
return y == null;
}
}
public override bool Equals(object obj) {
Tuple other = obj as Tuple;
if (other == null) return false;
if (val != null) {
if (other.val != null) {
if (val.Length != other.val.Length) {
return false;
}
for (int i = 0; i < val.Length; i++) {
if (!Compare(val[i], other.val[i])) {
return false;
}
}
return true;
} else return false;
} else return other.val == null;
}
public override int GetHashCode() {
int hash = 0;
if (val != null && val.Length > 0) {
hash = val[0].GetHashCode();
for (int i = 1; i < val.Length; i++) {
hash ^= val[i].GetHashCode();
}
}
return hash;
}
}
public struct StructIndexable {
private List<int?> _data;
public int? this[int index] {
get {
if (_data == null || _data.Count < index) {
return null;
}
return _data[index];
}
set {
if (_data == null) {
_data = new List<int?>();
}
while (_data.Count <= index) {
_data.Add(null);
}
_data[index] = value;
}
}
}
public class Indexable {
private Hashtable ht = new Hashtable();
public string this[int index] {
get {
return (string)ht[index];
}
set {
ht[index] = value;
}
}
public string this[string index] {
get {
return (string)ht[index];
}
set {
ht[index] = value;
}
}
public string this[double index] {
get {
return (string)ht[index];
}
set {
ht[index] = value;
}
}
public string this[int i, int j] {
get {
string ret = (string)ht[new Tuple(i, j)];
return ret;
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[int i, double j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[int i, string j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[double i, int j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[double i, double j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[double i, string j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[string i, int j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[string i, double j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
public string this[string i, string j] {
get {
return (string)ht[new Tuple(i, j)];
}
set {
ht[new Tuple(i, j)] = value;
}
}
}
public class IndexableList : IList {
private List<object> myList = new List<object>();
public object this[string index] {
get {
return myList[Int32.Parse(index)];
}
set {
myList[Int32.Parse(index)] = value;
}
}
#region IList Members
public int Add(object value) {
int res = myList.Count;
myList.Add(value);
return res;
}
public void Clear() {
myList.Clear();
}
public bool Contains(object value) {
return myList.Contains(value);
}
public int IndexOf(object value) {
return myList.IndexOf(value);
}
public void Insert(int index, object value) {
myList.Insert(index, value);
}
public bool IsFixedSize {
get { return false; }
}
public bool IsReadOnly {
get { return false; }
}
public void Remove(object value) {
myList.Remove(value);
}
public void RemoveAt(int index) {
myList.RemoveAt(index);
}
public object this[int index] {
get {
return myList[index];
}
set {
myList[index] = value;
}
}
#endregion
#region ICollection Members
public void CopyTo(Array array, int index) {
throw new NotImplementedException();
}
public int Count {
get { return myList.Count; }
}
public bool IsSynchronized {
get { return false; }
}
public object SyncRoot {
get { throw new Exception("The method or operation is not implemented."); }
}
#endregion
#region IEnumerable Members
public IEnumerator GetEnumerator() {
return myList.GetEnumerator();
}
#endregion
}
public class PropertyAccessClass {
public int this[int i] {
get {
return i;
}
set {
if (i != value) {
throw new IndexOutOfRangeException();
}
}
}
public int this[int i, int j] {
get {
return i + j;
}
set {
if (i + j != value) {
throw new IndexOutOfRangeException();
}
}
}
public int this[int i, int j, int k] {
get {
return i + j + k;
}
set {
if (i + j + k != value) {
throw new IndexOutOfRangeException();
}
}
}
}
public class MultipleIndexes {
private Dictionary<object, object> ht = new Dictionary<object, object>();
// works like Hashtable indexer--returns null instead of throwing if the key isn't found
private object GetValue(Tuple t) {
object result;
ht.TryGetValue(t, out result);
return result;
}
public object this[object i] {
get {
return GetValue(new Tuple(i));
}
set {
ht[new Tuple(i)] = value;
}
}
public object this[object i, object j] {
get {
return GetValue(new Tuple(i, j));
}
set {
ht[new Tuple(i, j)] = value;
}
}
public object this[object i, object j, object k] {
get {
return GetValue(new Tuple(i, j, k));
}
set {
ht[new Tuple(i, j, k)] = value;
}
}
public object this[object i, object j, object k, object l] {
get {
return GetValue(new Tuple(i, j, k, l));
}
set {
ht[new Tuple(i, j, k, l)] = value;
}
}
public object this[object i, object j, object k, object l, object m] {
get {
return GetValue(new Tuple(i, j, k, l, m));
}
set {
ht[new Tuple(i, j, k, l, m)] = value;
}
}
}
// TODO: LastIndexOf
public class UsePythonListAsList {
private IList<int> list;
public UsePythonListAsList(IList<int> list) {
this.list = list;
}
public int Inspect() {
list.Clear();
for (int i = 0; i < 100; i++) list.Add(i);
int flag = 0;
if (list.IndexOf(5) == 5) flag += 1;
if (list.IndexOf(1000) == -1) flag += 10;
if (list[5] == 5) flag += 100;
if (list.Remove(5)) flag += 1000;
if (list.IndexOf(5) == -1) flag += 10000;
return flag;
}
public void AddRemove() {
int value = 20;
list.Insert(0, value);
list.Insert(3, value);
list.Insert(5, value);
list.Insert(list.Count, value);
list[list.Count / 2] = value;
list.RemoveAt(2);
list.RemoveAt(list.Count - 1);
}
public int Loop() {
int sum = 0;
foreach (int t in list) sum += t;
return sum;
}
}
public class UsePythonListAsArrayList {
private ArrayList list;
public UsePythonListAsArrayList(ArrayList list) {
this.list = list;
}
public void AddRemove() {
foreach (object o in new object[] { 1, 2L, "string", typeof(int) }) {
list.Add(o);
}
list.Remove(2L);
list.RemoveAt(0);
list.RemoveRange(1, 2);
list.Reverse();
list.InsertRange(1, new object[] { 100, 30.4, (byte)3 });
list.SetRange(list.Count - 2, new object[] { (ushort)20, -200 });
list.Reverse();
//list.Capacity = list.Count / 2;
}
public int Inspect() {
list.Clear();
for (int i = 0; i < 10; i++) list.Add(i);
list.AddRange(new string[] { "a", "bc" });
int flag = 0;
if (list.IndexOf("a") == 10
&& list.IndexOf(4, 3) == 4 && list.IndexOf(4, 6) == -1
&& list.IndexOf(3, 1, 4) == 3 && list.IndexOf(4, 1, 10) == 4
&& list.IndexOf(3, 7, 3) == -1
&& list.LastIndexOf("a") == 10 && list.LastIndexOf("bc") == 11
&& list.LastIndexOf(4, 5) == 4
&& list.LastIndexOf(4, 6, 2) == -1 && list.LastIndexOf(4, 6, 3) == 4
&& list.LastIndexOf(1, 6, 5) == -1 && list.LastIndexOf(1, 6, 6) == 1
&& list.LastIndexOf(0, 6, 6) == -1 && list.LastIndexOf(0, 6, 7) == 0
)
flag += 1;
if (list.Count == 12) flag += 10;
if (list.Contains(8)) flag += 100;
if (list.Contains("abc") == false) flag += 1000;
if (list.BinarySearch("5", new MyComparer()) == 5
&& list.BinarySearch(0, 10, "a", new MyComparer()) == -1
&& list.BinarySearch(0, 10, 5, new MyComparer()) == 5
)
flag += 10000;
return flag;
}
public int Loop(out string strs) {
strs = null;
int sum = 0;
foreach (object o in list) {
if (o is int) {
sum += (int)o;
} else if (o is string) {
strs += (string)o;
}
}
return sum;
}
private class MyComparer : IComparer {
public int Compare(object x, object y) {
return string.Compare(x.ToString(), y.ToString(), StringComparison.Ordinal);
}
}
}
public class UsePythonDictAsDictionary {
private IDictionary<string, int> dict;
public UsePythonDictAsDictionary(IDictionary<string, int> dict) {
this.dict = dict;
}
public void AddRemove() {
dict.Add("hello", 1000);
dict.Add(new KeyValuePair<string, int>("world", 2000));
dict.Add("python", 3000);
dict.Remove("python");
}
public int Inspect(out string keys, out int values) {
dict.Clear();
for (int i = 0; i < 10; i++)
dict.Add(i.ToString(), i);
int flag = 0;
if (dict.ContainsKey("5")) flag += 1;
if (dict["5"] == 5) flag += 10;
if (dict.Count == 10) flag += 100;
int val;
if (dict.TryGetValue("6", out val)) flag += 1000;
if (dict.TryGetValue("spam", out val) == false) flag += 10000;
keys = string.Empty;
foreach (string s in SortedArray(dict.Keys, null)) {
keys += s;
}
values = 0;
foreach (int v in dict.Values) {
values += v;
}
return flag;
}
private T[] SortedArray<T>(ICollection<T> value, Comparison<T> comparer) {
T[] array = new T[value.Count];
value.CopyTo(array, 0);
if (comparer != null) {
Array.Sort(array, comparer);
} else {
Array.Sort(array);
}
return array;
}
private static int KeyValueComparer(KeyValuePair<string, int> x, KeyValuePair<string, int> y) {
return string.Compare(x.Key, y.Key, StringComparison.Ordinal);
}
public void Loop(out string keys, out int values) {
keys = string.Empty;
values = 0;
foreach (KeyValuePair<string, int> pair in SortedArray(dict, KeyValueComparer)) {
keys += pair.Key;
values += pair.Value;
}
}
}
public class CSharpEnumerable {
public IEnumerable<int> GetEnumerableOfInt() {
yield return 1;
yield return 2;
yield return 3;
}
public IEnumerable<object> GetEnumerableOfObject() {
yield return 1;
yield return 2;
yield return 3;
}
public IEnumerable GetEnumerable() {
yield return 1;
yield return 2;
yield return 3;
}
public IEnumerator<int> GetEnumeratorOfInt() {
yield return 1;
yield return 2;
yield return 3;
}
public IEnumerator<object> GetEnumeratorOfObject() {
yield return 1;
yield return 2;
yield return 3;
}
public IEnumerator GetEnumerator() {
yield return 1;
yield return 2;
yield return 3;
}
}
public class UsePythonDictAsHashtable {
private Hashtable table;
public UsePythonDictAsHashtable(Hashtable table) {
this.table = table;
}
public void AddRemove() {
table.Add(200, 400);
table.Add("spam", "spam");
table.Remove("spam");
}
public int Inspect(out int keysum, out int valuesum) {
table.Clear();
for (int i = 0; i < 10; i++) {
table.Add(i, i * i);
}
int flag = 0;
if (table.Contains(0)) flag += 1;
if (table.Contains("0") == false) flag += 10;
if (table.ContainsKey(3)) flag += 100;
if (table.ContainsValue(81)) flag += 1000;
if ((int)table[8] == 64) flag += 10000;
table[8] = 89;
if ((int)table[8] == 89) flag += 100000;
if (table.Count == 10) flag += 1000000;
keysum = 0;
foreach (object o in table.Keys) {
keysum += (int)o;
}
valuesum = 0;
foreach (object o in table.Values) {
valuesum += (int)o;
}
return flag;
}
public int Loop() {
int sum = 0;
IDictionaryEnumerator ide = table.GetEnumerator();
while (ide.MoveNext()) {
sum += (int)ide.Value;
sum += (int)ide.Key;
}
return sum;
}
}
}