lru fixes

Author: hanabi1224

bench/algorithm/coro-prime-sieve/1000_out

@@ -0,0 +1,100 @@
+2
+3
+5
+7
+11
+13
+17
+19
+23
+29
+31
+37
+41
+43
+47
+53
+59
+61
+67
+71
+73
+79
+83
+89
+97
+101
+103
+107
+109
+113
+127
+131
+137
+139
+149
+151
+157
+163
+167
+173
+179
+181
+191
+193
+197
+199
+211
+223
+227
+229
+233
+239
+241
+251
+257
+263
+269
+271
+277
+281
+283
+293
+307
+311
+313
+317
+331
+337
+347
+349
+353
+359
+367
+373
+379
+383
+389
+397
+401
+409
+419
+421
+431
+433
+439
+443
+449
+457
+461
+463
+467
+479
+487
+491
+499
+503
+509
+521
+523
+541

bench/algorithm/coro-prime-sieve/100_out

@@ -0,0 +1,200 @@
+2
+3
+5
+7
+11
+13
+17
+19
+23
+29
+31
+37
+41
+43
+47
+53
+59
+61
+67
+71
+73
+79
+83
+89
+97
+101
+103
+107
+109
+113
+127
+131
+137
+139
+149
+151
+157
+163
+167
+173
+179
+181
+191
+193
+197
+199
+211
+223
+227
+229
+233
+239
+241
+251
+257
+263
+269
+271
+277
+281
+283
+293
+307
+311
+313
+317
+331
+337
+347
+349
+353
+359
+367
+373
+379
+383
+389
+397
+401
+409
+419
+421
+431
+433
+439
+443
+449
+457
+461
+463
+467
+479
+487
+491
+499
+503
+509
+521
+523
+541
+547
+557
+563
+569
+571
+577
+587
+593
+599
+601
+607
+613
+617
+619
+631
+641
+643
+647
+653
+659
+661
+673
+677
+683
+691
+701
+709
+719
+727
+733
+739
+743
+751
+757
+761
+769
+773
+787
+797
+809
+811
+821
+823
+827
+829
+839
+853
+857
+859
+863
+877
+881
+883
+887
+907
+911
+919
+929
+937
+941
+947
+953
+967
+971
+977
+983
+991
+997
+1009
+1013
+1019
+1021
+1031
+1033
+1039
+1049
+1051
+1061
+1063
+1069
+1087
+1091
+1093
+1097
+1103
+1109
+1117
+1123
+1129
+1151
+1153
+1163
+1171
+1181
+1187
+1193
+1201
+1213
+1217
+1223

bench/algorithm/coro-prime-sieve/200_out

@@ -1,4 +1,4 @@
-import 'package:kt_dart/kt.dart';
+import "dart:collection";
 
 class LCG {
   int seed;
@@ -16,29 +16,29 @@ class LCG {
   }
 }
 
-class LRU {
+class LRU<K, V> {
   final int size;
-  final KtLinkedMap map = KtLinkedMap.empty();
+  final LinkedHashMap<K, V> map = LinkedHashMap<K, V>();
   LRU(int this.size);
 
-  int? get(int key) {
-    final ret = map.getOrDefault(key, null);
+  V? get(K key) {
+    final ret = map[key];
     if (ret != null) {
       map.remove(key);
-      map.put(key, ret);
+      map[key] = ret;
     }
     return ret;
   }
 
-  void put(int key, int value) {
+  void put(K key, V value) {
     if (map.containsKey(key)) {
       map.remove(key);
     } else {
-      if (map.size == size) {
-        map.remove(map.keys.first());
+      if (map.length == size) {
+        map.remove(map.keys.first);
       }
     }
-    map.put(key, value);
+    map[key] = value;
   }
 }
 
@@ -50,7 +50,7 @@ void main(List<String> arguments) {
   var missed = 0;
   final rng0 = LCG(0);
   final rng1 = LCG(1);
-  final lru = LRU(size);
+  final lru = LRU<int, int>(size);
   for (var i = 0; i < n; i++) {
     final n0 = rng0.next() % mod;
     lru.put(n0, n0);