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
| <html><style type="text/css">
span.lineno { color: white; background: #aaaaaa; border-right: solid white 12px }
span.nottickedoff { background: yellow}
span.istickedoff { background: white }
span.tickonlyfalse { margin: -1px; border: 1px solid #f20913; background: #f20913 }
span.tickonlytrue { margin: -1px; border: 1px solid #60de51; background: #60de51 }
span.funcount { font-size: small; color: orange; z-index: 2; position: absolute; right: 20 }
span.decl { font-weight: bold }
span.spaces { background: white }
</style>
<pre>
<span class="lineno"> 1 </span>{-# LANGUAGE NoBangPatterns, CPP, DeriveDataTypeable, ScopedTypeVariables #-}
<span class="lineno"> 2 </span>-----------------------------------------------------------------------------
<span class="lineno"> 3 </span>-- |
<span class="lineno"> 4 </span>-- Module : Data.CompactMap
<span class="lineno"> 5 </span>-- Copyright : (c) David Himmelstrup 2008
<span class="lineno"> 6 </span>-- License : BSD-style
<span class="lineno"> 7 </span>-- Maintainer : libraries@haskell.org
<span class="lineno"> 8 </span>-- Stability : experimental
<span class="lineno"> 9 </span>-- Portability : portable
<span class="lineno"> 10 </span>--
<span class="lineno"> 11 </span>-- An efficient implementation of maps from keys to values (dictionaries).
<span class="lineno"> 12 </span>--
<span class="lineno"> 13 </span>-- Since many function names (but not the type name) clash with
<span class="lineno"> 14 </span>-- "Prelude" names, this module is usually imported @qualified@, e.g.
<span class="lineno"> 15 </span>--
<span class="lineno"> 16 </span>-- > import Data.CompactMap (Map)
<span class="lineno"> 17 </span>-- > import qualified Data.CompactMap as Map
<span class="lineno"> 18 </span>--
<span class="lineno"> 19 </span>-- The implementation of 'Map' is based on /size balanced/ binary trees (or
<span class="lineno"> 20 </span>-- trees of /bounded balance/) as described by:
<span class="lineno"> 21 </span>--
<span class="lineno"> 22 </span>-- * Stephen Adams, \"/Efficient sets: a balancing act/\",
<span class="lineno"> 23 </span>-- Journal of Functional Programming 3(4):553-562, October 1993,
<span class="lineno"> 24 </span>-- <http://www.swiss.ai.mit.edu/~adams/BB/>.
<span class="lineno"> 25 </span>--
<span class="lineno"> 26 </span>-- * J. Nievergelt and E.M. Reingold,
<span class="lineno"> 27 </span>-- \"/Binary search trees of bounded balance/\",
<span class="lineno"> 28 </span>-- SIAM journal of computing 2(1), March 1973.
<span class="lineno"> 29 </span>--
<span class="lineno"> 30 </span>-- Note that the implementation is /left-biased/ -- the elements of a
<span class="lineno"> 31 </span>-- first argument are always preferred to the second, for example in
<span class="lineno"> 32 </span>-- 'union' or 'insert'.
<span class="lineno"> 33 </span>--
<span class="lineno"> 34 </span>-- Operation comments contain the operation time complexity in
<span class="lineno"> 35 </span>-- the Big-O notation <http://en.wikipedia.org/wiki/Big_O_notation>.
<span class="lineno"> 36 </span>-----------------------------------------------------------------------------
<span class="lineno"> 37 </span>module Data.CompactMap
<span class="lineno"> 38 </span> ( -- * Map type
<span class="lineno"> 39 </span> Map -- instance Eq,Show,Read
<span class="lineno"> 40 </span>
<span class="lineno"> 41 </span> -- * Operators
<span class="lineno"> 42 </span> , (!) --, (\\)
<span class="lineno"> 43 </span>
<span class="lineno"> 44 </span>
<span class="lineno"> 45 </span> -- * Query
<span class="lineno"> 46 </span> , null
<span class="lineno"> 47 </span> , size
<span class="lineno"> 48 </span> , member
<span class="lineno"> 49 </span> , notMember
<span class="lineno"> 50 </span> , lookup
<span class="lineno"> 51 </span> , findWithDefault
<span class="lineno"> 52 </span>
<span class="lineno"> 53 </span> -- * Construction
<span class="lineno"> 54 </span> , empty
<span class="lineno"> 55 </span> , singleton
<span class="lineno"> 56 </span>
<span class="lineno"> 57 </span> -- ** Insertion
<span class="lineno"> 58 </span> , insert
<span class="lineno"> 59 </span> , insertWith, insertWithKey, insertLookupWithKey
<span class="lineno"> 60 </span>
<span class="lineno"> 61 </span> -- ** Delete\/Update
<span class="lineno"> 62 </span> , delete
<span class="lineno"> 63 </span> , adjust
<span class="lineno"> 64 </span> , adjustWithKey
<span class="lineno"> 65 </span> , update
<span class="lineno"> 66 </span> , updateWithKey
<span class="lineno"> 67 </span> , updateLookupWithKey
<span class="lineno"> 68 </span> , alter
<span class="lineno"> 69 </span>
<span class="lineno"> 70 </span> -- * Combine
<span class="lineno"> 71 </span> , union
<span class="lineno"> 72 </span> , unionWith
<span class="lineno"> 73 </span> , unionWithKey
<span class="lineno"> 74 </span> , unions
<span class="lineno"> 75 </span> , unionsWith{-
<span class="lineno"> 76 </span>
<span class="lineno"> 77 </span> -- ** Difference
<span class="lineno"> 78 </span> , difference
<span class="lineno"> 79 </span> , differenceWith
<span class="lineno"> 80 </span> , differenceWithKey
<span class="lineno"> 81 </span>
<span class="lineno"> 82 </span> -- ** Intersection
<span class="lineno"> 83 </span> , intersection
<span class="lineno"> 84 </span> , intersectionWith
<span class="lineno"> 85 </span> , intersectionWithKey-}
<span class="lineno"> 86 </span>
<span class="lineno"> 87 </span> -- * Traversal
<span class="lineno"> 88 </span> -- ** Map
<span class="lineno"> 89 </span> , map
<span class="lineno"> 90 </span> , mapWithKey{-
<span class="lineno"> 91 </span> , mapAccum
<span class="lineno"> 92 </span> , mapAccumWithKey-}
<span class="lineno"> 93 </span> , mapKeys
<span class="lineno"> 94 </span> , mapKeysWith
<span class="lineno"> 95 </span> , mapKeysMonotonic
<span class="lineno"> 96 </span>
<span class="lineno"> 97 </span> -- ** Fold
<span class="lineno"> 98 </span> , fold
<span class="lineno"> 99 </span> , foldWithKey
<span class="lineno"> 100 </span>
<span class="lineno"> 101 </span> -- * Conversion
<span class="lineno"> 102 </span> , elems
<span class="lineno"> 103 </span> , keys
<span class="lineno"> 104 </span> , keysSet
<span class="lineno"> 105 </span> , assocs
<span class="lineno"> 106 </span>
<span class="lineno"> 107 </span> -- ** Lists
<span class="lineno"> 108 </span> , toList
<span class="lineno"> 109 </span> , fromList
<span class="lineno"> 110 </span> , fromListWith
<span class="lineno"> 111 </span> , fromListWithKey
<span class="lineno"> 112 </span>
<span class="lineno"> 113 </span> -- ** Ordered lists
<span class="lineno"> 114 </span> , toAscList
<span class="lineno"> 115 </span> , fromAscList
<span class="lineno"> 116 </span> , fromAscListWith
<span class="lineno"> 117 </span> , fromAscListWithKey
<span class="lineno"> 118 </span> , fromDistinctAscList
<span class="lineno"> 119 </span>
<span class="lineno"> 120 </span> -- * Filter
<span class="lineno"> 121 </span> , filter
<span class="lineno"> 122 </span> , filterWithKey
<span class="lineno"> 123 </span> , partition
<span class="lineno"> 124 </span> , partitionWithKey
<span class="lineno"> 125 </span>
<span class="lineno"> 126 </span> , mapMaybe
<span class="lineno"> 127 </span> , mapMaybeWithKey
<span class="lineno"> 128 </span> , mapEither
<span class="lineno"> 129 </span> , mapEitherWithKey{-
<span class="lineno"> 130 </span>
<span class="lineno"> 131 </span> , split
<span class="lineno"> 132 </span> , splitLookup
<span class="lineno"> 133 </span>
<span class="lineno"> 134 </span> -- * Submap
<span class="lineno"> 135 </span> , isSubmapOf, isSubmapOfBy
<span class="lineno"> 136 </span> , isProperSubmapOf, isProperSubmapOfBy
<span class="lineno"> 137 </span>
<span class="lineno"> 138 </span> -- * Indexed
<span class="lineno"> 139 </span> , lookupIndex
<span class="lineno"> 140 </span> , findIndex
<span class="lineno"> 141 </span> , elemAt
<span class="lineno"> 142 </span> , updateAt
<span class="lineno"> 143 </span> , deleteAt-}
<span class="lineno"> 144 </span> -- * Min\/Max
<span class="lineno"> 145 </span> , findMin
<span class="lineno"> 146 </span> , findMax
<span class="lineno"> 147 </span> , deleteMin
<span class="lineno"> 148 </span>-- , deleteMax
<span class="lineno"> 149 </span> , deleteFindMin
<span class="lineno"> 150 </span>-- , deleteFindMax
<span class="lineno"> 151 </span>{- , updateMin
<span class="lineno"> 152 </span> , updateMax
<span class="lineno"> 153 </span> , updateMinWithKey
<span class="lineno"> 154 </span> , updateMaxWithKey
<span class="lineno"> 155 </span> , minView
<span class="lineno"> 156 </span> , maxView
<span class="lineno"> 157 </span> , minViewWithKey
<span class="lineno"> 158 </span> , maxViewWithKey
<span class="lineno"> 159 </span>
<span class="lineno"> 160 </span> -- * Debugging
<span class="lineno"> 161 </span> , showTree
<span class="lineno"> 162 </span> , showTreeWith
<span class="lineno"> 163 </span> , valid-}
<span class="lineno"> 164 </span> ) where
<span class="lineno"> 165 </span>
<span class="lineno"> 166 </span>
<span class="lineno"> 167 </span>import Data.Monoid (Monoid(..))
<span class="lineno"> 168 </span>import Control.Concurrent
<span class="lineno"> 169 </span>import Data.IORef
<span class="lineno"> 170 </span>import Data.Binary
<span class="lineno"> 171 </span>import Data.Typeable
<span class="lineno"> 172 </span>import Data.List (foldl')
<span class="lineno"> 173 </span>import System.IO.Unsafe
<span class="lineno"> 174 </span>
<span class="lineno"> 175 </span>import qualified Data.Maybe as Maybe
<span class="lineno"> 176 </span>import Data.Maybe (isJust)
<span class="lineno"> 177 </span>import Foreign (nullPtr)
<span class="lineno"> 178 </span>import Text.Read hiding (get)
<span class="lineno"> 179 </span>import Control.Monad
<span class="lineno"> 180 </span>import qualified Data.CompactMap.Index as Index
<span class="lineno"> 181 </span>import Data.CompactMap.Types as Types
<span class="lineno"> 182 </span>import qualified Data.Array.IArray as IArray
<span class="lineno"> 183 </span>import qualified Data.Set as Set
<span class="lineno"> 184 </span>
<span class="lineno"> 185 </span>import qualified Data.ByteString as Strict
<span class="lineno"> 186 </span>import qualified Data.ByteString.Lazy as Lazy
<span class="lineno"> 187 </span>
<span class="lineno"> 188 </span>import Prelude hiding (null,lookup,map,filter)
<span class="lineno"> 189 </span>import qualified Prelude
<span class="lineno"> 190 </span>
<span class="lineno"> 191 </span>import System.Mem.Weak
<span class="lineno"> 192 </span>
<span class="lineno"> 193 </span>data Range = Range Int Int
<span class="lineno"> 194 </span>
<span class="lineno"> 195 </span>-- | A Map from keys @k@ to values @a@.
<span class="lineno"> 196 </span>data Map k a = Empty
<span class="lineno"> 197 </span> | Existing
<span class="lineno"> 198 </span> { index :: !(MVar Index)
<span class="lineno"> 199 </span> , uniq :: {-# UNPACK #-} !(IORef Int)
<span class="lineno"> 200 </span> , range :: ![Range]
<span class="lineno"> 201 </span> , mapSize :: {-# UNPACK #-} !Int
<span class="lineno"> 202 </span> }
<span class="lineno"> 203 </span>#if !defined(HPC)
<span class="lineno"> 204 </span> deriving (Typeable)
<span class="lineno"> 205 </span>#endif
<span class="lineno"> 206 </span>
<span class="lineno"> 207 </span>{--------------------------------------------------------------------
<span class="lineno"> 208 </span> Instances
<span class="lineno"> 209 </span>--------------------------------------------------------------------}
<span class="lineno"> 210 </span>
<span class="lineno"> 211 </span>instance (Eq k, Eq a, Binary k, Binary a) => Eq (Map k a) where
<span class="lineno"> 212 </span> <span class="decl"><span class="istickedoff">m1 == m2 = toList m1 == toList m2</span></span>
<span class="lineno"> 213 </span>
<span class="lineno"> 214 </span>instance (Ord k, Ord a, Binary k, Binary a) => Ord (Map k a) where
<span class="lineno"> 215 </span> <span class="decl"><span class="istickedoff">m1 `compare` m2 = toList m1 `compare` toList m2</span></span>
<span class="lineno"> 216 </span>
<span class="lineno"> 217 </span>instance (Binary k, Binary a, Show k, Show a) => Show (Map k a) where
<span class="lineno"> 218 </span> <span class="decl"><span class="istickedoff">showsPrec d m = showParen (d > 10) $</span>
<span class="lineno"> 219 </span><span class="spaces"> </span><span class="istickedoff">showString "fromList " . shows (toList m)</span></span>
<span class="lineno"> 220 </span>
<span class="lineno"> 221 </span>instance (Ord k, Binary k, Binary a, Read k, Read a) => Read (Map k a) where
<span class="lineno"> 222 </span>#ifdef __GLASGOW_HASKELL__
<span class="lineno"> 223 </span> <span class="decl"><span class="istickedoff">readPrec = parens $ prec 10 $ do</span>
<span class="lineno"> 224 </span><span class="spaces"> </span><span class="istickedoff">Ident "fromList" <- lexP</span>
<span class="lineno"> 225 </span><span class="spaces"> </span><span class="istickedoff">xs <- readPrec</span>
<span class="lineno"> 226 </span><span class="spaces"> </span><span class="istickedoff">return (fromList xs)</span></span>
<span class="lineno"> 227 </span>
<span class="lineno"> 228 </span> <span class="decl"><span class="istickedoff">readListPrec = readListPrecDefault</span></span>
<span class="lineno"> 229 </span>#else
<span class="lineno"> 230 </span> readsPrec p = readParen (p > 10) $ \ r -> do
<span class="lineno"> 231 </span> ("fromList",s) <- lex r
<span class="lineno"> 232 </span> (xs,t) <- reads s
<span class="lineno"> 233 </span> return (fromList xs,t)
<span class="lineno"> 234 </span>#endif
<span class="lineno"> 235 </span>
<span class="lineno"> 236 </span>instance Binary (Map k a) where
<span class="lineno"> 237 </span> <span class="decl"><span class="istickedoff">put Empty = put (0::Int)</span>
<span class="lineno"> 238 </span><span class="spaces"> </span><span class="istickedoff">put Existing{index=index,range=range,mapSize=mapSize} =</span>
<span class="lineno"> 239 </span><span class="spaces"> </span><span class="istickedoff">let a = unsafePerformIO $ withMVar index $ Index.listKeyPointers</span>
<span class="lineno"> 240 </span><span class="spaces"> </span><span class="istickedoff">in do put mapSize</span>
<span class="lineno"> 241 </span><span class="spaces"> </span><span class="istickedoff">forM_ (IArray.elems a) $ \ptr -></span>
<span class="lineno"> 242 </span><span class="spaces"> </span><span class="istickedoff">do let ls = unsafePerformIO $ Index.getDataFromPointer ptr</span>
<span class="lineno"> 243 </span><span class="spaces"> </span><span class="istickedoff">case findValue range ls of</span>
<span class="lineno"> 244 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> return <span class="nottickedoff">()</span></span>
<span class="lineno"> 245 </span><span class="spaces"> </span><span class="istickedoff">Just val -> do let key = unsafePerformIO $ Index.getKeyFromPointer ptr</span>
<span class="lineno"> 246 </span><span class="spaces"> </span><span class="istickedoff">put (key,val)</span>
<span class="lineno"> 247 </span><span class="spaces"> </span><span class="istickedoff">unsafePerformIO $</span>
<span class="lineno"> 248 </span><span class="spaces"> </span><span class="istickedoff">do withMVar index Index.touchIndex</span>
<span class="lineno"> 249 </span><span class="spaces"> </span><span class="istickedoff">return $ return <span class="nottickedoff">()</span></span></span>
<span class="lineno"> 250 </span> <span class="decl"><span class="istickedoff">get = do n <- get</span>
<span class="lineno"> 251 </span><span class="spaces"> </span><span class="istickedoff">ls <- replicateM n get</span>
<span class="lineno"> 252 </span><span class="spaces"> </span><span class="istickedoff">unsafePerformIO $</span>
<span class="lineno"> 253 </span><span class="spaces"> </span><span class="istickedoff">do idx <- Index.newIndex</span>
<span class="lineno"> 254 </span><span class="spaces"> </span><span class="istickedoff">forM_ ls $ \(k,v) -> do keyCursor <- Index.newKeyCursor (indexBuffer idx) (Lazy.fromChunks [k])</span>
<span class="lineno"> 255 </span><span class="spaces"> </span><span class="istickedoff">Index.insertLargestKeyCursor idx keyCursor</span>
<span class="lineno"> 256 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) 0 (Just (Lazy.fromChunks [v]))</span>
<span class="lineno"> 257 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 258 </span><span class="spaces"> </span><span class="istickedoff">--Index.insertBS idx (decodeStrict k :: k) 0 (Just (Lazy.fromChunks [v]))</span>
<span class="lineno"> 259 </span><span class="spaces"> </span><span class="istickedoff">uniq <- newIORef 1</span>
<span class="lineno"> 260 </span><span class="spaces"> </span><span class="istickedoff">index <- newMVar idx</span>
<span class="lineno"> 261 </span><span class="spaces"> </span><span class="istickedoff">return $ return $ Existing{index=index,uniq=uniq,range=addToRange 0 [],mapSize=n}</span></span>
<span class="lineno"> 262 </span>
<span class="lineno"> 263 </span>instance (Ord k, Binary k, Binary a) => Monoid (Map k a) where
<span class="lineno"> 264 </span> <span class="decl"><span class="istickedoff">mempty = empty</span></span>
<span class="lineno"> 265 </span> <span class="decl"><span class="istickedoff">mappend = union</span></span>
<span class="lineno"> 266 </span> <span class="decl"><span class="istickedoff">mconcat = unions</span></span>
<span class="lineno"> 267 </span>
<span class="lineno"> 268 </span>
<span class="lineno"> 269 </span>{--------------------------------------------------------------------
<span class="lineno"> 270 </span> Methods
<span class="lineno"> 271 </span>--------------------------------------------------------------------}
<span class="lineno"> 272 </span>
<span class="lineno"> 273 </span>infixl 9 ! -- ,\\
<span class="lineno"> 274 </span>
<span class="lineno"> 275 </span>-- | /O(log n)/. Find the value at a key.
<span class="lineno"> 276 </span>-- Calls 'error' when the element can not be found.
<span class="lineno"> 277 </span>--
<span class="lineno"> 278 </span>-- > fromList [(5,'a'), (3,'b')] ! 1 Error: element not in the map
<span class="lineno"> 279 </span>-- > fromList [(5,'a'), (3,'b')] ! 5 == 'a'
<span class="lineno"> 280 </span>
<span class="lineno"> 281 </span>(!) :: (Ord k, Binary k, Binary a) => Map k a -> k -> a
<span class="lineno"> 282 </span><span class="decl"><span class="istickedoff">m ! k = case lookup k m of</span>
<span class="lineno"> 283 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> <span class="nottickedoff">error "element not in the map"</span></span>
<span class="lineno"> 284 </span><span class="spaces"> </span><span class="istickedoff">Just x -> x</span></span>
<span class="lineno"> 285 </span>
<span class="lineno"> 286 </span>
<span class="lineno"> 287 </span>-- | /O(1)/. Is the map empty?
<span class="lineno"> 288 </span>--
<span class="lineno"> 289 </span>-- > Data.Map.null (empty) == True
<span class="lineno"> 290 </span>-- > Data.Map.null (singleton 1 'a') == False
<span class="lineno"> 291 </span>null :: Map k a -> Bool
<span class="lineno"> 292 </span><span class="decl"><span class="istickedoff">null m = size m == 0</span></span>
<span class="lineno"> 293 </span>
<span class="lineno"> 294 </span>-- | /O(1)/. The number of elements in the map.
<span class="lineno"> 295 </span>--
<span class="lineno"> 296 </span>-- > size empty == 0
<span class="lineno"> 297 </span>-- > size (singleton 1 'a') == 1
<span class="lineno"> 298 </span>-- > size (fromList([(1,'a'), (2,'c'), (3,'b')])) == 3
<span class="lineno"> 299 </span>size :: Map k a -> Int
<span class="lineno"> 300 </span><span class="decl"><span class="istickedoff">size Empty = 0</span>
<span class="lineno"> 301 </span><span class="spaces"></span><span class="istickedoff">size Existing{mapSize=size} = size</span></span>
<span class="lineno"> 302 </span>
<span class="lineno"> 303 </span>-- | /O(log n)/. Is the key a member of the map? See also 'notMember'.
<span class="lineno"> 304 </span>--
<span class="lineno"> 305 </span>-- > member 5 (fromList [(5,'a'), (3,'b')]) == True
<span class="lineno"> 306 </span>-- > member 1 (fromList [(5,'a'), (3,'b')]) == False
<span class="lineno"> 307 </span>member :: (Ord k, Binary k) => k -> Map k a -> Bool
<span class="lineno"> 308 </span><span class="decl"><span class="istickedoff">member k Empty = False</span>
<span class="lineno"> 309 </span><span class="spaces"></span><span class="istickedoff">member k Existing{index=index,range=range}</span>
<span class="lineno"> 310 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 311 </span><span class="spaces"> </span><span class="istickedoff">do ls <- Index.lookupList idx k</span>
<span class="lineno"> 312 </span><span class="spaces"> </span><span class="istickedoff">return $ isJust $ findValue range ls</span></span>
<span class="lineno"> 313 </span>
<span class="lineno"> 314 </span>-- | /O(log n)/. Is the key not a member of the map? See also 'member'.
<span class="lineno"> 315 </span>--
<span class="lineno"> 316 </span>-- > notMember 5 (fromList [(5,'a'), (3,'b')]) == False
<span class="lineno"> 317 </span>-- > notMember 1 (fromList [(5,'a'), (3,'b')]) == True
<span class="lineno"> 318 </span>notMember :: (Ord k, Binary k) => k -> Map k a -> Bool
<span class="lineno"> 319 </span><span class="decl"><span class="istickedoff">notMember k m = not (member k m)</span></span>
<span class="lineno"> 320 </span>
<span class="lineno"> 321 </span>-- | /O(log n)/. Lookup the value at a key in the map.
<span class="lineno"> 322 </span>--
<span class="lineno"> 323 </span>-- The function will return the corresponding value as @('Just' value)@,
<span class="lineno"> 324 </span>-- or 'Nothing' if the key isn't in the map.
<span class="lineno"> 325 </span>--
<span class="lineno"> 326 </span>-- An example of using @lookup@:
<span class="lineno"> 327 </span>--
<span class="lineno"> 328 </span>-- > import Prelude hiding (lookup)
<span class="lineno"> 329 </span>-- > import Data.CompactMap
<span class="lineno"> 330 </span>-- >
<span class="lineno"> 331 </span>-- > employeeDept = fromList([("John","Sales"), ("Bob","IT")])
<span class="lineno"> 332 </span>-- > deptCountry = fromList([("IT","USA"), ("Sales","France")])
<span class="lineno"> 333 </span>-- > countryCurrency = fromList([("USA", "Dollar"), ("France", "Euro")])
<span class="lineno"> 334 </span>-- >
<span class="lineno"> 335 </span>-- > employeeCurrency :: String -> Maybe String
<span class="lineno"> 336 </span>-- > employeeCurrency name = do
<span class="lineno"> 337 </span>-- > dept <- lookup name employeeDept
<span class="lineno"> 338 </span>-- > country <- lookup dept deptCountry
<span class="lineno"> 339 </span>-- > lookup country countryCurrency
<span class="lineno"> 340 </span>-- >
<span class="lineno"> 341 </span>-- > main = do
<span class="lineno"> 342 </span>-- > putStrLn $ "John's currency: " ++ (show (employeeCurrency "John"))
<span class="lineno"> 343 </span>-- > putStrLn $ "Pete's currency: " ++ (show (employeeCurrency "Pete"))
<span class="lineno"> 344 </span>--
<span class="lineno"> 345 </span>-- The output of this program:
<span class="lineno"> 346 </span>--
<span class="lineno"> 347 </span>-- > John's currency: Just "Euro"
<span class="lineno"> 348 </span>-- > Pete's currency: Nothing
<span class="lineno"> 349 </span>lookup :: (Ord k, Binary k, Binary a) => k -> Map k a -> Maybe a
<span class="lineno"> 350 </span><span class="decl"><span class="istickedoff">lookup k Empty = Nothing</span>
<span class="lineno"> 351 </span><span class="spaces"></span><span class="istickedoff">lookup k Existing{index=index,range=range}</span>
<span class="lineno"> 352 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 353 </span><span class="spaces"> </span><span class="istickedoff">do ls <- Index.lookupList idx k</span>
<span class="lineno"> 354 </span><span class="spaces"> </span><span class="istickedoff">case findValue range ls of</span>
<span class="lineno"> 355 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> return Nothing</span>
<span class="lineno"> 356 </span><span class="spaces"> </span><span class="istickedoff">Just bs -> do mkWeak <span class="nottickedoff">bs</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 357 </span><span class="spaces"> </span><span class="istickedoff">return $ Just (decodeStrict bs)</span></span>
<span class="lineno"> 358 </span>
<span class="lineno"> 359 </span>-- | /O(log n)/. The expression @('findWithDefault' def k map)@ returns
<span class="lineno"> 360 </span>-- the value at key @k@ or returns default value @def@
<span class="lineno"> 361 </span>-- when the key is not in the map.
<span class="lineno"> 362 </span>--
<span class="lineno"> 363 </span>-- > findWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x'
<span class="lineno"> 364 </span>-- > findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'
<span class="lineno"> 365 </span>findWithDefault :: (Ord k, Binary k, Binary a) => a -> k -> Map k a -> a
<span class="lineno"> 366 </span><span class="decl"><span class="istickedoff">findWithDefault def k m = case lookup k m of</span>
<span class="lineno"> 367 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> def</span>
<span class="lineno"> 368 </span><span class="spaces"> </span><span class="istickedoff">Just x -> x</span></span>
<span class="lineno"> 369 </span>
<span class="lineno"> 370 </span>-- | /O(1)/. The empty map.
<span class="lineno"> 371 </span>--
<span class="lineno"> 372 </span>-- > empty == fromList []
<span class="lineno"> 373 </span>-- > size empty == 0
<span class="lineno"> 374 </span>empty :: Map k a
<span class="lineno"> 375 </span><span class="decl"><span class="istickedoff">empty = Empty</span></span>
<span class="lineno"> 376 </span>
<span class="lineno"> 377 </span>-- | /O(1)/. A map with a single element.
<span class="lineno"> 378 </span>--
<span class="lineno"> 379 </span>-- > singleton 1 'a' == fromList [(1, 'a')]
<span class="lineno"> 380 </span>-- > size (singleton 1 'a') == 1
<span class="lineno"> 381 </span>singleton :: (Ord k, Binary k, Binary a) => k -> a -> Map k a
<span class="lineno"> 382 </span><span class="decl"><span class="istickedoff">singleton k a = insert k a empty</span></span>
<span class="lineno"> 383 </span>
<span class="lineno"> 384 </span>-- | /O(log n)/. Insert a new key and value in the map.
<span class="lineno"> 385 </span>-- If the key is already present in the map, the associated value is
<span class="lineno"> 386 </span>-- replaced with the supplied value. 'insert' is equivalent to
<span class="lineno"> 387 </span>-- @'insertWith' 'const'@.
<span class="lineno"> 388 </span>--
<span class="lineno"> 389 </span>-- > insert 5 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'x')]
<span class="lineno"> 390 </span>-- > insert 7 'x' (fromList [(5,'a'), (3,'b')]) == fromList [(3, 'b'), (5, 'a'), (7, 'x')]
<span class="lineno"> 391 </span>-- > insert 5 'x' empty == singleton 5 'x'
<span class="lineno"> 392 </span>insert :: (Ord k, Binary k, Binary a) => k -> a -> Map k a -> Map k a
<span class="lineno"> 393 </span><span class="decl"><span class="istickedoff">insert k a m</span>
<span class="lineno"> 394 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 395 </span><span class="spaces"> </span><span class="istickedoff">withExisting m $ \Existing{index=index,uniq=uniq,range=range,mapSize=mapSize} -></span>
<span class="lineno"> 396 </span><span class="spaces"> </span><span class="istickedoff">withMVar index $ \idx -></span>
<span class="lineno"> 397 </span><span class="spaces"> </span><span class="istickedoff">do u <- readIORef uniq</span>
<span class="lineno"> 398 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq succ</span>
<span class="lineno"> 399 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.insert idx k u (Just a)</span>
<span class="lineno"> 400 </span><span class="spaces"> </span><span class="istickedoff">let newSize | haveOldValue range ls = mapSize</span>
<span class="lineno"> 401 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = mapSize+1</span>
<span class="lineno"> 402 </span><span class="spaces"> </span><span class="istickedoff">return Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=newSize}</span></span>
<span class="lineno"> 403 </span>
<span class="lineno"> 404 </span>-- | /O(log n)/. Insert with a function, combining new value and old value.
<span class="lineno"> 405 </span>-- @'insertWith' f key value mp@
<span class="lineno"> 406 </span>-- will insert the pair (key, value) into @mp@ if key does
<span class="lineno"> 407 </span>-- not exist in the map. If the key does exist, the function will
<span class="lineno"> 408 </span>-- insert the pair @(key, f new_value old_value)@.
<span class="lineno"> 409 </span>--
<span class="lineno"> 410 </span>-- > insertWith (++) 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "xxxa")]
<span class="lineno"> 411 </span>-- > insertWith (++) 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
<span class="lineno"> 412 </span>-- > insertWith (++) 5 "xxx" empty == singleton 5 "xxx"
<span class="lineno"> 413 </span>insertWith :: (Ord k, Binary k, Binary a) => (a -> a -> a) -> k -> a -> Map k a -> Map k a
<span class="lineno"> 414 </span><span class="decl"><span class="istickedoff">insertWith f k x m</span>
<span class="lineno"> 415 </span><span class="spaces"> </span><span class="istickedoff">= insertWithKey (\_ x' y' -> f x' y') k x m</span></span>
<span class="lineno"> 416 </span>
<span class="lineno"> 417 </span>-- | /O(log n)/. Insert with a function, combining key, new value and old value.
<span class="lineno"> 418 </span>-- @'insertWithKey' f key value mp@
<span class="lineno"> 419 </span>-- will insert the pair (key, value) into @mp@ if key does
<span class="lineno"> 420 </span>-- not exist in the map. If the key does exist, the function will
<span class="lineno"> 421 </span>-- insert the pair @(key,f key new_value old_value)@.
<span class="lineno"> 422 </span>-- Note that the key passed to f is the same key passed to 'insertWithKey'.
<span class="lineno"> 423 </span>--
<span class="lineno"> 424 </span>-- > let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
<span class="lineno"> 425 </span>-- > insertWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:xxx|a")]
<span class="lineno"> 426 </span>-- > insertWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "xxx")]
<span class="lineno"> 427 </span>-- > insertWithKey f 5 "xxx" empty == singleton 5 "xxx"
<span class="lineno"> 428 </span>insertWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a
<span class="lineno"> 429 </span><span class="decl"><span class="istickedoff">insertWithKey f kx x Empty = singleton kx x</span>
<span class="lineno"> 430 </span><span class="spaces"></span><span class="istickedoff">insertWithKey f kx x Existing{index=index,uniq=uniq,range=range,mapSize=mapSize}</span>
<span class="lineno"> 431 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 432 </span><span class="spaces"> </span><span class="istickedoff">do u <- readIORef uniq</span>
<span class="lineno"> 433 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq succ</span>
<span class="lineno"> 434 </span><span class="spaces"> </span><span class="istickedoff">keyCursor <- Index.insertKey idx kx</span>
<span class="lineno"> 435 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.getDataFromPointer keyCursor</span>
<span class="lineno"> 436 </span><span class="spaces"> </span><span class="istickedoff">let oldVal = findValue range ls</span>
<span class="lineno"> 437 </span><span class="spaces"> </span><span class="istickedoff">newVal = case oldVal of</span>
<span class="lineno"> 438 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> x</span>
<span class="lineno"> 439 </span><span class="spaces"> </span><span class="istickedoff">Just old -> f kx x (decodeStrict old)</span>
<span class="lineno"> 440 </span><span class="spaces"> </span><span class="istickedoff">newSize = if isJust oldVal then mapSize else mapSize + 1</span>
<span class="lineno"> 441 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) u (Just $ encode newVal)</span>
<span class="lineno"> 442 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 443 </span><span class="spaces"> </span><span class="istickedoff">return $ Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=newSize}</span></span>
<span class="lineno"> 444 </span>
<span class="lineno"> 445 </span>-- | /O(log n)/. Combines insert operation with old value retrieval.
<span class="lineno"> 446 </span>-- The expression (@'insertLookupWithKey' f k x map@)
<span class="lineno"> 447 </span>-- is a pair where the first element is equal to (@'lookup' k map@)
<span class="lineno"> 448 </span>-- and the second element equal to (@'insertWithKey' f k x map@).
<span class="lineno"> 449 </span>--
<span class="lineno"> 450 </span>-- > let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
<span class="lineno"> 451 </span>-- > insertLookupWithKey f 5 "xxx" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "5:xxx|a")])
<span class="lineno"> 452 </span>-- > insertLookupWithKey f 7 "xxx" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "xxx")])
<span class="lineno"> 453 </span>-- > insertLookupWithKey f 5 "xxx" empty == (Nothing, singleton 5 "xxx")
<span class="lineno"> 454 </span>--
<span class="lineno"> 455 </span>-- This is how to define @insertLookup@ using @insertLookupWithKey@:
<span class="lineno"> 456 </span>--
<span class="lineno"> 457 </span>-- > let insertLookup kx x t = insertLookupWithKey (\_ a _ -> a) kx x t
<span class="lineno"> 458 </span>-- > insertLookup 5 "x" (fromList [(5,"a"), (3,"b")]) == (Just "a", fromList [(3, "b"), (5, "x")])
<span class="lineno"> 459 </span>-- > insertLookup 7 "x" (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a"), (7, "x")])
<span class="lineno"> 460 </span>insertLookupWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a,Map k a)
<span class="lineno"> 461 </span><span class="decl"><span class="istickedoff">insertLookupWithKey f k a Empty = (Nothing, singleton k a)</span>
<span class="lineno"> 462 </span><span class="spaces"></span><span class="istickedoff">insertLookupWithKey f k a Existing{index=index,uniq=uniq,range=range,mapSize=mapSize}</span>
<span class="lineno"> 463 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 464 </span><span class="spaces"> </span><span class="istickedoff">do u <- readIORef uniq</span>
<span class="lineno"> 465 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq <span class="nottickedoff">succ</span></span>
<span class="lineno"> 466 </span><span class="spaces"> </span><span class="istickedoff">keyCursor <- Index.insertKey idx k</span>
<span class="lineno"> 467 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.getDataFromPointer keyCursor</span>
<span class="lineno"> 468 </span><span class="spaces"> </span><span class="istickedoff">let oldValBS = findValue range ls</span>
<span class="lineno"> 469 </span><span class="spaces"> </span><span class="istickedoff">oldVal = fmap decodeStrict oldValBS</span>
<span class="lineno"> 470 </span><span class="spaces"> </span><span class="istickedoff">newVal = case oldVal of</span>
<span class="lineno"> 471 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> a</span>
<span class="lineno"> 472 </span><span class="spaces"> </span><span class="istickedoff">Just old -> f <span class="nottickedoff">k</span> <span class="nottickedoff">a</span> old</span>
<span class="lineno"> 473 </span><span class="spaces"> </span><span class="istickedoff">newSize = if isJust oldVal then mapSize else mapSize + 1</span>
<span class="lineno"> 474 </span><span class="spaces"> </span><span class="istickedoff">case oldValBS of Just val -> mkWeak <span class="nottickedoff">val</span> <span class="nottickedoff">index</span> Nothing>>return<span class="nottickedoff">()</span>; Nothing -> return <span class="nottickedoff">()</span></span>
<span class="lineno"> 475 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) u (Just $ encode newVal)</span>
<span class="lineno"> 476 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 477 </span><span class="spaces"> </span><span class="istickedoff">return $ (oldVal, Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=newSize})</span></span>
<span class="lineno"> 478 </span>
<span class="lineno"> 479 </span>
<span class="lineno"> 480 </span>
<span class="lineno"> 481 </span>-- | /O(log n)/. Delete a key and its value from the map. When the key is not
<span class="lineno"> 482 </span>-- a member of the map, the original map is returned.
<span class="lineno"> 483 </span>--
<span class="lineno"> 484 </span>-- > delete 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
<span class="lineno"> 485 </span>-- > delete 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 486 </span>-- > delete 5 empty == empty
<span class="lineno"> 487 </span>delete :: (Ord k, Binary k) => k -> Map k a -> Map k a
<span class="lineno"> 488 </span><span class="decl"><span class="istickedoff">delete k Empty = Empty</span>
<span class="lineno"> 489 </span><span class="spaces"></span><span class="istickedoff">delete k Existing{index=index,uniq=uniq,range=range,mapSize=mapSize}</span>
<span class="lineno"> 490 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 491 </span><span class="spaces"> </span><span class="istickedoff">do u <- readIORef uniq</span>
<span class="lineno"> 492 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq succ</span>
<span class="lineno"> 493 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.insert idx k u (Nothing :: Maybe ())</span>
<span class="lineno"> 494 </span><span class="spaces"> </span><span class="istickedoff">let newSize | haveOldValue range ls = mapSize-1</span>
<span class="lineno"> 495 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = mapSize</span>
<span class="lineno"> 496 </span><span class="spaces"> </span><span class="istickedoff">return Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=newSize}</span></span>
<span class="lineno"> 497 </span>
<span class="lineno"> 498 </span>-- | /O(log n)/. Update a value at a specific key with the result of the provided function.
<span class="lineno"> 499 </span>-- When the key is not
<span class="lineno"> 500 </span>-- a member of the map, the original map is returned.
<span class="lineno"> 501 </span>--
<span class="lineno"> 502 </span>-- > adjust ("new " ++) 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
<span class="lineno"> 503 </span>-- > adjust ("new " ++) 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 504 </span>-- > adjust ("new " ++) 7 empty == empty
<span class="lineno"> 505 </span>adjust :: (Ord k, Binary k, Binary a) => (a -> a) -> k -> Map k a -> Map k a
<span class="lineno"> 506 </span><span class="decl"><span class="istickedoff">adjust f k m</span>
<span class="lineno"> 507 </span><span class="spaces"> </span><span class="istickedoff">= adjustWithKey (\_ x -> f x) k m</span></span>
<span class="lineno"> 508 </span>
<span class="lineno"> 509 </span>-- | /O(log n)/. Adjust a value at a specific key. When the key is not
<span class="lineno"> 510 </span>-- a member of the map, the original map is returned.
<span class="lineno"> 511 </span>--
<span class="lineno"> 512 </span>-- > let f key x = (show key) ++ ":new " ++ x
<span class="lineno"> 513 </span>-- > adjustWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
<span class="lineno"> 514 </span>-- > adjustWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 515 </span>-- > adjustWithKey f 7 empty == empty
<span class="lineno"> 516 </span>adjustWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> a) -> k -> Map k a -> Map k a
<span class="lineno"> 517 </span><span class="decl"><span class="istickedoff">adjustWithKey f k m</span>
<span class="lineno"> 518 </span><span class="spaces"> </span><span class="istickedoff">= updateWithKey (\k' x' -> Just (f k' x')) k m</span></span>
<span class="lineno"> 519 </span>
<span class="lineno"> 520 </span>-- | /O(log n)/. The expression (@'update' f k map@) updates the value @x@
<span class="lineno"> 521 </span>-- at @k@ (if it is in the map). If (@f x@) is 'Nothing', the element is
<span class="lineno"> 522 </span>-- deleted. If it is (@'Just' y@), the key @k@ is bound to the new value @y@.
<span class="lineno"> 523 </span>--
<span class="lineno"> 524 </span>-- > let f x = if x == "a" then Just "new a" else Nothing
<span class="lineno"> 525 </span>-- > update f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "new a")]
<span class="lineno"> 526 </span>-- > update f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 527 </span>-- > update f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
<span class="lineno"> 528 </span>update :: (Ord k, Binary k, Binary a) => (a -> Maybe a) -> k -> Map k a -> Map k a
<span class="lineno"> 529 </span><span class="decl"><span class="istickedoff">update f k m</span>
<span class="lineno"> 530 </span><span class="spaces"> </span><span class="istickedoff">= updateWithKey (\_ x -> f x) k m</span></span>
<span class="lineno"> 531 </span>
<span class="lineno"> 532 </span>-- | /O(log n)/. The expression (@'updateWithKey' f k map@) updates the
<span class="lineno"> 533 </span>-- value @x@ at @k@ (if it is in the map). If (@f k x@) is 'Nothing',
<span class="lineno"> 534 </span>-- the element is deleted. If it is (@'Just' y@), the key @k@ is bound
<span class="lineno"> 535 </span>-- to the new value @y@.
<span class="lineno"> 536 </span>--
<span class="lineno"> 537 </span>-- > let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
<span class="lineno"> 538 </span>-- > updateWithKey f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "5:new a")]
<span class="lineno"> 539 </span>-- > updateWithKey f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 540 </span>-- > updateWithKey f 3 (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
<span class="lineno"> 541 </span>updateWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> Maybe a) -> k -> Map k a -> Map k a
<span class="lineno"> 542 </span><span class="decl"><span class="istickedoff">updateWithKey f k m = snd (updateLookupWithKey f k m)</span></span>
<span class="lineno"> 543 </span>
<span class="lineno"> 544 </span>-- | /O(log n)/. Lookup and update. See also 'updateWithKey'.
<span class="lineno"> 545 </span>-- The function returns changed value, if it is updated.
<span class="lineno"> 546 </span>-- Returns the original key value if the map entry is deleted.
<span class="lineno"> 547 </span>--
<span class="lineno"> 548 </span>-- > let f k x = if x == "a" then Just ((show k) ++ ":new a") else Nothing
<span class="lineno"> 549 </span>-- > updateLookupWithKey f 5 (fromList [(5,"a"), (3,"b")]) == (Just "5:new a", fromList [(3, "b"), (5, "5:new a")])
<span class="lineno"> 550 </span>-- > updateLookupWithKey f 7 (fromList [(5,"a"), (3,"b")]) == (Nothing, fromList [(3, "b"), (5, "a")])
<span class="lineno"> 551 </span>-- > updateLookupWithKey f 3 (fromList [(5,"a"), (3,"b")]) == (Just "b", singleton 5 "a")
<span class="lineno"> 552 </span>updateLookupWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> Maybe a) -> k -> Map k a -> (Maybe a,Map k a)
<span class="lineno"> 553 </span><span class="decl"><span class="istickedoff">updateLookupWithKey f k Empty = (Nothing,Empty)</span>
<span class="lineno"> 554 </span><span class="spaces"></span><span class="istickedoff">updateLookupWithKey f k m@Existing{index=index,uniq=uniq,range=range,mapSize=mapSize}</span>
<span class="lineno"> 555 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 556 </span><span class="spaces"> </span><span class="istickedoff">do ls <- Index.lookupList idx k</span>
<span class="lineno"> 557 </span><span class="spaces"> </span><span class="istickedoff">case findValue range ls of</span>
<span class="lineno"> 558 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> return (Nothing, m)</span>
<span class="lineno"> 559 </span><span class="spaces"> </span><span class="istickedoff">Just valBS -> do let val = decodeStrict valBS</span>
<span class="lineno"> 560 </span><span class="spaces"> </span><span class="istickedoff">newVal = f k val</span>
<span class="lineno"> 561 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">valBS</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 562 </span><span class="spaces"> </span><span class="istickedoff">u <- readIORef uniq</span>
<span class="lineno"> 563 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq <span class="nottickedoff">succ</span></span>
<span class="lineno"> 564 </span><span class="spaces"> </span><span class="istickedoff">Index.insert idx k u newVal</span>
<span class="lineno"> 565 </span><span class="spaces"> </span><span class="istickedoff">let newSize = case isJust newVal of</span>
<span class="lineno"> 566 </span><span class="spaces"> </span><span class="istickedoff">False -> mapSize-1</span>
<span class="lineno"> 567 </span><span class="spaces"> </span><span class="istickedoff">True -> mapSize</span>
<span class="lineno"> 568 </span><span class="spaces"> </span><span class="istickedoff">return (newVal `mplus` Just val, Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=newSize})</span></span>
<span class="lineno"> 569 </span>
<span class="lineno"> 570 </span>
<span class="lineno"> 571 </span>-- | /O(log n)/. The expression (@'alter' f k map@) alters the value @x@ at @k@, or absence thereof.
<span class="lineno"> 572 </span>-- 'alter' can be used to insert, delete, or update a value in a 'Map'.
<span class="lineno"> 573 </span>-- In short : @'lookup' k ('alter' f k m) = f ('lookup' k m)@.
<span class="lineno"> 574 </span>--
<span class="lineno"> 575 </span>-- > let f _ = Nothing
<span class="lineno"> 576 </span>-- > alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 577 </span>-- > alter f 5 (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
<span class="lineno"> 578 </span>-- >
<span class="lineno"> 579 </span>-- > let f _ = Just "c"
<span class="lineno"> 580 </span>-- > alter f 7 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "a"), (7, "c")]
<span class="lineno"> 581 </span>-- > alter f 5 (fromList [(5,"a"), (3,"b")]) == fromList [(3, "b"), (5, "c")]
<span class="lineno"> 582 </span>alter :: (Ord k, Binary k, Binary a) => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a
<span class="lineno"> 583 </span><span class="decl"><span class="istickedoff">alter f k m</span>
<span class="lineno"> 584 </span><span class="spaces"> </span><span class="istickedoff">= case f (lookup k m) of</span>
<span class="lineno"> 585 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> delete k m</span>
<span class="lineno"> 586 </span><span class="spaces"> </span><span class="istickedoff">Just val -> insert k val m</span></span>
<span class="lineno"> 587 </span>
<span class="lineno"> 588 </span>-- | /O(log n*m)/.
<span class="lineno"> 589 </span>-- The expression (@'union' t1 t2@) takes the left-biased union of @t1@ and @t2@.
<span class="lineno"> 590 </span>-- It prefers @t1@ when duplicate keys are encountered,
<span class="lineno"> 591 </span>-- i.e. (@'union' == 'unionWith' 'const'@).
<span class="lineno"> 592 </span>--
<span class="lineno"> 593 </span>-- > union (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "a"), (7, "C")]
<span class="lineno"> 594 </span>union :: (Ord k, Binary k, Binary a) => Map k a -> Map k a -> Map k a
<span class="lineno"> 595 </span><span class="decl"><span class="istickedoff">union = unionWith const</span></span>
<span class="lineno"> 596 </span>
<span class="lineno"> 597 </span>-- | /O(log n*m)/. Union with a combining function.
<span class="lineno"> 598 </span>--
<span class="lineno"> 599 </span>-- > unionWith (++) (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "aA"), (7, "C")]
<span class="lineno"> 600 </span>unionWith :: (Ord k, Binary k, Binary a) => (a -> a -> a) -> Map k a -> Map k a -> Map k a
<span class="lineno"> 601 </span><span class="decl"><span class="istickedoff">unionWith f m1 m2</span>
<span class="lineno"> 602 </span><span class="spaces"> </span><span class="istickedoff">= unionWithKey (\_ x y -> f x y) m1 m2</span></span>
<span class="lineno"> 603 </span>
<span class="lineno"> 604 </span>
<span class="lineno"> 605 </span>-- | /O(log n*m)/.
<span class="lineno"> 606 </span>-- Union with a combining function.
<span class="lineno"> 607 </span>--
<span class="lineno"> 608 </span>-- > let f key new_value old_value = (show key) ++ ":" ++ new_value ++ "|" ++ old_value
<span class="lineno"> 609 </span>-- > unionWithKey f (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == fromList [(3, "b"), (5, "5:a|A"), (7, "C")]
<span class="lineno"> 610 </span>unionWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a
<span class="lineno"> 611 </span><span class="decl"><span class="istickedoff">unionWithKey f t1 t2 = foldl' (\m (k,v) -> insertWithKey f k v m) t2 (toList t1)</span></span>
<span class="lineno"> 612 </span>
<span class="lineno"> 613 </span>-- | The union of a list of maps:
<span class="lineno"> 614 </span>-- (@'unions' == 'Prelude.foldl' 'union' 'empty'@).
<span class="lineno"> 615 </span>--
<span class="lineno"> 616 </span>-- > unions [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
<span class="lineno"> 617 </span>-- > == fromList [(3, "b"), (5, "a"), (7, "C")]
<span class="lineno"> 618 </span>-- > unions [(fromList [(5, "A3"), (3, "B3")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "a"), (3, "b")])]
<span class="lineno"> 619 </span>-- > == fromList [(3, "B3"), (5, "A3"), (7, "C")]
<span class="lineno"> 620 </span>unions :: (Ord k, Binary k, Binary a) => [Map k a] -> Map k a
<span class="lineno"> 621 </span><span class="decl"><span class="istickedoff">unions ts</span>
<span class="lineno"> 622 </span><span class="spaces"> </span><span class="istickedoff">= foldl' union empty ts</span></span>
<span class="lineno"> 623 </span>
<span class="lineno"> 624 </span>-- | The union of a list of maps, with a combining operation:
<span class="lineno"> 625 </span>-- (@'unionsWith' f == 'Prelude.foldl' ('unionWith' f) 'empty'@).
<span class="lineno"> 626 </span>--
<span class="lineno"> 627 </span>-- > unionsWith (++) [(fromList [(5, "a"), (3, "b")]), (fromList [(5, "A"), (7, "C")]), (fromList [(5, "A3"), (3, "B3")])]
<span class="lineno"> 628 </span>-- > == fromList [(3, "bB3"), (5, "aAA3"), (7, "C")]
<span class="lineno"> 629 </span>unionsWith :: (Ord k, Binary k, Binary a) => (a -> a -> a) -> [Map k a] -> Map k a
<span class="lineno"> 630 </span><span class="decl"><span class="istickedoff">unionsWith f ts</span>
<span class="lineno"> 631 </span><span class="spaces"> </span><span class="istickedoff">= foldl' (unionWith f) empty ts</span></span>
<span class="lineno"> 632 </span>
<span class="lineno"> 633 </span>-- | /O(n)/. Map a function over all values in the map.
<span class="lineno"> 634 </span>--
<span class="lineno"> 635 </span>-- > map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
<span class="lineno"> 636 </span>map :: (Ord k, Binary k, Binary a, Binary b) => (a -> b) -> Map k a -> Map k b
<span class="lineno"> 637 </span><span class="decl"><span class="istickedoff">map f m</span>
<span class="lineno"> 638 </span><span class="spaces"> </span><span class="istickedoff">= mapWithKey (\_ x -> f x) m</span></span>
<span class="lineno"> 639 </span>
<span class="lineno"> 640 </span>-- | /O(n)/. Map a function over all values in the map.
<span class="lineno"> 641 </span>--
<span class="lineno"> 642 </span>-- > let f key x = (show key) ++ ":" ++ x
<span class="lineno"> 643 </span>-- > mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]
<span class="lineno"> 644 </span>mapWithKey :: (Ord k, Binary k, Binary a, Binary b) => (k -> a -> b) -> Map k a -> Map k b
<span class="lineno"> 645 </span><span class="decl"><span class="istickedoff">mapWithKey f m = fromDistinctAscList [ (k, f k x) | (k,x) <- toList m ]</span></span>
<span class="lineno"> 646 </span>
<span class="lineno"> 647 </span>-- | /O(n*log n)/.
<span class="lineno"> 648 </span>-- @'mapKeys' f s@ is the map obtained by applying @f@ to each key of @s@.
<span class="lineno"> 649 </span>--
<span class="lineno"> 650 </span>-- The size of the result may be smaller if @f@ maps two or more distinct
<span class="lineno"> 651 </span>-- keys to the same new key. In this case the value at the smallest of
<span class="lineno"> 652 </span>-- these keys is retained.
<span class="lineno"> 653 </span>--
<span class="lineno"> 654 </span>-- > mapKeys (+ 1) (fromList [(5,"a"), (3,"b")]) == fromList [(4, "b"), (6, "a")]
<span class="lineno"> 655 </span>-- > mapKeys (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "c"
<span class="lineno"> 656 </span>-- > mapKeys (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "c"
<span class="lineno"> 657 </span>mapKeys :: (Ord k2,Binary k1,Binary k2,Binary a) => (k1->k2) -> Map k1 a -> Map k2 a
<span class="lineno"> 658 </span><span class="decl"><span class="istickedoff">mapKeys = mapKeysWith (\x _ -> x)</span></span>
<span class="lineno"> 659 </span>
<span class="lineno"> 660 </span>-- | /O(n*log n)/.
<span class="lineno"> 661 </span>-- @'mapKeysWith' c f s@ is the map obtained by applying @f@ to each key of @s@.
<span class="lineno"> 662 </span>--
<span class="lineno"> 663 </span>-- The size of the result may be smaller if @f@ maps two or more distinct
<span class="lineno"> 664 </span>-- keys to the same new key. In this case the associated values will be
<span class="lineno"> 665 </span>-- combined using @c@.
<span class="lineno"> 666 </span>--
<span class="lineno"> 667 </span>-- > mapKeysWith (++) (\ _ -> 1) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 1 "cdab"
<span class="lineno"> 668 </span>-- > mapKeysWith (++) (\ _ -> 3) (fromList [(1,"b"), (2,"a"), (3,"d"), (4,"c")]) == singleton 3 "cdab"
<span class="lineno"> 669 </span>mapKeysWith :: (Ord k2, Binary k1, Binary k2, Binary a) => (a -> a -> a) -> (k1->k2) -> Map k1 a -> Map k2 a
<span class="lineno"> 670 </span><span class="decl"><span class="istickedoff">mapKeysWith c f m = fromListWith c [ (f <span class="nottickedoff">x</span>,y) | (x,y) <- toList m ]</span></span>
<span class="lineno"> 671 </span>
<span class="lineno"> 672 </span>-- | /O(n)/.
<span class="lineno"> 673 </span>-- @'mapKeysMonotonic' f s == 'mapKeys' f s@, but works only when @f@
<span class="lineno"> 674 </span>-- is strictly monotonic.
<span class="lineno"> 675 </span>-- That is, for any values @x@ and @y@, if @x@ < @y@ then @f x@ < @f y@.
<span class="lineno"> 676 </span>-- /The precondition is not checked./
<span class="lineno"> 677 </span>-- Semi-formally, we have:
<span class="lineno"> 678 </span>--
<span class="lineno"> 679 </span>-- > and [x < y ==> f x < f y | x <- ls, y <- ls]
<span class="lineno"> 680 </span>-- > ==> mapKeysMonotonic f s == mapKeys f s
<span class="lineno"> 681 </span>-- > where ls = keys s
<span class="lineno"> 682 </span>--
<span class="lineno"> 683 </span>-- This means that @f@ maps distinct original keys to distinct resulting keys.
<span class="lineno"> 684 </span>-- This function has better performance than 'mapKeys'.
<span class="lineno"> 685 </span>--
<span class="lineno"> 686 </span>-- > mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")]) == fromList [(6, "b"), (10, "a")]
<span class="lineno"> 687 </span>-- > valid (mapKeysMonotonic (\ k -> k * 2) (fromList [(5,"a"), (3,"b")])) == True
<span class="lineno"> 688 </span>-- > valid (mapKeysMonotonic (\ _ -> 1) (fromList [(5,"a"), (3,"b")])) == False
<span class="lineno"> 689 </span>mapKeysMonotonic :: (Binary k1, Binary k2, Binary a) => (k1->k2) -> Map k1 a -> Map k2 a
<span class="lineno"> 690 </span><span class="decl"><span class="istickedoff">mapKeysMonotonic f m = fromDistinctAscList [ (f x, y) | (x,y) <- toList m ]</span></span>
<span class="lineno"> 691 </span>
<span class="lineno"> 692 </span>-- | /O(n)/. Fold the values in the map, such that
<span class="lineno"> 693 </span>-- @'fold' f z == 'Prelude.foldr' f z . 'elems'@.
<span class="lineno"> 694 </span>-- For example,
<span class="lineno"> 695 </span>--
<span class="lineno"> 696 </span>-- > elems map = fold (:) [] map
<span class="lineno"> 697 </span>--
<span class="lineno"> 698 </span>-- > let f a len = len + (length a)
<span class="lineno"> 699 </span>-- > fold f 0 (fromList [(5,"a"), (3,"bbb")]) == 4
<span class="lineno"> 700 </span>fold :: (Binary k, Binary a) => (a -> b -> b) -> b -> Map k a -> b
<span class="lineno"> 701 </span><span class="decl"><span class="istickedoff">fold f z m</span>
<span class="lineno"> 702 </span><span class="spaces"> </span><span class="istickedoff">= foldWithKey (\_ x' z' -> f x' z') z m</span></span>
<span class="lineno"> 703 </span>
<span class="lineno"> 704 </span>-- | /O(n)/. Fold the keys and values in the map, such that
<span class="lineno"> 705 </span>-- @'foldWithKey' f z == 'Prelude.foldr' ('uncurry' f) z . 'toAscList'@.
<span class="lineno"> 706 </span>-- For example,
<span class="lineno"> 707 </span>--
<span class="lineno"> 708 </span>-- > keys map = foldWithKey (\k x ks -> k:ks) [] map
<span class="lineno"> 709 </span>--
<span class="lineno"> 710 </span>-- > let f k a result = result ++ "(" ++ (show k) ++ ":" ++ a ++ ")"
<span class="lineno"> 711 </span>-- > foldWithKey f "Map: " (fromList [(5,"a"), (3,"b")]) == "Map: (5:a)(3:b)"
<span class="lineno"> 712 </span>foldWithKey :: (Binary k, Binary a) => (k -> a -> b -> b) -> b -> Map k a -> b
<span class="lineno"> 713 </span><span class="decl"><span class="istickedoff">foldWithKey f z = Prelude.foldr (uncurry f) z . toList</span></span>
<span class="lineno"> 714 </span>
<span class="lineno"> 715 </span>
<span class="lineno"> 716 </span>-- | /O(n)/.
<span class="lineno"> 717 </span>-- Return all elements of the map in the ascending order of their keys.
<span class="lineno"> 718 </span>--
<span class="lineno"> 719 </span>-- > elems (fromList [(5,"a"), (3,"b")]) == ["b","a"]
<span class="lineno"> 720 </span>-- > elems empty == []
<span class="lineno"> 721 </span>elems :: (Binary k, Binary a) => Map k a -> [a]
<span class="lineno"> 722 </span><span class="decl"><span class="istickedoff">elems = Prelude.map snd . toList</span></span>
<span class="lineno"> 723 </span>
<span class="lineno"> 724 </span>-- | /O(n)/. Return all keys of the map in ascending order.
<span class="lineno"> 725 </span>--
<span class="lineno"> 726 </span>-- > keys (fromList [(5,"a"), (3,"b")]) == [3,5]
<span class="lineno"> 727 </span>-- > keys empty == []
<span class="lineno"> 728 </span>keys :: (Binary k, Binary a) => Map k a -> [k]
<span class="lineno"> 729 </span><span class="decl"><span class="istickedoff">keys = Prelude.map fst . toList</span></span>
<span class="lineno"> 730 </span>
<span class="lineno"> 731 </span>-- | /O(n)/. The set of all keys of the map.
<span class="lineno"> 732 </span>--
<span class="lineno"> 733 </span>-- > keysSet (fromList [(5,"a"), (3,"b")]) == Data.Set.fromList [3,5]
<span class="lineno"> 734 </span>-- > keysSet empty == Data.Set.empty
<span class="lineno"> 735 </span>keysSet :: (Ord k, Binary k, Binary a) => Map k a -> Set.Set k
<span class="lineno"> 736 </span><span class="decl"><span class="istickedoff">keysSet m = Set.fromDistinctAscList (keys m)</span></span>
<span class="lineno"> 737 </span>
<span class="lineno"> 738 </span>-- | /O(n)/. Return all key\/value pairs in the map in ascending key order.
<span class="lineno"> 739 </span>--
<span class="lineno"> 740 </span>-- > assocs (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
<span class="lineno"> 741 </span>-- > assocs empty == []
<span class="lineno"> 742 </span>assocs :: (Binary k, Binary a) => Map k a -> [(k,a)]
<span class="lineno"> 743 </span><span class="decl"><span class="istickedoff">assocs m</span>
<span class="lineno"> 744 </span><span class="spaces"> </span><span class="istickedoff">= toList m</span></span>
<span class="lineno"> 745 </span>
<span class="lineno"> 746 </span>
<span class="lineno"> 747 </span>
<span class="lineno"> 748 </span>{-# SPECIALISE fromList :: (Binary a) => [(Strict.ByteString,a)] -> Map Strict.ByteString a #-}
<span class="lineno"> 749 </span>{-# SPECIALISE fromList :: (Binary a) => [(Int,a)] -> Map Int a #-}
<span class="lineno"> 750 </span>-- | /O(n*log n)/. Build a map from a list of key\/value pairs. See also 'fromAscList'.
<span class="lineno"> 751 </span>-- If the list contains more than one value for the same key, the last value
<span class="lineno"> 752 </span>-- for the key is retained.
<span class="lineno"> 753 </span>--
<span class="lineno"> 754 </span>-- > fromList [] == empty
<span class="lineno"> 755 </span>-- > fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
<span class="lineno"> 756 </span>-- > fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]
<span class="lineno"> 757 </span>fromList :: (Ord k, Binary k, Binary a) => [(k,a)] -> Map k a
<span class="lineno"> 758 </span><span class="decl"><span class="istickedoff">fromList [] = Empty</span>
<span class="lineno"> 759 </span><span class="spaces"></span><span class="istickedoff">fromList ls</span>
<span class="lineno"> 760 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 761 </span><span class="spaces"> </span><span class="istickedoff">do idx <- Index.newIndex</span>
<span class="lineno"> 762 </span><span class="spaces"> </span><span class="istickedoff">let loop n _ | <span class="tickonlyfalse">n `seq` False</span> = <span class="nottickedoff">undefined</span></span>
<span class="lineno"> 763 </span><span class="spaces"> </span><span class="istickedoff">loop n [] = return n</span>
<span class="lineno"> 764 </span><span class="spaces"> </span><span class="istickedoff">loop n ((k,v):rs) | <span class="tickonlytrue">k `seq` v `seq` True</span></span>
<span class="lineno"> 765 </span><span class="spaces"> </span><span class="istickedoff">= do keyCursor <- Index.insertKey idx k</span>
<span class="lineno"> 766 </span><span class="spaces"> </span><span class="istickedoff">oldData <- Index.peekKeyCursorData keyCursor</span>
<span class="lineno"> 767 </span><span class="spaces"> </span><span class="istickedoff">newData <- Index.newDataCursor (indexBuffer idx) 0 (Just (encode v))</span>
<span class="lineno"> 768 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor newData</span>
<span class="lineno"> 769 </span><span class="spaces"> </span><span class="istickedoff">loop (if oldData==nullPtr then n+1 else n) rs</span>
<span class="lineno"> 770 </span><span class="spaces"> </span><span class="istickedoff">size <- loop 0 ls</span>
<span class="lineno"> 771 </span><span class="spaces"> </span><span class="istickedoff">uniq <- newIORef 1</span>
<span class="lineno"> 772 </span><span class="spaces"> </span><span class="istickedoff">index <- newMVar idx</span>
<span class="lineno"> 773 </span><span class="spaces"> </span><span class="istickedoff">return $ Existing{index=index,uniq=uniq,range=addToRange 0 [],mapSize=size}</span></span>
<span class="lineno"> 774 </span>
<span class="lineno"> 775 </span>-- | /O(n*log n)/. Build a map from a list of key\/value pairs with a combining function. See also 'fromAscListWith'.
<span class="lineno"> 776 </span>--
<span class="lineno"> 777 </span>-- > fromListWith (++) [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "ab"), (5, "aba")]
<span class="lineno"> 778 </span>-- > fromListWith (++) [] == empty
<span class="lineno"> 779 </span>fromListWith :: (Ord k, Binary k, Binary a) => (a -> a -> a) -> [(k,a)] -> Map k a
<span class="lineno"> 780 </span><span class="decl"><span class="istickedoff">fromListWith f xs</span>
<span class="lineno"> 781 </span><span class="spaces"> </span><span class="istickedoff">= fromListWithKey (\_ x y -> f x y) xs</span></span>
<span class="lineno"> 782 </span>
<span class="lineno"> 783 </span>-- | /O(n*log n)/. Build a map from a list of key\/value pairs with a combining function. See also 'fromAscListWithKey'.
<span class="lineno"> 784 </span>--
<span class="lineno"> 785 </span>-- > let f k a1 a2 = (show k) ++ a1 ++ a2
<span class="lineno"> 786 </span>-- > fromListWithKey f [(5,"a"), (5,"b"), (3,"b"), (3,"a"), (5,"a")] == fromList [(3, "3ab"), (5, "5a5ba")]
<span class="lineno"> 787 </span>-- > fromListWithKey f [] == empty
<span class="lineno"> 788 </span>fromListWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> a -> a) -> [(k,a)] -> Map k a
<span class="lineno"> 789 </span><span class="decl"><span class="istickedoff">fromListWithKey f [] = empty</span>
<span class="lineno"> 790 </span><span class="spaces"></span><span class="istickedoff">fromListWithKey f ls</span>
<span class="lineno"> 791 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 792 </span><span class="spaces"> </span><span class="istickedoff">do idx <- Index.newIndex</span>
<span class="lineno"> 793 </span><span class="spaces"> </span><span class="istickedoff">let loop n _ | <span class="tickonlyfalse">n `seq` False</span> = <span class="nottickedoff">undefined</span></span>
<span class="lineno"> 794 </span><span class="spaces"> </span><span class="istickedoff">loop n [] = return n</span>
<span class="lineno"> 795 </span><span class="spaces"> </span><span class="istickedoff">loop n ((k,v):rs)</span>
<span class="lineno"> 796 </span><span class="spaces"> </span><span class="istickedoff">= do keyCursor <- Index.insertKey idx k</span>
<span class="lineno"> 797 </span><span class="spaces"> </span><span class="istickedoff">oldData <- Index.getDataFromPointer keyCursor</span>
<span class="lineno"> 798 </span><span class="spaces"> </span><span class="istickedoff">let newVal = case oldData of</span>
<span class="lineno"> 799 </span><span class="spaces"> </span><span class="istickedoff">((_,Just old):_) -> f <span class="nottickedoff">k</span> v (decodeStrict old)</span>
<span class="lineno"> 800 </span><span class="spaces"> </span><span class="istickedoff">_ -> v</span>
<span class="lineno"> 801 </span><span class="spaces"> </span><span class="istickedoff">newData <- Index.newDataCursor (indexBuffer idx) 0 (Just (encode newVal))</span>
<span class="lineno"> 802 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor newData</span>
<span class="lineno"> 803 </span><span class="spaces"> </span><span class="istickedoff">loop (if Prelude.null oldData then n+1 else n) rs</span>
<span class="lineno"> 804 </span><span class="spaces"> </span><span class="istickedoff">size <- loop 0 ls</span>
<span class="lineno"> 805 </span><span class="spaces"> </span><span class="istickedoff">uniq <- newIORef <span class="nottickedoff">1</span></span>
<span class="lineno"> 806 </span><span class="spaces"> </span><span class="istickedoff">index <- newMVar idx</span>
<span class="lineno"> 807 </span><span class="spaces"> </span><span class="istickedoff">return $ Existing{index=index,uniq=uniq,range=addToRange 0 [],mapSize=size}</span></span>
<span class="lineno"> 808 </span>
<span class="lineno"> 809 </span>
<span class="lineno"> 810 </span>-- | /O(n)/. Convert to a list of key\/value pairs.
<span class="lineno"> 811 </span>--
<span class="lineno"> 812 </span>-- > toList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
<span class="lineno"> 813 </span>-- > toList empty == []
<span class="lineno"> 814 </span>toList :: (Binary k, Binary a) => Map k a -> [(k,a)]
<span class="lineno"> 815 </span><span class="decl"><span class="istickedoff">toList Empty = []</span>
<span class="lineno"> 816 </span><span class="spaces"></span><span class="istickedoff">toList Existing{index=index,range=range}</span>
<span class="lineno"> 817 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 818 </span><span class="spaces"> </span><span class="istickedoff">do keys <- withMVar index $ Index.listKeyPointers</span>
<span class="lineno"> 819 </span><span class="spaces"> </span><span class="istickedoff">let loop [] = return [] -- withMVar index Index.touchIndex >> return []</span>
<span class="lineno"> 820 </span><span class="spaces"> </span><span class="istickedoff">loop (keyCursor:xs)</span>
<span class="lineno"> 821 </span><span class="spaces"> </span><span class="istickedoff">= unsafeInterleaveIO $</span>
<span class="lineno"> 822 </span><span class="spaces"> </span><span class="istickedoff">do mkWeak <span class="nottickedoff">keyCursor</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 823 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.getDataFromPointer keyCursor</span>
<span class="lineno"> 824 </span><span class="spaces"> </span><span class="istickedoff">case findValue range ls of</span>
<span class="lineno"> 825 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> loop xs</span>
<span class="lineno"> 826 </span><span class="spaces"> </span><span class="istickedoff">Just bs -> do key <- Index.getKeyFromPointer keyCursor</span>
<span class="lineno"> 827 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">bs</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 828 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">key</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 829 </span><span class="spaces"> </span><span class="istickedoff">let pair = (decodeStrict key, decodeStrict bs)</span>
<span class="lineno"> 830 </span><span class="spaces"> </span><span class="istickedoff">liftM (pair:) (loop xs)</span>
<span class="lineno"> 831 </span><span class="spaces"> </span><span class="istickedoff">loop (IArray.elems keys)</span></span>
<span class="lineno"> 832 </span>
<span class="lineno"> 833 </span>
<span class="lineno"> 834 </span>-- | /O(n)/. Convert to an ascending list.
<span class="lineno"> 835 </span>--
<span class="lineno"> 836 </span>-- > toAscList (fromList [(5,"a"), (3,"b")]) == [(3,"b"), (5,"a")]
<span class="lineno"> 837 </span>toAscList :: (Binary k, Binary a) =>Map k a -> [(k,a)]
<span class="lineno"> 838 </span><span class="decl"><span class="istickedoff">toAscList = toList</span></span>
<span class="lineno"> 839 </span>
<span class="lineno"> 840 </span>-- | /O(n)/. Build a map from an ascending list in linear time.
<span class="lineno"> 841 </span>-- /The precondition (input list is ascending) is not checked./
<span class="lineno"> 842 </span>--
<span class="lineno"> 843 </span>-- > fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 844 </span>-- > fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]
<span class="lineno"> 845 </span>-- > valid (fromAscList [(3,"b"), (5,"a"), (5,"b")]) == True
<span class="lineno"> 846 </span>-- > valid (fromAscList [(5,"a"), (3,"b"), (5,"b")]) == False
<span class="lineno"> 847 </span>fromAscList :: (Eq k, Binary k, Binary a) => [(k,a)] -> Map k a
<span class="lineno"> 848 </span><span class="decl"><span class="istickedoff">fromAscList xs</span>
<span class="lineno"> 849 </span><span class="spaces"> </span><span class="istickedoff">= fromAscListWithKey (\_ x _ -> x) xs</span></span>
<span class="lineno"> 850 </span>
<span class="lineno"> 851 </span>-- | /O(n)/. Build a map from an ascending list in linear time with a combining function for equal keys.
<span class="lineno"> 852 </span>-- /The precondition (input list is ascending) is not checked./
<span class="lineno"> 853 </span>--
<span class="lineno"> 854 </span>-- > fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "ba")]
<span class="lineno"> 855 </span>-- > valid (fromAscListWith (++) [(3,"b"), (5,"a"), (5,"b")]) == True
<span class="lineno"> 856 </span>-- > valid (fromAscListWith (++) [(5,"a"), (3,"b"), (5,"b")]) == False
<span class="lineno"> 857 </span>fromAscListWith :: (Eq k, Binary k, Binary a) => (a -> a -> a) -> [(k,a)] -> Map k a
<span class="lineno"> 858 </span><span class="decl"><span class="istickedoff">fromAscListWith f xs</span>
<span class="lineno"> 859 </span><span class="spaces"> </span><span class="istickedoff">= fromAscListWithKey (\_ x y -> f x y) xs</span></span>
<span class="lineno"> 860 </span>
<span class="lineno"> 861 </span>-- | /O(n)/. Build a map from an ascending list in linear time with a
<span class="lineno"> 862 </span>-- combining function for equal keys.
<span class="lineno"> 863 </span>-- /The precondition (input list is ascending) is not checked./
<span class="lineno"> 864 </span>--
<span class="lineno"> 865 </span>-- > let f k a1 a2 = (show k) ++ ":" ++ a1 ++ a2
<span class="lineno"> 866 </span>-- > fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")] == fromList [(3, "b"), (5, "5:b5:ba")]
<span class="lineno"> 867 </span>-- > valid (fromAscListWithKey f [(3,"b"), (5,"a"), (5,"b"), (5,"b")]) == True
<span class="lineno"> 868 </span>-- > valid (fromAscListWithKey f [(5,"a"), (3,"b"), (5,"b"), (5,"b")]) == False
<span class="lineno"> 869 </span>fromAscListWithKey :: (Eq k, Binary k, Binary a) => (k -> a -> a -> a) -> [(k,a)] -> Map k a
<span class="lineno"> 870 </span><span class="decl"><span class="istickedoff">fromAscListWithKey f xs</span>
<span class="lineno"> 871 </span><span class="spaces"> </span><span class="istickedoff">= fromDistinctAscList (combineEq <span class="nottickedoff">f</span> xs)</span>
<span class="lineno"> 872 </span><span class="spaces"> </span><span class="istickedoff">where</span>
<span class="lineno"> 873 </span><span class="spaces"> </span><span class="istickedoff">-- [combineEq f xs] combines equal elements with function [f] in an ordered list [xs]</span>
<span class="lineno"> 874 </span><span class="spaces"> </span><span class="istickedoff">combineEq _ xs'</span>
<span class="lineno"> 875 </span><span class="spaces"> </span><span class="istickedoff">= case xs' of</span>
<span class="lineno"> 876 </span><span class="spaces"> </span><span class="istickedoff">[] -> []</span>
<span class="lineno"> 877 </span><span class="spaces"> </span><span class="istickedoff">[x] -> [x]</span>
<span class="lineno"> 878 </span><span class="spaces"> </span><span class="istickedoff">(x:xx) -> combineEq' x xx</span>
<span class="lineno"> 879 </span><span class="spaces"></span><span class="istickedoff"></span>
<span class="lineno"> 880 </span><span class="spaces"> </span><span class="istickedoff">combineEq' z [] = [z]</span>
<span class="lineno"> 881 </span><span class="spaces"> </span><span class="istickedoff">combineEq' z@(kz,zz) (x@(kx,xx):xs')</span>
<span class="lineno"> 882 </span><span class="spaces"> </span><span class="istickedoff">| kx==kz = let yy = f <span class="nottickedoff">kx</span> xx zz in combineEq' (kx,yy) xs'</span>
<span class="lineno"> 883 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = z:combineEq' x xs'</span></span>
<span class="lineno"> 884 </span>
<span class="lineno"> 885 </span>
<span class="lineno"> 886 </span>-- | /O(n)/. Build a map from an ascending list of distinct elements in linear time.
<span class="lineno"> 887 </span>-- /The precondition is not checked./
<span class="lineno"> 888 </span>--
<span class="lineno"> 889 </span>-- > fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
<span class="lineno"> 890 </span>-- > valid (fromDistinctAscList [(3,"b"), (5,"a")]) == True
<span class="lineno"> 891 </span>-- > valid (fromDistinctAscList [(3,"b"), (5,"a"), (5,"b")]) == False
<span class="lineno"> 892 </span>fromDistinctAscList :: (Binary k, Binary a) => [(k,a)] -> Map k a
<span class="lineno"> 893 </span><span class="decl"><span class="istickedoff">fromDistinctAscList [] = Empty</span>
<span class="lineno"> 894 </span><span class="spaces"></span><span class="istickedoff">fromDistinctAscList ls</span>
<span class="lineno"> 895 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 896 </span><span class="spaces"> </span><span class="istickedoff">do idx <- Index.newIndex</span>
<span class="lineno"> 897 </span><span class="spaces"> </span><span class="istickedoff">n <- foldM (\s (k,v) -> do keyCursor <- Index.insertLargestKey idx k</span>
<span class="lineno"> 898 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) 0 (Just $ encode v)</span>
<span class="lineno"> 899 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 900 </span><span class="spaces"> </span><span class="istickedoff">return $! s+1) 0 ls</span>
<span class="lineno"> 901 </span><span class="spaces"> </span><span class="istickedoff">index <- newMVar idx</span>
<span class="lineno"> 902 </span><span class="spaces"> </span><span class="istickedoff">uniq <- newIORef <span class="nottickedoff">1</span></span>
<span class="lineno"> 903 </span><span class="spaces"> </span><span class="istickedoff">return Existing{index=index,uniq=uniq,range=addToRange 0 [],mapSize=n}</span></span>
<span class="lineno"> 904 </span>
<span class="lineno"> 905 </span>
<span class="lineno"> 906 </span>-- | /O(n)/. Filter all values that satisfy the predicate.
<span class="lineno"> 907 </span>--
<span class="lineno"> 908 </span>-- > filter (> "a") (fromList [(5,"a"), (3,"b")]) == singleton 3 "b"
<span class="lineno"> 909 </span>-- > filter (> "x") (fromList [(5,"a"), (3,"b")]) == empty
<span class="lineno"> 910 </span>-- > filter (< "a") (fromList [(5,"a"), (3,"b")]) == empty
<span class="lineno"> 911 </span>filter :: (Ord k, Binary k, Binary a) => (a -> Bool) -> Map k a -> Map k a
<span class="lineno"> 912 </span><span class="decl"><span class="istickedoff">filter p m</span>
<span class="lineno"> 913 </span><span class="spaces"> </span><span class="istickedoff">= filterWithKey (\_ x -> p x) m</span></span>
<span class="lineno"> 914 </span>
<span class="lineno"> 915 </span>-- FIXME: optimize this.
<span class="lineno"> 916 </span>-- | /O(n)/. Filter all keys\/values that satisfy the predicate.
<span class="lineno"> 917 </span>--
<span class="lineno"> 918 </span>-- > filterWithKey (\k _ -> k > 4) (fromList [(5,"a"), (3,"b")]) == singleton 5 "a"
<span class="lineno"> 919 </span>filterWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> Bool) -> Map k a -> Map k a
<span class="lineno"> 920 </span><span class="decl"><span class="istickedoff">filterWithKey p m = fromDistinctAscList [ (k, v) | (k,v) <- toList m, p k v ]</span></span>
<span class="lineno"> 921 </span>
<span class="lineno"> 922 </span>-- | /O(n)/. Partition the map according to a predicate. The first
<span class="lineno"> 923 </span>-- map contains all elements that satisfy the predicate, the second all
<span class="lineno"> 924 </span>-- elements that fail the predicate. See also 'split'.
<span class="lineno"> 925 </span>--
<span class="lineno"> 926 </span>-- > partition (> "a") (fromList [(5,"a"), (3,"b")]) == (singleton 3 "b", singleton 5 "a")
<span class="lineno"> 927 </span>-- > partition (< "x") (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
<span class="lineno"> 928 </span>-- > partition (> "x") (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
<span class="lineno"> 929 </span>partition :: (Ord k, Binary k, Binary a) => (a -> Bool) -> Map k a -> (Map k a,Map k a)
<span class="lineno"> 930 </span><span class="decl"><span class="istickedoff">partition p = partitionWithKey (\_ -> p)</span></span>
<span class="lineno"> 931 </span>
<span class="lineno"> 932 </span>-- | /O(n)/. Partition the map according to a predicate. The first
<span class="lineno"> 933 </span>-- map contains all elements that satisfy the predicate, the second all
<span class="lineno"> 934 </span>-- elements that fail the predicate. See also 'split'.
<span class="lineno"> 935 </span>--
<span class="lineno"> 936 </span>-- > partitionWithKey (\ k _ -> k > 3) (fromList [(5,"a"), (3,"b")]) == (singleton 5 "a", singleton 3 "b")
<span class="lineno"> 937 </span>-- > partitionWithKey (\ k _ -> k < 7) (fromList [(5,"a"), (3,"b")]) == (fromList [(3, "b"), (5, "a")], empty)
<span class="lineno"> 938 </span>-- > partitionWithKey (\ k _ -> k > 7) (fromList [(5,"a"), (3,"b")]) == (empty, fromList [(3, "b"), (5, "a")])
<span class="lineno"> 939 </span>partitionWithKey :: (Ord k, Binary k, Binary a) => (k -> a -> Bool) -> Map k a -> (Map k a,Map k a)
<span class="lineno"> 940 </span><span class="decl"><span class="istickedoff">partitionWithKey p m = mapEitherWithKey (\k x -> if p <span class="nottickedoff">k</span> x then Left x else Right x) m</span></span>
<span class="lineno"> 941 </span>
<span class="lineno"> 942 </span>-- | /O(n)/. Map values and collect the 'Just' results.
<span class="lineno"> 943 </span>--
<span class="lineno"> 944 </span>-- > let f x = if x == "a" then Just "new a" else Nothing
<span class="lineno"> 945 </span>-- > mapMaybe f (fromList [(5,"a"), (3,"b")]) == singleton 5 "new a"
<span class="lineno"> 946 </span>mapMaybe :: (Ord k, Binary k, Binary a, Binary b) => (a -> Maybe b) -> Map k a -> Map k b
<span class="lineno"> 947 </span><span class="decl"><span class="istickedoff">mapMaybe f m</span>
<span class="lineno"> 948 </span><span class="spaces"> </span><span class="istickedoff">= mapMaybeWithKey (\_ x -> f x) m</span></span>
<span class="lineno"> 949 </span>
<span class="lineno"> 950 </span>-- | /O(n)/. Map keys\/values and collect the 'Just' results.
<span class="lineno"> 951 </span>--
<span class="lineno"> 952 </span>-- > let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing
<span class="lineno"> 953 </span>-- > mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"
<span class="lineno"> 954 </span>mapMaybeWithKey :: (Ord k, Binary k, Binary a, Binary b) => (k -> a -> Maybe b) -> Map k a -> Map k b
<span class="lineno"> 955 </span><span class="decl"><span class="istickedoff">mapMaybeWithKey f m = fromDistinctAscList [ (k, v) | (k,x) <- toList m, Just v <- [f <span class="nottickedoff">k</span> x] ]</span></span>
<span class="lineno"> 956 </span>
<span class="lineno"> 957 </span>
<span class="lineno"> 958 </span>-- | /O(n)/. Map values and separate the 'Left' and 'Right' results.
<span class="lineno"> 959 </span>--
<span class="lineno"> 960 </span>-- > let f a = if a < "c" then Left a else Right a
<span class="lineno"> 961 </span>-- > mapEither f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
<span class="lineno"> 962 </span>-- > == (fromList [(3,"b"), (5,"a")], fromList [(1,"x"), (7,"z")])
<span class="lineno"> 963 </span>-- >
<span class="lineno"> 964 </span>-- > mapEither (\ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
<span class="lineno"> 965 </span>-- > == (empty, fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
<span class="lineno"> 966 </span>
<span class="lineno"> 967 </span>mapEither :: (Ord k, Binary k, Binary a, Binary b, Binary c) => (a -> Either b c) -> Map k a -> (Map k b, Map k c)
<span class="lineno"> 968 </span><span class="decl"><span class="istickedoff">mapEither f m</span>
<span class="lineno"> 969 </span><span class="spaces"> </span><span class="istickedoff">= mapEitherWithKey (\_ x -> f x) m</span></span>
<span class="lineno"> 970 </span>
<span class="lineno"> 971 </span>-- The key doesn't change. Don't re-encode it. Copy bytestring instead.
<span class="lineno"> 972 </span>-- | /O(n)/. Map keys\/values and separate the 'Left' and 'Right' results.
<span class="lineno"> 973 </span>--
<span class="lineno"> 974 </span>-- > let f k a = if k < 5 then Left (k * 2) else Right (a ++ a)
<span class="lineno"> 975 </span>-- > mapEitherWithKey f (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
<span class="lineno"> 976 </span>-- > == (fromList [(1,2), (3,6)], fromList [(5,"aa"), (7,"zz")])
<span class="lineno"> 977 </span>-- >
<span class="lineno"> 978 </span>-- > mapEitherWithKey (\_ a -> Right a) (fromList [(5,"a"), (3,"b"), (1,"x"), (7,"z")])
<span class="lineno"> 979 </span>-- > == (empty, fromList [(1,"x"), (3,"b"), (5,"a"), (7,"z")])
<span class="lineno"> 980 </span>mapEitherWithKey :: (Ord k, Binary k, Binary a, Binary c, Binary b) =>
<span class="lineno"> 981 </span> (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c)
<span class="lineno"> 982 </span><span class="decl"><span class="istickedoff">mapEitherWithKey f m</span>
<span class="lineno"> 983 </span><span class="spaces"> </span><span class="istickedoff">= unsafePerformIO $</span>
<span class="lineno"> 984 </span><span class="spaces"> </span><span class="istickedoff">do idxL <- Index.newIndex</span>
<span class="lineno"> 985 </span><span class="spaces"> </span><span class="istickedoff">idxR <- Index.newIndex</span>
<span class="lineno"> 986 </span><span class="spaces"> </span><span class="istickedoff">(s1,s2) <- foldM (\(s1,s2) (k,v) -> s1 `seq` s2 `seq`</span>
<span class="lineno"> 987 </span><span class="spaces"> </span><span class="istickedoff">do let cond = f <span class="nottickedoff">k</span> v</span>
<span class="lineno"> 988 </span><span class="spaces"> </span><span class="istickedoff">(idx,v',s1',s2') = case cond of</span>
<span class="lineno"> 989 </span><span class="spaces"> </span><span class="istickedoff">Left v' -> (idxL,encode v',s1+1,s2)</span>
<span class="lineno"> 990 </span><span class="spaces"> </span><span class="istickedoff">Right v' -> (idxR,encode v',s1,s2+1)</span>
<span class="lineno"> 991 </span><span class="spaces"> </span><span class="istickedoff">keyCursor <- Index.insertLargestKey idx k</span>
<span class="lineno"> 992 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) 0 (Just v')</span>
<span class="lineno"> 993 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 994 </span><span class="spaces"> </span><span class="istickedoff">return $! (s1',s2')) (0,0) (toList m)</span>
<span class="lineno"> 995 </span><span class="spaces"> </span><span class="istickedoff">indexL <- newMVar idxL</span>
<span class="lineno"> 996 </span><span class="spaces"> </span><span class="istickedoff">indexR <- newMVar idxR</span>
<span class="lineno"> 997 </span><span class="spaces"> </span><span class="istickedoff">uniqL <- newIORef <span class="nottickedoff">1</span></span>
<span class="lineno"> 998 </span><span class="spaces"> </span><span class="istickedoff">uniqR <- newIORef <span class="nottickedoff">1</span></span>
<span class="lineno"> 999 </span><span class="spaces"> </span><span class="istickedoff">return $ (Existing{index=indexL,uniq=uniqR,range=addToRange 0 [],mapSize=s1}</span>
<span class="lineno"> 1000 </span><span class="spaces"> </span><span class="istickedoff">,Existing{index=indexR,uniq=uniqL,range=addToRange 0 [],mapSize=s2})</span></span>
<span class="lineno"> 1001 </span>
<span class="lineno"> 1002 </span>
<span class="lineno"> 1003 </span>-- | /O(log n)/. The minimal key of the map. Calls 'error' is the map is empty.
<span class="lineno"> 1004 </span>--
<span class="lineno"> 1005 </span>-- > findMin (fromList [(5,"a"), (3,"b")]) == (3,"b")
<span class="lineno"> 1006 </span>-- > findMin empty Error: empty map has no minimal element
<span class="lineno"> 1007 </span>findMin :: (Binary k, Binary a) => Map k a -> (k,a)
<span class="lineno"> 1008 </span><span class="decl"><span class="istickedoff">findMin m = case m of</span>
<span class="lineno"> 1009 </span><span class="spaces"> </span><span class="istickedoff">Empty -> <span class="nottickedoff">err</span></span>
<span class="lineno"> 1010 </span><span class="spaces"> </span><span class="istickedoff">Existing{index=index,range=range} -></span>
<span class="lineno"> 1011 </span><span class="spaces"> </span><span class="istickedoff">unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 1012 </span><span class="spaces"> </span><span class="istickedoff">do mbMin <- findMinKey idx range</span>
<span class="lineno"> 1013 </span><span class="spaces"> </span><span class="istickedoff">case mbMin of</span>
<span class="lineno"> 1014 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> <span class="nottickedoff">err</span></span>
<span class="lineno"> 1015 </span><span class="spaces"> </span><span class="istickedoff">Just (keyCursor,val)</span>
<span class="lineno"> 1016 </span><span class="spaces"> </span><span class="istickedoff">-> do key <- Index.getKeyFromPointer keyCursor</span>
<span class="lineno"> 1017 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">key</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1018 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">val</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1019 </span><span class="spaces"> </span><span class="istickedoff">return (decodeStrict key, decodeStrict val)</span>
<span class="lineno"> 1020 </span><span class="spaces"> </span><span class="istickedoff">where <span class="nottickedoff">err = error "Map.findMin: empty map has no minimal element"</span></span></span>
<span class="lineno"> 1021 </span>
<span class="lineno"> 1022 </span>-- | /O(log n)/. The maximal key of the map. Calls 'error' is the map is empty.
<span class="lineno"> 1023 </span>--
<span class="lineno"> 1024 </span>-- > findMax (fromList [(5,"a"), (3,"b")]) == (5,"a")
<span class="lineno"> 1025 </span>-- > findMax empty Error: empty map has no maximal element
<span class="lineno"> 1026 </span>findMax :: (Binary k, Binary a) => Map k a -> (k,a)
<span class="lineno"> 1027 </span><span class="decl"><span class="istickedoff">findMax m = case m of</span>
<span class="lineno"> 1028 </span><span class="spaces"> </span><span class="istickedoff">Empty -> <span class="nottickedoff">err</span></span>
<span class="lineno"> 1029 </span><span class="spaces"> </span><span class="istickedoff">Existing{index=index,range=range} -></span>
<span class="lineno"> 1030 </span><span class="spaces"> </span><span class="istickedoff">unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 1031 </span><span class="spaces"> </span><span class="istickedoff">do mbMin <- findMaxKey idx range</span>
<span class="lineno"> 1032 </span><span class="spaces"> </span><span class="istickedoff">case mbMin of</span>
<span class="lineno"> 1033 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> <span class="nottickedoff">err</span></span>
<span class="lineno"> 1034 </span><span class="spaces"> </span><span class="istickedoff">Just (keyCursor,val)</span>
<span class="lineno"> 1035 </span><span class="spaces"> </span><span class="istickedoff">-> do key <- Index.getKeyFromPointer keyCursor</span>
<span class="lineno"> 1036 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">key</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1037 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">val</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1038 </span><span class="spaces"> </span><span class="istickedoff">return (decodeStrict key, decodeStrict val)</span>
<span class="lineno"> 1039 </span><span class="spaces"> </span><span class="istickedoff">where <span class="nottickedoff">err = error "Map.findMax: empty map has no maximal element"</span></span></span>
<span class="lineno"> 1040 </span>
<span class="lineno"> 1041 </span>-- | /O(log n)/. Delete the minimal key. Returns an empty map if the map is empty.
<span class="lineno"> 1042 </span>--
<span class="lineno"> 1043 </span>-- > deleteMin (fromList [(5,"a"), (3,"b"), (7,"c")]) == fromList [(5,"a"), (7,"c")]
<span class="lineno"> 1044 </span>-- > deleteMin empty == empty
<span class="lineno"> 1045 </span>deleteMin :: (Binary k, Binary a) => Map k a -> Map k a
<span class="lineno"> 1046 </span><span class="decl"><span class="istickedoff">deleteMin = snd . deleteFindMin</span></span>
<span class="lineno"> 1047 </span>
<span class="lineno"> 1048 </span>-- | /O(log n)/. Delete and find the minimal element.
<span class="lineno"> 1049 </span>--
<span class="lineno"> 1050 </span>-- > deleteFindMin (fromList [(5,"a"), (3,"b"), (10,"c")]) == ((3,"b"), fromList[(5,"a"), (10,"c")])
<span class="lineno"> 1051 </span>-- > deleteFindMin empty == (Error: can not return the minimal element of an empty map,empty)
<span class="lineno"> 1052 </span>deleteFindMin :: (Binary k, Binary a) => Map k a -> ((k,a), Map k a)
<span class="lineno"> 1053 </span><span class="decl"><span class="istickedoff">deleteFindMin m</span>
<span class="lineno"> 1054 </span><span class="spaces"> </span><span class="istickedoff">= case m of</span>
<span class="lineno"> 1055 </span><span class="spaces"> </span><span class="istickedoff">Empty -> (<span class="nottickedoff">deleteFindMinErr</span>, Empty)</span>
<span class="lineno"> 1056 </span><span class="spaces"> </span><span class="istickedoff">Existing{index=index,uniq=uniq,range=range,mapSize=mapSize}</span>
<span class="lineno"> 1057 </span><span class="spaces"> </span><span class="istickedoff">-> unsafePerformIO $ withMVar index $ \idx -></span>
<span class="lineno"> 1058 </span><span class="spaces"> </span><span class="istickedoff">do mbMin <- findMinKey idx range</span>
<span class="lineno"> 1059 </span><span class="spaces"> </span><span class="istickedoff">case mbMin of</span>
<span class="lineno"> 1060 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> return (<span class="nottickedoff">deleteFindMinErr</span>, Empty)</span>
<span class="lineno"> 1061 </span><span class="spaces"> </span><span class="istickedoff">Just (keyCursor,val)</span>
<span class="lineno"> 1062 </span><span class="spaces"> </span><span class="istickedoff">-> do u <- readIORef uniq</span>
<span class="lineno"> 1063 </span><span class="spaces"> </span><span class="istickedoff">modifyIORef uniq <span class="nottickedoff">succ</span></span>
<span class="lineno"> 1064 </span><span class="spaces"> </span><span class="istickedoff">dataCursor <- Index.newDataCursor (indexBuffer idx) u Nothing</span>
<span class="lineno"> 1065 </span><span class="spaces"> </span><span class="istickedoff">Index.pushNewDataCursor keyCursor dataCursor</span>
<span class="lineno"> 1066 </span><span class="spaces"> </span><span class="istickedoff">key <- Index.getKeyFromPointer keyCursor</span>
<span class="lineno"> 1067 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">key</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1068 </span><span class="spaces"> </span><span class="istickedoff">mkWeak <span class="nottickedoff">val</span> <span class="nottickedoff">index</span> Nothing</span>
<span class="lineno"> 1069 </span><span class="spaces"> </span><span class="istickedoff">return $ (<span class="nottickedoff">(decodeStrict key,decodeStrict val)</span>,Existing{index=index,uniq=uniq,range=addToRange u range,mapSize=mapSize-1})</span>
<span class="lineno"> 1070 </span><span class="spaces"> </span><span class="istickedoff">where <span class="nottickedoff">deleteFindMinErr = error "Data.CompactMap.deleteFindMin: can not return the minimal element of an empty map"</span></span></span>
<span class="lineno"> 1071 </span>
<span class="lineno"> 1072 </span><span class="decl"><span class="istickedoff">findMinKey = findCornerKey Index.extractLeft Index.extractRight</span></span>
<span class="lineno"> 1073 </span><span class="decl"><span class="istickedoff">findMaxKey = findCornerKey Index.extractRight Index.extractLeft</span></span>
<span class="lineno"> 1074 </span><span class="decl"><span class="istickedoff">findCornerKey left right (Index orig buffer) range</span>
<span class="lineno"> 1075 </span><span class="spaces"> </span><span class="istickedoff">= do s <- Index.getSize orig</span>
<span class="lineno"> 1076 </span><span class="spaces"> </span><span class="istickedoff">if <span class="tickonlyfalse">s == 0</span></span>
<span class="lineno"> 1077 </span><span class="spaces"> </span><span class="istickedoff">then <span class="nottickedoff">return Nothing</span></span>
<span class="lineno"> 1078 </span><span class="spaces"> </span><span class="istickedoff">else do let loop ptr | ptr == nullPtr = return Nothing</span>
<span class="lineno"> 1079 </span><span class="spaces"> </span><span class="istickedoff">loop ptr = do res <- loop =<< left ptr</span>
<span class="lineno"> 1080 </span><span class="spaces"> </span><span class="istickedoff">case res of</span>
<span class="lineno"> 1081 </span><span class="spaces"> </span><span class="istickedoff">Just val -> return $ Just val</span>
<span class="lineno"> 1082 </span><span class="spaces"> </span><span class="istickedoff">Nothing -> do keyCursor <- Index.extractElemIdx ptr</span>
<span class="lineno"> 1083 </span><span class="spaces"> </span><span class="istickedoff">ls <- Index.getDataFromPointer keyCursor</span>
<span class="lineno"> 1084 </span><span class="spaces"> </span><span class="istickedoff">case findValue range ls of</span>
<span class="lineno"> 1085 </span><span class="spaces"> </span><span class="istickedoff">Just val -> return $ Just (keyCursor, val)</span>
<span class="lineno"> 1086 </span><span class="spaces"> </span><span class="istickedoff">_ -> loop =<< right ptr</span>
<span class="lineno"> 1087 </span><span class="spaces"> </span><span class="istickedoff">loop orig</span></span>
<span class="lineno"> 1088 </span>
<span class="lineno"> 1089 </span>
<span class="lineno"> 1090 </span>{--------------------------------------------------------------------
<span class="lineno"> 1091 </span> Utilities
<span class="lineno"> 1092 </span>--------------------------------------------------------------------}
<span class="lineno"> 1093 </span>
<span class="lineno"> 1094 </span><span class="decl"><span class="istickedoff">decodeStrict bs = decode (Lazy.fromChunks [bs])</span></span>
<span class="lineno"> 1095 </span>
<span class="lineno"> 1096 </span><span class="decl"><span class="istickedoff">haveOldValue range ls</span>
<span class="lineno"> 1097 </span><span class="spaces"> </span><span class="istickedoff">= isJust (findValue range ls)</span></span>
<span class="lineno"> 1098 </span>
<span class="lineno"> 1099 </span><span class="decl"><span class="istickedoff">withExisting Empty fn</span>
<span class="lineno"> 1100 </span><span class="spaces"> </span><span class="istickedoff">= do idx <- newMVar =<< Index.newIndex</span>
<span class="lineno"> 1101 </span><span class="spaces"> </span><span class="istickedoff">uniq <- newIORef 0</span>
<span class="lineno"> 1102 </span><span class="spaces"> </span><span class="istickedoff">fn (Existing idx uniq [] 0)</span>
<span class="lineno"> 1103 </span><span class="spaces"></span><span class="istickedoff">withExisting m fn</span>
<span class="lineno"> 1104 </span><span class="spaces"> </span><span class="istickedoff">= fn m</span></span>
<span class="lineno"> 1105 </span>
<span class="lineno"> 1106 </span><span class="decl"><span class="istickedoff">findValue range [] = Nothing</span>
<span class="lineno"> 1107 </span><span class="spaces"></span><span class="istickedoff">findValue range ((uniqId, value):rs)</span>
<span class="lineno"> 1108 </span><span class="spaces"> </span><span class="istickedoff">| uniqId `isInRange` range = value</span>
<span class="lineno"> 1109 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = findValue range rs</span></span>
<span class="lineno"> 1110 </span>
<span class="lineno"> 1111 </span>
<span class="lineno"> 1112 </span>isInRange :: Int -> [Range] -> Bool
<span class="lineno"> 1113 </span><span class="decl"><span class="istickedoff">isInRange i [] = <span class="nottickedoff">False</span></span>
<span class="lineno"> 1114 </span><span class="spaces"></span><span class="istickedoff">isInRange i (Range x y:rs)</span>
<span class="lineno"> 1115 </span><span class="spaces"> </span><span class="istickedoff">| i > x = False</span>
<span class="lineno"> 1116 </span><span class="spaces"> </span><span class="istickedoff">| i < y = isInRange i rs</span>
<span class="lineno"> 1117 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = True</span></span>
<span class="lineno"> 1118 </span>
<span class="lineno"> 1119 </span>addToRange :: Int -> [Range] -> [Range]
<span class="lineno"> 1120 </span><span class="decl"><span class="istickedoff">addToRange i [] = [Range i i]</span>
<span class="lineno"> 1121 </span><span class="spaces"></span><span class="istickedoff">addToRange i (Range x y:rs)</span>
<span class="lineno"> 1122 </span><span class="spaces"> </span><span class="istickedoff">= merge (Range i i:Range x y:rs)</span></span>
<span class="lineno"> 1123 </span>
<span class="lineno"> 1124 </span><span class="decl"><span class="istickedoff">merge [] = <span class="nottickedoff">[]</span></span>
<span class="lineno"> 1125 </span><span class="spaces"></span><span class="istickedoff">merge [x] = [x]</span>
<span class="lineno"> 1126 </span><span class="spaces"></span><span class="istickedoff">merge (Range x y:Range a b:rs)</span>
<span class="lineno"> 1127 </span><span class="spaces"> </span><span class="istickedoff">| y == a+1 = merge (Range x b:rs)</span>
<span class="lineno"> 1128 </span><span class="spaces"> </span><span class="istickedoff">| <span class="tickonlytrue">otherwise</span> = Range x y:merge (Range a b:rs)</span></span>
<span class="lineno"> 1129 </span>
<span class="lineno"> 1130 </span>
</pre>
</html>
|