libghc-unordered-containers-doc 0.2.7.1-3 / usr / share / doc / libghc-unordered-containers-doc / html / src / Data-HashMap-Strict.html

This file is indexed.

/usr/share/doc/libghc-unordered-containers-doc/html/src/Data-HashMap-Strict.html is in libghc-unordered-containers-doc 0.2.7.1-3.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below. 

  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
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<!-- Generated by HsColour, http://code.haskell.org/~malcolm/hscolour/ -->
<title>Data/HashMap/Strict.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>{-# LANGUAGE BangPatterns, CPP, PatternGuards #-}</span>
<a name="line-2"></a>
<a name="line-3"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ &gt;= 702</span>
<a name="line-4"></a><span class='hs-comment'>{-# LANGUAGE Trustworthy #-}</span>
<a name="line-5"></a><span class='hs-cpp'>#endif</span>
<a name="line-6"></a>
<a name="line-7"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-8"></a><span class='hs-comment'>-- |</span>
<a name="line-9"></a><span class='hs-comment'>-- Module      :  Data.HashMap.Strict</span>
<a name="line-10"></a><span class='hs-comment'>-- Copyright   :  2010-2012 Johan Tibell</span>
<a name="line-11"></a><span class='hs-comment'>-- License     :  BSD-style</span>
<a name="line-12"></a><span class='hs-comment'>-- Maintainer  :  johan.tibell@gmail.com</span>
<a name="line-13"></a><span class='hs-comment'>-- Stability   :  provisional</span>
<a name="line-14"></a><span class='hs-comment'>-- Portability :  portable</span>
<a name="line-15"></a><span class='hs-comment'>--</span>
<a name="line-16"></a><span class='hs-comment'>-- A map from /hashable/ keys to values.  A map cannot contain</span>
<a name="line-17"></a><span class='hs-comment'>-- duplicate keys; each key can map to at most one value.  A 'HashMap'</span>
<a name="line-18"></a><span class='hs-comment'>-- makes no guarantees as to the order of its elements.</span>
<a name="line-19"></a><span class='hs-comment'>--</span>
<a name="line-20"></a><span class='hs-comment'>-- The implementation is based on /hash array mapped tries/.  A</span>
<a name="line-21"></a><span class='hs-comment'>-- 'HashMap' is often faster than other tree-based set types,</span>
<a name="line-22"></a><span class='hs-comment'>-- especially when key comparison is expensive, as in the case of</span>
<a name="line-23"></a><span class='hs-comment'>-- strings.</span>
<a name="line-24"></a><span class='hs-comment'>--</span>
<a name="line-25"></a><span class='hs-comment'>-- Many operations have a average-case complexity of /O(log n)/.  The</span>
<a name="line-26"></a><span class='hs-comment'>-- implementation uses a large base (i.e. 16) so in practice these</span>
<a name="line-27"></a><span class='hs-comment'>-- operations are constant time.</span>
<a name="line-28"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Strict</span>
<a name="line-29"></a>    <span class='hs-layout'>(</span>
<a name="line-30"></a>      <span class='hs-comment'>-- * Strictness properties</span>
<a name="line-31"></a>      <span class='hs-comment'>-- $strictness</span>
<a name="line-32"></a>
<a name="line-33"></a>      <span class='hs-conid'>HashMap</span>
<a name="line-34"></a>
<a name="line-35"></a>      <span class='hs-comment'>-- * Construction</span>
<a name="line-36"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>empty</span>
<a name="line-37"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>singleton</span>
<a name="line-38"></a>
<a name="line-39"></a>      <span class='hs-comment'>-- * Basic interface</span>
<a name="line-40"></a>    <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>null</span>
<a name="line-41"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>size</span>
<a name="line-42"></a>    <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>member</span>
<a name="line-43"></a>    <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span>
<a name="line-44"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>lookupDefault</span>
<a name="line-45"></a>    <span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-varop'>!</span><span class='hs-layout'>)</span>
<a name="line-46"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>insert</span>
<a name="line-47"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>insertWith</span>
<a name="line-48"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>delete</span>
<a name="line-49"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>adjust</span>
<a name="line-50"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>update</span>
<a name="line-51"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>alter</span>
<a name="line-52"></a>
<a name="line-53"></a>      <span class='hs-comment'>-- * Combine</span>
<a name="line-54"></a>      <span class='hs-comment'>-- ** Union</span>
<a name="line-55"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>union</span>
<a name="line-56"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>unionWith</span>
<a name="line-57"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>unionWithKey</span>
<a name="line-58"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>unions</span>
<a name="line-59"></a>
<a name="line-60"></a>      <span class='hs-comment'>-- * Transformations</span>
<a name="line-61"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>map</span>
<a name="line-62"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>mapWithKey</span>
<a name="line-63"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>traverseWithKey</span>
<a name="line-64"></a>
<a name="line-65"></a>      <span class='hs-comment'>-- * Difference and intersection</span>
<a name="line-66"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>difference</span>
<a name="line-67"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>intersection</span>
<a name="line-68"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>intersectionWith</span>
<a name="line-69"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>intersectionWithKey</span>
<a name="line-70"></a>
<a name="line-71"></a>      <span class='hs-comment'>-- * Folds</span>
<a name="line-72"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>foldl'</span>
<a name="line-73"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>foldlWithKey'</span>
<a name="line-74"></a>    <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>foldr</span>
<a name="line-75"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>foldrWithKey</span>
<a name="line-76"></a>
<a name="line-77"></a>      <span class='hs-comment'>-- * Filter</span>
<a name="line-78"></a>    <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>filter</span>
<a name="line-79"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>filterWithKey</span>
<a name="line-80"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>mapMaybe</span>
<a name="line-81"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>mapMaybeWithKey</span>
<a name="line-82"></a>
<a name="line-83"></a>      <span class='hs-comment'>-- * Conversions</span>
<a name="line-84"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>keys</span>
<a name="line-85"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>elems</span>
<a name="line-86"></a>
<a name="line-87"></a>      <span class='hs-comment'>-- ** Lists</span>
<a name="line-88"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>toList</span>
<a name="line-89"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>fromList</span>
<a name="line-90"></a>    <span class='hs-layout'>,</span> <span class='hs-varid'>fromListWith</span>
<a name="line-91"></a>    <span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-92"></a>
<a name="line-93"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Bits</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varop'>.&amp;.</span><span class='hs-layout'>)</span><span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-varop'>.|.</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-94"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>List</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>L</span>
<a name="line-95"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Hashable</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span><span class='hs-layout'>)</span>
<a name="line-96"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Prelude</span> <span class='hs-varid'>hiding</span> <span class='hs-layout'>(</span><span class='hs-varid'>map</span><span class='hs-layout'>)</span>
<a name="line-97"></a>
<a name="line-98"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>A</span>
<a name="line-99"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Base</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>HM</span>
<a name="line-100"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Base</span> <span class='hs-varid'>hiding</span> <span class='hs-layout'>(</span>
<a name="line-101"></a>    <span class='hs-varid'>alter</span><span class='hs-layout'>,</span> <span class='hs-varid'>adjust</span><span class='hs-layout'>,</span> <span class='hs-varid'>fromList</span><span class='hs-layout'>,</span> <span class='hs-varid'>fromListWith</span><span class='hs-layout'>,</span> <span class='hs-varid'>insert</span><span class='hs-layout'>,</span> <span class='hs-varid'>insertWith</span><span class='hs-layout'>,</span> <span class='hs-varid'>intersectionWith</span><span class='hs-layout'>,</span>
<a name="line-102"></a>    <span class='hs-varid'>intersectionWithKey</span><span class='hs-layout'>,</span> <span class='hs-varid'>map</span><span class='hs-layout'>,</span> <span class='hs-varid'>mapWithKey</span><span class='hs-layout'>,</span> <span class='hs-varid'>mapMaybe</span><span class='hs-layout'>,</span> <span class='hs-varid'>mapMaybeWithKey</span><span class='hs-layout'>,</span> <span class='hs-varid'>singleton</span><span class='hs-layout'>,</span>
<a name="line-103"></a>    <span class='hs-varid'>update</span><span class='hs-layout'>,</span> <span class='hs-varid'>unionWith</span><span class='hs-layout'>,</span> <span class='hs-varid'>unionWithKey</span><span class='hs-layout'>)</span>
<a name="line-104"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Unsafe</span> <span class='hs-layout'>(</span><span class='hs-varid'>runST</span><span class='hs-layout'>)</span>
<a name="line-105"></a>
<a name="line-106"></a><span class='hs-comment'>-- $strictness</span>
<a name="line-107"></a><span class='hs-comment'>--</span>
<a name="line-108"></a><span class='hs-comment'>-- This module satisfies the following strictness properties:</span>
<a name="line-109"></a><span class='hs-comment'>--</span>
<a name="line-110"></a><span class='hs-comment'>-- 1. Key arguments are evaluated to WHNF;</span>
<a name="line-111"></a><span class='hs-comment'>--</span>
<a name="line-112"></a><span class='hs-comment'>-- 2. Keys and values are evaluated to WHNF before they are stored in</span>
<a name="line-113"></a><span class='hs-comment'>--    the map.</span>
<a name="line-114"></a>
<a name="line-115"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-116"></a><span class='hs-comment'>-- * Construction</span>
<a name="line-117"></a>
<a name="line-118"></a><a name="singleton"></a><span class='hs-comment'>-- | /O(1)/ Construct a map with a single element.</span>
<a name="line-119"></a><span class='hs-definition'>singleton</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-120"></a><span class='hs-definition'>singleton</span> <span class='hs-varid'>k</span> <span class='hs-varop'>!</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>singleton</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-121"></a>
<a name="line-122"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-123"></a><span class='hs-comment'>-- * Basic interface</span>
<a name="line-124"></a>
<a name="line-125"></a><a name="insert"></a><span class='hs-comment'>-- | /O(log n)/ Associate the specified value with the specified</span>
<a name="line-126"></a><span class='hs-comment'>-- key in this map.  If this map previously contained a mapping for</span>
<a name="line-127"></a><span class='hs-comment'>-- the key, the old value is replaced.</span>
<a name="line-128"></a><span class='hs-definition'>insert</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-129"></a><span class='hs-definition'>insert</span> <span class='hs-varid'>k</span> <span class='hs-varop'>!</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-130"></a><span class='hs-comment'>{-# INLINABLE insert #-}</span>
<a name="line-131"></a>
<a name="line-132"></a><a name="insertWith"></a><span class='hs-comment'>-- | /O(log n)/ Associate the value with the key in this map.  If</span>
<a name="line-133"></a><span class='hs-comment'>-- this map previously contained a mapping for the key, the old value</span>
<a name="line-134"></a><span class='hs-comment'>-- is replaced by the result of applying the given function to the new</span>
<a name="line-135"></a><span class='hs-comment'>-- and old value.  Example:</span>
<a name="line-136"></a><span class='hs-comment'>--</span>
<a name="line-137"></a><span class='hs-comment'>-- &gt; insertWith f k v map</span>
<a name="line-138"></a><span class='hs-comment'>-- &gt;   where f new old = new + old</span>
<a name="line-139"></a><span class='hs-definition'>insertWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-140"></a>           <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-141"></a><span class='hs-definition'>insertWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-varid'>m0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h0</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-num'>0</span> <span class='hs-varid'>m0</span>
<a name="line-142"></a>  <span class='hs-keyword'>where</span>
<a name="line-143"></a>    <span class='hs-varid'>h0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>hash</span> <span class='hs-varid'>k0</span>
<a name="line-144"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-varid'>h</span> <span class='hs-varop'>!</span><span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-conid'>Empty</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span>
<a name="line-145"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>l</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>ky</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-146"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>hy</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>ky</span> <span class='hs-varop'>==</span> <span class='hs-varid'>k</span>
<a name="line-147"></a>                    <span class='hs-keyword'>then</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>x</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span>
<a name="line-148"></a>                    <span class='hs-keyword'>else</span> <span class='hs-varid'>x</span> <span class='hs-varop'>`seq`</span> <span class='hs-layout'>(</span><span class='hs-varid'>collision</span> <span class='hs-varid'>h</span> <span class='hs-varid'>l</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-149"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>x</span> <span class='hs-varop'>`seq`</span> <span class='hs-varid'>runST</span> <span class='hs-layout'>(</span><span class='hs-varid'>two</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>ky</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span>
<a name="line-150"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span>
<a name="line-151"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>b</span> <span class='hs-varop'>.&amp;.</span> <span class='hs-varid'>m</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span>
<a name="line-152"></a>            <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span>
<a name="line-153"></a>            <span class='hs-keyword'>in</span> <span class='hs-varid'>bitmapIndexedOrFull</span> <span class='hs-layout'>(</span><span class='hs-varid'>b</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-varid'>ary'</span>
<a name="line-154"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span>
<a name="line-155"></a>            <span class='hs-keyword'>let</span> <span class='hs-varid'>st</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-156"></a>                <span class='hs-varid'>st'</span>  <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-157"></a>                <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>update</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>st'</span>
<a name="line-158"></a>            <span class='hs-keyword'>in</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary'</span>
<a name="line-159"></a>      <span class='hs-keyword'>where</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-160"></a>            <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>sparseIndex</span> <span class='hs-varid'>b</span> <span class='hs-varid'>m</span>
<a name="line-161"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-162"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>st</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-163"></a>            <span class='hs-varid'>st'</span>  <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-164"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>update16</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>st'</span>
<a name="line-165"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-166"></a>      <span class='hs-keyword'>where</span> <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>index</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-167"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-168"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h</span> <span class='hs-varop'>==</span> <span class='hs-varid'>hy</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateOrSnocWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-169"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varop'>$</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-layout'>(</span><span class='hs-varid'>mask</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>s</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>singleton</span> <span class='hs-varid'>t</span><span class='hs-layout'>)</span>
<a name="line-170"></a><span class='hs-comment'>{-# INLINABLE insertWith #-}</span>
<a name="line-171"></a>
<a name="line-172"></a><a name="unsafeInsertWith"></a><span class='hs-comment'>-- | In-place update version of insertWith</span>
<a name="line-173"></a><span class='hs-definition'>unsafeInsertWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-174"></a>                 <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-175"></a><span class='hs-definition'>unsafeInsertWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-varid'>m0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>runST</span> <span class='hs-layout'>(</span><span class='hs-varid'>go</span> <span class='hs-varid'>h0</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-num'>0</span> <span class='hs-varid'>m0</span><span class='hs-layout'>)</span>
<a name="line-176"></a>  <span class='hs-keyword'>where</span>
<a name="line-177"></a>    <span class='hs-varid'>h0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>hash</span> <span class='hs-varid'>k0</span>
<a name="line-178"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-varid'>h</span> <span class='hs-varop'>!</span><span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-conid'>Empty</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span>
<a name="line-179"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>l</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>ky</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-180"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>hy</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>ky</span> <span class='hs-varop'>==</span> <span class='hs-varid'>k</span>
<a name="line-181"></a>                    <span class='hs-keyword'>then</span> <span class='hs-varid'>return</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>x</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span>
<a name="line-182"></a>                    <span class='hs-keyword'>else</span> <span class='hs-keyword'>do</span>
<a name="line-183"></a>                        <span class='hs-keyword'>let</span> <span class='hs-varid'>l'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>x</span> <span class='hs-varop'>`seq`</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span><span class='hs-layout'>)</span>
<a name="line-184"></a>                        <span class='hs-varid'>return</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>collision</span> <span class='hs-varid'>h</span> <span class='hs-varid'>l</span> <span class='hs-varid'>l'</span>
<a name="line-185"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>two</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>ky</span> <span class='hs-varid'>y</span>
<a name="line-186"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span>
<a name="line-187"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>b</span> <span class='hs-varop'>.&amp;.</span> <span class='hs-varid'>m</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-188"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>insertM</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span>
<a name="line-189"></a>            <span class='hs-varid'>return</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>bitmapIndexedOrFull</span> <span class='hs-layout'>(</span><span class='hs-varid'>b</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-varid'>ary'</span>
<a name="line-190"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-191"></a>            <span class='hs-varid'>st</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>indexM</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-192"></a>            <span class='hs-varid'>st'</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-193"></a>            <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>unsafeUpdateM</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varid'>st'</span>
<a name="line-194"></a>            <span class='hs-varid'>return</span> <span class='hs-varid'>t</span>
<a name="line-195"></a>      <span class='hs-keyword'>where</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-196"></a>            <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>sparseIndex</span> <span class='hs-varid'>b</span> <span class='hs-varid'>m</span>
<a name="line-197"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>do</span>
<a name="line-198"></a>        <span class='hs-varid'>st</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>indexM</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-199"></a>        <span class='hs-varid'>st'</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-200"></a>        <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>unsafeUpdateM</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varid'>st'</span>
<a name="line-201"></a>        <span class='hs-varid'>return</span> <span class='hs-varid'>t</span>
<a name="line-202"></a>      <span class='hs-keyword'>where</span> <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>index</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-203"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-204"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h</span> <span class='hs-varop'>==</span> <span class='hs-varid'>hy</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>return</span> <span class='hs-varop'>$!</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateOrSnocWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-205"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>x</span> <span class='hs-varid'>s</span> <span class='hs-varop'>$</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-layout'>(</span><span class='hs-varid'>mask</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>s</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>singleton</span> <span class='hs-varid'>t</span><span class='hs-layout'>)</span>
<a name="line-206"></a><span class='hs-comment'>{-# INLINABLE unsafeInsertWith #-}</span>
<a name="line-207"></a>
<a name="line-208"></a><a name="adjust"></a><span class='hs-comment'>-- | /O(log n)/ Adjust the value tied to a given key in this map only</span>
<a name="line-209"></a><span class='hs-comment'>-- if it is present. Otherwise, leave the map alone.</span>
<a name="line-210"></a><span class='hs-definition'>adjust</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-211"></a><span class='hs-definition'>adjust</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>m0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h0</span> <span class='hs-varid'>k0</span> <span class='hs-num'>0</span> <span class='hs-varid'>m0</span>
<a name="line-212"></a>  <span class='hs-keyword'>where</span>
<a name="line-213"></a>    <span class='hs-varid'>h0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>hash</span> <span class='hs-varid'>k0</span>
<a name="line-214"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-conid'>Empty</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Empty</span>
<a name="line-215"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>hy</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>ky</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-216"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>hy</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h</span> <span class='hs-varop'>&amp;&amp;</span> <span class='hs-varid'>ky</span> <span class='hs-varop'>==</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span>
<a name="line-217"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span>          <span class='hs-keyglyph'>=</span> <span class='hs-varid'>t</span>
<a name="line-218"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span>
<a name="line-219"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>b</span> <span class='hs-varop'>.&amp;.</span> <span class='hs-varid'>m</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>t</span>
<a name="line-220"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>st</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-221"></a>                          <span class='hs-varid'>st'</span>  <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-222"></a>                          <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>update</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>st'</span>
<a name="line-223"></a>                      <span class='hs-keyword'>in</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary'</span>
<a name="line-224"></a>      <span class='hs-keyword'>where</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-225"></a>            <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>sparseIndex</span> <span class='hs-varid'>b</span> <span class='hs-varid'>m</span>
<a name="line-226"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-227"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>i</span>    <span class='hs-keyglyph'>=</span> <span class='hs-varid'>index</span> <span class='hs-varid'>h</span> <span class='hs-varid'>s</span>
<a name="line-228"></a>            <span class='hs-varid'>st</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span>
<a name="line-229"></a>            <span class='hs-varid'>st'</span>  <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st</span>
<a name="line-230"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>update16</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>st'</span>
<a name="line-231"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-232"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>t</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>hy</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-233"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h</span> <span class='hs-varop'>==</span> <span class='hs-varid'>hy</span>   <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-234"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>t</span>
<a name="line-235"></a><span class='hs-comment'>{-# INLINABLE adjust #-}</span>
<a name="line-236"></a>
<a name="line-237"></a><a name="update"></a><span class='hs-comment'>-- | /O(log n)/  The expression (@'update' f k map@) updates the value @x@ at @k@,</span>
<a name="line-238"></a><span class='hs-comment'>-- (if it is in the map). If (f k x) is @'Nothing', the element is deleted.</span>
<a name="line-239"></a><span class='hs-comment'>-- If it is (@'Just' y), the key k is bound to the new value y.</span>
<a name="line-240"></a><span class='hs-definition'>update</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>Maybe</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>a</span>
<a name="line-241"></a><span class='hs-definition'>update</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>alter</span> <span class='hs-layout'>(</span><span class='hs-varop'>&gt;&gt;=</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-242"></a><span class='hs-comment'>{-# INLINABLE update #-}</span>
<a name="line-243"></a>
<a name="line-244"></a><a name="alter"></a><span class='hs-comment'>-- | /O(log n)/  The expression (@'alter' f k map@) alters the value @x@ at @k@, or</span>
<a name="line-245"></a><span class='hs-comment'>-- absence thereof. @alter@ can be used to insert, delete, or update a value in a</span>
<a name="line-246"></a><span class='hs-comment'>-- map. In short : @'lookup' k ('alter' f k m) = f ('lookup' k m)@.</span>
<a name="line-247"></a><span class='hs-definition'>alter</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-conid'>Maybe</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>Maybe</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-248"></a><span class='hs-definition'>alter</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span>
<a name="line-249"></a>  <span class='hs-keyword'>case</span> <span class='hs-varid'>f</span> <span class='hs-layout'>(</span><span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span> <span class='hs-varid'>k</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-keyword'>of</span>
<a name="line-250"></a>    <span class='hs-conid'>Nothing</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>delete</span> <span class='hs-varid'>k</span> <span class='hs-varid'>m</span>
<a name="line-251"></a>    <span class='hs-conid'>Just</span> <span class='hs-varid'>v</span>  <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>insert</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>m</span>
<a name="line-252"></a><span class='hs-comment'>{-# INLINABLE alter #-}</span>
<a name="line-253"></a>
<a name="line-254"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-255"></a><span class='hs-comment'>-- * Combine</span>
<a name="line-256"></a>
<a name="line-257"></a><a name="unionWith"></a><span class='hs-comment'>-- | /O(n+m)/ The union of two maps.  If a key occurs in both maps,</span>
<a name="line-258"></a><span class='hs-comment'>-- the provided function (first argument) will be used to compute the result.</span>
<a name="line-259"></a><span class='hs-definition'>unionWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-260"></a>          <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-261"></a><span class='hs-definition'>unionWith</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>unionWithKey</span> <span class='hs-layout'>(</span><span class='hs-varid'>const</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-262"></a><span class='hs-comment'>{-# INLINE unionWith #-}</span>
<a name="line-263"></a>
<a name="line-264"></a><a name="unionWithKey"></a><span class='hs-comment'>-- | /O(n+m)/ The union of two maps.  If a key occurs in both maps,</span>
<a name="line-265"></a><span class='hs-comment'>-- the provided function (first argument) will be used to compute the result.</span>
<a name="line-266"></a><span class='hs-definition'>unionWithKey</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-267"></a>          <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-268"></a><span class='hs-definition'>unionWithKey</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-num'>0</span>
<a name="line-269"></a>  <span class='hs-keyword'>where</span>
<a name="line-270"></a>    <span class='hs-comment'>-- empty vs. anything</span>
<a name="line-271"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-keyword'>_</span> <span class='hs-varid'>t1</span> <span class='hs-conid'>Empty</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>t1</span>
<a name="line-272"></a>    <span class='hs-varid'>go</span> <span class='hs-keyword'>_</span> <span class='hs-conid'>Empty</span> <span class='hs-varid'>t2</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>t2</span>
<a name="line-273"></a>    <span class='hs-comment'>-- leaf vs. leaf</span>
<a name="line-274"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>l1</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k1</span> <span class='hs-varid'>v1</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>l2</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k2</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-275"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>if</span> <span class='hs-varid'>k1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>k2</span>
<a name="line-276"></a>                      <span class='hs-keyword'>then</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>k1</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>k1</span> <span class='hs-varid'>v1</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span>
<a name="line-277"></a>                      <span class='hs-keyword'>else</span> <span class='hs-varid'>collision</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>l1</span> <span class='hs-varid'>l2</span>
<a name="line-278"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>goDifferentHash</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span>
<a name="line-279"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h1</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k1</span> <span class='hs-varid'>v1</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>ls2</span><span class='hs-layout'>)</span>
<a name="line-280"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h1</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateOrSnocWithKey</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k1</span> <span class='hs-varid'>v1</span> <span class='hs-varid'>ls2</span><span class='hs-layout'>)</span>
<a name="line-281"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>goDifferentHash</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span>
<a name="line-282"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>ls1</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h2</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k2</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-283"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h1</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateOrSnocWithKey</span> <span class='hs-layout'>(</span><span class='hs-varid'>flip</span> <span class='hs-varop'>.</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span> <span class='hs-varid'>k2</span> <span class='hs-varid'>v2</span> <span class='hs-varid'>ls1</span><span class='hs-layout'>)</span>
<a name="line-284"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>goDifferentHash</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span>
<a name="line-285"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>ls1</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>ls2</span><span class='hs-layout'>)</span>
<a name="line-286"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>h1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>h2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Collision</span> <span class='hs-varid'>h1</span> <span class='hs-layout'>(</span><span class='hs-varid'>updateOrConcatWithKey</span> <span class='hs-varid'>f</span> <span class='hs-varid'>ls1</span> <span class='hs-varid'>ls2</span><span class='hs-layout'>)</span>
<a name="line-287"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>goDifferentHash</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span>
<a name="line-288"></a>    <span class='hs-comment'>-- branch vs. branch</span>
<a name="line-289"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-290"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>b'</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>b1</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>b2</span>
<a name="line-291"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>unionArrayBy</span> <span class='hs-layout'>(</span><span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>ary2</span>
<a name="line-292"></a>        <span class='hs-keyword'>in</span> <span class='hs-varid'>bitmapIndexedOrFull</span> <span class='hs-varid'>b'</span> <span class='hs-varid'>ary'</span>
<a name="line-293"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-294"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>unionArrayBy</span> <span class='hs-layout'>(</span><span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>fullNodeMask</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>ary2</span>
<a name="line-295"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-296"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-297"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>unionArrayBy</span> <span class='hs-layout'>(</span><span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>fullNodeMask</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>ary2</span>
<a name="line-298"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-299"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-300"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>unionArrayBy</span> <span class='hs-layout'>(</span><span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-varid'>fullNodeMask</span> <span class='hs-varid'>fullNodeMask</span>
<a name="line-301"></a>                   <span class='hs-varid'>ary1</span> <span class='hs-varid'>ary2</span>
<a name="line-302"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-303"></a>    <span class='hs-comment'>-- leaf vs. branch</span>
<a name="line-304"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span>
<a name="line-305"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>b1</span> <span class='hs-varop'>.&amp;.</span> <span class='hs-varid'>m2</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>i</span> <span class='hs-varid'>t2</span>
<a name="line-306"></a>                               <span class='hs-varid'>b'</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>b1</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m2</span>
<a name="line-307"></a>                           <span class='hs-keyword'>in</span> <span class='hs-varid'>bitmapIndexedOrFull</span> <span class='hs-varid'>b'</span> <span class='hs-varid'>ary'</span>
<a name="line-308"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span>      <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>updateWith'</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>st1</span> <span class='hs-keyglyph'>-&gt;</span>
<a name="line-309"></a>                                   <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st1</span> <span class='hs-varid'>t2</span>
<a name="line-310"></a>                           <span class='hs-keyword'>in</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>ary'</span>
<a name="line-311"></a>        <span class='hs-keyword'>where</span>
<a name="line-312"></a>          <span class='hs-varid'>h2</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leafHashCode</span> <span class='hs-varid'>t2</span>
<a name="line-313"></a>          <span class='hs-varid'>m2</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>s</span>
<a name="line-314"></a>          <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>sparseIndex</span> <span class='hs-varid'>b1</span> <span class='hs-varid'>m2</span>
<a name="line-315"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span>
<a name="line-316"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>b2</span> <span class='hs-varop'>.&amp;.</span> <span class='hs-varid'>m1</span> <span class='hs-varop'>==</span> <span class='hs-num'>0</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>ary2</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>t1</span>
<a name="line-317"></a>                               <span class='hs-varid'>b'</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>b2</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m1</span>
<a name="line-318"></a>                           <span class='hs-keyword'>in</span> <span class='hs-varid'>bitmapIndexedOrFull</span> <span class='hs-varid'>b'</span> <span class='hs-varid'>ary'</span>
<a name="line-319"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span>      <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>let</span> <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>updateWith'</span> <span class='hs-varid'>ary2</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>st2</span> <span class='hs-keyglyph'>-&gt;</span>
<a name="line-320"></a>                                   <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>st2</span>
<a name="line-321"></a>                           <span class='hs-keyword'>in</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>ary'</span>
<a name="line-322"></a>      <span class='hs-keyword'>where</span>
<a name="line-323"></a>        <span class='hs-varid'>h1</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leafHashCode</span> <span class='hs-varid'>t1</span>
<a name="line-324"></a>        <span class='hs-varid'>m1</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>s</span>
<a name="line-325"></a>        <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>sparseIndex</span> <span class='hs-varid'>b2</span> <span class='hs-varid'>m1</span>
<a name="line-326"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary1</span><span class='hs-layout'>)</span> <span class='hs-varid'>t2</span> <span class='hs-keyglyph'>=</span>
<a name="line-327"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>h2</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leafHashCode</span> <span class='hs-varid'>t2</span>
<a name="line-328"></a>            <span class='hs-varid'>i</span>    <span class='hs-keyglyph'>=</span> <span class='hs-varid'>index</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>s</span>
<a name="line-329"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>update16With'</span> <span class='hs-varid'>ary1</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>st1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>st1</span> <span class='hs-varid'>t2</span>
<a name="line-330"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-331"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>s</span> <span class='hs-varid'>t1</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span>
<a name="line-332"></a>        <span class='hs-keyword'>let</span> <span class='hs-varid'>h1</span>   <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leafHashCode</span> <span class='hs-varid'>t1</span>
<a name="line-333"></a>            <span class='hs-varid'>i</span>    <span class='hs-keyglyph'>=</span> <span class='hs-varid'>index</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>s</span>
<a name="line-334"></a>            <span class='hs-varid'>ary'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>update16With'</span> <span class='hs-varid'>ary2</span> <span class='hs-varid'>i</span> <span class='hs-varop'>$</span> <span class='hs-keyglyph'>\</span><span class='hs-varid'>st2</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>st2</span>
<a name="line-335"></a>        <span class='hs-keyword'>in</span> <span class='hs-conid'>Full</span> <span class='hs-varid'>ary'</span>
<a name="line-336"></a>
<a name="line-337"></a>    <span class='hs-varid'>leafHashCode</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h</span> <span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>h</span>
<a name="line-338"></a>    <span class='hs-varid'>leafHashCode</span> <span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-keyword'>_</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>h</span>
<a name="line-339"></a>    <span class='hs-varid'>leafHashCode</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>error</span> <span class='hs-str'>"leafHashCode"</span>
<a name="line-340"></a>
<a name="line-341"></a>    <span class='hs-varid'>goDifferentHash</span> <span class='hs-varid'>s</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span>
<a name="line-342"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>m1</span> <span class='hs-varop'>==</span> <span class='hs-varid'>m2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>m1</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>singleton</span> <span class='hs-varop'>$!</span> <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-varid'>s</span><span class='hs-varop'>+</span><span class='hs-varid'>bitsPerSubkey</span><span class='hs-layout'>)</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span><span class='hs-layout'>)</span>
<a name="line-343"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>m1</span> <span class='hs-varop'>&lt;</span>  <span class='hs-varid'>m2</span>  <span class='hs-keyglyph'>=</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-layout'>(</span><span class='hs-varid'>m1</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m2</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>pair</span> <span class='hs-varid'>t1</span> <span class='hs-varid'>t2</span><span class='hs-layout'>)</span>
<a name="line-344"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-layout'>(</span><span class='hs-varid'>m1</span> <span class='hs-varop'>.|.</span> <span class='hs-varid'>m2</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>pair</span> <span class='hs-varid'>t2</span> <span class='hs-varid'>t1</span><span class='hs-layout'>)</span>
<a name="line-345"></a>      <span class='hs-keyword'>where</span>
<a name="line-346"></a>        <span class='hs-varid'>m1</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h1</span> <span class='hs-varid'>s</span>
<a name="line-347"></a>        <span class='hs-varid'>m2</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mask</span> <span class='hs-varid'>h2</span> <span class='hs-varid'>s</span>
<a name="line-348"></a><span class='hs-comment'>{-# INLINE unionWithKey #-}</span>
<a name="line-349"></a>
<a name="line-350"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-351"></a><span class='hs-comment'>-- * Transformations</span>
<a name="line-352"></a>
<a name="line-353"></a><a name="mapWithKey"></a><span class='hs-comment'>-- | /O(n)/ Transform this map by applying a function to every value.</span>
<a name="line-354"></a><span class='hs-definition'>mapWithKey</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span>
<a name="line-355"></a><span class='hs-definition'>mapWithKey</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span>
<a name="line-356"></a>  <span class='hs-keyword'>where</span>
<a name="line-357"></a>    <span class='hs-varid'>go</span> <span class='hs-conid'>Empty</span>                 <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Empty</span>
<a name="line-358"></a>    <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>      <span class='hs-keyglyph'>=</span> <span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-359"></a>    <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>BitmapIndexed</span> <span class='hs-varid'>b</span> <span class='hs-varop'>$</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>map'</span> <span class='hs-varid'>go</span> <span class='hs-varid'>ary</span>
<a name="line-360"></a>    <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-conid'>Full</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span>            <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Full</span> <span class='hs-varop'>$</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>map'</span> <span class='hs-varid'>go</span> <span class='hs-varid'>ary</span>
<a name="line-361"></a>    <span class='hs-varid'>go</span> <span class='hs-layout'>(</span><span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-varid'>ary</span><span class='hs-layout'>)</span>     <span class='hs-keyglyph'>=</span>
<a name="line-362"></a>        <span class='hs-conid'>Collision</span> <span class='hs-varid'>h</span> <span class='hs-varop'>$</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>map'</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-keyword'>let</span> <span class='hs-varop'>!</span><span class='hs-varid'>v'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyword'>in</span> <span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v'</span><span class='hs-layout'>)</span> <span class='hs-varid'>ary</span>
<a name="line-363"></a><span class='hs-comment'>{-# INLINE mapWithKey #-}</span>
<a name="line-364"></a>
<a name="line-365"></a><a name="map"></a><span class='hs-comment'>-- | /O(n)/ Transform this map by applying a function to every value.</span>
<a name="line-366"></a><span class='hs-definition'>map</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span>
<a name="line-367"></a><span class='hs-definition'>map</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mapWithKey</span> <span class='hs-layout'>(</span><span class='hs-varid'>const</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-368"></a><span class='hs-comment'>{-# INLINE map #-}</span>
<a name="line-369"></a>
<a name="line-370"></a>
<a name="line-371"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-372"></a><span class='hs-comment'>-- * Filter</span>
<a name="line-373"></a>
<a name="line-374"></a><a name="mapMaybeWithKey"></a><span class='hs-comment'>-- | /O(n)/ Transform this map by applying a function to every value</span>
<a name="line-375"></a><span class='hs-comment'>--   and retaining only some of them.</span>
<a name="line-376"></a><span class='hs-definition'>mapMaybeWithKey</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>Maybe</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span>
<a name="line-377"></a><span class='hs-definition'>mapMaybeWithKey</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>filterMapAux</span> <span class='hs-varid'>onLeaf</span> <span class='hs-varid'>onColl</span>
<a name="line-378"></a>  <span class='hs-keyword'>where</span> <span class='hs-varid'>onLeaf</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-conid'>Just</span> <span class='hs-varid'>v'</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-varid'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v'</span><span class='hs-layout'>)</span>
<a name="line-379"></a>        <span class='hs-varid'>onLeaf</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Nothing</span>
<a name="line-380"></a>
<a name="line-381"></a>        <span class='hs-varid'>onColl</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-conid'>Just</span> <span class='hs-varid'>v'</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Just</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v'</span><span class='hs-layout'>)</span>
<a name="line-382"></a>                       <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Nothing</span>
<a name="line-383"></a><span class='hs-comment'>{-# INLINE mapMaybeWithKey #-}</span>
<a name="line-384"></a>
<a name="line-385"></a><a name="mapMaybe"></a><span class='hs-comment'>-- | /O(n)/ Transform this map by applying a function to every value</span>
<a name="line-386"></a><span class='hs-comment'>--   and retaining only some of them.</span>
<a name="line-387"></a><span class='hs-definition'>mapMaybe</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>Maybe</span> <span class='hs-varid'>v2</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span>
<a name="line-388"></a><span class='hs-definition'>mapMaybe</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mapMaybeWithKey</span> <span class='hs-layout'>(</span><span class='hs-varid'>const</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-389"></a><span class='hs-comment'>{-# INLINE mapMaybe #-}</span>
<a name="line-390"></a>
<a name="line-391"></a>
<a name="line-392"></a><span class='hs-comment'>-- TODO: Should we add a strict traverseWithKey?</span>
<a name="line-393"></a>
<a name="line-394"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-395"></a><span class='hs-comment'>-- * Difference and intersection</span>
<a name="line-396"></a>
<a name="line-397"></a><a name="intersectionWith"></a><span class='hs-comment'>-- | /O(n+m)/ Intersection of two maps. If a key occurs in both maps</span>
<a name="line-398"></a><span class='hs-comment'>-- the provided function is used to combine the values from the two</span>
<a name="line-399"></a><span class='hs-comment'>-- maps.</span>
<a name="line-400"></a><span class='hs-definition'>intersectionWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v2</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v3</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span>
<a name="line-401"></a>                 <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v3</span>
<a name="line-402"></a><span class='hs-definition'>intersectionWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>foldlWithKey'</span> <span class='hs-varid'>go</span> <span class='hs-varid'>empty</span> <span class='hs-varid'>a</span>
<a name="line-403"></a>  <span class='hs-keyword'>where</span>
<a name="line-404"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>m</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span> <span class='hs-varid'>k</span> <span class='hs-varid'>b</span> <span class='hs-keyword'>of</span>
<a name="line-405"></a>                 <span class='hs-conid'>Just</span> <span class='hs-varid'>w</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>insert</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>v</span> <span class='hs-varid'>w</span><span class='hs-layout'>)</span> <span class='hs-varid'>m</span>
<a name="line-406"></a>                 <span class='hs-keyword'>_</span>      <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>m</span>
<a name="line-407"></a><span class='hs-comment'>{-# INLINABLE intersectionWith #-}</span>
<a name="line-408"></a>
<a name="line-409"></a><a name="intersectionWithKey"></a><span class='hs-comment'>-- | /O(n+m)/ Intersection of two maps. If a key occurs in both maps</span>
<a name="line-410"></a><span class='hs-comment'>-- the provided function is used to combine the values from the two</span>
<a name="line-411"></a><span class='hs-comment'>-- maps.</span>
<a name="line-412"></a><span class='hs-definition'>intersectionWithKey</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v2</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v3</span><span class='hs-layout'>)</span>
<a name="line-413"></a>                    <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v1</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v2</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v3</span>
<a name="line-414"></a><span class='hs-definition'>intersectionWithKey</span> <span class='hs-varid'>f</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>foldlWithKey'</span> <span class='hs-varid'>go</span> <span class='hs-varid'>empty</span> <span class='hs-varid'>a</span>
<a name="line-415"></a>  <span class='hs-keyword'>where</span>
<a name="line-416"></a>    <span class='hs-varid'>go</span> <span class='hs-varid'>m</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span> <span class='hs-varid'>k</span> <span class='hs-varid'>b</span> <span class='hs-keyword'>of</span>
<a name="line-417"></a>                 <span class='hs-conid'>Just</span> <span class='hs-varid'>w</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>insert</span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>w</span><span class='hs-layout'>)</span> <span class='hs-varid'>m</span>
<a name="line-418"></a>                 <span class='hs-keyword'>_</span>      <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>m</span>
<a name="line-419"></a><span class='hs-comment'>{-# INLINABLE intersectionWithKey #-}</span>
<a name="line-420"></a>
<a name="line-421"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-422"></a><span class='hs-comment'>-- ** Lists</span>
<a name="line-423"></a>
<a name="line-424"></a><a name="fromList"></a><span class='hs-comment'>-- | /O(n*log n)/ Construct a map with the supplied mappings.  If the</span>
<a name="line-425"></a><span class='hs-comment'>-- list contains duplicate mappings, the later mappings take</span>
<a name="line-426"></a><span class='hs-comment'>-- precedence.</span>
<a name="line-427"></a><span class='hs-definition'>fromList</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-keyglyph'>[</span><span class='hs-layout'>(</span><span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-428"></a><span class='hs-definition'>fromList</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>L</span><span class='hs-varop'>.</span><span class='hs-varid'>foldl'</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-varid'>m</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-varop'>!</span><span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>unsafeInsert</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-varid'>empty</span>
<a name="line-429"></a><span class='hs-comment'>{-# INLINABLE fromList #-}</span>
<a name="line-430"></a>
<a name="line-431"></a><a name="fromListWith"></a><span class='hs-comment'>-- | /O(n*log n)/ Construct a map from a list of elements.  Uses</span>
<a name="line-432"></a><span class='hs-comment'>-- the provided function f to merge duplicate entries (f newVal oldVal).</span>
<a name="line-433"></a><span class='hs-comment'>--</span>
<a name="line-434"></a><span class='hs-comment'>-- For example:</span>
<a name="line-435"></a><span class='hs-comment'>--</span>
<a name="line-436"></a><span class='hs-comment'>-- &gt; fromListWith (+) [ (x, 1) | x &lt;- xs ]</span>
<a name="line-437"></a><span class='hs-comment'>--</span>
<a name="line-438"></a><span class='hs-comment'>-- will create a map with number of occurrences of each element in xs.</span>
<a name="line-439"></a><span class='hs-comment'>--</span>
<a name="line-440"></a><span class='hs-comment'>-- &gt; fromListWith (++) [ (k, [v]) | (k, v) &lt;- xs ]</span>
<a name="line-441"></a><span class='hs-comment'>--</span>
<a name="line-442"></a><span class='hs-comment'>-- will group all values by their keys in a list 'xs :: [(k, v)]' and</span>
<a name="line-443"></a><span class='hs-comment'>-- return a 'HashMap k [v]'.</span>
<a name="line-444"></a><span class='hs-definition'>fromListWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>k</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-keyglyph'>[</span><span class='hs-layout'>(</span><span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-445"></a><span class='hs-definition'>fromListWith</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>L</span><span class='hs-varop'>.</span><span class='hs-varid'>foldl'</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-varid'>m</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span><span class='hs-layout'>,</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>unsafeInsertWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-varid'>empty</span>
<a name="line-446"></a><span class='hs-comment'>{-# INLINE fromListWith #-}</span>
<a name="line-447"></a>
<a name="line-448"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-449"></a><span class='hs-comment'>-- Array operations</span>
<a name="line-450"></a>
<a name="line-451"></a><a name="updateWith"></a><span class='hs-definition'>updateWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-452"></a><span class='hs-definition'>updateWith</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>ary0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>ary0</span> <span class='hs-num'>0</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>length</span> <span class='hs-varid'>ary0</span><span class='hs-layout'>)</span>
<a name="line-453"></a>  <span class='hs-keyword'>where</span>
<a name="line-454"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-varid'>k</span> <span class='hs-varop'>!</span><span class='hs-varid'>ary</span> <span class='hs-varop'>!</span><span class='hs-varid'>i</span> <span class='hs-varop'>!</span><span class='hs-varid'>n</span>
<a name="line-455"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>i</span> <span class='hs-varop'>&gt;=</span> <span class='hs-varid'>n</span>    <span class='hs-keyglyph'>=</span> <span class='hs-varid'>ary</span>
<a name="line-456"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-keyword'>of</span>
<a name="line-457"></a>            <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>kx</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>k</span> <span class='hs-varop'>==</span> <span class='hs-varid'>kx</span>   <span class='hs-keyglyph'>-&gt;</span> <span class='hs-keyword'>let</span> <span class='hs-varop'>!</span><span class='hs-varid'>v'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>y</span> <span class='hs-keyword'>in</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>update</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v'</span><span class='hs-layout'>)</span>
<a name="line-458"></a>                     <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>go</span> <span class='hs-varid'>k</span> <span class='hs-varid'>ary</span> <span class='hs-layout'>(</span><span class='hs-varid'>i</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-varid'>n</span>
<a name="line-459"></a><span class='hs-comment'>{-# INLINABLE updateWith #-}</span>
<a name="line-460"></a>
<a name="line-461"></a><a name="updateOrSnocWith"></a><span class='hs-comment'>-- | Append the given key and value to the array. If the key is</span>
<a name="line-462"></a><span class='hs-comment'>-- already present, instead update the value of the key by applying</span>
<a name="line-463"></a><span class='hs-comment'>-- the given function to the new and old value (in that order). The</span>
<a name="line-464"></a><span class='hs-comment'>-- value is always evaluated to WHNF before being inserted into the</span>
<a name="line-465"></a><span class='hs-comment'>-- array.</span>
<a name="line-466"></a><span class='hs-definition'>updateOrSnocWith</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-467"></a>                 <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-468"></a><span class='hs-definition'>updateOrSnocWith</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>updateOrSnocWithKey</span> <span class='hs-layout'>(</span><span class='hs-varid'>const</span> <span class='hs-varid'>f</span><span class='hs-layout'>)</span>
<a name="line-469"></a><span class='hs-comment'>{-# INLINABLE updateOrSnocWith #-}</span>
<a name="line-470"></a>
<a name="line-471"></a><a name="updateOrSnocWithKey"></a><span class='hs-comment'>-- | Append the given key and value to the array. If the key is</span>
<a name="line-472"></a><span class='hs-comment'>-- already present, instead update the value of the key by applying</span>
<a name="line-473"></a><span class='hs-comment'>-- the given function to the new and old value (in that order). The</span>
<a name="line-474"></a><span class='hs-comment'>-- value is always evaluated to WHNF before being inserted into the</span>
<a name="line-475"></a><span class='hs-comment'>-- array.</span>
<a name="line-476"></a><span class='hs-definition'>updateOrSnocWithKey</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>=&gt;</span> <span class='hs-layout'>(</span><span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-477"></a>                 <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-conid'>Array</span> <span class='hs-layout'>(</span><span class='hs-conid'>Leaf</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-478"></a><span class='hs-definition'>updateOrSnocWithKey</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-varid'>ary0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>go</span> <span class='hs-varid'>k0</span> <span class='hs-varid'>v0</span> <span class='hs-varid'>ary0</span> <span class='hs-num'>0</span> <span class='hs-layout'>(</span><span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>length</span> <span class='hs-varid'>ary0</span><span class='hs-layout'>)</span>
<a name="line-479"></a>  <span class='hs-keyword'>where</span>
<a name="line-480"></a>    <span class='hs-varid'>go</span> <span class='hs-varop'>!</span><span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varop'>!</span><span class='hs-varid'>ary</span> <span class='hs-varop'>!</span><span class='hs-varid'>i</span> <span class='hs-varop'>!</span><span class='hs-varid'>n</span>
<a name="line-481"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>i</span> <span class='hs-varop'>&gt;=</span> <span class='hs-varid'>n</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>run</span> <span class='hs-varop'>$</span> <span class='hs-keyword'>do</span>
<a name="line-482"></a>            <span class='hs-comment'>-- Not found, append to the end.</span>
<a name="line-483"></a>            <span class='hs-varid'>mary</span> <span class='hs-keyglyph'>&lt;-</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>new_</span> <span class='hs-layout'>(</span><span class='hs-varid'>n</span> <span class='hs-varop'>+</span> <span class='hs-num'>1</span><span class='hs-layout'>)</span>
<a name="line-484"></a>            <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>copy</span> <span class='hs-varid'>ary</span> <span class='hs-num'>0</span> <span class='hs-varid'>mary</span> <span class='hs-num'>0</span> <span class='hs-varid'>n</span>
<a name="line-485"></a>            <span class='hs-keyword'>let</span> <span class='hs-varop'>!</span><span class='hs-varid'>l</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>v</span> <span class='hs-varop'>`seq`</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-486"></a>            <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>write</span> <span class='hs-varid'>mary</span> <span class='hs-varid'>n</span> <span class='hs-varid'>l</span>
<a name="line-487"></a>            <span class='hs-varid'>return</span> <span class='hs-varid'>mary</span>
<a name="line-488"></a>        <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>index</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-keyword'>of</span>
<a name="line-489"></a>            <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>kx</span> <span class='hs-varid'>y</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>k</span> <span class='hs-varop'>==</span> <span class='hs-varid'>kx</span>   <span class='hs-keyglyph'>-&gt;</span> <span class='hs-keyword'>let</span> <span class='hs-varop'>!</span><span class='hs-varid'>v'</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>y</span> <span class='hs-keyword'>in</span> <span class='hs-conid'>A</span><span class='hs-varop'>.</span><span class='hs-varid'>update</span> <span class='hs-varid'>ary</span> <span class='hs-varid'>i</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v'</span><span class='hs-layout'>)</span>
<a name="line-490"></a>                     <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>go</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span> <span class='hs-varid'>ary</span> <span class='hs-layout'>(</span><span class='hs-varid'>i</span><span class='hs-varop'>+</span><span class='hs-num'>1</span><span class='hs-layout'>)</span> <span class='hs-varid'>n</span>
<a name="line-491"></a><span class='hs-comment'>{-# INLINABLE updateOrSnocWithKey #-}</span>
<a name="line-492"></a>
<a name="line-493"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-494"></a><span class='hs-comment'>-- Smart constructors</span>
<a name="line-495"></a><span class='hs-comment'>--</span>
<a name="line-496"></a><span class='hs-comment'>-- These constructors make sure the value is in WHNF before it's</span>
<a name="line-497"></a><span class='hs-comment'>-- inserted into the constructor.</span>
<a name="line-498"></a>
<a name="line-499"></a><a name="leaf"></a><span class='hs-definition'>leaf</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Hash</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>-&gt;</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span>
<a name="line-500"></a><span class='hs-definition'>leaf</span> <span class='hs-varid'>h</span> <span class='hs-varid'>k</span> <span class='hs-varop'>!</span><span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Leaf</span> <span class='hs-varid'>h</span> <span class='hs-layout'>(</span><span class='hs-conid'>L</span> <span class='hs-varid'>k</span> <span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-501"></a><span class='hs-comment'>{-# INLINE leaf #-}</span>
</pre></body>
</html>

APT Browse - Built by Thomas Orozco.