    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67
    68
    69
    70
    71
    72
    73
    74
    75
    76
    77
    78
    79
    80
    81
    82
    83
    84
    85
    86
    87
    88
    89
    90
    91
    92
    93
    94
    95
    96
    97
    98
    99
    100
    101
    102
    103
    104
    105
    106
    107
    108
    109
    110
    111
    112
    113
    114
    115
    116
    117
    118
    119
    120
    121
    122
    123
    124
    125
    126
    127
    128
    129
    130
    131
    132
    133
    134
    135
    136
    137
    138
    139
    140
    141
    142
    143
    144
    145
    146
    147
    148
    149
    150
    151
    152
    153
    154
    155
    156
    157
    158
    159
    160
    161
    162
    163
    164
    165
    166
    167
    168
    169
    170
    171
    172
    173
    174
    175
    176
    177
    178
    179
    180
    181
    182
    183
    184
    185
    186
    187
    188
    189
    190
    191
    192
    193
    194
    195
    196
    197
    198
    199
    200
    201
    202
    203
    204
    205
    206
    207
    208
    209
    210
    211
    212
    213
    214
    215
    216
    217
    218
    219
    220
    221
    222
    223
    224
    225
    226
    227
    228
    229
    230
    231
    232
    233
    234
    235
    236
    237
    238
    239
    240
    241
    242
    243
    244
    245
    246
    247
    248
    249
    250
    251
    252
    253
    254
    255
    256
    257
    258
    259
    260
    261
    262
    263
    264
    265
    266
    267
    268
    269
    270
    271
    272
    273
    274
    275
    276
    277
    278
    279
    280
    281
    282
    283
    284
    285
    286
    287
    288
    289
    290
    291
    292
    293
    294
    295
    296
    297
    298
    299
    300
    301
    302
    303
    304
    305
    306
    307
    308
    309
    310
    311
    312
    313
    314
    315
    316
    317
    318
    319
    320
    321
    322
    323
    324
    325
    326
    327
    328
    329
    330
    331
    332
    333
    334
    335
    336
    337
    338
    339
    340
    341
    342
    343
    344
    345
    346
    347
    348
    349
    350
    351
    352
    353
    354
    355
    356
    357
    358
    359
    360
    361
    362
    363
    364
    365
    366
    367
    368
    369
    370
    371
    372
    373
    374
    375
    376
    377
    378
    379
    380
    381
    382
    383
    384
    385
    386
    387
    388
    389
    390
    391
    392
    393
    394
    395
    396
    397
    398
    399
    400
    401
    402
    403
    404
    405
    406
    407
    408
    409
    410
    411
    412
    413
    414
    415
    416
    417
    418
    419
    420
    421
    422
    423
    424
    425
    426
    427
    428
    429
    430
    431
    432
    433
    434
    435
    436
    437
    438
    439
    440
    441
    442
    443
    444
    445
    446
    447
    448
    449
    450
    451
    452
    453
    454
    455
    456
    457
    458
    459
    460
    461
    462
    463
    464
    465
    466
    467
    468
    469
    470
    471
    472
    473
    474
    475
    476
    477
    478
    479
    480
    481
    482
    483
    484
    485
    486
    487
    488
    489
    490
    491
    492
    493
    494
    495
    496
    497
    498
    499
    500
    501
    502
    503
    504
    505
    506
    507
    508
    509
    510
    511
    512
    513
    514
    515
    516
    517
    518
    519
    520
    521
    522
    523
    524
    525
    526
    527
    528
    529
    530
    531
    532
    533
    534
    535
    536
    537
    538
    539
    540
    541
    542
    543
    544
    545
    546
    547
    548
    549
    550
    551
    552
    553
    554
    555
    556
    557
    558
    559
    560
    561
    562
    563
    564
    565
    566
    567
    568
    569
    570
    571
    572
    573
    574
    575
    576
    577
    578
    579
    580
    581
    582
    583
    584
    585
    586
    587
    588
    589
    590
    591
    592
    593
    594
    595
    596
    597
    598
    599
    600
    601
    602
    603
    604
    605
    606
    607
    608
    609
    610
    611
    612
    613
    614
    615
    616
    617
    618
    619
    620
    621
    622
    623
    624
    625
    626
    627
    628
    629
    630
    631
    632
    633
    634
    635
    636
    637
    638
    639
    640
    641
    642
    643
    644
    645
    646
    647
    648
    649
    650
    651
    652
    653
    654
    655
    656
    657
    658
    659
    660
    661
    662
    663
    664
    665
    666
    667
    668
    669
    670
    671
    672
    673
    674
    675
    676
    677
    678
    679
    680
    681
    682
    683
    684
    685
    686
    687
    688
    689
    690
    691
    692
    693
    694
    695
    696
    697
    698
    699
    700
    701
    702
    703
    704
    705
    706
    707
    708
    709
    710
    711
    712
    713
    714
    715
    716
    717
    718
    719
    720
    721
    722
    723
    724
    725
    726
    727
    728
    729
    730
    731
    732
    733
    734
    735
    736
    737
    738
    739
    740
    741
    742
    743
    744
    745
    746
    747
    748
    749
    750
    751
    752
    753
    754
    755
    756
    757
    758
    759
    760
    761
    762
    763
    764
    765
    766
    767
    768
    769
    770
    771
    772
    773
    774
    775
    776
    777
    778
    779
    780
    781
    782
    783
    784
    785
    786
    787
    788
    789
    790
    791
    792
    793
    794
    795
    796
    797
    798
    799
    800
    801
    802
    803
    804
    805
    806
    807
    808
    809
    810
    811
    812
    813
    814
    815
    816
    817
    818
    819
    820
    821
    822
    823
    824
    825
    826
    827
    828
    829
    830
    831
    832
    833
    834
    835
    836
    837
    838
    839
    840
    841
    842
    843
    844
    845
    846
    847
    848
    849
    850
    851
    852
    853
    854
    855
    856
    857
    858
    859
    860
    861
    862
    863
    864
    865
    866
    867
    868
    869
    870
    871
    872
    873
    874
    875
    876
    877
    878
    879
    880
    881
    882
    883
    884
    885
    886
    887
    888
    889
    890
    891
    892
    893
    894
    895
    896
    897
    898
    899
    900
    901
    902
    903
    904
    905
    906
    907
    908
    909
    910
    911
    912
    913
    914
    915
    916
    917
    918
    919
    920
    921
    922
    923
    924
    925
    926
    927
    928
    929
    930
    931
    932
    933
    934
    935
    936
    937
    938
    939
    940
    941
    942
    943
    944
    945
    946
    947
    948
    949
    950
    951
    952
    953
    954
    955
    956
    957
    958
    959
    960
    961
    962
    963
    964
    965
    966
    967
    968
    969
    970
    971
    972
    973
    974
    975
    976
    977
    978
    979
    980
    981
    982
    983
    984
    985
    986
    987
    988
    989
    990
    991
    992
    993
    994
    995
    996
    997
    998
    999
    1000
    1001
    1002
    1003
    1004
    1005
    1006
    1007
    1008
    1009
    1010
    1011
    1012
    1013
    1014
    1015
    1016
    1017
    1018
    1019
    1020
    1021
    1022
    1023
    1024
    1025
    1026
    1027
    1028
    1029
    1030
    1031
    1032
    1033
    1034
    1035
    1036
    1037
    1038
    1039
    1040
    1041
    1042
    1043
    1044
    1045
    1046
    1047
    1048
    1049
    1050
    1051
    1052
    1053
    1054
    1055
    1056
    1057
    1058
    1059
    1060
    1061
    1062
    1063
    1064
    1065
    1066
    1067
    1068
    1069
    1070
    1071
    1072
    1073
    1074
    1075
    1076
    1077
    1078
    1079
    1080
    1081
    1082
    1083
    1084
    1085
    1086
    1087
    1088
    1089
    1090
    1091
    1092
    1093
    1094
    1095
    1096
    1097
    1098
    1099
    1100
    1101
    1102
    1103
    1104
    1105
    1106
    1107
    1108
    1109
    1110
    1111
    1112
    1113
    1114
    1115
    1116
    1117
    1118
    1119
    1120
    1121
    1122
    1123
    1124
    1125
    1126
    1127
    1128
    1129
    1130
    1131
    1132
    1133
    1134
    1135
    1136
    1137
    1138
    1139
    1140
    1141
    1142
    1143
    1144
    1145
    1146
    1147
    1148
    1149
    1150
    1151
    1152
    1153
    1154
    1155
    1156
    1157
    1158
    1159
    1160
    1161
    1162
    1163
    1164
    1165
    1166
    1167
    1168
    1169
    1170
    1171
    1172
    1173
    1174
    1175
    1176
    1177
    1178
    1179
    1180
    1181
    1182
    1183
    1184
    1185
    1186
    1187
    1188
    1189
    1190
    1191
    1192
    1193
    1194
    1195
    1196
    1197
    1198
    1199
    1200
    1201
    1202
    1203
    1204
    1205
    1206
    1207
    1208
    1209
    1210
    1211
    1212
    1213
    1214
    1215
    1216
    1217
    1218
    1219
    1220
    1221
    1222
    1223
    1224
    1225
    1226
    1227
    1228
    1229
    1230
    1231
    1232
    1233
    1234
    1235
    1236
    1237
    1238
    1239
    1240
    1241
    1242
    1243
    1244
    1245
    1246
    1247
    1248
    1249
    1250
    1251
    1252
    1253
    1254
    1255
    1256
    1257
    1258
    1259
    1260
    1261
    1262
    1263
    1264
    1265
    1266
    1267
    1268
    1269
    1270
    1271
    1272
    1273
    1274
    1275
    1276
    1277
    1278
    1279
    1280
    1281
    1282
    1283
    1284
    1285
    1286
    1287
    1288
    1289
    1290
    1291
    1292
    1293
    1294
    1295
    1296
    1297
    1298
    1299
    1300
    1301
    1302
    1303
    1304
    1305
    1306
    1307
    1308
    1309
    1310
    1311
    1312
    1313
    1314
    1315
    1316
    1317
    1318
    1319
    1320
    1321
    1322
    1323
    1324
    1325
    1326
    1327
    1328
    1329
    1330
    1331
    1332
    1333
    1334
    1335
    1336
    1337
    1338
    1339
    1340
    1341
    1342
    1343
    1344
    1345
    1346
    1347
    1348
    1349
    1350
    1351
    1352
    1353
    1354
    1355
    1356
    1357
    1358
    1359
    1360
    1361
    1362
    1363
    1364
    1365
    1366
    1367
    1368
    1369
    1370
    1371
    1372
    1373
    1374
    1375
    1376
    1377
    1378
    1379
    1380
    1381
    1382
    1383
    1384
    1385
    1386
    1387
    1388
    1389
    1390
    1391
    1392
    1393
    1394
    1395
    1396
    1397
    1398
    1399
    1400
    1401
    1402
    1403
    1404
    1405
    1406
    1407
    1408
    1409
    1410
    1411
    1412
    1413
    1414
    1415
    1416
    1417
    1418
    1419
    1420
    1421
    1422
    1423
    1424
    1425
    1426
    1427
    1428
    1429
    1430
    1431
    1432
    1433
    1434
    1435
    1436
    1437
    1438
    1439
    1440
    1441
    1442
    1443
    1444
    1445
    1446
    1447
    1448
    1449
    1450
    1451
    1452
    1453
    1454
    1455
    1456
    1457
    1458
    1459
    1460
    1461
    1462
    1463
    1464
    1465
    1466
    1467
    1468
    1469
    1470
    1471
    1472
    1473
    1474
    1475
    1476
    1477
    1478
    1479
    1480
    1481
    1482
    1483
    1484
    1485
    1486
    1487
    1488
    1489
    1490
    1491
    1492
    1493
    1494
    1495
    1496
    1497
    1498
    1499
    1500
    1501
    1502
    1503
    1504
    1505
    1506
    1507
    1508
    1509
    1510
    1511
    1512
    1513
    1514
    1515
    1516
    1517
    1518
    1519
    1520
    1521
    1522
    1523
    1524
    1525
    1526
    1527
    1528
    1529
    1530
    1531
    1532
    1533
    1534
    1535
    1536
    1537
    1538
    1539
    1540
    1541
    1542
    1543
    1544
    1545
    1546
    1547
    1548
    1549
    1550
    1551
    1552
    1553
    1554
    1555
    1556
    1557
    1558
    1559
    1560
    1561
    1562
    1563
    1564
    1565
    1566
    1567
    1568
    1569
    1570
    1571
    1572
    1573
    1574
    1575
    1576
    1577
    1578
    1579
    1580
    1581
    1582
    1583
    1584
    1585
    1586
    1587
    1588
    1589
    1590
    1591
    1592
    1593
    1594
    1595
    1596
    1597
    1598
    1599
    1600
    1601
    1602
    1603
    1604
    1605
    1606
    1607
    1608
    1609
    1610
    1611
    1612
    1613
    1614
    1615
    1616
    1617
    1618
    1619
    1620
    1621
    1622
    1623
    1624
    1625
    1626
    1627
    1628
    1629
    1630
    1631
    1632
    1633
    1634
    1635
    1636
    1637
    1638
    1639
    1640
    1641
    1642
    1643
    1644
    1645
    1646
    1647
    1648
    1649
    1650
    1651
    1652
    1653
    1654
    1655
    1656
    1657
    1658
    1659
    1660
    1661
    1662
    1663
    1664
    1665
    1666
    1667
    1668
    1669
    1670
    1671
    1672
    1673
    1674
    1675
    1676
    1677
    1678
    1679
    1680
    1681
    1682
    1683
    1684
    1685
    1686
    1687
    1688
    1689
    1690
    1691
    1692
    1693
    1694
    1695
    1696
    1697
    1698
    1699
    1700
    1701
    1702
    1703
    1704
    1705
    1706
    1707
    1708
    1709
    1710
    1711
    1712
    1713
    1714
    1715
    1716
    1717
    1718
    1719
    1720
    1721
    1722
    1723
    1724
    1725
    1726
    1727
    1728
    1729
    1730
    1731
    1732
    1733
    1734
    1735
    1736
    1737
    1738
    1739
    1740
    1741
    1742
    1743
    1744
    1745
    1746
    1747
    1748
    1749
    1750
    1751
    1752
    1753
    1754
    1755
    1756
    1757
    1758
    1759
    1760
    1761
    1762
    1763
    1764
    1765
    1766
    1767
    1768
    1769
    1770
    1771
    1772
    1773
    1774
    1775
    1776
    1777
    1778
    1779
    1780
    1781
    1782
    1783
    1784
    1785
    1786
    1787
    1788
    1789
    1790
    1791
    1792
    1793
    1794
    1795
    1796
    1797
    1798
    1799
    1800
    1801
    1802
    1803
    1804
    1805
    1806
    1807
    1808
    1809
    1810
    1811
    1812
    1813
    1814
    1815
    1816
    1817
    1818
    1819
    1820
    1821
    1822
    1823
    1824
    1825
    1826
    1827
    1828
    1829
    1830
    1831
    1832
    1833
    1834
    1835
    1836
    1837
    1838
    1839
    1840
    1841
    1842
    1843
    1844
    1845
    1846
    1847
    1848
    1849
    1850
    1851
    1852
    1853
    1854
    1855
    1856
    1857
    1858
    1859
    1860
    1861
    1862
    1863
    1864
    1865
    1866
    1867
    1868
    1869
    1870
    1871
    1872
    1873
    1874
    1875
    1876
    1877
    1878
    1879
    1880
    1881
    1882
    1883
    1884
    1885
    1886
    1887
    1888
    1889
    1890
    1891
    1892
    1893
    1894
    1895
    1896
    1897
    1898
    1899
    1900
    1901
    1902
    1903
    1904
    1905
    1906
    1907
    1908
    1909
    1910
    1911
    1912
    1913
    1914
    1915
    1916
    1917
    1918
    1919
    1920
    1921
    1922
    1923
    1924
    1925
    1926
    1927
    1928
    1929
    1930
    1931
    1932
    1933
    1934
    1935
    1936
    1937
    1938
    1939
    1940
    1941
    1942
    1943
    1944
    1945
    1946
    1947
    1948
    1949
    1950
    1951
    1952
    1953
    1954
    1955
    1956
    1957
    1958
    1959
    1960
    1961
    1962
    1963
    1964
    1965
    1966
    1967
    1968
    1969
    1970
    1971
    1972
    1973
    1974
    1975
    1976
    1977
    1978
    1979
    1980
    1981
    1982
    1983
    1984
    1985
    1986
    1987
    1988
    1989
    1990
    1991
    1992
    1993
    1994
    1995
    1996
    1997
    1998
    1999
    2000
    2001
    2002
    2003
    2004
    2005
    2006
    2007
    2008
    2009
    2010
    2011
    2012
    2013
    2014
    2015
    2016
    2017
    2018
    2019
    2020
    2021
    2022
    2023
    2024
    2025
    2026
    2027
    2028
    2029
    2030
    2031
    2032
    2033
    2034
    2035
    2036
    2037
    2038
    2039
    2040
    2041
    2042
    2043
    2044
    2045
    2046
    2047
    2048
    2049
    2050
    2051
    2052
    2053
    2054
    2055
    2056
    2057
    2058
    2059
    2060
    2061
    2062
    2063
    2064
    2065
    2066
    2067
    2068
    2069
    2070
    2071
    2072
    2073
    2074
    2075
    2076
    2077
    2078
    2079
    2080
    2081
    2082
    2083
    2084
    2085
    2086
    2087
    2088
    2089
    2090
    2091
    2092
    2093
    2094
    2095
    2096
    2097
    2098
    2099
    2100
    2101
    2102
    2103
    2104
    2105
    2106
    2107
    2108
    2109
    2110
    2111
    2112
    2113
    2114
    2115
    2116
    2117
    2118
    2119
    2120
    2121
    2122
    2123
    2124
    2125
    2126
    2127
    2128
    2129
    2130
    2131
    2132
    2133
    2134
    2135
    2136
    2137
    2138
    2139
    2140
    2141
    2142
    2143
    2144
    2145
    2146
    2147
    2148
    2149
    2150
    2151
    2152
    2153
    2154
    2155
    2156
    2157
    2158
    2159
    2160
    2161
    2162
    2163
    2164
    2165
    2166
    2167
    2168
    2169
    2170
    2171
    2172
    2173
    2174
    2175
    2176
    2177
    2178
    2179
    2180
    2181
    2182
    2183
    2184
    2185
    2186
    2187
    2188
    2189
    2190
    2191
    2192
    2193
    2194
    2195
    2196
    2197
    2198
    2199
    2200
    2201
    2202
    2203
    2204
    2205
    2206
    2207
    2208
    2209
    2210
    2211
    2212
    2213
    2214
    2215
    2216
    2217
    2218
    2219
    2220
    2221
    2222
    2223
    2224
    2225
    2226
    2227
    2228
    2229
    2230
    2231
    2232
    2233
    2234
    2235
    2236
    2237
    2238
    2239
    2240
    2241
    2242
    2243
    2244
    2245
    2246
    2247
    2248
    2249
    2250
    2251
    2252
    2253
    2254
    2255
    2256
    2257
    2258
    2259
    2260
    2261
    2262
    2263
    2264
    2265
    2266
    2267
    2268
    2269
    2270
    2271
    2272
    2273
    2274
    2275
    2276
    2277
    2278
    2279
    2280
    2281
    2282
    2283
    2284
    2285
    2286
    2287
    2288
    2289
    2290
    2291
    2292
    2293
    2294
    2295
    2296
    2297
    2298
    2299
    2300
    2301
    2302
    2303
    2304
    2305
    2306
    2307
    2308
    2309
    2310
    2311
    2312
    2313
    2314
    2315
    2316
    2317
    2318
    2319
    2320
    2321
    2322
    2323
    2324
    2325
    2326
    2327
    2328
    2329
    2330
    2331
    2332
    2333
    2334
    2335
    2336
    2337
    2338
    2339
    2340
    2341
    2342
    2343
    2344
    2345
    2346
    2347
    2348
    2349
    2350
    2351
    2352
    2353
    2354
    2355
    2356
    2357
    2358
    2359
    2360
    2361
    2362
    2363
    2364
    2365
    2366
    2367
    2368
    2369
    2370
    2371
    2372
    2373
    2374
    2375
    2376
    2377
    2378
    2379
    2380
    2381
    2382
    2383
    2384
    2385
    2386
    2387
    2388
    2389
    2390
    2391
    2392
    2393
    2394
    2395
    2396
    2397
    2398
    2399
    2400
    2401
    2402
    2403
    2404
    2405
    2406
    2407
    2408
    2409
    2410
    2411
    2412
    2413
    2414
    2415
    2416
    2417
    2418
    2419
    2420
    2421
    2422
    2423
    2424
    2425
    2426
    2427
    2428
    2429
    2430
    2431
    2432
    2433
    2434
    2435
    2436
    2437
    2438
    2439
    2440
    2441
    2442
    2443
    2444
    2445
    2446
    2447
    2448
    2449
    2450
    2451
    2452
    2453
    2454
    2455
    2456
    2457
    2458
    2459
    2460
    2461
    2462
    2463
    2464
    2465
    2466
    2467
    2468
    2469
    2470
    2471
    2472
    2473
    2474
    2475
    2476
    2477
    2478
    2479
    2480
    2481
    2482
    2483
    2484
    2485
    2486
    2487
    2488
    2489
    2490
    2491
    2492
    2493
    2494
    2495
    2496
    2497
    2498
    2499
    2500
    2501
    2502
    2503
    2504
    2505
    2506
    2507
    2508
    2509
    2510
    2511
    2512
    2513
    2514
    2515
    2516
    2517
    2518
    2519
    2520
    2521
    2522
    2523
    2524
    2525
    2526
    2527
    2528
    2529
    2530
    2531
    2532
    2533
    2534
    2535
    2536
    2537
    2538
    2539
    2540
    2541
    2542
    2543
    2544
    2545
    2546
    2547
    2548
    2549
    2550
    2551
    2552
    2553
    2554
    2555
    2556
    2557
    2558
    2559
    2560
    2561
    2562
    2563
    2564
    2565
    2566
    2567
    2568
    2569
    2570
    2571
    2572
    2573
    2574
    2575
    2576
    2577
    2578
    2579
    2580
    2581
    2582
    2583
    2584
    2585
    2586
    2587
    2588
    2589
    2590
    2591
    2592
    2593
    2594
    2595
    2596
    2597
    2598
    2599
    2600
    2601
    2602
    2603
    2604
    2605
    2606
    2607
    2608
    2609
    2610
    2611
    2612
    2613
    2614
    2615
    2616
    2617
    2618
    2619
    2620
    2621
    2622
    2623
    2624
    2625
    2626
    2627
    2628
    2629
    2630
    2631
    2632
    2633
    2634
    2635
    2636
    2637
    2638
    2639
    2640
    2641
    2642
    2643
    2644
    2645
    2646
    2647
    2648
    2649
    2650
    2651
    2652
    2653
    2654
    2655
    2656
    2657
    2658
    2659
    2660
    2661
    2662
    2663
    2664
    2665
    2666
    2667
    2668
    2669
    2670
    2671
    2672
    2673
    2674
    2675
    2676
    2677
    2678
    2679
    2680
    2681
    2682
    2683
    2684
    2685
    2686
    2687
    2688
    2689
    2690
    2691
    2692
    2693
    2694
    2695
    2696
    2697
    2698
    2699
    2700
    2701
    2702
    2703
    2704
    2705
    2706
    2707
    2708
    2709
    2710
    2711
    2712
    2713
    2714
    2715
    2716
    2717
    2718
    2719
    2720
    2721
    2722
    2723
    2724
    2725
    2726
    2727
    2728
    2729
    2730
    2731
    2732
    2733
    2734
    2735
    2736
    2737
    2738
    2739
    2740
    2741
    2742
    2743
    2744
    2745
    2746
    2747
    2748
    2749
    2750
    2751
    2752
    2753
    2754
    2755
    2756
    2757
    2758
    2759
    2760
    2761
    2762
    2763
    2764
    2765
    2766
    2767
    2768
    2769
    2770
    2771
    2772
    2773
    2774
    2775
    2776
    2777
    2778
    2779
    2780
    2781
    2782
    2783
    2784
    2785
    2786
    2787
    2788
    2789
    2790
    2791
    2792
    2793
    2794
    2795
    2796
    2797
    2798
    2799
    2800
    2801
    2802
    2803
    2804
    2805
    2806
    2807
    2808
    2809
    2810
    2811
    2812
    2813
    2814
    2815
    2816
    2817
    2818
    2819
    2820
    2821
    2822
    2823
    2824
    2825
    2826
    2827
    2828
    2829
    2830
    2831
    2832
    2833
    2834
    2835
    2836
    2837
    2838
    2839
    2840
    2841
    2842
    2843
    2844
    2845
    2846
    2847
    2848
    2849
    2850
    2851
    2852
    2853
    2854
    2855
    2856
    2857
    2858
    2859
    2860
    2861
    2862
    2863
    2864
    2865
    2866
    2867
    2868
    2869
    2870
    2871
    2872
    2873
    2874
    2875
    2876
    2877
    2878
    2879
    2880
    2881
    2882
    2883
    2884
    2885
    2886
    2887
    2888
    2889
    2890
    2891
    2892
    2893
    2894
    2895
    2896
    2897
    2898
    2899
    2900
    2901
    2902
    2903
    2904
    2905
    2906
    2907
    2908
    2909
    2910
    2911
    2912
    2913
    2914
    2915
    2916
    2917
    2918
    2919
    2920
    2921
    2922
    2923
    2924
    2925
    2926
    2927
    2928
    2929
    2930
    2931
    2932
    2933
    2934
    2935
    2936
    2937
    2938
    2939
    2940
    2941
    2942
    2943
    2944
    2945
    2946
    2947
    2948
    2949
    2950
    2951
    2952
    2953
    2954
    2955
    2956
    2957
    2958
    2959
    2960
    2961
    2962
    2963
    2964
    2965
    2966
    2967
    2968
    2969
    2970
    2971
    2972
    2973
    2974
    2975
    2976
    2977
    2978
    2979
    2980
    2981
    2982
    2983
    2984
    2985
    2986
    2987
    2988
    2989
    2990
    2991
    2992
    2993
    2994
    2995
    2996
    2997
    2998
    2999
    3000
    3001
    3002
    3003
    3004
    3005
    3006
    3007
    3008
    3009
    3010
    3011
    3012
    3013
    3014
    3015
    3016
    3017
    3018
    3019
    3020
    3021
    3022
    3023
    3024
    3025
    3026
    3027
    3028
    3029
    3030
    3031
    3032
    3033
    3034
    3035
    3036
    3037
    3038
    3039
    3040
    3041
    3042
    3043
    3044
    3045
    3046
    3047
    3048
    3049
    3050
    3051
    3052
    3053
    3054
    3055
    3056
    3057
    3058
    3059
    3060
    3061
    3062
    3063
    3064
    3065
    3066
    3067
    3068
    3069
    3070
    3071
    3072
    3073
    3074
    3075
    3076
    3077
    3078
    3079
    3080
    3081
    3082
    3083
    3084
    3085
    3086
    3087
    3088
    3089
    3090
    3091
    3092
    3093
    3094
    3095
    3096
    3097
    3098
    3099
    3100
    3101
    3102
    3103
    3104
    3105
    3106
    3107
    3108
    3109
    3110
    3111
    3112
    3113
    3114
    3115
    3116
    3117
    3118
    3119
    3120
    3121
    3122
    3123
    3124
    3125
    3126
    3127
    3128
    3129
    3130
    3131
    3132
    3133
    3134
    3135
    3136
    3137
    3138
    3139
    3140
    3141
    3142
    3143
    3144
    3145
    3146
    3147
    3148
    3149
    3150
    3151
    3152
    3153
    3154
    3155
    3156
    3157
    3158
    3159
    3160
    3161
    3162
    3163
    3164
    3165
    3166
    3167
    3168
    3169
    3170
    3171
    3172
    3173
    3174
    3175
    3176
    3177
    3178
    3179
    3180
    3181
    3182
    3183
    3184
    3185
    3186
    3187
    3188
    3189
    3190
    3191
    3192
    3193
    3194
    3195
    3196
    3197
    3198
    3199
    3200
    3201
    3202
    3203
    3204
    3205
    3206
    3207
    3208
    3209
    3210
    3211
    3212
    3213
    3214
    3215
    3216
    3217
    3218
    3219
    3220
    3221
    3222
    3223
    3224
    3225
    3226
    3227
    3228
    3229
    3230
    3231
    3232
    3233
    3234
    3235
    3236
    3237
    3238
    3239
    3240
    3241
    3242
    3243
    3244
    3245
    3246
    3247
    3248
    3249
    3250
    3251
    3252
    3253
    3254
    3255
    3256
    3257
    3258
    3259
    3260
    3261
    3262
    3263
    3264
    3265
    3266
    3267
    3268
    3269
    3270
    3271
    3272
    3273
    3274
    3275
    3276
    3277
    3278
    3279
    3280
    3281
    3282
    3283
    3284
    3285
    3286
    3287
    3288
    3289
    3290
    3291
    3292
    3293
    3294
    3295
    3296
    3297
    3298
    3299
    3300
    3301
    3302
    3303
    3304
    3305
    3306
    3307
    3308
    3309
    3310
    3311
    3312
    3313
    3314
    3315
    3316
    3317
    3318
    3319
    3320
    3321
    3322
    3323
    3324
    3325
    3326
    3327
    3328
    3329
    3330
    3331
    3332
    3333
    3334
    3335
    3336
    3337
    3338
    3339
    3340
    3341
    3342
    3343
    3344
    3345
    3346
    3347
    3348
    3349
    3350
    3351
    3352
    3353
    3354
    3355
    3356
    3357
    3358
    3359
    3360
    3361
    3362
    3363
    3364
    3365
    3366
    3367
    3368
    3369
    3370
    3371
    3372
    3373
    3374
    3375
    3376
    3377
    3378
    3379
    3380
    3381
    3382
    3383
    3384
    3385
    3386
    3387
    3388
    3389
    3390
    3391
    3392
    3393
    3394
    3395
    3396
    3397
    3398
    3399
    3400
    3401
    3402
    3403
    3404
    3405
    3406
    3407
    3408
    3409
    3410
    3411
    3412
    3413
    3414
    3415
    3416
    3417
    3418
    3419
    3420
    3421
    3422
    3423
    3424
    3425
    3426
    3427
    3428
    3429
    3430
    3431
    3432
    3433
    3434
    3435
    3436
    3437
    3438
    3439
    3440
    3441
    3442
    3443
    3444
    3445
    3446
    3447
    3448
    3449
    3450
    3451
    3452
    3453
    3454
    3455
    3456
    3457
    3458
    3459
    3460
    3461
    3462
    3463
    3464
    3465
    3466
    3467
    3468
    3469
    3470
    3471
    3472
    3473
    3474
    3475
    3476
    3477
    3478
    3479
    3480
    3481
    3482
    3483
    3484
    3485
    3486
    3487
    3488
    3489
    3490
    3491
    3492
    3493
    3494
    3495
    3496
    3497
    3498
    3499
    3500
    3501
    3502
    3503
    3504
    3505
    3506
    3507
    3508
    3509
    3510
    3511
    3512
    3513
    3514
    3515
    3516
    3517
    3518
    3519
    3520
    3521
    3522
    3523
    3524
    3525
    3526
    3527
    3528
    3529
    3530
    3531
    3532
    3533
    3534
    3535
    3536
    3537
    3538
    3539
    3540
    3541
    3542
    3543
    3544
    3545
    3546
    3547
    3548
    3549
    3550
    3551
    3552
    3553
    3554
    3555
    3556
    3557
    3558
    3559
    3560
    3561
    3562
    3563
    3564
    3565
    3566
    3567
    3568
    3569
    3570
    3571
    3572
    3573
    3574
    3575
    3576
    3577
    3578
    3579
    3580
    3581
    3582
    3583
    3584
    3585
    3586
    3587
    3588
    3589
    3590
    3591
    3592
    3593
    3594
    3595
    3596
    3597
    3598
    3599
    3600
    3601
    3602
    3603
    3604
    3605
    3606
    3607
    3608
    3609
    3610
    3611
    3612
    3613
    3614
    3615
    3616
    3617
    3618
    3619
    3620
    3621
    3622
    3623
    3624
    3625
    3626
    3627
    3628
    3629
    3630
    3631
    3632
    3633
    3634
    3635
    3636
    3637
    3638
    3639
    3640
    3641
    3642
    3643
    3644
    3645
    3646
    3647
    3648
    3649
    3650
    3651
    3652
    3653
    3654
    3655
    3656
    3657
    3658
    3659
    3660
    3661
    3662
    3663
    3664
    3665
    3666
    3667
    3668
    3669
    3670
    3671
    3672
    3673
    3674
    3675
    3676
    3677
    3678
    3679
    3680
    3681
    3682
    3683
    3684
    3685
    3686
    3687
    3688
    3689
    3690
    3691
    3692
    3693
    3694
    3695
    3696
    3697
    3698
    3699
    3700
    3701
    3702
    3703
    3704
    3705
    3706
    3707
    3708
    3709
    3710
    3711
    3712
    3713
    3714
    3715
    3716
    3717
    3718
    3719
    3720
    3721
    3722
    3723
    3724
    3725
    3726
    3727
    3728
    3729
    3730
    3731
    3732
    3733
    3734
    3735
    3736
    3737
    3738
    3739
    3740
    3741
    3742
    3743
    3744
    3745
    3746
    3747
    3748
    3749
    3750
    3751
    3752
    3753
    3754
    3755
    3756
    3757
    3758
    3759
    3760
    3761
    3762
    3763
    3764
    3765
    3766
    3767
    3768
    3769
    3770
    3771
    3772
    3773
    3774
    3775
    3776
    3777
    3778
    3779
    3780
    3781
    3782
    3783
    3784
    3785
    3786
    3787
    3788
    3789
    3790
    3791
    3792
    3793
    3794
    3795
    3796
    3797
    3798
    3799
    3800
    3801
    3802
    3803
    3804
    3805
    3806
    3807
    3808
    3809
    3810
    3811
    3812
    3813
    3814
    3815
    3816
    3817
    3818
    3819
    3820
    3821
    3822
    3823
    3824
    3825
    3826
    3827
    3828
    3829
    3830
    3831
    3832
    3833
    3834
    3835
    3836
    3837
    3838
    3839
    3840
    3841
    3842
    3843
    3844
    3845
    3846
    3847
    3848
    3849
    3850
    3851
    3852
    3853
    3854
    3855
    3856
    3857
    3858
    3859
    3860
    3861
    3862
    3863
    3864
    3865
    3866
    3867
    3868
    3869
    3870
    3871
    3872
    3873
    3874
    3875
    3876
    3877
    3878
    3879
    3880
    3881
    3882
    3883
    3884
    3885
    3886
    3887
    3888
    3889
    3890
    3891
    3892
    3893
    3894
    3895
    3896
    3897
    3898
    3899
    3900
    3901
    3902
    3903
    3904
    3905
    3906
    3907
    3908
    3909
    3910
    3911
    3912
    3913
    3914
    3915
    3916
    3917
    3918
    3919
    3920
    3921
    3922
    3923
    3924
    3925
    3926
    3927
    3928
    3929
    3930
    3931
    3932
    3933
    3934
    3935
    3936
    3937
    3938
    3939
    3940
    3941
    3942
    3943
    3944
    3945
    3946
    3947
    3948
    3949
    3950
    3951
    3952
    3953
    3954
    3955
    3956
    3957
    3958
    3959
    3960
    3961
    3962
    3963
    3964
    3965
    3966
    3967
    3968
    3969
    3970
    3971
    3972
    3973
    3974
    3975
    3976
    3977
    3978
    3979
    3980
    3981
    3982
    3983
    3984
    3985
    3986
    3987
    3988
    3989
    3990
    3991
    3992
    3993
    3994
    3995
    3996
    3997
    3998
    3999
    4000
    4001
    4002
    4003
    4004
    4005
    4006
    4007
    4008
    4009
    4010
    4011
    4012
    4013
    4014
    4015
    4016
    4017
    4018
    4019
    4020
    4021
    4022
    4023
    4024
    4025
    4026
    4027
    4028
    4029
    4030
    4031
    4032
    4033
    4034
    4035
    4036
    4037
    4038
    4039
    4040
    4041
    4042
    4043
    4044
    4045
    4046
    4047
    4048
    4049
    4050
    4051
    4052
    4053
    4054
    4055
    4056
    4057
    4058
    4059
    4060
    4061
    4062
    4063
    4064
    4065
    4066
    4067
    4068
    4069
    4070
    4071
    4072
    4073
    4074
    4075
    4076
    4077
    4078
    4079
    4080
    4081
    4082
    4083
    4084
    4085
    4086
    4087
    4088
    4089
    4090
    4091
    4092
    4093
    4094
    4095
    4096
    4097
    4098
    4099
    4100
    4101
    4102
    4103
    4104
    4105
    4106
    4107
    4108
    4109
    4110
    4111
    4112
    4113
    4114
    4115
    4116
    4117
    4118
    4119
    4120
    4121
    4122
    4123
    4124
    4125
    4126
    4127
    4128
    4129
    4130
    4131
    4132
    4133
    4134
    4135
    4136
    4137
    4138
    4139
    4140
    4141
    4142
    4143
    4144
    4145
    4146
    4147
    4148
    4149
    4150
    4151
    4152
    4153
    4154
    4155
    4156
    4157
    4158
    4159
    4160
    4161
    4162
    4163
    4164
    4165
    4166
    4167
    4168
    4169
    4170
    4171
    4172
    4173
    4174
    4175
    4176
    4177
    4178
    4179
    4180
    4181
    4182
    4183
    4184
    4185
    4186
    4187
    4188
    4189
    4190
    4191
    4192
    4193
    4194
    4195
    4196
    4197
    4198
    4199
    4200
    4201
    4202
    4203
    4204
    4205
    4206
    4207
    4208
    4209
    4210
    4211
    4212
    4213
    4214
    4215
    4216
    4217
    4218
    4219
    4220
    4221
    4222
    4223
    4224
    4225
    4226
    4227
    4228
    4229
    4230
    4231
    4232
    4233
    4234
    4235
    4236
    4237
    4238
    4239
    4240
    4241
    4242
    4243
    4244
    4245
    4246
    4247
    4248
    4249
    4250
    4251
    4252
    4253
    4254
    4255
    4256
    4257
    4258
    4259
    4260
    4261
    4262
    4263
    4264
    4265
    4266
    4267
    4268
    4269
    4270
    4271
    4272
    4273
    4274
    4275
    4276
    4277
    4278
    4279
    4280
    4281
    4282
    4283
    4284
    4285
    4286
    4287
    4288
    4289
    4290
    4291
    4292
    4293
    4294
    4295
    4296
    4297
    4298
    4299
    4300
    4301
    4302
    4303
    4304
    4305
    4306
    4307
    4308
    4309
    4310
    4311
    4312
    4313
    4314
    4315
    4316
    4317
    4318
    4319
    4320
    4321
    4322
    4323
    4324
    4325
    4326
    4327
    4328
    4329
    4330
    4331
    4332
    4333
    4334
    4335
    4336
    4337
    4338
    4339
    4340
    4341
    4342
    4343
    4344
    4345
    4346
    4347
    4348
    4349
    4350
    4351
    4352
    4353
    4354
    4355
    4356
    4357
    4358
    4359
    4360
    4361
    4362
    4363
    4364
    4365
    4366
    4367
    4368
    4369
    4370
    4371
    4372
    4373
    4374
    4375
    4376
    4377
    4378
    4379
    4380
    4381
    4382
    4383
    4384
    4385
    4386
    4387
    4388
    4389
    4390
    4391
    4392
    4393
    4394
    4395
    4396
    4397
    4398
    4399
    4400
    4401
    4402
    4403
    4404
    4405
    4406
    4407
    4408
    4409
    4410
    4411
    4412
    4413
    4414
    4415
    4416
    4417
    4418
    4419
    4420
    4421
    4422
    4423
    4424
    4425
    4426
    4427
    4428
    4429
    4430
    4431
    4432
    4433
    4434
    4435
    4436
    4437
    4438
    4439
    4440
    4441
    4442
    4443
    4444
    4445
    4446
    4447
    4448
    4449
    4450
    4451
    4452
    4453
    4454
    4455
    4456
    4457
    4458
    4459
    4460
    4461
    4462
    4463
    4464
    4465
    4466
    4467
    4468
    4469
    4470
    4471
    4472
    4473
    4474
    4475
    4476
    4477
    4478
    4479
    4480
    4481
    4482
    4483
    4484
    4485
    4486
    4487
    4488
    4489
    4490
    4491
    4492
    4493
    4494
    4495
    4496
    4497
    4498
    4499
    4500
    4501
    4502
    4503
    4504
    4505
    4506
    4507
    4508
    4509
    4510
    4511
    4512
    4513
    4514
    4515
    4516
    4517
    4518
    4519
    4520
    4521
    4522
    4523
    4524
    4525
    4526
    4527
    4528
    4529
    4530
    4531
    4532
    4533
    4534
    4535
    4536
    4537
    4538
    4539
    4540
    4541
    4542
    4543
    4544
    4545
    4546
    4547
    4548
    4549
    4550
    4551
    4552
    4553
    4554
    4555
    4556
    4557
    4558
    4559
    4560
    4561
    4562
    4563
    4564
    4565
    4566
    4567
    4568
    4569
    4570
    4571
    4572
    4573
    4574
    4575
    4576
    4577
    4578
    4579
    4580
    4581
    4582
    4583
    4584
    4585
    4586
    4587
    4588
    4589
    4590
    4591
    4592
    4593
    4594
    4595
    4596
    4597
    4598
    4599
    4600
    4601
    4602
    4603
    4604
    4605
    4606
    4607
    4608
    4609
    4610
    4611
    4612
    4613
    4614
    4615
    4616
    4617
    4618
    4619
    4620
    4621
    4622
    4623
    4624
    4625
    4626
    4627
    4628
    4629
    4630
    4631
    4632
    4633
    4634
    4635
    4636
    4637
    4638
    4639
    4640
    4641
    4642
    4643
    4644
    4645
    4646
    4647
    4648
    4649
    4650
    4651
    4652
    4653
    4654
    4655
    4656
    4657
    4658
    4659
    4660
    4661
    4662
    4663
    4664
    4665
    4666
    4667
    4668
    4669
    4670
    4671
    4672
    4673
    4674
    4675
    4676
    4677
    4678
    4679
    4680
    4681
    4682
    4683
    4684
    4685
    4686
    4687
    4688
    4689
    4690
    4691
    4692
    4693
    4694
    4695
    4696
    4697
    4698
    4699
    4700
    4701
    4702
    4703
    4704
    4705
    4706
    4707
    4708
    4709
    4710
    4711
    4712
    4713
    4714
    4715
    4716
    4717
    4718
    4719
    4720
    4721
    4722
    4723
    4724
    4725
    4726
    4727
    4728
    4729
    4730
    4731
    4732
    4733
    4734
    4735
    4736
    4737
    4738
    4739
    4740
    4741
    4742
    4743
    4744
    4745
    4746
    4747
    4748
    4749
    4750
    4751
    4752
    4753
    4754
    4755
    4756
    4757
    4758
    4759
    4760
    4761
    4762
    4763
    4764
    4765
    4766
    4767
    4768
    4769
    4770
    4771
    4772
    4773
    4774
    4775
    4776
    4777
    4778
    4779
    4780
    4781
    4782
    4783
    4784
    4785
    4786
    4787
    4788
    4789
    4790
    4791
    4792
    4793
    4794
    4795
    4796
    4797
    4798
    4799
    4800
    4801
    4802
    4803
    4804
    4805
    4806
    4807
    4808
    4809
    4810
    4811
    4812
    4813
    4814
    4815
    4816
    4817
    4818
    4819
    4820
    4821
    4822
    4823
    4824
    4825
    4826
    4827
    4828
    4829
    4830
    4831
    4832
    4833
    4834
    4835
    4836
    4837
    4838
    4839
    4840
    4841
    4842
    4843
    4844
    4845
    4846
    4847
    4848
    4849
    4850
    4851
    4852
    4853
    4854
    4855
    4856
    4857
    4858
    4859
    4860
    4861
    4862
    4863
    4864
    4865
    4866
    4867
    4868
    4869
    4870
    4871
    4872
    4873
    4874
    4875
    4876
    4877
    4878
    4879
    4880
    4881
    4882
    4883
    4884
    4885
    4886
    4887
    4888
    4889
    4890
    4891
    4892
    4893
    4894
    4895
    4896
    4897
    4898
    4899
    4900
    4901
    4902
    4903
    4904
    4905
    4906
    4907
    4908
    4909
    4910
    4911
    4912
    4913
    4914
    4915
    4916
    4917
    4918
    4919
    4920
    4921
    4922
    4923
    4924
    4925
    4926
    4927
    4928
    4929
    4930
    4931
    4932
    4933
    4934
    4935
    4936
    4937
    4938
    4939
    4940
    4941
    4942
    4943
    4944
    4945
    4946
    4947
    4948
    4949
    4950
    4951
    4952
    4953
    4954
    4955
    4956
    4957
    4958
    4959
    4960
    4961
    4962
    4963
    4964
    4965
    4966
    4967
    4968
    4969
    4970
    4971
    4972
    4973
    4974
    4975
    4976
    4977
    4978
    4979
    4980
    4981
    4982
    4983
    4984
    4985
    4986
    4987
    4988
    4989
    4990
    4991
    4992
    4993
    4994
    4995
    4996
    4997
    4998
    4999
    5000
    5001
    5002
    5003
    5004
    5005
    5006
    5007
    5008
    5009
    5010
    5011
    5012
    5013
    5014
    5015
    5016
    5017
    5018
    5019
    5020
    5021
    5022
    5023
    5024
    5025
    5026
    5027
    5028
    5029
    5030
    5031
    5032
    5033
    5034
    5035
    5036
    5037
    5038
    5039
    5040
    5041
    5042
    5043
    5044
    5045
    5046
    5047
    5048
    5049
    5050
    5051
    5052
    5053
    5054
    5055
    5056
    5057
    5058
    5059
    5060
    5061
    5062
    5063
    5064
    5065
    5066
    5067
    5068
    5069
    5070
    5071
    5072
    5073
    5074
    5075
    5076
    5077
    5078
    5079
    5080
    5081
    5082
    5083
    5084
    5085
    5086
    5087
    5088
    5089
    5090
    5091
    5092
    5093
    5094
    5095
    5096
    5097
    5098
    5099
    5100
    5101
    5102
    5103
    5104
    5105
    5106
    5107
    5108
    5109
    5110
    5111
    5112
    5113
    5114
    5115
    5116
    5117
    5118
    5119
    5120
    5121
    5122
    5123
    5124
    5125
    5126
    5127
    5128
    5129
    5130
    5131
    5132
    5133
    5134
    5135
    5136
    5137
    5138
    5139
    5140
    5141
    5142
    5143
    5144
    5145
    5146
    5147
    5148
    5149
    5150
    5151
    5152
    5153
    5154
    5155
    5156
    5157
    5158
    5159
    5160
    5161
    5162
    5163
    5164
    5165
    5166
    5167
    5168
    5169
    5170
    5171
    5172
    5173
    5174
    5175
    5176
    5177
    5178
    5179
    5180
    5181
    5182
    5183
    5184
    5185
    5186
    5187
    5188
    5189
    5190
    5191
    5192
    5193
    5194
    5195
    5196
    5197
    5198
    5199
    5200
    5201
    5202
    5203
    5204
    5205
    5206
    5207
    5208
    5209
    5210
    5211
    5212
    5213
    5214
    5215
    5216
    5217
    5218
    5219
    5220
    5221
    5222
    5223
    5224
    5225
    5226
    5227
    5228
    5229
    5230
    5231
    5232
    5233
    5234
    5235
    5236
    5237
    5238
    5239
    5240
    5241
    5242
    5243
    5244
    5245
    5246
    5247
    5248
    5249
    5250
    5251
    5252
    5253
    5254
    5255
    5256
    5257
    5258
    5259
    5260
    5261
    5262
    5263
    5264
    5265
    5266
    5267
    5268
    5269
    5270
    5271
    5272
    5273
    5274
    5275
    5276
    5277
    5278
    5279
    5280
    5281
    5282
    5283
    5284
    5285
    5286
    5287
    5288
    5289
    5290
    5291
    5292
    5293
    5294
    5295
    5296
    5297
    5298
    5299
    5300
    5301
    5302
    5303
    5304
    5305
    5306
    5307
    5308
    5309
    5310
    5311
    5312
    5313
    5314
    5315
    5316
    5317
    5318
    5319
    5320
    5321
    5322
    5323
    5324
    5325
    5326
    5327
    5328
    5329
    5330
    5331
    5332
    5333
    5334
    5335
    5336
    5337
    5338
    5339
    5340
    5341
    5342
    5343
    5344
    5345
    5346
    5347
    5348
    5349
    5350
    5351
    5352
    5353
    5354
    5355
    5356
    5357
    5358
    5359
    5360
    5361
    5362
    5363
    5364
    5365
    5366
    5367
    5368
    5369
    5370
    5371
    5372
    5373
    5374
    5375
    5376
    5377
    5378
    5379
    5380
    5381
    5382
    5383
    5384
    5385
    5386
    5387
    5388
    5389
    5390
    5391
    5392
    5393
    5394
    5395
    5396
    5397
    5398
    5399
    5400
    5401
    5402
    5403
    5404
    5405
    5406
    5407
    5408
    5409
    5410
    5411
    5412
    5413
    5414
    5415
    5416
    5417
    5418
    5419
    5420
    5421
    5422
    5423
    5424
    5425
    5426
    5427
    5428
    5429
    5430
    5431
    5432
    5433
    5434
    5435
    5436
    5437
    5438
    5439
    5440
    5441
    5442
    5443
    5444
    5445
    5446
    5447
    5448
    5449
    5450
    5451
    5452
    5453
    5454
    5455
    5456
    5457
    5458
    5459
    5460
    5461
    5462
    5463
    5464
    5465
    5466
    5467
    5468
    5469
    5470
    5471
    5472
    5473
    5474
    5475
    5476
    5477
    5478
    5479
    5480
    5481
    5482
    5483
    5484
    5485
    5486
    5487
    5488
    5489
    5490
    5491
    5492
    5493
    5494
    5495
    5496
    5497
    5498
    5499
    5500
    5501
    5502
    5503
    5504
    5505
    5506
    5507
    5508
    5509
    5510
    5511
    5512
    5513
    5514
    5515
    5516
    5517
    5518
    5519
    5520
    5521
    5522
    5523
    5524
    5525
    5526
    5527
    5528
    5529
    5530
    5531
    5532
    5533
    5534
    5535
    5536
    5537
    5538
    5539
    5540
    5541
    5542
    5543
    5544
    5545
    5546
    5547
    5548
    5549
    5550
    5551
    5552
    5553
    5554
    5555
    5556
    5557
    5558
    5559
    5560
    5561
    5562
    5563
    5564
    5565
    5566
    5567
    5568
    5569
    5570
    5571
    5572
    5573
    5574
    5575
    5576
    5577
    5578
    5579
    5580
    5581
    5582
    5583
    5584
    5585
    5586
    5587
    5588
    5589
    5590
    5591
    5592
    5593
    5594
    5595
    5596
    5597
    5598
    5599
    5600
    5601
    5602
    5603
    5604
    5605
    5606
    5607
    5608
    5609
    5610
    5611
    5612
    5613
    5614
    5615
    5616
    5617
    5618
    5619
    5620
    5621
    5622
    5623
    5624
    5625
    5626
    5627
    5628
    5629
    5630
    5631
    5632
    5633
    5634
    5635
    5636
    5637
    5638
    5639
    5640
    5641
    5642
    5643
    5644
    5645
    5646
    5647
    5648
    5649
    5650
    5651
    5652
    5653
    5654
    5655
    5656
    5657
    5658
    5659
    5660
    5661
    5662
    5663
    5664
    5665
    5666
    5667
    5668
    5669
    5670
    5671
    5672
    5673
    5674
    5675
    5676
    5677
    5678
    5679
    5680
    5681
    5682
    5683
    5684
    5685
    5686
    5687
    5688
    5689
    5690
    5691
    5692
    5693
    5694
    5695
    5696
    5697
    5698
    5699
    5700
    5701
    5702
    5703
    5704
    5705
    5706
    5707
    5708
    5709
    5710
    5711
    5712
    5713
    5714
    5715
    5716
    5717
    5718
    5719
    5720
    5721
    5722
    5723
    5724
    5725
    5726
    5727
    5728
    5729
    5730
    5731
    5732
    5733
    5734
    5735
    5736
    5737
    5738
    5739
    5740
    5741
    5742
    5743
    5744
    5745
    5746
    5747
    5748
    5749
    5750
    5751
    5752
    5753
    5754
    5755
    5756
    5757
    5758
    5759
    5760
    5761
    5762
    5763
    5764
    5765
    5766
    5767
    5768
    5769
    5770
    5771
    5772
    5773
    5774
    5775
    5776
    5777
    5778
    5779
    5780
    5781
    5782
    5783
    5784
    5785
    5786
    5787
    5788
    5789
    5790
    5791
    5792
    5793
    5794
    5795
    5796
    5797
    5798
    5799
    5800
    5801
    5802
    5803
    5804
    5805
    5806
    5807
    5808
    5809
    5810
    5811
    5812
    5813
    5814
    5815
    5816
    5817
    5818
    5819
    5820
    5821
    5822
    5823
    5824
    5825
    5826
    5827
    5828
    5829
    5830
    5831
    5832
    5833
    5834
    5835
    5836
    5837
    5838
    5839
    5840
    5841
    5842
    5843
    5844
    5845
    5846
    5847
    5848
    5849
    5850
    5851
    5852
    5853
    5854
    5855
    5856
    5857
    5858
    5859
    5860
    5861
    5862
    5863
    5864
    5865
    5866
    5867
    5868
    5869
    5870
    5871
    5872
    5873
    5874
    5875
    5876
    5877
    5878
    5879
    5880
    5881
    5882
    5883
    5884
    5885
    5886
    5887
    5888
    5889
    5890
    5891
    5892
    5893
    5894
    5895
    5896
    5897
    5898
    5899
    5900
    5901
    5902
    5903
    5904
    5905
    5906
    5907
    5908
    5909
    5910
    5911
    5912
    5913
    5914
    5915
    5916
    5917
    5918
    5919
    5920
    5921
    5922
    5923
    5924
    5925
    5926
    5927
    5928
    5929
    5930
    5931
    5932
    5933
    5934
    5935
    5936
    5937
    5938
    5939
    5940
    5941
    5942
    5943
    5944
    5945
    5946
    5947
    5948
    5949
    5950
    5951
    5952
    5953
    5954
    5955
    5956
    5957
    5958
    5959
    5960
    5961
    5962
    5963
    5964
    5965
    5966
    5967
    5968
    5969
    5970
    5971
    5972
    5973
    5974
    5975
    5976
    5977
    5978
    5979
    5980
    5981
    5982
    5983
    5984
    5985
    5986
    5987
    5988
    5989
    5990
    5991
    5992
    5993
    5994
    5995
    5996
    5997
    5998
    5999
    6000
    6001
    6002
    6003
    6004
    6005
    6006
    6007
    6008
    6009
    6010
    6011
    6012
    6013
    6014
    6015
    6016
    6017
    6018
    6019
    6020
    6021
    6022
    6023
    6024
    6025
    6026
    6027
    6028
    6029
    6030
    6031
    6032
    6033
    6034
    6035
    6036
    6037
    6038
    6039
    6040
    6041
    6042
    6043
    6044
    6045
    6046
    6047
    6048
    6049
    6050
    6051
    6052
    6053
    6054
    6055
    6056
    6057
    6058
    6059
    6060
    6061
    6062
    6063
    6064
    6065
    6066
    6067
    6068
    6069
    6070
    6071
    6072
    6073
    6074
    6075
    6076
    6077
    6078
    6079
    6080
    6081
    6082
    6083
    6084
    6085
    6086
    6087
    6088
    6089
    6090
    6091
    6092
    6093
    6094
    6095
    6096
    6097
    6098
    6099
    6100
    6101
    6102
    6103
    6104
    6105
    6106
    6107
    6108
    6109
    6110
    6111
    6112
    6113
    6114
    6115
    6116
    6117
    6118
    6119
    6120
    6121
    6122
    6123
    6124
    6125
    6126
    6127
    6128
    6129
    6130
    6131
    6132
    6133
    6134
    6135
    6136
    6137
    6138
    6139
    6140
    6141
    6142
    6143
    6144
    6145
    6146
    6147
    6148
    6149
    6150
    6151
    6152
    6153
    6154
    6155
    6156
    6157
    6158
    6159
    6160
    6161
    6162
    6163
    6164
    6165
    6166
    6167
    6168
    6169
    6170
    6171
    6172
    6173
    6174
    6175
    6176
    6177
    6178
    6179
    6180
    6181
    6182
    6183
    6184
    6185
    6186
    6187
    6188
    6189
    6190
    6191
    6192
    6193
    6194
    6195
    6196
    6197
    6198
    6199
    6200
    6201
    6202
    6203
    6204
    6205
    6206
    6207
    6208
    6209
    6210
    6211
    6212
    6213
    6214
    6215
    6216
    6217
    6218
    6219
    6220
    6221
    6222
    6223
    6224
    6225
    6226
    6227
    6228
    6229
    6230
    6231
    6232
    6233
    6234
    6235
    6236
    6237
    6238
    6239
    6240
    6241
    6242
    6243
    6244
    6245
    6246
    6247
    6248
    6249
    6250
    6251
    6252
    6253
    6254
    6255
    6256
    6257
    6258
    6259
    6260
    6261
    6262
    6263
    6264
    6265
    6266
    6267
    6268
    6269
    6270
    6271
    6272
    6273
    6274
    6275
    6276
    6277
    6278
    6279
    6280
    6281
    6282
    6283
    6284
    6285
    6286
    6287
    6288
    6289
    6290
    6291
    6292
    6293
    6294
    6295
    6296
    6297
    6298
    6299
    6300
    6301
    6302
    6303
    6304
    6305
    6306
    6307
    6308
    6309
    6310
    6311
    6312
    6313
    6314
    6315
    6316
    6317
    6318
    6319
    6320
    6321
    6322
    6323
    6324
    6325
    6326
    6327
    6328
    6329
    6330
    6331
    6332
    6333
    6334
    6335
    6336
    6337
    6338
    6339
    6340
    6341
    6342
    6343
    6344
    6345
    6346
    6347
    6348
    6349
    6350
    6351
    6352
    6353
    6354
    6355
    6356
    6357
    6358
    6359
    6360
    6361
    6362
    6363
    6364
    6365
    6366
    6367
    6368
    6369
    6370
    6371
    6372
    6373
    6374
    6375
    6376
    6377
    6378
    6379
    6380
    6381
    6382
    6383
    6384
    6385
    6386
    6387
    6388
    6389
    6390
    6391
    6392
    6393
    6394
    6395
    6396
    6397
    6398
    6399
    6400
    6401
    6402
    6403
    6404
    6405
    6406
    6407
    6408
    6409
    6410
    6411
    6412
    6413
    6414
    6415
    6416
    6417
    6418
    6419
    6420
    6421
    6422
    6423
    6424
    6425
    6426
    6427
    6428
    6429
    6430
    6431
    6432
    6433
    6434
    6435
    6436
    6437
    6438
    6439
    6440
    6441
    6442
    6443
    6444
    6445
    6446
    6447
    6448
    6449
    6450
    6451
    6452
    6453
    6454
    6455
    6456
    6457
    6458
    6459
    6460
    6461
    6462
    6463
    6464
    6465
    6466
    6467
    6468
    6469
    6470
    6471
    6472
    6473
    6474
    6475
    6476
    6477
    6478
    6479
    6480
    6481
    6482
    6483
    6484
    6485
    6486
    6487
    6488
    6489
    6490
    6491
    6492
    6493
    6494
    6495
    6496
    6497
    6498
    6499
    6500
    6501
    6502
    6503
    6504
    6505
    6506
    6507
    6508
    6509
    6510
    6511
    6512
    6513
    6514
    6515
    6516
    6517
    6518
    6519
    6520
    6521
    6522
    6523
    6524
    6525
    6526
    6527
    6528
    6529
    6530
    6531
    6532
    6533
    6534
    6535
    6536
    6537
    6538
    6539
    6540
    6541
    6542
    6543
    6544
    6545
    6546
    6547
    6548
    6549
    6550
    6551
    6552
    6553
    6554
    6555
    6556
    6557
    6558
    6559
    6560
    6561
    6562
    6563
    6564
    6565
    6566
    6567
    6568
    6569
    6570
    6571
    6572
    6573
    6574
    6575
    6576
    6577
    6578
    6579
    6580
    6581
    6582
    6583
    6584
    6585
    6586
    6587
    6588
    6589
    6590
    6591
    6592
    6593
    6594
    6595
    6596
    6597
    6598
    6599
    6600
    6601
    6602
    6603
    6604
    6605
    6606
    6607
    6608
    6609
    6610
    6611
    6612
    6613
    6614
    6615
    6616
    6617
    6618
    6619
    6620
    6621
    6622
    6623
    6624
    6625
    6626
    6627
    6628
    6629
    6630
    6631
    6632
    6633
    6634
    6635
    6636
    6637
    6638
    6639
    6640
    6641
    6642
    6643
    6644
    6645
    6646
    6647
    6648
    6649
    6650
    6651
    6652
    6653
    6654
    6655
    6656
    6657
    6658
    6659
    6660
    6661
    6662
    6663
    6664
    6665
    6666
    6667
    6668
    6669
    6670
    6671
    6672
    6673
    6674
    6675
    6676
    6677
    6678
    6679
    6680
    6681
    6682
    6683
    6684
    6685
    6686
    6687
    6688
    6689
    6690
    6691
    6692
    6693
    6694
    6695
    6696
    6697
    6698
    6699
    6700
    6701
    6702
    6703
    6704
    6705
    6706
    6707
    6708
    6709
    6710
    6711
    6712
    6713
    6714
    6715
    6716
    6717
    6718
    6719
    6720
    6721
    6722
    6723
    6724
    6725
    6726
    6727
    6728
    6729
    6730
    6731
    6732
    6733
    6734
    6735
    6736
    6737
    6738
    6739
    6740
    6741
    6742
    6743
    6744
    6745
    6746
    6747
    6748
    6749
    6750
    6751
    6752
    6753
    6754
    6755
    6756
    6757
    6758
    6759
    6760
    6761
    6762
    6763
    6764
    6765
    6766
    6767
    6768
    6769
    6770
    6771
    6772
    6773
    6774
    6775
    6776
    6777
    6778
    6779
    6780
    6781
    6782
    6783
    6784
    6785
    6786
    6787
    6788
    6789
    6790
    6791
    6792
    6793
    6794
    6795
    6796
    6797
    6798
    6799
    6800
    6801
    6802
    6803
    6804
    6805
    6806
    6807
    6808
    6809
    6810
    6811
    6812
    6813
    6814
    6815
    6816
    6817
    6818
    6819
    6820
    6821
    6822
    6823
    6824
    6825
    6826
    6827
    6828
    6829
    6830
    6831
    6832
    6833
    6834
    6835
    6836
    6837
    6838
    6839
    6840
    6841
    6842
    6843
    6844
    6845
    6846
    6847
    6848
    6849
    6850
    6851
    6852
    6853
    6854
    6855
    6856
    6857
    6858
    6859
    6860
    6861
    6862
    6863
    6864
    6865
    6866
    6867
    6868
    6869
    6870
    6871
    6872
    6873
    6874
    6875
    6876
    6877
    6878
    6879
    6880
    6881
    6882
    6883
    6884
    6885
    6886
    6887
    6888
    6889
    6890
    6891
    6892
    6893
    6894
    6895
    6896
    6897
    6898
    6899
    6900
    6901
    6902
    6903
    6904
    6905
    6906
    6907
    6908
    6909
    6910
    6911
    6912
    6913
    6914
    6915
    6916
    6917
    6918
    6919
    6920
    6921
    6922
    6923
    6924
    6925
    6926
    6927
    6928
    6929
    6930
    6931
    6932
    6933
    6934
    6935
    6936
    6937
    6938
    6939
    6940
    6941
    6942
    6943
    6944
    6945
    6946
    6947
    6948
    6949
    6950
    6951
    6952
    6953
    6954
    6955
    6956
    6957
    6958
    6959
    6960
    6961
    6962
    6963
    6964
    6965
    6966
    6967
    6968
    6969
    6970
    6971
    6972
    6973
    6974
    6975
    6976
    6977
    6978
    6979
    6980
    6981
    6982
    6983
    6984
    6985
    6986
    6987
    6988
    6989
    6990
    6991
    6992
    6993
    6994
    6995
    6996
    6997
    6998
    6999
    7000
    7001
    7002
    7003
    7004
    7005
    7006
    7007
    7008
    7009
    7010
    7011
    7012
    7013
    7014
    7015
    7016
    7017
    7018
    7019
    7020
    7021
    7022
    7023
    7024
    7025
    7026
    7027
    7028
    7029
    7030
    7031
    7032
    7033
    7034
    7035
    7036
    7037
    7038
    7039
    7040
    7041
    7042
    7043
    7044
    7045
    7046
    7047
    7048
    7049
    7050
    7051
    7052
    7053
    7054
    7055
    7056
    7057
    7058
    7059
    7060
    7061
    7062
    7063
    7064
    7065
    7066
    7067
    7068
    7069
    7070
    7071
    7072
    7073
    7074
    7075
    7076
    7077
    7078
    7079
    7080
    7081
    7082
    7083
    7084
    7085
    7086
    7087
    7088
    7089
    7090
    7091
    7092
    7093
    7094
    7095
    7096
    7097
    7098
    7099
    7100
    7101
    7102
    7103
    7104
    7105
    7106
    7107
    7108
    7109
    7110
    7111
    7112
    7113
    7114
    7115
    7116
    7117
    7118
    7119
    7120
    7121
    7122
    7123
    7124
    7125
    7126
    7127
    7128
    7129
    7130
    7131
    7132
    7133
    7134
    7135
    7136
    7137
    7138
    7139
    7140
    7141
    7142
    7143
    7144
    7145
    7146
    7147
    7148
    7149
    7150
    7151
    7152
    7153
    7154
    7155
    7156
    7157
    7158
    7159
    7160
    7161
    7162
    7163
    7164
    7165
    7166
    7167
    7168
    7169
    7170
    7171
    7172
    7173
    7174
    7175
    7176
    7177
    7178
    7179
    7180
    7181
    7182
    7183
    7184
    7185
    7186
    7187
    7188
    7189
    7190
    7191
    7192
    7193
    7194
    7195
    7196
    7197
    7198
    7199
    7200
    7201
    7202
    7203
    7204
    7205
    7206
    7207
    7208
    7209
    7210
    7211
    7212
    7213
    7214
    7215
    7216
    7217
    7218
    7219
    7220
    7221
    7222
    7223
    7224
    7225
    7226
    7227
    7228
    7229
    7230
    7231
    7232
    7233
    7234
    7235
    7236
    7237
    7238
    7239
    7240
    7241
    7242
    7243
    7244
    7245
    7246
    7247
    7248
    7249
    7250
    7251
    7252
    7253
    7254
    7255
    7256
    7257
    7258
    7259
    7260
    7261
    7262
    7263
    7264
    7265
    7266
    7267
    7268
    7269
    7270
    7271
    7272
    7273
    7274
    7275
    7276
    7277
    7278
    7279
    7280
    7281
    7282
    7283
    7284
    7285
    7286
    7287
    7288
    7289
    7290
    7291
    7292
    7293
    7294
    7295
    7296
    7297
    7298
    7299
    7300
    7301
    7302
    7303
    7304
    7305
    7306
    7307
    7308
    7309
    7310
    7311
    7312
    7313
    7314
    7315
    7316
    7317
    7318
    7319
    7320
    7321
    7322
    7323
    7324
    7325
    7326
    7327
    7328
    7329
    7330
    7331
    7332
    7333
    7334
    7335
    7336
    7337
    7338
    7339
    7340
    7341
    7342
    7343
    7344
    7345
    7346
    7347
    7348
    7349
    7350
    7351
    7352
    7353
    7354
    7355
    7356
    7357
    7358
    7359
    7360
    7361
    7362
    7363
    7364
    7365
    7366
    7367
    7368
    7369
    7370
    7371
    7372
    7373
    7374
    7375
    7376
    7377
    7378
    7379
    7380
    7381
    7382
    7383
    7384
    7385
    7386
    7387
    7388
    7389
    7390
    7391
    7392
    7393
    7394
    7395
    7396
    7397
    7398
    7399
    7400
    7401
    7402
    7403
    7404
    7405
    7406
    7407
    7408
    7409
    7410
    7411
    7412
    7413
    7414
    7415
    7416
    7417
    7418
    7419
    7420
    7421
    7422
    7423
    7424
    7425
    7426
    7427
    7428
    7429
    7430
    7431
    7432
    7433
    7434
    7435
    7436
    7437
    7438
    7439
    7440
    7441
    7442
    7443
    7444
    7445
    7446
    7447
    7448
    7449
    7450
    7451
    7452
    7453
    7454
    7455
    7456
    7457
    7458
    7459
    7460
    7461
    7462
    7463
    7464
    7465
    7466
    7467
    7468
    7469
    7470
    7471
    7472
    7473
    7474
    7475
    7476
    7477
    7478
    7479
    7480
    7481
    7482
    7483
    7484
    7485
    7486
    7487
    7488
    7489
    7490
    7491
    7492
    7493
    7494
    7495
    7496
    7497
    7498
    7499
    7500
    7501
    7502
    7503
    7504
    7505
    7506
    7507
    7508
    7509
    7510
    7511
    7512
    7513
    7514
    7515
    7516
    7517
    7518
    7519
    7520
    7521
    7522
    7523
    7524
    7525
    7526
    7527
    7528
    7529
    7530
    7531
    7532
    7533
    7534
    7535
    7536
    7537
    7538
    7539
    7540
    7541
    7542
    7543
    7544
    7545
    7546
    7547
    7548
    7549
    7550
    7551
    7552
    7553
    7554
    7555
    7556
    7557
    7558
    7559
    7560
    7561
    7562
    7563
    7564
    7565
    7566
    7567
    7568
    7569
    7570
    7571
    7572
    7573
    7574
    7575
    7576
    7577
    7578
    7579
    7580
    7581
    7582
    7583
    7584
    7585
    7586
    7587
    7588
    7589
    7590
    7591
    7592
    7593
    7594
    7595
    7596
    7597
    7598
    7599
    7600
    7601
    7602
    7603
    7604
    7605
    7606
    7607
    7608
    7609
    7610
    7611
    7612
    7613
    7614
    7615
    7616
    7617
    7618
    7619
    7620
    7621
    7622
    7623
    7624
    7625
    7626
    7627
    7628
    7629
    7630
    7631
    7632
    7633
    7634
    7635
    7636
    7637
    7638
    7639
    7640
    7641
    7642
    7643
    7644
    7645
    7646
    7647
    7648
    7649
    7650
    7651
    7652
    7653
    7654
    7655
    7656
    7657
    7658
    7659
    7660
    7661
    7662
    7663
    7664
    7665
    7666
    7667
    7668
    7669
    7670
    7671
    7672
    7673
    7674
    7675
    7676
    7677
    7678
    7679
    7680
    7681
    7682
    7683
    7684
    7685
    7686
    7687
    7688
    7689
    7690
    7691
    7692
    7693
    7694
    7695
    7696
    7697
    7698
    7699
    7700
    7701
    7702
    7703
    7704
    7705
    7706
    7707
    7708
    7709
    7710
    7711
    7712
    7713
    7714
    7715
    7716
    7717
    7718
    7719
    7720
    7721
    7722
    7723
    7724
    7725
    7726
    7727
    7728
    7729
    7730
    7731
    7732
    7733
    7734
    7735
    7736
    7737
    7738
    7739
    7740
    7741
    7742
    7743
    7744
    7745
    7746
    7747
    7748
    7749
    7750
    7751
    7752
    7753
    7754
    7755
    7756
    7757
    7758
    7759
    7760
    7761
    7762
    7763
    7764
    7765
    7766
    7767
    7768
    7769
    7770
    7771
    7772
    7773
    7774
    7775
    7776
    7777
    7778
    7779
    7780
    7781
    7782
    7783
    7784
    7785
    7786
    7787
    7788
    7789
    7790
    7791
    7792
    7793
    7794
    7795
    7796
    7797
    7798
    7799
    7800
    7801
    7802
    7803
    7804
    7805
    7806
    7807
    7808
    7809
    7810
    7811
    7812
    7813
    7814
    7815
    7816
    7817
    7818
    7819
    7820
    7821
    7822
    7823
    7824
    7825
    7826
    7827
    7828
    7829
    7830
    7831
    7832
    7833
    7834
    7835
    7836
    7837
    7838
    7839
    7840
    7841
    7842
    7843
    7844
    7845
    7846
    7847
    7848
    7849
    7850
    7851
    7852
    7853
    7854
    7855
    7856
    7857
    7858
    7859
    7860
    7861
    7862
    7863
    7864
    7865
    7866
    7867
    7868
    7869
    7870
    7871
    7872
    7873
    7874
    7875
    7876
    7877
    7878
    7879
    7880
    7881
    7882
    7883
    7884
    7885
    7886
    7887
    7888
    7889
    7890
    7891
    7892
    7893
    7894
    7895
    7896
    7897
    7898
    7899
    7900
    7901
    7902
    7903
    7904
    7905
    7906
    7907
    7908
    7909
    7910
    7911
    7912
    7913
    7914
    7915
    7916
    7917
    7918
    7919
    7920
    7921
    7922
    7923
    7924
    7925
    7926
    7927
    7928
    7929
    7930
    7931
    7932
    7933
    7934
    7935
    7936
    7937
    7938
    7939
    7940
    7941
    7942
    7943
    7944
    7945
    7946
    7947
    7948
    7949
    7950
    7951
    7952
    7953
    7954
    7955
    7956
    7957
    7958
    7959
    7960
    7961
    7962
    7963
    7964
    7965
    7966
    7967
    7968
    7969
    7970
    7971
    7972
    7973
    7974
    7975
    7976
    7977
    7978
    7979
    7980
    7981
    7982
    7983
    7984
    7985
    7986
    7987
    7988
    7989
    7990
    7991
    7992
    7993
    7994
    7995
    7996
    7997
    7998
    7999
    8000
    8001
    8002
    8003
    8004
    8005
    8006
    8007
    8008
    8009
    8010
    8011
    8012
    8013
    8014
    8015
    8016
    8017
    8018
    8019
    8020
    8021
    8022
    8023
    8024
    8025
    8026
    8027
    8028
    8029
    8030
    8031
    8032
    8033
    8034
    8035
    8036
    8037
    8038
    8039
    8040
    8041
    8042
    8043
    8044
    8045
    8046
    8047
    8048
    8049
    8050
    8051
    8052
    8053
    8054
    8055
    8056
    8057
    8058
    8059
    8060
    8061
    8062
    8063
    8064
    8065
    8066
    8067
    8068
    8069
    8070
    8071
    8072
    8073
    8074
    8075
    8076
    8077
    8078
    8079
    8080
    8081
    8082
    8083
    8084
    8085
    8086
    8087
    8088
    8089
    8090
    8091
    8092
    8093
    8094
    8095
    8096
    8097
    8098
    8099
    8100
    8101
    8102
    8103
    8104
    8105
    8106
    8107
    8108
    8109
    8110
    8111
    8112
    8113
    8114
    8115
    8116
    8117
    8118
    8119
    8120
    8121
    8122
    8123
    8124
    8125
    8126
    8127
    8128
    8129
    8130
    8131
    8132
    8133
    8134
    8135
    8136
    8137
    8138
    8139
    8140
    8141
    8142
    8143
    8144
    8145
    8146
    8147
    8148
    8149
    8150
    8151
    8152
    8153
    8154
    8155
    8156
    8157
    8158
    8159
    8160
    8161
    8162
    8163
    8164
    8165
    8166
    8167
    8168
    8169
    8170
    8171
    8172
    8173
    8174
    8175
    8176
    8177
    8178
    8179
    8180
    8181
    8182
    8183
    8184
    8185
    8186
    8187
    8188
    8189
    8190
    8191
    8192
    8193
    8194
    8195
    8196
    8197
    8198
    8199
    8200
    8201
    8202
    8203
    8204
    8205
    8206
    8207
    8208
    8209
    8210
    8211
    8212
    8213
    8214
    8215
    8216
    8217
    8218
    8219
    8220
    8221
    8222
    8223
    8224
    8225
    8226
    8227
    8228
    8229
    8230
    8231
    8232
    8233
    8234
    8235
    8236
    8237
    8238
    8239
    8240
    8241
    8242
    8243
    8244
    8245
    8246
    8247
    8248
    8249
    8250
    8251
    8252
    8253
    8254
    8255
    8256
    8257
    8258
    8259
    8260
    8261
    8262
    8263
    8264
    8265
    8266
    8267
    8268
    8269
    8270
    8271
    8272
    8273
    8274
    8275
    8276
    8277
    8278
    8279
    8280
    8281
    8282
    8283
    8284
    8285
    8286
    8287
    8288
    8289
    8290
    8291
    8292
    8293
    8294
    8295
    8296
    8297
    8298
    8299
    8300
    8301
    8302
    8303
    8304
    8305
    8306
    8307
    8308
    8309
    8310
    8311
    8312
    8313
    8314
    8315
    8316
    8317
    8318
    8319
    8320
    8321
    8322
    8323
    8324
    8325
    8326
    8327
    8328
    8329
    8330
    8331
    8332
    8333
    8334
    8335
    8336
    8337
    8338
    8339
    8340
    8341
    8342
    8343
    8344
    8345
    8346
    8347
    8348
    8349
    8350
    8351
    8352
    8353
    8354
    8355
    8356
    8357
    8358
    8359
    8360
    8361
    8362
    8363
    8364
    8365
    8366
    8367
    8368
    8369
    8370
    8371
    8372
    8373
    8374
    8375
    8376
    8377
    8378
    8379
    8380
    8381
    8382
    8383
    8384
    8385
    8386
    8387
    8388
    8389
    8390
    8391
    8392
    8393
    8394
    8395
    8396
    8397
    8398
    8399
    8400
    8401
    8402
    8403
    8404
    8405
    8406
    8407
    8408

    use crate::raw::{Allocator, Bucket, Global, RawDrain, RawIntoIter, RawIter, RawTable};
    use crate::TryReserveError;
    use core::borrow::Borrow;
    use core::fmt::{self, Debug};
    use core::hash::{BuildHasher, Hash};
    use core::iter::{FromIterator, FusedIterator};
    use core::marker::PhantomData;
    use core::mem;
    use core::ops::Index;

    /// Default hasher for `HashMap`.
    #[cfg(feature = "ahash")]
    pub type DefaultHashBuilder = ahash::RandomState;

    /// Dummy default hasher for `HashMap`.
    #[cfg(not(feature = "ahash"))]
    pub enum DefaultHashBuilder {}

    /// A hash map implemented with quadratic probing and SIMD lookup.
    ///
    /// The default hashing algorithm is currently [`AHash`], though this is
    /// subject to change at any point in the future. This hash function is very
    /// fast for all types of keys, but this algorithm will typically *not* protect
    /// against attacks such as HashDoS.
    ///
    /// The hashing algorithm can be replaced on a per-`HashMap` basis using the
    /// [`default`], [`with_hasher`], and [`with_capacity_and_hasher`] methods. Many
    /// alternative algorithms are available on crates.io, such as the [`fnv`] crate.
    ///
    /// It is required that the keys implement the [`Eq`] and [`Hash`] traits, although
    /// this can frequently be achieved by using `#[derive(PartialEq, Eq, Hash)]`.
    /// If you implement these yourself, it is important that the following
    /// property holds:
    ///
    /// ```text
    /// k1 == k2 -> hash(k1) == hash(k2)
    /// ```
    ///
    /// In other words, if two keys are equal, their hashes must be equal.
    ///
    /// It is a logic error for a key to be modified in such a way that the key's
    /// hash, as determined by the [`Hash`] trait, or its equality, as determined by
    /// the [`Eq`] trait, changes while it is in the map. This is normally only
    /// possible through [`Cell`], [`RefCell`], global state, I/O, or unsafe code.
    ///
    /// It is also a logic error for the [`Hash`] implementation of a key to panic.
    /// This is generally only possible if the trait is implemented manually. If a
    /// panic does occur then the contents of the `HashMap` may become corrupted and
    /// some items may be dropped from the table.
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// // Type inference lets us omit an explicit type signature (which
    /// // would be `HashMap<String, String>` in this example).
    /// let mut book_reviews = HashMap::new();
    ///
    /// // Review some books.
    /// book_reviews.insert(
    ///     "Adventures of Huckleberry Finn".to_string(),
    ///     "My favorite book.".to_string(),
    /// );
    /// book_reviews.insert(
    ///     "Grimms' Fairy Tales".to_string(),
    ///     "Masterpiece.".to_string(),
    /// );
    /// book_reviews.insert(
    ///     "Pride and Prejudice".to_string(),
    ///     "Very enjoyable.".to_string(),
    /// );
    /// book_reviews.insert(
    ///     "The Adventures of Sherlock Holmes".to_string(),
    ///     "Eye lyked it alot.".to_string(),
    /// );
    ///
    /// // Check for a specific one.
    /// // When collections store owned values (String), they can still be
    /// // queried using references (&str).
    /// if !book_reviews.contains_key("Les Misérables") {
    ///     println!("We've got {} reviews, but Les Misérables ain't one.",
    ///              book_reviews.len());
    /// }
    ///
    /// // oops, this review has a lot of spelling mistakes, let's delete it.
    /// book_reviews.remove("The Adventures of Sherlock Holmes");
    ///
    /// // Look up the values associated with some keys.
    /// let to_find = ["Pride and Prejudice", "Alice's Adventure in Wonderland"];
    /// for &book in &to_find {
    ///     match book_reviews.get(book) {
    ///         Some(review) => println!("{}: {}", book, review),
    ///         None => println!("{} is unreviewed.", book)
    ///     }
    /// }
    ///
    /// // Look up the value for a key (will panic if the key is not found).
    /// println!("Review for Jane: {}", book_reviews["Pride and Prejudice"]);
    ///
    /// // Iterate over everything.
    /// for (book, review) in &book_reviews {
    ///     println!("{}: \"{}\"", book, review);
    /// }
    /// ```
    ///
    /// `HashMap` also implements an [`Entry API`](#method.entry), which allows
    /// for more complex methods of getting, setting, updating and removing keys and
    /// their values:
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// // type inference lets us omit an explicit type signature (which
    /// // would be `HashMap<&str, u8>` in this example).
    /// let mut player_stats = HashMap::new();
    ///
    /// fn random_stat_buff() -> u8 {
    ///     // could actually return some random value here - let's just return
    ///     // some fixed value for now
    ///     42
    /// }
    ///
    /// // insert a key only if it doesn't already exist
    /// player_stats.entry("health").or_insert(100);
    ///
    /// // insert a key using a function that provides a new value only if it
    /// // doesn't already exist
    /// player_stats.entry("defence").or_insert_with(random_stat_buff);
    ///
    /// // update a key, guarding against the key possibly not being set
    /// let stat = player_stats.entry("attack").or_insert(100);
    /// *stat += random_stat_buff();
    /// ```
    ///
    /// The easiest way to use `HashMap` with a custom key type is to derive [`Eq`] and [`Hash`].
    /// We must also derive [`PartialEq`].
    ///
    /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
    /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
    /// [`PartialEq`]: https://doc.rust-lang.org/std/cmp/trait.PartialEq.html
    /// [`RefCell`]: https://doc.rust-lang.org/std/cell/struct.RefCell.html
    /// [`Cell`]: https://doc.rust-lang.org/std/cell/struct.Cell.html
    /// [`default`]: #method.default
    /// [`with_hasher`]: #method.with_hasher
    /// [`with_capacity_and_hasher`]: #method.with_capacity_and_hasher
    /// [`fnv`]: https://crates.io/crates/fnv
    /// [`AHash`]: https://crates.io/crates/ahash
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// #[derive(Hash, Eq, PartialEq, Debug)]
    /// struct Viking {
    ///     name: String,
    ///     country: String,
    /// }
    ///
    /// impl Viking {
    ///     /// Creates a new Viking.
    ///     fn new(name: &str, country: &str) -> Viking {
    ///         Viking { name: name.to_string(), country: country.to_string() }
    ///     }
    /// }
    ///
    /// // Use a HashMap to store the vikings' health points.
    /// let mut vikings = HashMap::new();
    ///
    /// vikings.insert(Viking::new("Einar", "Norway"), 25);
    /// vikings.insert(Viking::new("Olaf", "Denmark"), 24);
    /// vikings.insert(Viking::new("Harald", "Iceland"), 12);
    ///
    /// // Use derived implementation to print the status of the vikings.
    /// for (viking, health) in &vikings {
    ///     println!("{:?} has {} hp", viking, health);
    /// }
    /// ```
    ///
    /// A `HashMap` with fixed list of elements can be initialized from an array:
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let timber_resources: HashMap<&str, i32> = [("Norway", 100), ("Denmark", 50), ("Iceland", 10)]
    ///     .iter().cloned().collect();
    /// // use the values stored in map
    /// ```
    pub struct HashMap<K, V, S = DefaultHashBuilder, A: Allocator + Clone = Global> {
        pub(crate) hash_builder: S,
        pub(crate) table: RawTable<(K, V), A>,
    }

    impl<K: Clone, V: Clone, S: Clone, A: Allocator + Clone> Clone for HashMap<K, V, S, A> {
        fn clone(&self) -> Self {
            HashMap {
                hash_builder: self.hash_builder.clone(),
                table: self.table.clone(),
            }
        }

        fn clone_from(&mut self, source: &Self) {
            self.table.clone_from(&source.table);

            // Update hash_builder only if we successfully cloned all elements.
            self.hash_builder.clone_from(&source.hash_builder);
        }
    }

    /// Ensures that a single closure type across uses of this which, in turn prevents multiple
    /// instances of any functions like RawTable::reserve from being generated
    #[cfg_attr(feature = "inline-more", inline)]
    pub(crate) fn make_hasher<K, Q, V, S>(hash_builder: &S) -> impl Fn(&(Q, V)) -> u64 + '_
    where
        K: Borrow<Q>,
        Q: Hash,
        S: BuildHasher,
    {
        move |val| make_hash::<K, Q, S>(hash_builder, &val.0)
    }

    /// Ensures that a single closure type across uses of this which, in turn prevents multiple
    /// instances of any functions like RawTable::reserve from being generated
    #[cfg_attr(feature = "inline-more", inline)]
    fn equivalent_key<Q, K, V>(k: &Q) -> impl Fn(&(K, V)) -> bool + '_
    where
        K: Borrow<Q>,
        Q: ?Sized + Eq,
    {
        move |x| k.eq(x.0.borrow())
    }

    /// Ensures that a single closure type across uses of this which, in turn prevents multiple
    /// instances of any functions like RawTable::reserve from being generated
    #[cfg_attr(feature = "inline-more", inline)]
    fn equivalent<Q, K>(k: &Q) -> impl Fn(&K) -> bool + '_
    where
        K: Borrow<Q>,
        Q: ?Sized + Eq,
    {
        move |x| k.eq(x.borrow())
    }

    #[cfg(not(feature = "nightly"))]
    #[cfg_attr(feature = "inline-more", inline)]
    pub(crate) fn make_hash<K, Q, S>(hash_builder: &S, val: &Q) -> u64
    where
        K: Borrow<Q>,
        Q: Hash + ?Sized,
        S: BuildHasher,
    {
        use core::hash::Hasher;
        let mut state = hash_builder.build_hasher();
        val.hash(&mut state);
        state.finish()
    }

    #[cfg(feature = "nightly")]
    #[cfg_attr(feature = "inline-more", inline)]
    pub(crate) fn make_hash<K, Q, S>(hash_builder: &S, val: &Q) -> u64
    where
        K: Borrow<Q>,
        Q: Hash + ?Sized,
        S: BuildHasher,
    {
        hash_builder.hash_one(val)
    }

    #[cfg(not(feature = "nightly"))]
    #[cfg_attr(feature = "inline-more", inline)]
    pub(crate) fn make_insert_hash<K, S>(hash_builder: &S, val: &K) -> u64
    where
        K: Hash,
        S: BuildHasher,
    {
        use core::hash::Hasher;
        let mut state = hash_builder.build_hasher();
        val.hash(&mut state);
        state.finish()
    }

    #[cfg(feature = "nightly")]
    #[cfg_attr(feature = "inline-more", inline)]
    pub(crate) fn make_insert_hash<K, S>(hash_builder: &S, val: &K) -> u64
    where
        K: Hash,
        S: BuildHasher,
    {
        hash_builder.hash_one(val)
    }

    #[cfg(feature = "ahash")]
    impl<K, V> HashMap<K, V, DefaultHashBuilder> {
        /// Creates an empty `HashMap`.
        ///
        /// The hash map is initially created with a capacity of 0, so it will not allocate until it
        /// is first inserted into.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let mut map: HashMap<&str, i32> = HashMap::new();
        /// assert_eq!(map.len(), 0);
        /// assert_eq!(map.capacity(), 0);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn new() -> Self {
            Self::default()
        }

        /// Creates an empty `HashMap` with the specified capacity.
        ///
        /// The hash map will be able to hold at least `capacity` elements without
        /// reallocating. If `capacity` is 0, the hash map will not allocate.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let mut map: HashMap<&str, i32> = HashMap::with_capacity(10);
        /// assert_eq!(map.len(), 0);
        /// assert!(map.capacity() >= 10);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn with_capacity(capacity: usize) -> Self {
            Self::with_capacity_and_hasher(capacity, DefaultHashBuilder::default())
        }
    }

    #[cfg(feature = "ahash")]
    impl<K, V, A: Allocator + Clone> HashMap<K, V, DefaultHashBuilder, A> {
        /// Creates an empty `HashMap` using the given allocator.
        ///
        /// The hash map is initially created with a capacity of 0, so it will not allocate until it
        /// is first inserted into.
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn new_in(alloc: A) -> Self {
            Self::with_hasher_in(DefaultHashBuilder::default(), alloc)
        }

        /// Creates an empty `HashMap` with the specified capacity using the given allocator.
        ///
        /// The hash map will be able to hold at least `capacity` elements without
        /// reallocating. If `capacity` is 0, the hash map will not allocate.
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn with_capacity_in(capacity: usize, alloc: A) -> Self {
            Self::with_capacity_and_hasher_in(capacity, DefaultHashBuilder::default(), alloc)
        }
    }

    impl<K, V, S> HashMap<K, V, S> {
        /// Creates an empty `HashMap` which will use the given hash builder to hash
        /// keys.
        ///
        /// The hash map is initially created with a capacity of 0, so it will not
        /// allocate until it is first inserted into.
        ///
        /// Warning: `hash_builder` is normally randomly generated, and
        /// is designed to allow HashMaps to be resistant to attacks that
        /// cause many collisions and very poor performance. Setting it
        /// manually using this function can expose a DoS attack vector.
        ///
        /// The `hash_builder` passed should implement the [`BuildHasher`] trait for
        /// the HashMap to be useful, see its documentation for details.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::DefaultHashBuilder;
        ///
        /// let s = DefaultHashBuilder::default();
        /// let mut map = HashMap::with_hasher(s);
        /// assert_eq!(map.len(), 0);
        /// assert_eq!(map.capacity(), 0);
        ///
        /// map.insert(1, 2);
        /// ```
        ///
        /// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
        #[cfg_attr(feature = "inline-more", inline)]
        pub const fn with_hasher(hash_builder: S) -> Self {
            Self {
                hash_builder,
                table: RawTable::new(),
            }
        }

        /// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
        /// to hash the keys.
        ///
        /// The hash map will be able to hold at least `capacity` elements without
        /// reallocating. If `capacity` is 0, the hash map will not allocate.
        ///
        /// Warning: `hash_builder` is normally randomly generated, and
        /// is designed to allow HashMaps to be resistant to attacks that
        /// cause many collisions and very poor performance. Setting it
        /// manually using this function can expose a DoS attack vector.
        ///
        /// The `hash_builder` passed should implement the [`BuildHasher`] trait for
        /// the HashMap to be useful, see its documentation for details.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::DefaultHashBuilder;
        ///
        /// let s = DefaultHashBuilder::default();
        /// let mut map = HashMap::with_capacity_and_hasher(10, s);
        /// assert_eq!(map.len(), 0);
        /// assert!(map.capacity() >= 10);
        ///
        /// map.insert(1, 2);
        /// ```
        ///
        /// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self {
            Self {
                hash_builder,
                table: RawTable::with_capacity(capacity),
            }
        }
    }

    impl<K, V, S, A: Allocator + Clone> HashMap<K, V, S, A> {
        /// Returns a reference to the underlying allocator.
        #[inline]
        pub fn allocator(&self) -> &A {
            self.table.allocator()
        }

        /// Creates an empty `HashMap` which will use the given hash builder to hash
        /// keys. It will be allocated with the given allocator.
        ///
        /// The created map has the default initial capacity.
        ///
        /// Warning: `hash_builder` is normally randomly generated, and
        /// is designed to allow HashMaps to be resistant to attacks that
        /// cause many collisions and very poor performance. Setting it
        /// manually using this function can expose a DoS attack vector.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::DefaultHashBuilder;
        ///
        /// let s = DefaultHashBuilder::default();
        /// let mut map = HashMap::with_hasher(s);
        /// map.insert(1, 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn with_hasher_in(hash_builder: S, alloc: A) -> Self {
            Self {
                hash_builder,
                table: RawTable::new_in(alloc),
            }
        }

        /// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
        /// to hash the keys. It will be allocated with the given allocator.
        ///
        /// The hash map will be able to hold at least `capacity` elements without
        /// reallocating. If `capacity` is 0, the hash map will not allocate.
        ///
        /// Warning: `hash_builder` is normally randomly generated, and
        /// is designed to allow HashMaps to be resistant to attacks that
        /// cause many collisions and very poor performance. Setting it
        /// manually using this function can expose a DoS attack vector.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::DefaultHashBuilder;
        ///
        /// let s = DefaultHashBuilder::default();
        /// let mut map = HashMap::with_capacity_and_hasher(10, s);
        /// map.insert(1, 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn with_capacity_and_hasher_in(capacity: usize, hash_builder: S, alloc: A) -> Self {
            Self {
                hash_builder,
                table: RawTable::with_capacity_in(capacity, alloc),
            }
        }

        /// Returns a reference to the map's [`BuildHasher`].
        ///
        /// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::DefaultHashBuilder;
        ///
        /// let hasher = DefaultHashBuilder::default();
        /// let map: HashMap<i32, i32> = HashMap::with_hasher(hasher);
        /// let hasher: &DefaultHashBuilder = map.hasher();
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn hasher(&self) -> &S {
            &self.hash_builder
        }

        /// Returns the number of elements the map can hold without reallocating.
        ///
        /// This number is a lower bound; the `HashMap<K, V>` might be able to hold
        /// more, but is guaranteed to be able to hold at least this many.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let map: HashMap<i32, i32> = HashMap::with_capacity(100);
        /// assert_eq!(map.len(), 0);
        /// assert!(map.capacity() >= 100);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn capacity(&self) -> usize {
            self.table.capacity()
        }

        /// An iterator visiting all keys in arbitrary order.
        /// The iterator element type is `&'a K`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        /// assert_eq!(map.len(), 3);
        /// let mut vec: Vec<&str> = Vec::new();
        ///
        /// for key in map.keys() {
        ///     println!("{}", key);
        ///     vec.push(*key);
        /// }
        ///
        /// // The `Keys` iterator produces keys in arbitrary order, so the
        /// // keys must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, ["a", "b", "c"]);
        ///
        /// assert_eq!(map.len(), 3);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn keys(&self) -> Keys<'_, K, V> {
            Keys { inner: self.iter() }
        }

        /// An iterator visiting all values in arbitrary order.
        /// The iterator element type is `&'a V`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        /// assert_eq!(map.len(), 3);
        /// let mut vec: Vec<i32> = Vec::new();
        ///
        /// for val in map.values() {
        ///     println!("{}", val);
        ///     vec.push(*val);
        /// }
        ///
        /// // The `Values` iterator produces values in arbitrary order, so the
        /// // values must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [1, 2, 3]);
        ///
        /// assert_eq!(map.len(), 3);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn values(&self) -> Values<'_, K, V> {
            Values { inner: self.iter() }
        }

        /// An iterator visiting all values mutably in arbitrary order.
        /// The iterator element type is `&'a mut V`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        ///
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        ///
        /// for val in map.values_mut() {
        ///     *val = *val + 10;
        /// }
        ///
        /// assert_eq!(map.len(), 3);
        /// let mut vec: Vec<i32> = Vec::new();
        ///
        /// for val in map.values() {
        ///     println!("{}", val);
        ///     vec.push(*val);
        /// }
        ///
        /// // The `Values` iterator produces values in arbitrary order, so the
        /// // values must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [11, 12, 13]);
        ///
        /// assert_eq!(map.len(), 3);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> {
            ValuesMut {
                inner: self.iter_mut(),
            }
        }

        /// An iterator visiting all key-value pairs in arbitrary order.
        /// The iterator element type is `(&'a K, &'a V)`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        /// assert_eq!(map.len(), 3);
        /// let mut vec: Vec<(&str, i32)> = Vec::new();
        ///
        /// for (key, val) in map.iter() {
        ///     println!("key: {} val: {}", key, val);
        ///     vec.push((*key, *val));
        /// }
        ///
        /// // The `Iter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
        ///
        /// assert_eq!(map.len(), 3);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn iter(&self) -> Iter<'_, K, V> {
            // Here we tie the lifetime of self to the iter.
            unsafe {
                Iter {
                    inner: self.table.iter(),
                    marker: PhantomData,
                }
            }
        }

        /// An iterator visiting all key-value pairs in arbitrary order,
        /// with mutable references to the values.
        /// The iterator element type is `(&'a K, &'a mut V)`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        ///
        /// // Update all values
        /// for (_, val) in map.iter_mut() {
        ///     *val *= 2;
        /// }
        ///
        /// assert_eq!(map.len(), 3);
        /// let mut vec: Vec<(&str, i32)> = Vec::new();
        ///
        /// for (key, val) in &map {
        ///     println!("key: {} val: {}", key, val);
        ///     vec.push((*key, *val));
        /// }
        ///
        /// // The `Iter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [("a", 2), ("b", 4), ("c", 6)]);
        ///
        /// assert_eq!(map.len(), 3);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn iter_mut(&mut self) -> IterMut<'_, K, V> {
            // Here we tie the lifetime of self to the iter.
            unsafe {
                IterMut {
                    inner: self.table.iter(),
                    marker: PhantomData,
                }
            }
        }

        #[cfg(test)]
        #[cfg_attr(feature = "inline-more", inline)]
        fn raw_capacity(&self) -> usize {
            self.table.buckets()
        }

        /// Returns the number of elements in the map.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut a = HashMap::new();
        /// assert_eq!(a.len(), 0);
        /// a.insert(1, "a");
        /// assert_eq!(a.len(), 1);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn len(&self) -> usize {
            self.table.len()
        }

        /// Returns `true` if the map contains no elements.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut a = HashMap::new();
        /// assert!(a.is_empty());
        /// a.insert(1, "a");
        /// assert!(!a.is_empty());
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn is_empty(&self) -> bool {
            self.len() == 0
        }

        /// Clears the map, returning all key-value pairs as an iterator. Keeps the
        /// allocated memory for reuse.
        ///
        /// If the returned iterator is dropped before being fully consumed, it
        /// drops the remaining key-value pairs. The returned iterator keeps a
        /// mutable borrow on the vector to optimize its implementation.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut a = HashMap::new();
        /// a.insert(1, "a");
        /// a.insert(2, "b");
        /// let capacity_before_drain = a.capacity();
        ///
        /// for (k, v) in a.drain().take(1) {
        ///     assert!(k == 1 || k == 2);
        ///     assert!(v == "a" || v == "b");
        /// }
        ///
        /// // As we can see, the map is empty and contains no element.
        /// assert!(a.is_empty() && a.len() == 0);
        /// // But map capacity is equal to old one.
        /// assert_eq!(a.capacity(), capacity_before_drain);
        ///
        /// let mut a = HashMap::new();
        /// a.insert(1, "a");
        /// a.insert(2, "b");
        ///
        /// {   // Iterator is dropped without being consumed.
        ///     let d = a.drain();
        /// }
        ///
        /// // But the map is empty even if we do not use Drain iterator.
        /// assert!(a.is_empty());
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn drain(&mut self) -> Drain<'_, K, V, A> {
            Drain {
                inner: self.table.drain(),
            }
        }

        /// Retains only the elements specified by the predicate. Keeps the
        /// allocated memory for reuse.
        ///
        /// In other words, remove all pairs `(k, v)` such that `f(&k, &mut v)` returns `false`.
        /// The elements are visited in unsorted (and unspecified) order.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<i32, i32> = (0..8).map(|x|(x, x*10)).collect();
        /// assert_eq!(map.len(), 8);
        /// let capacity_before_retain = map.capacity();
        ///
        /// map.retain(|&k, _| k % 2 == 0);
        ///
        /// // We can see, that the number of elements inside map is changed.
        /// assert_eq!(map.len(), 4);
        /// // But map capacity is equal to old one.
        /// assert_eq!(map.capacity(), capacity_before_retain);
        ///
        /// let mut vec: Vec<(i32, i32)> = map.iter().map(|(&k, &v)| (k, v)).collect();
        /// vec.sort_unstable();
        /// assert_eq!(vec, [(0, 0), (2, 20), (4, 40), (6, 60)]);
        /// ```
        pub fn retain<F>(&mut self, mut f: F)
        where
            F: FnMut(&K, &mut V) -> bool,
        {
            // Here we only use `iter` as a temporary, preventing use-after-free
            unsafe {
                for item in self.table.iter() {
                    let &mut (ref key, ref mut value) = item.as_mut();
                    if !f(key, value) {
                        self.table.erase(item);
                    }
                }
            }
        }

        /// Drains elements which are true under the given predicate,
        /// and returns an iterator over the removed items.
        ///
        /// In other words, move all pairs `(k, v)` such that `f(&k, &mut v)` returns `true` out
        /// into another iterator.
        ///
        /// Note that `drain_filter` lets you mutate every value in the filter closure, regardless of
        /// whether you choose to keep or remove it.
        ///
        /// When the returned DrainedFilter is dropped, any remaining elements that satisfy
        /// the predicate are dropped from the table.
        ///
        /// It is unspecified how many more elements will be subjected to the closure
        /// if a panic occurs in the closure, or a panic occurs while dropping an element,
        /// or if the `DrainFilter` value is leaked.
        ///
        /// Keeps the allocated memory for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
        /// let capacity_before_drain_filter = map.capacity();
        /// let drained: HashMap<i32, i32> = map.drain_filter(|k, _v| k % 2 == 0).collect();
        ///
        /// let mut evens = drained.keys().cloned().collect::<Vec<_>>();
        /// let mut odds = map.keys().cloned().collect::<Vec<_>>();
        /// evens.sort();
        /// odds.sort();
        ///
        /// assert_eq!(evens, vec![0, 2, 4, 6]);
        /// assert_eq!(odds, vec![1, 3, 5, 7]);
        /// // Map capacity is equal to old one.
        /// assert_eq!(map.capacity(), capacity_before_drain_filter);
        ///
        /// let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
        ///
        /// {   // Iterator is dropped without being consumed.
        ///     let d = map.drain_filter(|k, _v| k % 2 != 0);
        /// }
        ///
        /// // But the map lens have been reduced by half
        /// // even if we do not use DrainFilter iterator.
        /// assert_eq!(map.len(), 4);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn drain_filter<F>(&mut self, f: F) -> DrainFilter<'_, K, V, F, A>
        where
            F: FnMut(&K, &mut V) -> bool,
        {
            DrainFilter {
                f,
                inner: DrainFilterInner {
                    iter: unsafe { self.table.iter() },
                    table: &mut self.table,
                },
            }
        }

        /// Clears the map, removing all key-value pairs. Keeps the allocated memory
        /// for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut a = HashMap::new();
        /// a.insert(1, "a");
        /// let capacity_before_clear = a.capacity();
        ///
        /// a.clear();
        ///
        /// // Map is empty.
        /// assert!(a.is_empty());
        /// // But map capacity is equal to old one.
        /// assert_eq!(a.capacity(), capacity_before_clear);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn clear(&mut self) {
            self.table.clear();
        }

        /// Creates a consuming iterator visiting all the keys in arbitrary order.
        /// The map cannot be used after calling this.
        /// The iterator element type is `K`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        ///
        /// let mut vec: Vec<&str> = map.into_keys().collect();
        ///
        /// // The `IntoKeys` iterator produces keys in arbitrary order, so the
        /// // keys must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, ["a", "b", "c"]);
        /// ```
        #[inline]
        pub fn into_keys(self) -> IntoKeys<K, V, A> {
            IntoKeys {
                inner: self.into_iter(),
            }
        }

        /// Creates a consuming iterator visiting all the values in arbitrary order.
        /// The map cannot be used after calling this.
        /// The iterator element type is `V`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert("a", 1);
        /// map.insert("b", 2);
        /// map.insert("c", 3);
        ///
        /// let mut vec: Vec<i32> = map.into_values().collect();
        ///
        /// // The `IntoValues` iterator produces values in arbitrary order, so
        /// // the values must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [1, 2, 3]);
        /// ```
        #[inline]
        pub fn into_values(self) -> IntoValues<K, V, A> {
            IntoValues {
                inner: self.into_iter(),
            }
        }
    }

    impl<K, V, S, A> HashMap<K, V, S, A>
    where
        K: Eq + Hash,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        /// Reserves capacity for at least `additional` more elements to be inserted
        /// in the `HashMap`. The collection may reserve more space to avoid
        /// frequent reallocations.
        ///
        /// # Panics
        ///
        /// Panics if the new allocation size overflows [`usize`].
        ///
        /// [`usize`]: https://doc.rust-lang.org/std/primitive.usize.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let mut map: HashMap<&str, i32> = HashMap::new();
        /// // Map is empty and doesn't allocate memory
        /// assert_eq!(map.capacity(), 0);
        ///
        /// map.reserve(10);
        ///
        /// // And now map can hold at least 10 elements
        /// assert!(map.capacity() >= 10);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn reserve(&mut self, additional: usize) {
            self.table
                .reserve(additional, make_hasher::<K, _, V, S>(&self.hash_builder));
        }

        /// Tries to reserve capacity for at least `additional` more elements to be inserted
        /// in the given `HashMap<K,V>`. The collection may reserve more space to avoid
        /// frequent reallocations.
        ///
        /// # Errors
        ///
        /// If the capacity overflows, or the allocator reports a failure, then an error
        /// is returned.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, isize> = HashMap::new();
        /// // Map is empty and doesn't allocate memory
        /// assert_eq!(map.capacity(), 0);
        ///
        /// map.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
        ///
        /// // And now map can hold at least 10 elements
        /// assert!(map.capacity() >= 10);
        /// ```
        /// If the capacity overflows, or the allocator reports a failure, then an error
        /// is returned:
        /// ```
        /// # fn test() {
        /// use hashbrown::HashMap;
        /// use hashbrown::TryReserveError;
        /// let mut map: HashMap<i32, i32> = HashMap::new();
        ///
        /// match map.try_reserve(usize::MAX) {
        ///     Err(error) => match error {
        ///         TryReserveError::CapacityOverflow => {}
        ///         _ => panic!("TryReserveError::AllocError ?"),
        ///     },
        ///     _ => panic!(),
        /// }
        /// # }
        /// # fn main() {
        /// #     #[cfg(not(miri))]
        /// #     test()
        /// # }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn try_reserve(&mut self, additional: usize) -> Result<(), TryReserveError> {
            self.table
                .try_reserve(additional, make_hasher::<K, _, V, S>(&self.hash_builder))
        }

        /// Shrinks the capacity of the map as much as possible. It will drop
        /// down as much as possible while maintaining the internal rules
        /// and possibly leaving some space in accordance with the resize policy.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
        /// map.insert(1, 2);
        /// map.insert(3, 4);
        /// assert!(map.capacity() >= 100);
        /// map.shrink_to_fit();
        /// assert!(map.capacity() >= 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn shrink_to_fit(&mut self) {
            self.table
                .shrink_to(0, make_hasher::<K, _, V, S>(&self.hash_builder));
        }

        /// Shrinks the capacity of the map with a lower limit. It will drop
        /// down no lower than the supplied limit while maintaining the internal rules
        /// and possibly leaving some space in accordance with the resize policy.
        ///
        /// This function does nothing if the current capacity is smaller than the
        /// supplied minimum capacity.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<i32, i32> = HashMap::with_capacity(100);
        /// map.insert(1, 2);
        /// map.insert(3, 4);
        /// assert!(map.capacity() >= 100);
        /// map.shrink_to(10);
        /// assert!(map.capacity() >= 10);
        /// map.shrink_to(0);
        /// assert!(map.capacity() >= 2);
        /// map.shrink_to(10);
        /// assert!(map.capacity() >= 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn shrink_to(&mut self, min_capacity: usize) {
            self.table
                .shrink_to(min_capacity, make_hasher::<K, _, V, S>(&self.hash_builder));
        }

        /// Gets the given key's corresponding entry in the map for in-place manipulation.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut letters = HashMap::new();
        ///
        /// for ch in "a short treatise on fungi".chars() {
        ///     let counter = letters.entry(ch).or_insert(0);
        ///     *counter += 1;
        /// }
        ///
        /// assert_eq!(letters[&'s'], 2);
        /// assert_eq!(letters[&'t'], 3);
        /// assert_eq!(letters[&'u'], 1);
        /// assert_eq!(letters.get(&'y'), None);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn entry(&mut self, key: K) -> Entry<'_, K, V, S, A> {
            let hash = make_insert_hash::<K, S>(&self.hash_builder, &key);
            if let Some(elem) = self.table.find(hash, equivalent_key(&key)) {
                Entry::Occupied(OccupiedEntry {
                    hash,
                    key: Some(key),
                    elem,
                    table: self,
                })
            } else {
                Entry::Vacant(VacantEntry {
                    hash,
                    key,
                    table: self,
                })
            }
        }

        /// Gets the given key's corresponding entry by reference in the map for in-place manipulation.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut words: HashMap<String, usize> = HashMap::new();
        /// let source = ["poneyland", "horseyland", "poneyland", "poneyland"];
        /// for (i, &s) in source.iter().enumerate() {
        ///     let counter = words.entry_ref(s).or_insert(0);
        ///     *counter += 1;
        /// }
        ///
        /// assert_eq!(words["poneyland"], 3);
        /// assert_eq!(words["horseyland"], 1);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn entry_ref<'a, 'b, Q: ?Sized>(&'a mut self, key: &'b Q) -> EntryRef<'a, 'b, K, Q, V, S, A>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hash = make_hash::<K, Q, S>(&self.hash_builder, key);
            if let Some(elem) = self.table.find(hash, equivalent_key(key)) {
                EntryRef::Occupied(OccupiedEntryRef {
                    hash,
                    key: Some(KeyOrRef::Borrowed(key)),
                    elem,
                    table: self,
                })
            } else {
                EntryRef::Vacant(VacantEntryRef {
                    hash,
                    key: KeyOrRef::Borrowed(key),
                    table: self,
                })
            }
        }

        /// Returns a reference to the value corresponding to the key.
        ///
        /// The key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, "a");
        /// assert_eq!(map.get(&1), Some(&"a"));
        /// assert_eq!(map.get(&2), None);
        /// ```
        #[inline]
        pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.get_inner(k) {
                Some(&(_, ref v)) => Some(v),
                None => None,
            }
        }

        /// Returns the key-value pair corresponding to the supplied key.
        ///
        /// The supplied key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, "a");
        /// assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
        /// assert_eq!(map.get_key_value(&2), None);
        /// ```
        #[inline]
        pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.get_inner(k) {
                Some(&(ref key, ref value)) => Some((key, value)),
                None => None,
            }
        }

        #[inline]
        fn get_inner<Q: ?Sized>(&self, k: &Q) -> Option<&(K, V)>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            if self.table.is_empty() {
                None
            } else {
                let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
                self.table.get(hash, equivalent_key(k))
            }
        }

        /// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.
        ///
        /// The supplied key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, "a");
        /// let (k, v) = map.get_key_value_mut(&1).unwrap();
        /// assert_eq!(k, &1);
        /// assert_eq!(v, &mut "a");
        /// *v = "b";
        /// assert_eq!(map.get_key_value_mut(&1), Some((&1, &mut "b")));
        /// assert_eq!(map.get_key_value_mut(&2), None);
        /// ```
        #[inline]
        pub fn get_key_value_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<(&K, &mut V)>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.get_inner_mut(k) {
                Some(&mut (ref key, ref mut value)) => Some((key, value)),
                None => None,
            }
        }

        /// Returns `true` if the map contains a value for the specified key.
        ///
        /// The key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, "a");
        /// assert_eq!(map.contains_key(&1), true);
        /// assert_eq!(map.contains_key(&2), false);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> bool
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            self.get_inner(k).is_some()
        }

        /// Returns a mutable reference to the value corresponding to the key.
        ///
        /// The key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, "a");
        /// if let Some(x) = map.get_mut(&1) {
        ///     *x = "b";
        /// }
        /// assert_eq!(map[&1], "b");
        ///
        /// assert_eq!(map.get_mut(&2), None);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.get_inner_mut(k) {
                Some(&mut (_, ref mut v)) => Some(v),
                None => None,
            }
        }

        #[inline]
        fn get_inner_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut (K, V)>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            if self.table.is_empty() {
                None
            } else {
                let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
                self.table.get_mut(hash, equivalent_key(k))
            }
        }

        /// Attempts to get mutable references to `N` values in the map at once.
        ///
        /// Returns an array of length `N` with the results of each query. For soundness, at most one
        /// mutable reference will be returned to any value. `None` will be returned if any of the
        /// keys are duplicates or missing.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut libraries = HashMap::new();
        /// libraries.insert("Bodleian Library".to_string(), 1602);
        /// libraries.insert("Athenæum".to_string(), 1807);
        /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
        /// libraries.insert("Library of Congress".to_string(), 1800);
        ///
        /// let got = libraries.get_many_mut([
        ///     "Athenæum",
        ///     "Library of Congress",
        /// ]);
        /// assert_eq!(
        ///     got,
        ///     Some([
        ///         &mut 1807,
        ///         &mut 1800,
        ///     ]),
        /// );
        ///
        /// // Missing keys result in None
        /// let got = libraries.get_many_mut([
        ///     "Athenæum",
        ///     "New York Public Library",
        /// ]);
        /// assert_eq!(got, None);
        ///
        /// // Duplicate keys result in None
        /// let got = libraries.get_many_mut([
        ///     "Athenæum",
        ///     "Athenæum",
        /// ]);
        /// assert_eq!(got, None);
        /// ```
        pub fn get_many_mut<Q: ?Sized, const N: usize>(&mut self, ks: [&Q; N]) -> Option<[&'_ mut V; N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            self.get_many_mut_inner(ks).map(|res| res.map(|(_, v)| v))
        }

        /// Attempts to get mutable references to `N` values in the map at once, without validating that
        /// the values are unique.
        ///
        /// Returns an array of length `N` with the results of each query. `None` will be returned if
        /// any of the keys are missing.
        ///
        /// For a safe alternative see [`get_many_mut`](`HashMap::get_many_mut`).
        ///
        /// # Safety
        ///
        /// Calling this method with overlapping keys is *[undefined behavior]* even if the resulting
        /// references are not used.
        ///
        /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut libraries = HashMap::new();
        /// libraries.insert("Bodleian Library".to_string(), 1602);
        /// libraries.insert("Athenæum".to_string(), 1807);
        /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
        /// libraries.insert("Library of Congress".to_string(), 1800);
        ///
        /// let got = libraries.get_many_mut([
        ///     "Athenæum",
        ///     "Library of Congress",
        /// ]);
        /// assert_eq!(
        ///     got,
        ///     Some([
        ///         &mut 1807,
        ///         &mut 1800,
        ///     ]),
        /// );
        ///
        /// // Missing keys result in None
        /// let got = libraries.get_many_mut([
        ///     "Athenæum",
        ///     "New York Public Library",
        /// ]);
        /// assert_eq!(got, None);
        /// ```
        pub unsafe fn get_many_unchecked_mut<Q: ?Sized, const N: usize>(
            &mut self,
            ks: [&Q; N],
        ) -> Option<[&'_ mut V; N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            self.get_many_unchecked_mut_inner(ks)
                .map(|res| res.map(|(_, v)| v))
        }

        /// Attempts to get mutable references to `N` values in the map at once, with immutable
        /// references to the corresponding keys.
        ///
        /// Returns an array of length `N` with the results of each query. For soundness, at most one
        /// mutable reference will be returned to any value. `None` will be returned if any of the keys
        /// are duplicates or missing.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut libraries = HashMap::new();
        /// libraries.insert("Bodleian Library".to_string(), 1602);
        /// libraries.insert("Athenæum".to_string(), 1807);
        /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
        /// libraries.insert("Library of Congress".to_string(), 1800);
        ///
        /// let got = libraries.get_many_key_value_mut([
        ///     "Bodleian Library",
        ///     "Herzogin-Anna-Amalia-Bibliothek",
        /// ]);
        /// assert_eq!(
        ///     got,
        ///     Some([
        ///         (&"Bodleian Library".to_string(), &mut 1602),
        ///         (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
        ///     ]),
        /// );
        /// // Missing keys result in None
        /// let got = libraries.get_many_key_value_mut([
        ///     "Bodleian Library",
        ///     "Gewandhaus",
        /// ]);
        /// assert_eq!(got, None);
        ///
        /// // Duplicate keys result in None
        /// let got = libraries.get_many_key_value_mut([
        ///     "Bodleian Library",
        ///     "Herzogin-Anna-Amalia-Bibliothek",
        ///     "Herzogin-Anna-Amalia-Bibliothek",
        /// ]);
        /// assert_eq!(got, None);
        /// ```
        pub fn get_many_key_value_mut<Q: ?Sized, const N: usize>(
            &mut self,
            ks: [&Q; N],
        ) -> Option<[(&'_ K, &'_ mut V); N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            self.get_many_mut_inner(ks)
                .map(|res| res.map(|(k, v)| (&*k, v)))
        }

        /// Attempts to get mutable references to `N` values in the map at once, with immutable
        /// references to the corresponding keys, without validating that the values are unique.
        ///
        /// Returns an array of length `N` with the results of each query. `None` will be returned if
        /// any of the keys are missing.
        ///
        /// For a safe alternative see [`get_many_key_value_mut`](`HashMap::get_many_key_value_mut`).
        ///
        /// # Safety
        ///
        /// Calling this method with overlapping keys is *[undefined behavior]* even if the resulting
        /// references are not used.
        ///
        /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut libraries = HashMap::new();
        /// libraries.insert("Bodleian Library".to_string(), 1602);
        /// libraries.insert("Athenæum".to_string(), 1807);
        /// libraries.insert("Herzogin-Anna-Amalia-Bibliothek".to_string(), 1691);
        /// libraries.insert("Library of Congress".to_string(), 1800);
        ///
        /// let got = libraries.get_many_key_value_mut([
        ///     "Bodleian Library",
        ///     "Herzogin-Anna-Amalia-Bibliothek",
        /// ]);
        /// assert_eq!(
        ///     got,
        ///     Some([
        ///         (&"Bodleian Library".to_string(), &mut 1602),
        ///         (&"Herzogin-Anna-Amalia-Bibliothek".to_string(), &mut 1691),
        ///     ]),
        /// );
        /// // Missing keys result in None
        /// let got = libraries.get_many_key_value_mut([
        ///     "Bodleian Library",
        ///     "Gewandhaus",
        /// ]);
        /// assert_eq!(got, None);
        /// ```
        pub unsafe fn get_many_key_value_unchecked_mut<Q: ?Sized, const N: usize>(
            &mut self,
            ks: [&Q; N],
        ) -> Option<[(&'_ K, &'_ mut V); N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            self.get_many_unchecked_mut_inner(ks)
                .map(|res| res.map(|(k, v)| (&*k, v)))
        }

        fn get_many_mut_inner<Q: ?Sized, const N: usize>(
            &mut self,
            ks: [&Q; N],
        ) -> Option<[&'_ mut (K, V); N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hashes = self.build_hashes_inner(ks);
            self.table
                .get_many_mut(hashes, |i, (k, _)| ks[i].eq(k.borrow()))
        }

        unsafe fn get_many_unchecked_mut_inner<Q: ?Sized, const N: usize>(
            &mut self,
            ks: [&Q; N],
        ) -> Option<[&'_ mut (K, V); N]>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hashes = self.build_hashes_inner(ks);
            self.table
                .get_many_unchecked_mut(hashes, |i, (k, _)| ks[i].eq(k.borrow()))
        }

        fn build_hashes_inner<Q: ?Sized, const N: usize>(&self, ks: [&Q; N]) -> [u64; N]
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let mut hashes = [0_u64; N];
            for i in 0..N {
                hashes[i] = make_hash::<K, Q, S>(&self.hash_builder, ks[i]);
            }
            hashes
        }

        /// Inserts a key-value pair into the map.
        ///
        /// If the map did not have this key present, [`None`] is returned.
        ///
        /// If the map did have this key present, the value is updated, and the old
        /// value is returned. The key is not updated, though; this matters for
        /// types that can be `==` without being identical. See the [`std::collections`]
        /// [module-level documentation] for more.
        ///
        /// [`None`]: https://doc.rust-lang.org/std/option/enum.Option.html#variant.None
        /// [`std::collections`]: https://doc.rust-lang.org/std/collections/index.html
        /// [module-level documentation]: https://doc.rust-lang.org/std/collections/index.html#insert-and-complex-keys
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// assert_eq!(map.insert(37, "a"), None);
        /// assert_eq!(map.is_empty(), false);
        ///
        /// map.insert(37, "b");
        /// assert_eq!(map.insert(37, "c"), Some("b"));
        /// assert_eq!(map[&37], "c");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(&mut self, k: K, v: V) -> Option<V> {
            let hash = make_insert_hash::<K, S>(&self.hash_builder, &k);
            if let Some((_, item)) = self.table.get_mut(hash, equivalent_key(&k)) {
                Some(mem::replace(item, v))
            } else {
                self.table
                    .insert(hash, (k, v), make_hasher::<K, _, V, S>(&self.hash_builder));
                None
            }
        }

        /// Insert a key-value pair into the map without checking
        /// if the key already exists in the map.
        ///
        /// Returns a reference to the key and value just inserted.
        ///
        /// This operation is safe if a key does not exist in the map.
        ///
        /// However, if a key exists in the map already, the behavior is unspecified:
        /// this operation may panic, loop forever, or any following operation with the map
        /// may panic, loop forever or return arbitrary result.
        ///
        /// That said, this operation (and following operations) are guaranteed to
        /// not violate memory safety.
        ///
        /// This operation is faster than regular insert, because it does not perform
        /// lookup before insertion.
        ///
        /// This operation is useful during initial population of the map.
        /// For example, when constructing a map from another map, we know
        /// that keys are unique.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map1 = HashMap::new();
        /// assert_eq!(map1.insert(1, "a"), None);
        /// assert_eq!(map1.insert(2, "b"), None);
        /// assert_eq!(map1.insert(3, "c"), None);
        /// assert_eq!(map1.len(), 3);
        ///
        /// let mut map2 = HashMap::new();
        ///
        /// for (key, value) in map1.into_iter() {
        ///     map2.insert_unique_unchecked(key, value);
        /// }
        ///
        /// let (key, value) = map2.insert_unique_unchecked(4, "d");
        /// assert_eq!(key, &4);
        /// assert_eq!(value, &mut "d");
        /// *value = "e";
        ///
        /// assert_eq!(map2[&1], "a");
        /// assert_eq!(map2[&2], "b");
        /// assert_eq!(map2[&3], "c");
        /// assert_eq!(map2[&4], "e");
        /// assert_eq!(map2.len(), 4);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert_unique_unchecked(&mut self, k: K, v: V) -> (&K, &mut V) {
            let hash = make_insert_hash::<K, S>(&self.hash_builder, &k);
            let bucket = self
                .table
                .insert(hash, (k, v), make_hasher::<K, _, V, S>(&self.hash_builder));
            let (k_ref, v_ref) = unsafe { bucket.as_mut() };
            (k_ref, v_ref)
        }

        /// Tries to insert a key-value pair into the map, and returns
        /// a mutable reference to the value in the entry.
        ///
        /// # Errors
        ///
        /// If the map already had this key present, nothing is updated, and
        /// an error containing the occupied entry and the value is returned.
        ///
        /// # Examples
        ///
        /// Basic usage:
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::OccupiedError;
        ///
        /// let mut map = HashMap::new();
        /// assert_eq!(map.try_insert(37, "a").unwrap(), &"a");
        ///
        /// match map.try_insert(37, "b") {
        ///     Err(OccupiedError { entry, value }) => {
        ///         assert_eq!(entry.key(), &37);
        ///         assert_eq!(entry.get(), &"a");
        ///         assert_eq!(value, "b");
        ///     }
        ///     _ => panic!()
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn try_insert(
            &mut self,
            key: K,
            value: V,
        ) -> Result<&mut V, OccupiedError<'_, K, V, S, A>> {
            match self.entry(key) {
                Entry::Occupied(entry) => Err(OccupiedError { entry, value }),
                Entry::Vacant(entry) => Ok(entry.insert(value)),
            }
        }

        /// Removes a key from the map, returning the value at the key if the key
        /// was previously in the map. Keeps the allocated memory for reuse.
        ///
        /// The key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.insert(1, "a");
        /// let capacity_before_remove = map.capacity();
        ///
        /// assert_eq!(map.remove(&1), Some("a"));
        /// assert_eq!(map.remove(&1), None);
        ///
        /// // Now map holds none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.remove_entry(k) {
                Some((_, v)) => Some(v),
                None => None,
            }
        }

        /// Removes a key from the map, returning the stored key and value if the
        /// key was previously in the map. Keeps the allocated memory for reuse.
        ///
        /// The key may be any borrowed form of the map's key type, but
        /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
        /// the key type.
        ///
        /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
        /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.insert(1, "a");
        /// let capacity_before_remove = map.capacity();
        ///
        /// assert_eq!(map.remove_entry(&1), Some((1, "a")));
        /// assert_eq!(map.remove(&1), None);
        ///
        /// // Now map hold none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove_entry<Q: ?Sized>(&mut self, k: &Q) -> Option<(K, V)>
        where
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hash = make_hash::<K, Q, S>(&self.hash_builder, k);
            self.table.remove_entry(hash, equivalent_key(k))
        }
    }

    impl<K, V, S, A: Allocator + Clone> HashMap<K, V, S, A> {
        /// Creates a raw entry builder for the HashMap.
        ///
        /// Raw entries provide the lowest level of control for searching and
        /// manipulating a map. They must be manually initialized with a hash and
        /// then manually searched. After this, insertions into a vacant entry
        /// still require an owned key to be provided.
        ///
        /// Raw entries are useful for such exotic situations as:
        ///
        /// * Hash memoization
        /// * Deferring the creation of an owned key until it is known to be required
        /// * Using a search key that doesn't work with the Borrow trait
        /// * Using custom comparison logic without newtype wrappers
        ///
        /// Because raw entries provide much more low-level control, it's much easier
        /// to put the HashMap into an inconsistent state which, while memory-safe,
        /// will cause the map to produce seemingly random results. Higher-level and
        /// more foolproof APIs like `entry` should be preferred when possible.
        ///
        /// In particular, the hash used to initialized the raw entry must still be
        /// consistent with the hash of the key that is ultimately stored in the entry.
        /// This is because implementations of HashMap may need to recompute hashes
        /// when resizing, at which point only the keys are available.
        ///
        /// Raw entries give mutable access to the keys. This must not be used
        /// to modify how the key would compare or hash, as the map will not re-evaluate
        /// where the key should go, meaning the keys may become "lost" if their
        /// location does not reflect their state. For instance, if you change a key
        /// so that the map now contains keys which compare equal, search may start
        /// acting erratically, with two keys randomly masking each other. Implementations
        /// are free to assume this doesn't happen (within the limits of memory-safety).
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map = HashMap::new();
        /// map.extend([("a", 100), ("b", 200), ("c", 300)]);
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// // Existing key (insert and update)
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => unreachable!(),
        ///     RawEntryMut::Occupied(mut view) => {
        ///         assert_eq!(view.get(), &100);
        ///         let v = view.get_mut();
        ///         let new_v = (*v) * 10;
        ///         *v = new_v;
        ///         assert_eq!(view.insert(1111), 1000);
        ///     }
        /// }
        ///
        /// assert_eq!(map[&"a"], 1111);
        /// assert_eq!(map.len(), 3);
        ///
        /// // Existing key (take)
        /// let hash = compute_hash(map.hasher(), &"c");
        /// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {
        ///     RawEntryMut::Vacant(_) => unreachable!(),
        ///     RawEntryMut::Occupied(view) => {
        ///         assert_eq!(view.remove_entry(), ("c", 300));
        ///     }
        /// }
        /// assert_eq!(map.raw_entry().from_key(&"c"), None);
        /// assert_eq!(map.len(), 2);
        ///
        /// // Nonexistent key (insert and update)
        /// let key = "d";
        /// let hash = compute_hash(map.hasher(), &key);
        /// match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
        ///     RawEntryMut::Occupied(_) => unreachable!(),
        ///     RawEntryMut::Vacant(view) => {
        ///         let (k, value) = view.insert("d", 4000);
        ///         assert_eq!((*k, *value), ("d", 4000));
        ///         *value = 40000;
        ///     }
        /// }
        /// assert_eq!(map[&"d"], 40000);
        /// assert_eq!(map.len(), 3);
        ///
        /// match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
        ///     RawEntryMut::Vacant(_) => unreachable!(),
        ///     RawEntryMut::Occupied(view) => {
        ///         assert_eq!(view.remove_entry(), ("d", 40000));
        ///     }
        /// }
        /// assert_eq!(map.get(&"d"), None);
        /// assert_eq!(map.len(), 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn raw_entry_mut(&mut self) -> RawEntryBuilderMut<'_, K, V, S, A> {
            RawEntryBuilderMut { map: self }
        }

        /// Creates a raw immutable entry builder for the HashMap.
        ///
        /// Raw entries provide the lowest level of control for searching and
        /// manipulating a map. They must be manually initialized with a hash and
        /// then manually searched.
        ///
        /// This is useful for
        /// * Hash memoization
        /// * Using a search key that doesn't work with the Borrow trait
        /// * Using custom comparison logic without newtype wrappers
        ///
        /// Unless you are in such a situation, higher-level and more foolproof APIs like
        /// `get` should be preferred.
        ///
        /// Immutable raw entries have very limited use; you might instead want `raw_entry_mut`.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.extend([("a", 100), ("b", 200), ("c", 300)]);
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// for k in ["a", "b", "c", "d", "e", "f"] {
        ///     let hash = compute_hash(map.hasher(), k);
        ///     let v = map.get(&k).cloned();
        ///     let kv = v.as_ref().map(|v| (&k, v));
        ///
        ///     println!("Key: {} and value: {:?}", k, v);
        ///
        ///     assert_eq!(map.raw_entry().from_key(&k), kv);
        ///     assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
        ///     assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn raw_entry(&self) -> RawEntryBuilder<'_, K, V, S, A> {
            RawEntryBuilder { map: self }
        }

        /// Returns a mutable reference to the [`RawTable`] used underneath [`HashMap`].
        /// This function is only available if the `raw` feature of the crate is enabled.
        ///
        /// # Note
        ///
        /// Calling the function safe, but using raw hash table API's may require
        /// unsafe functions or blocks.
        ///
        /// `RawTable` API gives the lowest level of control under the map that can be useful
        /// for extending the HashMap's API, but may lead to *[undefined behavior]*.
        ///
        /// [`HashMap`]: struct.HashMap.html
        /// [`RawTable`]: raw/struct.RawTable.html
        /// [undefined behavior]: https://doc.rust-lang.org/reference/behavior-considered-undefined.html
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.extend([("a", 10), ("b", 20), ("c", 30)]);
        /// assert_eq!(map.len(), 3);
        ///
        /// // Let's imagine that we have a value and a hash of the key, but not the key itself.
        /// // However, if you want to remove the value from the map by hash and value, and you
        /// // know exactly that the value is unique, then you can create a function like this:
        /// fn remove_by_hash<K, V, S, F>(
        ///     map: &mut HashMap<K, V, S>,
        ///     hash: u64,
        ///     is_match: F,
        /// ) -> Option<(K, V)>
        /// where
        ///     F: Fn(&(K, V)) -> bool,
        /// {
        ///     let raw_table = map.raw_table();
        ///     match raw_table.find(hash, is_match) {
        ///         Some(bucket) => Some(unsafe { raw_table.remove(bucket) }),
        ///         None => None,
        ///     }
        /// }
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let hash = compute_hash(map.hasher(), "a");
        /// assert_eq!(remove_by_hash(&mut map, hash, |(_, v)| *v == 10), Some(("a", 10)));
        /// assert_eq!(map.get(&"a"), None);
        /// assert_eq!(map.len(), 2);
        /// ```
        #[cfg(feature = "raw")]
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn raw_table(&mut self) -> &mut RawTable<(K, V), A> {
            &mut self.table
        }
    }

    impl<K, V, S, A> PartialEq for HashMap<K, V, S, A>
    where
        K: Eq + Hash,
        V: PartialEq,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        fn eq(&self, other: &Self) -> bool {
            if self.len() != other.len() {
                return false;
            }

            self.iter()
                .all(|(key, value)| other.get(key).map_or(false, |v| *value == *v))
        }
    }

    impl<K, V, S, A> Eq for HashMap<K, V, S, A>
    where
        K: Eq + Hash,
        V: Eq,
        S: BuildHasher,
        A: Allocator + Clone,
    {
    }

    impl<K, V, S, A> Debug for HashMap<K, V, S, A>
    where
        K: Debug,
        V: Debug,
        A: Allocator + Clone,
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_map().entries(self.iter()).finish()
        }
    }

    impl<K, V, S, A> Default for HashMap<K, V, S, A>
    where
        S: Default,
        A: Default + Allocator + Clone,
    {
        /// Creates an empty `HashMap<K, V, S, A>`, with the `Default` value for the hasher and allocator.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use std::collections::hash_map::RandomState;
        ///
        /// // You can specify all types of HashMap, including hasher and allocator.
        /// // Created map is empty and don't allocate memory
        /// let map: HashMap<u32, String> = Default::default();
        /// assert_eq!(map.capacity(), 0);
        /// let map: HashMap<u32, String, RandomState> = HashMap::default();
        /// assert_eq!(map.capacity(), 0);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn default() -> Self {
            Self::with_hasher_in(Default::default(), Default::default())
        }
    }

    impl<K, Q: ?Sized, V, S, A> Index<&Q> for HashMap<K, V, S, A>
    where
        K: Eq + Hash + Borrow<Q>,
        Q: Eq + Hash,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        type Output = V;

        /// Returns a reference to the value corresponding to the supplied key.
        ///
        /// # Panics
        ///
        /// Panics if the key is not present in the `HashMap`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let map: HashMap<_, _> = [("a", "One"), ("b", "Two")].into();
        ///
        /// assert_eq!(map[&"a"], "One");
        /// assert_eq!(map[&"b"], "Two");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn index(&self, key: &Q) -> &V {
            self.get(key).expect("no entry found for key")
        }
    }

    // The default hasher is used to match the std implementation signature
    #[cfg(feature = "ahash")]
    impl<K, V, A, const N: usize> From<[(K, V); N]> for HashMap<K, V, DefaultHashBuilder, A>
    where
        K: Eq + Hash,
        A: Default + Allocator + Clone,
    {
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let map1 = HashMap::from([(1, 2), (3, 4)]);
        /// let map2: HashMap<_, _> = [(1, 2), (3, 4)].into();
        /// assert_eq!(map1, map2);
        /// ```
        fn from(arr: [(K, V); N]) -> Self {
            arr.into_iter().collect()
        }
    }

    /// An iterator over the entries of a `HashMap` in arbitrary order.
    /// The iterator element type is `(&'a K, &'a V)`.
    ///
    /// This `struct` is created by the [`iter`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`iter`]: struct.HashMap.html#method.iter
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut iter = map.iter();
    /// let mut vec = vec![iter.next(), iter.next(), iter.next()];
    ///
    /// // The `Iter` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some((&1, &"a")), Some((&2, &"b")), Some((&3, &"c"))]);
    ///
    /// // It is fused iterator
    /// assert_eq!(iter.next(), None);
    /// assert_eq!(iter.next(), None);
    /// ```
    pub struct Iter<'a, K, V> {
        inner: RawIter<(K, V)>,
        marker: PhantomData<(&'a K, &'a V)>,
    }

    // FIXME(#26925) Remove in favor of `#[derive(Clone)]`
    impl<K, V> Clone for Iter<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn clone(&self) -> Self {
            Iter {
                inner: self.inner.clone(),
                marker: PhantomData,
            }
        }
    }

    impl<K: Debug, V: Debug> fmt::Debug for Iter<'_, K, V> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.clone()).finish()
        }
    }

    /// A mutable iterator over the entries of a `HashMap` in arbitrary order.
    /// The iterator element type is `(&'a K, &'a mut V)`.
    ///
    /// This `struct` is created by the [`iter_mut`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`iter_mut`]: struct.HashMap.html#method.iter_mut
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let mut map: HashMap<_, _> = [(1, "One".to_owned()), (2, "Two".into())].into();
    ///
    /// let mut iter = map.iter_mut();
    /// iter.next().map(|(_, v)| v.push_str(" Mississippi"));
    /// iter.next().map(|(_, v)| v.push_str(" Mississippi"));
    ///
    /// // It is fused iterator
    /// assert_eq!(iter.next(), None);
    /// assert_eq!(iter.next(), None);
    ///
    /// assert_eq!(map.get(&1).unwrap(), &"One Mississippi".to_owned());
    /// assert_eq!(map.get(&2).unwrap(), &"Two Mississippi".to_owned());
    /// ```
    pub struct IterMut<'a, K, V> {
        inner: RawIter<(K, V)>,
        // To ensure invariance with respect to V
        marker: PhantomData<(&'a K, &'a mut V)>,
    }

    // We override the default Send impl which has K: Sync instead of K: Send. Both
    // are correct, but this one is more general since it allows keys which
    // implement Send but not Sync.
    unsafe impl<K: Send, V: Send> Send for IterMut<'_, K, V> {}

    impl<K, V> IterMut<'_, K, V> {
        /// Returns a iterator of references over the remaining items.
        #[cfg_attr(feature = "inline-more", inline)]
        pub(super) fn iter(&self) -> Iter<'_, K, V> {
            Iter {
                inner: self.inner.clone(),
                marker: PhantomData,
            }
        }
    }

    /// An owning iterator over the entries of a `HashMap` in arbitrary order.
    /// The iterator element type is `(K, V)`.
    ///
    /// This `struct` is created by the [`into_iter`] method on [`HashMap`]
    /// (provided by the [`IntoIterator`] trait). See its documentation for more.
    /// The map cannot be used after calling that method.
    ///
    /// [`into_iter`]: struct.HashMap.html#method.into_iter
    /// [`HashMap`]: struct.HashMap.html
    /// [`IntoIterator`]: https://doc.rust-lang.org/core/iter/trait.IntoIterator.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut iter = map.into_iter();
    /// let mut vec = vec![iter.next(), iter.next(), iter.next()];
    ///
    /// // The `IntoIter` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some((1, "a")), Some((2, "b")), Some((3, "c"))]);
    ///
    /// // It is fused iterator
    /// assert_eq!(iter.next(), None);
    /// assert_eq!(iter.next(), None);
    /// ```
    pub struct IntoIter<K, V, A: Allocator + Clone = Global> {
        inner: RawIntoIter<(K, V), A>,
    }

    impl<K, V, A: Allocator + Clone> IntoIter<K, V, A> {
        /// Returns a iterator of references over the remaining items.
        #[cfg_attr(feature = "inline-more", inline)]
        pub(super) fn iter(&self) -> Iter<'_, K, V> {
            Iter {
                inner: self.inner.iter(),
                marker: PhantomData,
            }
        }
    }

    /// An owning iterator over the keys of a `HashMap` in arbitrary order.
    /// The iterator element type is `K`.
    ///
    /// This `struct` is created by the [`into_keys`] method on [`HashMap`].
    /// See its documentation for more.
    /// The map cannot be used after calling that method.
    ///
    /// [`into_keys`]: struct.HashMap.html#method.into_keys
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut keys = map.into_keys();
    /// let mut vec = vec![keys.next(), keys.next(), keys.next()];
    ///
    /// // The `IntoKeys` iterator produces keys in arbitrary order, so the
    /// // keys must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some(1), Some(2), Some(3)]);
    ///
    /// // It is fused iterator
    /// assert_eq!(keys.next(), None);
    /// assert_eq!(keys.next(), None);
    /// ```
    pub struct IntoKeys<K, V, A: Allocator + Clone = Global> {
        inner: IntoIter<K, V, A>,
    }

    impl<K, V, A: Allocator + Clone> Iterator for IntoKeys<K, V, A> {
        type Item = K;

        #[inline]
        fn next(&mut self) -> Option<K> {
            self.inner.next().map(|(k, _)| k)
        }
        #[inline]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }

    impl<K, V, A: Allocator + Clone> ExactSizeIterator for IntoKeys<K, V, A> {
        #[inline]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }

    impl<K, V, A: Allocator + Clone> FusedIterator for IntoKeys<K, V, A> {}

    impl<K: Debug, V: Debug, A: Allocator + Clone> fmt::Debug for IntoKeys<K, V, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list()
                .entries(self.inner.iter().map(|(k, _)| k))
                .finish()
        }
    }

    /// An owning iterator over the values of a `HashMap` in arbitrary order.
    /// The iterator element type is `V`.
    ///
    /// This `struct` is created by the [`into_values`] method on [`HashMap`].
    /// See its documentation for more. The map cannot be used after calling that method.
    ///
    /// [`into_values`]: struct.HashMap.html#method.into_values
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut values = map.into_values();
    /// let mut vec = vec![values.next(), values.next(), values.next()];
    ///
    /// // The `IntoValues` iterator produces values in arbitrary order, so
    /// // the values must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some("a"), Some("b"), Some("c")]);
    ///
    /// // It is fused iterator
    /// assert_eq!(values.next(), None);
    /// assert_eq!(values.next(), None);
    /// ```
    pub struct IntoValues<K, V, A: Allocator + Clone = Global> {
        inner: IntoIter<K, V, A>,
    }

    impl<K, V, A: Allocator + Clone> Iterator for IntoValues<K, V, A> {
        type Item = V;

        #[inline]
        fn next(&mut self) -> Option<V> {
            self.inner.next().map(|(_, v)| v)
        }
        #[inline]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }

    impl<K, V, A: Allocator + Clone> ExactSizeIterator for IntoValues<K, V, A> {
        #[inline]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }

    impl<K, V, A: Allocator + Clone> FusedIterator for IntoValues<K, V, A> {}

    impl<K, V: Debug, A: Allocator + Clone> fmt::Debug for IntoValues<K, V, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list()
                .entries(self.inner.iter().map(|(_, v)| v))
                .finish()
        }
    }

    /// An iterator over the keys of a `HashMap` in arbitrary order.
    /// The iterator element type is `&'a K`.
    ///
    /// This `struct` is created by the [`keys`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`keys`]: struct.HashMap.html#method.keys
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut keys = map.keys();
    /// let mut vec = vec![keys.next(), keys.next(), keys.next()];
    ///
    /// // The `Keys` iterator produces keys in arbitrary order, so the
    /// // keys must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some(&1), Some(&2), Some(&3)]);
    ///
    /// // It is fused iterator
    /// assert_eq!(keys.next(), None);
    /// assert_eq!(keys.next(), None);
    /// ```
    pub struct Keys<'a, K, V> {
        inner: Iter<'a, K, V>,
    }

    // FIXME(#26925) Remove in favor of `#[derive(Clone)]`
    impl<K, V> Clone for Keys<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn clone(&self) -> Self {
            Keys {
                inner: self.inner.clone(),
            }
        }
    }

    impl<K: Debug, V> fmt::Debug for Keys<'_, K, V> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.clone()).finish()
        }
    }

    /// An iterator over the values of a `HashMap` in arbitrary order.
    /// The iterator element type is `&'a V`.
    ///
    /// This `struct` is created by the [`values`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`values`]: struct.HashMap.html#method.values
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut values = map.values();
    /// let mut vec = vec![values.next(), values.next(), values.next()];
    ///
    /// // The `Values` iterator produces values in arbitrary order, so the
    /// // values must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some(&"a"), Some(&"b"), Some(&"c")]);
    ///
    /// // It is fused iterator
    /// assert_eq!(values.next(), None);
    /// assert_eq!(values.next(), None);
    /// ```
    pub struct Values<'a, K, V> {
        inner: Iter<'a, K, V>,
    }

    // FIXME(#26925) Remove in favor of `#[derive(Clone)]`
    impl<K, V> Clone for Values<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn clone(&self) -> Self {
            Values {
                inner: self.inner.clone(),
            }
        }
    }

    impl<K, V: Debug> fmt::Debug for Values<'_, K, V> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.clone()).finish()
        }
    }

    /// A draining iterator over the entries of a `HashMap` in arbitrary
    /// order. The iterator element type is `(K, V)`.
    ///
    /// This `struct` is created by the [`drain`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`drain`]: struct.HashMap.html#method.drain
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let mut map: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut drain_iter = map.drain();
    /// let mut vec = vec![drain_iter.next(), drain_iter.next(), drain_iter.next()];
    ///
    /// // The `Drain` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some((1, "a")), Some((2, "b")), Some((3, "c"))]);
    ///
    /// // It is fused iterator
    /// assert_eq!(drain_iter.next(), None);
    /// assert_eq!(drain_iter.next(), None);
    /// ```
    pub struct Drain<'a, K, V, A: Allocator + Clone = Global> {
        inner: RawDrain<'a, (K, V), A>,
    }

    impl<K, V, A: Allocator + Clone> Drain<'_, K, V, A> {
        /// Returns a iterator of references over the remaining items.
        #[cfg_attr(feature = "inline-more", inline)]
        pub(super) fn iter(&self) -> Iter<'_, K, V> {
            Iter {
                inner: self.inner.iter(),
                marker: PhantomData,
            }
        }
    }

    /// A draining iterator over entries of a `HashMap` which don't satisfy the predicate
    /// `f(&k, &mut v)` in arbitrary order. The iterator element type is `(K, V)`.
    ///
    /// This `struct` is created by the [`drain_filter`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`drain_filter`]: struct.HashMap.html#method.drain_filter
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let mut map: HashMap<i32, &str> = [(1, "a"), (2, "b"), (3, "c")].into();
    ///
    /// let mut drain_filter = map.drain_filter(|k, _v| k % 2 != 0);
    /// let mut vec = vec![drain_filter.next(), drain_filter.next()];
    ///
    /// // The `DrainFilter` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [Some((1, "a")),Some((3, "c"))]);
    ///
    /// // It is fused iterator
    /// assert_eq!(drain_filter.next(), None);
    /// assert_eq!(drain_filter.next(), None);
    /// drop(drain_filter);
    ///
    /// assert_eq!(map.len(), 1);
    /// ```
    pub struct DrainFilter<'a, K, V, F, A: Allocator + Clone = Global>
    where
        F: FnMut(&K, &mut V) -> bool,
    {
        f: F,
        inner: DrainFilterInner<'a, K, V, A>,
    }

    impl<'a, K, V, F, A> Drop for DrainFilter<'a, K, V, F, A>
    where
        F: FnMut(&K, &mut V) -> bool,
        A: Allocator + Clone,
    {
        #[cfg_attr(feature = "inline-more", inline)]
        fn drop(&mut self) {
            while let Some(item) = self.next() {
                let guard = ConsumeAllOnDrop(self);
                drop(item);
                mem::forget(guard);
            }
        }
    }

    pub(super) struct ConsumeAllOnDrop<'a, T: Iterator>(pub &'a mut T);

    impl<T: Iterator> Drop for ConsumeAllOnDrop<'_, T> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn drop(&mut self) {
            self.0.for_each(drop);
        }
    }

    impl<K, V, F, A> Iterator for DrainFilter<'_, K, V, F, A>
    where
        F: FnMut(&K, &mut V) -> bool,
        A: Allocator + Clone,
    {
        type Item = (K, V);

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<Self::Item> {
            self.inner.next(&mut self.f)
        }

        #[inline]
        fn size_hint(&self) -> (usize, Option<usize>) {
            (0, self.inner.iter.size_hint().1)
        }
    }

    impl<K, V, F> FusedIterator for DrainFilter<'_, K, V, F> where F: FnMut(&K, &mut V) -> bool {}

    /// Portions of `DrainFilter` shared with `set::DrainFilter`
    pub(super) struct DrainFilterInner<'a, K, V, A: Allocator + Clone> {
        pub iter: RawIter<(K, V)>,
        pub table: &'a mut RawTable<(K, V), A>,
    }

    impl<K, V, A: Allocator + Clone> DrainFilterInner<'_, K, V, A> {
        #[cfg_attr(feature = "inline-more", inline)]
        pub(super) fn next<F>(&mut self, f: &mut F) -> Option<(K, V)>
        where
            F: FnMut(&K, &mut V) -> bool,
        {
            unsafe {
                for item in &mut self.iter {
                    let &mut (ref key, ref mut value) = item.as_mut();
                    if f(key, value) {
                        return Some(self.table.remove(item));
                    }
                }
            }
            None
        }
    }

    /// A mutable iterator over the values of a `HashMap` in arbitrary order.
    /// The iterator element type is `&'a mut V`.
    ///
    /// This `struct` is created by the [`values_mut`] method on [`HashMap`]. See its
    /// documentation for more.
    ///
    /// [`values_mut`]: struct.HashMap.html#method.values_mut
    /// [`HashMap`]: struct.HashMap.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::HashMap;
    ///
    /// let mut map: HashMap<_, _> = [(1, "One".to_owned()), (2, "Two".into())].into();
    ///
    /// let mut values = map.values_mut();
    /// values.next().map(|v| v.push_str(" Mississippi"));
    /// values.next().map(|v| v.push_str(" Mississippi"));
    ///
    /// // It is fused iterator
    /// assert_eq!(values.next(), None);
    /// assert_eq!(values.next(), None);
    ///
    /// assert_eq!(map.get(&1).unwrap(), &"One Mississippi".to_owned());
    /// assert_eq!(map.get(&2).unwrap(), &"Two Mississippi".to_owned());
    /// ```
    pub struct ValuesMut<'a, K, V> {
        inner: IterMut<'a, K, V>,
    }

    /// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
    ///
    /// See the [`HashMap::raw_entry_mut`] docs for usage examples.
    ///
    /// [`HashMap::raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{RawEntryBuilderMut, RawEntryMut::Vacant, RawEntryMut::Occupied};
    /// use hashbrown::HashMap;
    /// use core::hash::{BuildHasher, Hash};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([(1, 11), (2, 12), (3, 13), (4, 14), (5, 15), (6, 16)]);
    /// assert_eq!(map.len(), 6);
    ///
    /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
    ///     use core::hash::Hasher;
    ///     let mut state = hash_builder.build_hasher();
    ///     key.hash(&mut state);
    ///     state.finish()
    /// }
    ///
    /// let builder: RawEntryBuilderMut<_, _, _> = map.raw_entry_mut();
    ///
    /// // Existing key
    /// match builder.from_key(&6) {
    ///     Vacant(_) => unreachable!(),
    ///     Occupied(view) => assert_eq!(view.get(), &16),
    /// }
    ///
    /// for key in 0..12 {
    ///     let hash = compute_hash(map.hasher(), &key);
    ///     let value = map.get(&key).cloned();
    ///     let key_value = value.as_ref().map(|v| (&key, v));
    ///
    ///     println!("Key: {} and value: {:?}", key, value);
    ///
    ///     match map.raw_entry_mut().from_key(&key) {
    ///         Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
    ///         Vacant(_) => assert_eq!(value, None),
    ///     }
    ///     match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {
    ///         Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
    ///         Vacant(_) => assert_eq!(value, None),
    ///     }
    ///     match map.raw_entry_mut().from_hash(hash, |q| *q == key) {
    ///         Occupied(mut o) => assert_eq!(Some(o.get_key_value()), key_value),
    ///         Vacant(_) => assert_eq!(value, None),
    ///     }
    /// }
    ///
    /// assert_eq!(map.len(), 6);
    /// ```
    pub struct RawEntryBuilderMut<'a, K, V, S, A: Allocator + Clone = Global> {
        map: &'a mut HashMap<K, V, S, A>,
    }

    /// A view into a single entry in a map, which may either be vacant or occupied.
    ///
    /// This is a lower-level version of [`Entry`].
    ///
    /// This `enum` is constructed through the [`raw_entry_mut`] method on [`HashMap`],
    /// then calling one of the methods of that [`RawEntryBuilderMut`].
    ///
    /// [`HashMap`]: struct.HashMap.html
    /// [`Entry`]: enum.Entry.html
    /// [`raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
    /// [`RawEntryBuilderMut`]: struct.RawEntryBuilderMut.html
    ///
    /// # Examples
    ///
    /// ```
    /// use core::hash::{BuildHasher, Hash};
    /// use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([('a', 1), ('b', 2), ('c', 3)]);
    /// assert_eq!(map.len(), 3);
    ///
    /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
    ///     use core::hash::Hasher;
    ///     let mut state = hash_builder.build_hasher();
    ///     key.hash(&mut state);
    ///     state.finish()
    /// }
    ///
    /// // Existing key (insert)
    /// let raw: RawEntryMut<_, _, _> = map.raw_entry_mut().from_key(&'a');
    /// let _raw_o: RawOccupiedEntryMut<_, _, _> = raw.insert('a', 10);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Nonexistent key (insert)
    /// map.raw_entry_mut().from_key(&'d').insert('d', 40);
    /// assert_eq!(map.len(), 4);
    ///
    /// // Existing key (or_insert)
    /// let hash = compute_hash(map.hasher(), &'b');
    /// let kv = map
    ///     .raw_entry_mut()
    ///     .from_key_hashed_nocheck(hash, &'b')
    ///     .or_insert('b', 20);
    /// assert_eq!(kv, (&mut 'b', &mut 2));
    /// *kv.1 = 20;
    /// assert_eq!(map.len(), 4);
    ///
    /// // Nonexistent key (or_insert)
    /// let hash = compute_hash(map.hasher(), &'e');
    /// let kv = map
    ///     .raw_entry_mut()
    ///     .from_key_hashed_nocheck(hash, &'e')
    ///     .or_insert('e', 50);
    /// assert_eq!(kv, (&mut 'e', &mut 50));
    /// assert_eq!(map.len(), 5);
    ///
    /// // Existing key (or_insert_with)
    /// let hash = compute_hash(map.hasher(), &'c');
    /// let kv = map
    ///     .raw_entry_mut()
    ///     .from_hash(hash, |q| q == &'c')
    ///     .or_insert_with(|| ('c', 30));
    /// assert_eq!(kv, (&mut 'c', &mut 3));
    /// *kv.1 = 30;
    /// assert_eq!(map.len(), 5);
    ///
    /// // Nonexistent key (or_insert_with)
    /// let hash = compute_hash(map.hasher(), &'f');
    /// let kv = map
    ///     .raw_entry_mut()
    ///     .from_hash(hash, |q| q == &'f')
    ///     .or_insert_with(|| ('f', 60));
    /// assert_eq!(kv, (&mut 'f', &mut 60));
    /// assert_eq!(map.len(), 6);
    ///
    /// println!("Our HashMap: {:?}", map);
    ///
    /// let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();
    /// // The `Iter` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [('a', 10), ('b', 20), ('c', 30), ('d', 40), ('e', 50), ('f', 60)]);
    /// ```
    pub enum RawEntryMut<'a, K, V, S, A: Allocator + Clone = Global> {
        /// An occupied entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::{hash_map::RawEntryMut, HashMap};
        /// let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => unreachable!(),
        ///     RawEntryMut::Occupied(_) => { }
        /// }
        /// ```
        Occupied(RawOccupiedEntryMut<'a, K, V, S, A>),
        /// A vacant entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::{hash_map::RawEntryMut, HashMap};
        /// let mut map: HashMap<&str, i32> = HashMap::new();
        ///
        /// match map.raw_entry_mut().from_key("a") {
        ///     RawEntryMut::Occupied(_) => unreachable!(),
        ///     RawEntryMut::Vacant(_) => { }
        /// }
        /// ```
        Vacant(RawVacantEntryMut<'a, K, V, S, A>),
    }

    /// A view into an occupied entry in a `HashMap`.
    /// It is part of the [`RawEntryMut`] enum.
    ///
    /// [`RawEntryMut`]: enum.RawEntryMut.html
    ///
    /// # Examples
    ///
    /// ```
    /// use core::hash::{BuildHasher, Hash};
    /// use hashbrown::hash_map::{HashMap, RawEntryMut, RawOccupiedEntryMut};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([("a", 10), ("b", 20), ("c", 30)]);
    ///
    /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
    ///     use core::hash::Hasher;
    ///     let mut state = hash_builder.build_hasher();
    ///     key.hash(&mut state);
    ///     state.finish()
    /// }
    ///
    /// let _raw_o: RawOccupiedEntryMut<_, _, _> = map.raw_entry_mut().from_key(&"a").insert("a", 100);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (insert and update)
    /// match map.raw_entry_mut().from_key(&"a") {
    ///     RawEntryMut::Vacant(_) => unreachable!(),
    ///     RawEntryMut::Occupied(mut view) => {
    ///         assert_eq!(view.get(), &100);
    ///         let v = view.get_mut();
    ///         let new_v = (*v) * 10;
    ///         *v = new_v;
    ///         assert_eq!(view.insert(1111), 1000);
    ///     }
    /// }
    ///
    /// assert_eq!(map[&"a"], 1111);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (take)
    /// let hash = compute_hash(map.hasher(), &"c");
    /// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"c") {
    ///     RawEntryMut::Vacant(_) => unreachable!(),
    ///     RawEntryMut::Occupied(view) => {
    ///         assert_eq!(view.remove_entry(), ("c", 30));
    ///     }
    /// }
    /// assert_eq!(map.raw_entry().from_key(&"c"), None);
    /// assert_eq!(map.len(), 2);
    ///
    /// let hash = compute_hash(map.hasher(), &"b");
    /// match map.raw_entry_mut().from_hash(hash, |q| *q == "b") {
    ///     RawEntryMut::Vacant(_) => unreachable!(),
    ///     RawEntryMut::Occupied(view) => {
    ///         assert_eq!(view.remove_entry(), ("b", 20));
    ///     }
    /// }
    /// assert_eq!(map.get(&"b"), None);
    /// assert_eq!(map.len(), 1);
    /// ```
    pub struct RawOccupiedEntryMut<'a, K, V, S, A: Allocator + Clone = Global> {
        elem: Bucket<(K, V)>,
        table: &'a mut RawTable<(K, V), A>,
        hash_builder: &'a S,
    }

    unsafe impl<K, V, S, A> Send for RawOccupiedEntryMut<'_, K, V, S, A>
    where
        K: Send,
        V: Send,
        S: Send,
        A: Send + Allocator + Clone,
    {
    }
    unsafe impl<K, V, S, A> Sync for RawOccupiedEntryMut<'_, K, V, S, A>
    where
        K: Sync,
        V: Sync,
        S: Sync,
        A: Sync + Allocator + Clone,
    {
    }

    /// A view into a vacant entry in a `HashMap`.
    /// It is part of the [`RawEntryMut`] enum.
    ///
    /// [`RawEntryMut`]: enum.RawEntryMut.html
    ///
    /// # Examples
    ///
    /// ```
    /// use core::hash::{BuildHasher, Hash};
    /// use hashbrown::hash_map::{HashMap, RawEntryMut, RawVacantEntryMut};
    ///
    /// let mut map = HashMap::<&str, i32>::new();
    ///
    /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
    ///     use core::hash::Hasher;
    ///     let mut state = hash_builder.build_hasher();
    ///     key.hash(&mut state);
    ///     state.finish()
    /// }
    ///
    /// let raw_v: RawVacantEntryMut<_, _, _> = match map.raw_entry_mut().from_key(&"a") {
    ///     RawEntryMut::Vacant(view) => view,
    ///     RawEntryMut::Occupied(_) => unreachable!(),
    /// };
    /// raw_v.insert("a", 10);
    /// assert!(map[&"a"] == 10 && map.len() == 1);
    ///
    /// // Nonexistent key (insert and update)
    /// let hash = compute_hash(map.hasher(), &"b");
    /// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &"b") {
    ///     RawEntryMut::Occupied(_) => unreachable!(),
    ///     RawEntryMut::Vacant(view) => {
    ///         let (k, value) = view.insert("b", 2);
    ///         assert_eq!((*k, *value), ("b", 2));
    ///         *value = 20;
    ///     }
    /// }
    /// assert!(map[&"b"] == 20 && map.len() == 2);
    ///
    /// let hash = compute_hash(map.hasher(), &"c");
    /// match map.raw_entry_mut().from_hash(hash, |q| *q == "c") {
    ///     RawEntryMut::Occupied(_) => unreachable!(),
    ///     RawEntryMut::Vacant(view) => {
    ///         assert_eq!(view.insert("c", 30), (&mut "c", &mut 30));
    ///     }
    /// }
    /// assert!(map[&"c"] == 30 && map.len() == 3);
    /// ```
    pub struct RawVacantEntryMut<'a, K, V, S, A: Allocator + Clone = Global> {
        table: &'a mut RawTable<(K, V), A>,
        hash_builder: &'a S,
    }

    /// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
    ///
    /// See the [`HashMap::raw_entry`] docs for usage examples.
    ///
    /// [`HashMap::raw_entry`]: struct.HashMap.html#method.raw_entry
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{HashMap, RawEntryBuilder};
    /// use core::hash::{BuildHasher, Hash};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([(1, 10), (2, 20), (3, 30)]);
    ///
    /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
    ///     use core::hash::Hasher;
    ///     let mut state = hash_builder.build_hasher();
    ///     key.hash(&mut state);
    ///     state.finish()
    /// }
    ///
    /// for k in 0..6 {
    ///     let hash = compute_hash(map.hasher(), &k);
    ///     let v = map.get(&k).cloned();
    ///     let kv = v.as_ref().map(|v| (&k, v));
    ///
    ///     println!("Key: {} and value: {:?}", k, v);
    ///     let builder: RawEntryBuilder<_, _, _> = map.raw_entry();
    ///     assert_eq!(builder.from_key(&k), kv);
    ///     assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
    ///     assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);
    /// }
    /// ```
    pub struct RawEntryBuilder<'a, K, V, S, A: Allocator + Clone = Global> {
        map: &'a HashMap<K, V, S, A>,
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawEntryBuilderMut<'a, K, V, S, A> {
        /// Creates a `RawEntryMut` from the given key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let key = "a";
        /// let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key(&key);
        /// entry.insert(key, 100);
        /// assert_eq!(map[&"a"], 100);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_key<Q: ?Sized>(self, k: &Q) -> RawEntryMut<'a, K, V, S, A>
        where
            S: BuildHasher,
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hash = make_hash::<K, Q, S>(&self.map.hash_builder, k);
            self.from_key_hashed_nocheck(hash, k)
        }

        /// Creates a `RawEntryMut` from the given key and its hash.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let key = "a";
        /// let hash = compute_hash(map.hasher(), &key);
        /// let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_key_hashed_nocheck(hash, &key);
        /// entry.insert(key, 100);
        /// assert_eq!(map[&"a"], 100);
        /// ```
        #[inline]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_key_hashed_nocheck<Q: ?Sized>(self, hash: u64, k: &Q) -> RawEntryMut<'a, K, V, S, A>
        where
            K: Borrow<Q>,
            Q: Eq,
        {
            self.from_hash(hash, equivalent(k))
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawEntryBuilderMut<'a, K, V, S, A> {
        /// Creates a `RawEntryMut` from the given hash and matching function.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let key = "a";
        /// let hash = compute_hash(map.hasher(), &key);
        /// let entry: RawEntryMut<&str, u32, _> = map.raw_entry_mut().from_hash(hash, |k| k == &key);
        /// entry.insert(key, 100);
        /// assert_eq!(map[&"a"], 100);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_hash<F>(self, hash: u64, is_match: F) -> RawEntryMut<'a, K, V, S, A>
        where
            for<'b> F: FnMut(&'b K) -> bool,
        {
            self.search(hash, is_match)
        }

        #[cfg_attr(feature = "inline-more", inline)]
        fn search<F>(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S, A>
        where
            for<'b> F: FnMut(&'b K) -> bool,
        {
            match self.map.table.find(hash, |(k, _)| is_match(k)) {
                Some(elem) => RawEntryMut::Occupied(RawOccupiedEntryMut {
                    elem,
                    table: &mut self.map.table,
                    hash_builder: &self.map.hash_builder,
                }),
                None => RawEntryMut::Vacant(RawVacantEntryMut {
                    table: &mut self.map.table,
                    hash_builder: &self.map.hash_builder,
                }),
            }
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawEntryBuilder<'a, K, V, S, A> {
        /// Access an immutable entry by key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        /// let key = "a";
        /// assert_eq!(map.raw_entry().from_key(&key), Some((&"a", &100)));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_key<Q: ?Sized>(self, k: &Q) -> Option<(&'a K, &'a V)>
        where
            S: BuildHasher,
            K: Borrow<Q>,
            Q: Hash + Eq,
        {
            let hash = make_hash::<K, Q, S>(&self.map.hash_builder, k);
            self.from_key_hashed_nocheck(hash, k)
        }

        /// Access an immutable entry by a key and its hash.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::HashMap;
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        /// let key = "a";
        /// let hash = compute_hash(map.hasher(), &key);
        /// assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &key), Some((&"a", &100)));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_key_hashed_nocheck<Q: ?Sized>(self, hash: u64, k: &Q) -> Option<(&'a K, &'a V)>
        where
            K: Borrow<Q>,
            Q: Eq,
        {
            self.from_hash(hash, equivalent(k))
        }

        #[cfg_attr(feature = "inline-more", inline)]
        fn search<F>(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)>
        where
            F: FnMut(&K) -> bool,
        {
            match self.map.table.get(hash, |(k, _)| is_match(k)) {
                Some(&(ref key, ref value)) => Some((key, value)),
                None => None,
            }
        }

        /// Access an immutable entry by hash and matching function.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::HashMap;
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        /// let key = "a";
        /// let hash = compute_hash(map.hasher(), &key);
        /// assert_eq!(map.raw_entry().from_hash(hash, |k| k == &key), Some((&"a", &100)));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::wrong_self_convention)]
        pub fn from_hash<F>(self, hash: u64, is_match: F) -> Option<(&'a K, &'a V)>
        where
            F: FnMut(&K) -> bool,
        {
            self.search(hash, is_match)
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawEntryMut<'a, K, V, S, A> {
        /// Sets the value of the entry, and returns a RawOccupiedEntryMut.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let entry = map.raw_entry_mut().from_key("horseyland").insert("horseyland", 37);
        ///
        /// assert_eq!(entry.remove_entry(), ("horseyland", 37));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, key: K, value: V) -> RawOccupiedEntryMut<'a, K, V, S, A>
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                RawEntryMut::Occupied(mut entry) => {
                    entry.insert(value);
                    entry
                }
                RawEntryMut::Vacant(entry) => entry.insert_entry(key, value),
            }
        }

        /// Ensures a value is in the entry by inserting the default if empty, and returns
        /// mutable references to the key and value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 3);
        /// assert_eq!(map["poneyland"], 3);
        ///
        /// *map.raw_entry_mut().from_key("poneyland").or_insert("poneyland", 10).1 *= 2;
        /// assert_eq!(map["poneyland"], 6);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert(self, default_key: K, default_val: V) -> (&'a mut K, &'a mut V)
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                RawEntryMut::Occupied(entry) => entry.into_key_value(),
                RawEntryMut::Vacant(entry) => entry.insert(default_key, default_val),
            }
        }

        /// Ensures a value is in the entry by inserting the result of the default function if empty,
        /// and returns mutable references to the key and value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, String> = HashMap::new();
        ///
        /// map.raw_entry_mut().from_key("poneyland").or_insert_with(|| {
        ///     ("poneyland", "hoho".to_string())
        /// });
        ///
        /// assert_eq!(map["poneyland"], "hoho".to_string());
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert_with<F>(self, default: F) -> (&'a mut K, &'a mut V)
        where
            F: FnOnce() -> (K, V),
            K: Hash,
            S: BuildHasher,
        {
            match self {
                RawEntryMut::Occupied(entry) => entry.into_key_value(),
                RawEntryMut::Vacant(entry) => {
                    let (k, v) = default();
                    entry.insert(k, v)
                }
            }
        }

        /// Provides in-place mutable access to an occupied entry before any
        /// potential inserts into the map.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// map.raw_entry_mut()
        ///    .from_key("poneyland")
        ///    .and_modify(|_k, v| { *v += 1 })
        ///    .or_insert("poneyland", 42);
        /// assert_eq!(map["poneyland"], 42);
        ///
        /// map.raw_entry_mut()
        ///    .from_key("poneyland")
        ///    .and_modify(|_k, v| { *v += 1 })
        ///    .or_insert("poneyland", 0);
        /// assert_eq!(map["poneyland"], 43);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_modify<F>(self, f: F) -> Self
        where
            F: FnOnce(&mut K, &mut V),
        {
            match self {
                RawEntryMut::Occupied(mut entry) => {
                    {
                        let (k, v) = entry.get_key_value_mut();
                        f(k, v);
                    }
                    RawEntryMut::Occupied(entry)
                }
                RawEntryMut::Vacant(entry) => RawEntryMut::Vacant(entry),
            }
        }

        /// Provides shared access to the key and owned access to the value of
        /// an occupied entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::RawEntryMut;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// let entry = map
        ///     .raw_entry_mut()
        ///     .from_key("poneyland")
        ///     .and_replace_entry_with(|_k, _v| panic!());
        ///
        /// match entry {
        ///     RawEntryMut::Vacant(_) => {},
        ///     RawEntryMut::Occupied(_) => panic!(),
        /// }
        ///
        /// map.insert("poneyland", 42);
        ///
        /// let entry = map
        ///     .raw_entry_mut()
        ///     .from_key("poneyland")
        ///     .and_replace_entry_with(|k, v| {
        ///         assert_eq!(k, &"poneyland");
        ///         assert_eq!(v, 42);
        ///         Some(v + 1)
        ///     });
        ///
        /// match entry {
        ///     RawEntryMut::Occupied(e) => {
        ///         assert_eq!(e.key(), &"poneyland");
        ///         assert_eq!(e.get(), &43);
        ///     },
        ///     RawEntryMut::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(map["poneyland"], 43);
        ///
        /// let entry = map
        ///     .raw_entry_mut()
        ///     .from_key("poneyland")
        ///     .and_replace_entry_with(|_k, _v| None);
        ///
        /// match entry {
        ///     RawEntryMut::Vacant(_) => {},
        ///     RawEntryMut::Occupied(_) => panic!(),
        /// }
        ///
        /// assert!(!map.contains_key("poneyland"));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_replace_entry_with<F>(self, f: F) -> Self
        where
            F: FnOnce(&K, V) -> Option<V>,
        {
            match self {
                RawEntryMut::Occupied(entry) => entry.replace_entry_with(f),
                RawEntryMut::Vacant(_) => self,
            }
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawOccupiedEntryMut<'a, K, V, S, A> {
        /// Gets a reference to the key in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => assert_eq!(o.key(), &"a")
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &K {
            unsafe { &self.elem.as_ref().0 }
        }

        /// Gets a mutable reference to the key in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        /// use std::rc::Rc;
        ///
        /// let key_one = Rc::new("a");
        /// let key_two = Rc::new("a");
        ///
        /// let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
        /// map.insert(key_one.clone(), 10);
        ///
        /// assert_eq!(map[&key_one], 10);
        /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        /// match map.raw_entry_mut().from_key(&key_one) {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(mut o) => {
        ///         *o.key_mut() = key_two.clone();
        ///     }
        /// }
        /// assert_eq!(map[&key_two], 10);
        /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key_mut(&mut self) -> &mut K {
            unsafe { &mut self.elem.as_mut().0 }
        }

        /// Converts the entry into a mutable reference to the key in the entry
        /// with a lifetime bound to the map itself.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        /// use std::rc::Rc;
        ///
        /// let key_one = Rc::new("a");
        /// let key_two = Rc::new("a");
        ///
        /// let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
        /// map.insert(key_one.clone(), 10);
        ///
        /// assert_eq!(map[&key_one], 10);
        /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        /// let inside_key: &mut Rc<&str>;
        ///
        /// match map.raw_entry_mut().from_key(&key_one) {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => inside_key = o.into_key(),
        /// }
        /// *inside_key = key_two.clone();
        ///
        /// assert_eq!(map[&key_two], 10);
        /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_key(self) -> &'a mut K {
            unsafe { &mut self.elem.as_mut().0 }
        }

        /// Gets a reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => assert_eq!(o.get(), &100),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get(&self) -> &V {
            unsafe { &self.elem.as_ref().1 }
        }

        /// Converts the OccupiedEntry into a mutable reference to the value in the entry
        /// with a lifetime bound to the map itself.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// let value: &mut u32;
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => value = o.into_mut(),
        /// }
        /// *value += 900;
        ///
        /// assert_eq!(map[&"a"], 1000);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_mut(self) -> &'a mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Gets a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(mut o) => *o.get_mut() += 900,
        /// }
        ///
        /// assert_eq!(map[&"a"], 1000);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_mut(&mut self) -> &mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Gets a reference to the key and value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => assert_eq!(o.get_key_value(), (&"a", &100)),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_key_value(&self) -> (&K, &V) {
            unsafe {
                let &(ref key, ref value) = self.elem.as_ref();
                (key, value)
            }
        }

        /// Gets a mutable reference to the key and value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        /// use std::rc::Rc;
        ///
        /// let key_one = Rc::new("a");
        /// let key_two = Rc::new("a");
        ///
        /// let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
        /// map.insert(key_one.clone(), 10);
        ///
        /// assert_eq!(map[&key_one], 10);
        /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        /// match map.raw_entry_mut().from_key(&key_one) {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(mut o) => {
        ///         let (inside_key, inside_value) = o.get_key_value_mut();
        ///         *inside_key = key_two.clone();
        ///         *inside_value = 100;
        ///     }
        /// }
        /// assert_eq!(map[&key_two], 100);
        /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_key_value_mut(&mut self) -> (&mut K, &mut V) {
            unsafe {
                let &mut (ref mut key, ref mut value) = self.elem.as_mut();
                (key, value)
            }
        }

        /// Converts the OccupiedEntry into a mutable reference to the key and value in the entry
        /// with a lifetime bound to the map itself.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        /// use std::rc::Rc;
        ///
        /// let key_one = Rc::new("a");
        /// let key_two = Rc::new("a");
        ///
        /// let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
        /// map.insert(key_one.clone(), 10);
        ///
        /// assert_eq!(map[&key_one], 10);
        /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        /// let inside_key: &mut Rc<&str>;
        /// let inside_value: &mut u32;
        /// match map.raw_entry_mut().from_key(&key_one) {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => {
        ///         let tuple = o.into_key_value();
        ///         inside_key = tuple.0;
        ///         inside_value = tuple.1;
        ///     }
        /// }
        /// *inside_key = key_two.clone();
        /// *inside_value = 100;
        /// assert_eq!(map[&key_two], 100);
        /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_key_value(self) -> (&'a mut K, &'a mut V) {
            unsafe {
                let &mut (ref mut key, ref mut value) = self.elem.as_mut();
                (key, value)
            }
        }

        /// Sets the value of the entry, and returns the entry's old value.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(mut o) => assert_eq!(o.insert(1000), 100),
        /// }
        ///
        /// assert_eq!(map[&"a"], 1000);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(&mut self, value: V) -> V {
            mem::replace(self.get_mut(), value)
        }

        /// Sets the value of the entry, and returns the entry's old value.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        /// use std::rc::Rc;
        ///
        /// let key_one = Rc::new("a");
        /// let key_two = Rc::new("a");
        ///
        /// let mut map: HashMap<Rc<&str>, u32> = HashMap::new();
        /// map.insert(key_one.clone(), 10);
        ///
        /// assert_eq!(map[&key_one], 10);
        /// assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        /// match map.raw_entry_mut().from_key(&key_one) {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(mut o) => {
        ///         let old_key = o.insert_key(key_two.clone());
        ///         assert!(Rc::ptr_eq(&old_key, &key_one));
        ///     }
        /// }
        /// assert_eq!(map[&key_two], 10);
        /// assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert_key(&mut self, key: K) -> K {
            mem::replace(self.key_mut(), key)
        }

        /// Takes the value out of the entry, and returns it.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => assert_eq!(o.remove(), 100),
        /// }
        /// assert_eq!(map.get(&"a"), None);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove(self) -> V {
            self.remove_entry().1
        }

        /// Take the ownership of the key and value from the map.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => assert_eq!(o.remove_entry(), ("a", 100)),
        /// }
        /// assert_eq!(map.get(&"a"), None);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove_entry(self) -> (K, V) {
            unsafe { self.table.remove(self.elem) }
        }

        /// Provides shared access to the key and owned access to the value of
        /// the entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// let raw_entry = match map.raw_entry_mut().from_key(&"a") {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => o.replace_entry_with(|k, v| {
        ///         assert_eq!(k, &"a");
        ///         assert_eq!(v, 100);
        ///         Some(v + 900)
        ///     }),
        /// };
        /// let raw_entry = match raw_entry {
        ///     RawEntryMut::Vacant(_) => panic!(),
        ///     RawEntryMut::Occupied(o) => o.replace_entry_with(|k, v| {
        ///         assert_eq!(k, &"a");
        ///         assert_eq!(v, 1000);
        ///         None
        ///     }),
        /// };
        /// match raw_entry {
        ///     RawEntryMut::Vacant(_) => { },
        ///     RawEntryMut::Occupied(_) => panic!(),
        /// };
        /// assert_eq!(map.get(&"a"), None);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_entry_with<F>(self, f: F) -> RawEntryMut<'a, K, V, S, A>
        where
            F: FnOnce(&K, V) -> Option<V>,
        {
            unsafe {
                let still_occupied = self
                    .table
                    .replace_bucket_with(self.elem.clone(), |(key, value)| {
                        f(&key, value).map(|new_value| (key, new_value))
                    });

                if still_occupied {
                    RawEntryMut::Occupied(self)
                } else {
                    RawEntryMut::Vacant(RawVacantEntryMut {
                        table: self.table,
                        hash_builder: self.hash_builder,
                    })
                }
            }
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> RawVacantEntryMut<'a, K, V, S, A> {
        /// Sets the value of the entry with the VacantEntry's key,
        /// and returns a mutable reference to it.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.raw_entry_mut().from_key(&"c") {
        ///     RawEntryMut::Occupied(_) => panic!(),
        ///     RawEntryMut::Vacant(v) => assert_eq!(v.insert("c", 300), (&mut "c", &mut 300)),
        /// }
        ///
        /// assert_eq!(map[&"c"], 300);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, key: K, value: V) -> (&'a mut K, &'a mut V)
        where
            K: Hash,
            S: BuildHasher,
        {
            let hash = make_insert_hash::<K, S>(self.hash_builder, &key);
            self.insert_hashed_nocheck(hash, key, value)
        }

        /// Sets the value of the entry with the VacantEntry's key,
        /// and returns a mutable reference to it.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// fn compute_hash<K: Hash + ?Sized, S: BuildHasher>(hash_builder: &S, key: &K) -> u64 {
        ///     use core::hash::Hasher;
        ///     let mut state = hash_builder.build_hasher();
        ///     key.hash(&mut state);
        ///     state.finish()
        /// }
        ///
        /// let mut map: HashMap<&str, u32> = [("a", 100), ("b", 200)].into();
        /// let key = "c";
        /// let hash = compute_hash(map.hasher(), &key);
        ///
        /// match map.raw_entry_mut().from_key_hashed_nocheck(hash, &key) {
        ///     RawEntryMut::Occupied(_) => panic!(),
        ///     RawEntryMut::Vacant(v) => assert_eq!(
        ///         v.insert_hashed_nocheck(hash, key, 300),
        ///         (&mut "c", &mut 300)
        ///     ),
        /// }
        ///
        /// assert_eq!(map[&"c"], 300);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        #[allow(clippy::shadow_unrelated)]
        pub fn insert_hashed_nocheck(self, hash: u64, key: K, value: V) -> (&'a mut K, &'a mut V)
        where
            K: Hash,
            S: BuildHasher,
        {
            let &mut (ref mut k, ref mut v) = self.table.insert_entry(
                hash,
                (key, value),
                make_hasher::<K, _, V, S>(self.hash_builder),
            );
            (k, v)
        }

        /// Set the value of an entry with a custom hasher function.
        ///
        /// # Examples
        ///
        /// ```
        /// use core::hash::{BuildHasher, Hash};
        /// use hashbrown::hash_map::{HashMap, RawEntryMut};
        ///
        /// fn make_hasher<K, S>(hash_builder: &S) -> impl Fn(&K) -> u64 + '_
        /// where
        ///     K: Hash + ?Sized,
        ///     S: BuildHasher,
        /// {
        ///     move |key: &K| {
        ///         use core::hash::Hasher;
        ///         let mut state = hash_builder.build_hasher();
        ///         key.hash(&mut state);
        ///         state.finish()
        ///     }
        /// }
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let key = "a";
        /// let hash_builder = map.hasher().clone();
        /// let hash = make_hasher(&hash_builder)(&key);
        ///
        /// match map.raw_entry_mut().from_hash(hash, |q| q == &key) {
        ///     RawEntryMut::Occupied(_) => panic!(),
        ///     RawEntryMut::Vacant(v) => assert_eq!(
        ///         v.insert_with_hasher(hash, key, 100, make_hasher(&hash_builder)),
        ///         (&mut "a", &mut 100)
        ///     ),
        /// }
        /// map.extend([("b", 200), ("c", 300), ("d", 400), ("e", 500), ("f", 600)]);
        /// assert_eq!(map[&"a"], 100);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert_with_hasher<H>(
            self,
            hash: u64,
            key: K,
            value: V,
            hasher: H,
        ) -> (&'a mut K, &'a mut V)
        where
            H: Fn(&K) -> u64,
        {
            let &mut (ref mut k, ref mut v) = self
                .table
                .insert_entry(hash, (key, value), |x| hasher(&x.0));
            (k, v)
        }

        #[cfg_attr(feature = "inline-more", inline)]
        fn insert_entry(self, key: K, value: V) -> RawOccupiedEntryMut<'a, K, V, S, A>
        where
            K: Hash,
            S: BuildHasher,
        {
            let hash = make_insert_hash::<K, S>(self.hash_builder, &key);
            let elem = self.table.insert(
                hash,
                (key, value),
                make_hasher::<K, _, V, S>(self.hash_builder),
            );
            RawOccupiedEntryMut {
                elem,
                table: self.table,
                hash_builder: self.hash_builder,
            }
        }
    }

    impl<K, V, S, A: Allocator + Clone> Debug for RawEntryBuilderMut<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("RawEntryBuilder").finish()
        }
    }

    impl<K: Debug, V: Debug, S, A: Allocator + Clone> Debug for RawEntryMut<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            match *self {
                RawEntryMut::Vacant(ref v) => f.debug_tuple("RawEntry").field(v).finish(),
                RawEntryMut::Occupied(ref o) => f.debug_tuple("RawEntry").field(o).finish(),
            }
        }
    }

    impl<K: Debug, V: Debug, S, A: Allocator + Clone> Debug for RawOccupiedEntryMut<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("RawOccupiedEntryMut")
                .field("key", self.key())
                .field("value", self.get())
                .finish()
        }
    }

    impl<K, V, S, A: Allocator + Clone> Debug for RawVacantEntryMut<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("RawVacantEntryMut").finish()
        }
    }

    impl<K, V, S, A: Allocator + Clone> Debug for RawEntryBuilder<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("RawEntryBuilder").finish()
        }
    }

    /// A view into a single entry in a map, which may either be vacant or occupied.
    ///
    /// This `enum` is constructed from the [`entry`] method on [`HashMap`].
    ///
    /// [`HashMap`]: struct.HashMap.html
    /// [`entry`]: struct.HashMap.html#method.entry
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([("a", 10), ("b", 20), ("c", 30)]);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (insert)
    /// let entry: Entry<_, _, _> = map.entry("a");
    /// let _raw_o: OccupiedEntry<_, _, _> = entry.insert(1);
    /// assert_eq!(map.len(), 3);
    /// // Nonexistent key (insert)
    /// map.entry("d").insert(4);
    ///
    /// // Existing key (or_insert)
    /// let v = map.entry("b").or_insert(2);
    /// assert_eq!(std::mem::replace(v, 2), 20);
    /// // Nonexistent key (or_insert)
    /// map.entry("e").or_insert(5);
    ///
    /// // Existing key (or_insert_with)
    /// let v = map.entry("c").or_insert_with(|| 3);
    /// assert_eq!(std::mem::replace(v, 3), 30);
    /// // Nonexistent key (or_insert_with)
    /// map.entry("f").or_insert_with(|| 6);
    ///
    /// println!("Our HashMap: {:?}", map);
    ///
    /// let mut vec: Vec<_> = map.iter().map(|(&k, &v)| (k, v)).collect();
    /// // The `Iter` iterator produces items in arbitrary order, so the
    /// // items must be sorted to test them against a sorted array.
    /// vec.sort_unstable();
    /// assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3), ("d", 4), ("e", 5), ("f", 6)]);
    /// ```
    pub enum Entry<'a, K, V, S, A = Global>
    where
        A: Allocator + Clone,
    {
        /// An occupied entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        /// let mut map: HashMap<_, _> = [("a", 100), ("b", 200)].into();
        ///
        /// match map.entry("a") {
        ///     Entry::Vacant(_) => unreachable!(),
        ///     Entry::Occupied(_) => { }
        /// }
        /// ```
        Occupied(OccupiedEntry<'a, K, V, S, A>),

        /// A vacant entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        /// let mut map: HashMap<&str, i32> = HashMap::new();
        ///
        /// match map.entry("a") {
        ///     Entry::Occupied(_) => unreachable!(),
        ///     Entry::Vacant(_) => { }
        /// }
        /// ```
        Vacant(VacantEntry<'a, K, V, S, A>),
    }

    impl<K: Debug, V: Debug, S, A: Allocator + Clone> Debug for Entry<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            match *self {
                Entry::Vacant(ref v) => f.debug_tuple("Entry").field(v).finish(),
                Entry::Occupied(ref o) => f.debug_tuple("Entry").field(o).finish(),
            }
        }
    }

    /// A view into an occupied entry in a `HashMap`.
    /// It is part of the [`Entry`] enum.
    ///
    /// [`Entry`]: enum.Entry.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{Entry, HashMap, OccupiedEntry};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([("a", 10), ("b", 20), ("c", 30)]);
    ///
    /// let _entry_o: OccupiedEntry<_, _, _> = map.entry("a").insert(100);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (insert and update)
    /// match map.entry("a") {
    ///     Entry::Vacant(_) => unreachable!(),
    ///     Entry::Occupied(mut view) => {
    ///         assert_eq!(view.get(), &100);
    ///         let v = view.get_mut();
    ///         *v *= 10;
    ///         assert_eq!(view.insert(1111), 1000);
    ///     }
    /// }
    ///
    /// assert_eq!(map[&"a"], 1111);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (take)
    /// match map.entry("c") {
    ///     Entry::Vacant(_) => unreachable!(),
    ///     Entry::Occupied(view) => {
    ///         assert_eq!(view.remove_entry(), ("c", 30));
    ///     }
    /// }
    /// assert_eq!(map.get(&"c"), None);
    /// assert_eq!(map.len(), 2);
    /// ```
    pub struct OccupiedEntry<'a, K, V, S, A: Allocator + Clone = Global> {
        hash: u64,
        key: Option<K>,
        elem: Bucket<(K, V)>,
        table: &'a mut HashMap<K, V, S, A>,
    }

    unsafe impl<K, V, S, A> Send for OccupiedEntry<'_, K, V, S, A>
    where
        K: Send,
        V: Send,
        S: Send,
        A: Send + Allocator + Clone,
    {
    }
    unsafe impl<K, V, S, A> Sync for OccupiedEntry<'_, K, V, S, A>
    where
        K: Sync,
        V: Sync,
        S: Sync,
        A: Sync + Allocator + Clone,
    {
    }

    impl<K: Debug, V: Debug, S, A: Allocator + Clone> Debug for OccupiedEntry<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("OccupiedEntry")
                .field("key", self.key())
                .field("value", self.get())
                .finish()
        }
    }

    /// A view into a vacant entry in a `HashMap`.
    /// It is part of the [`Entry`] enum.
    ///
    /// [`Entry`]: enum.Entry.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{Entry, HashMap, VacantEntry};
    ///
    /// let mut map = HashMap::<&str, i32>::new();
    ///
    /// let entry_v: VacantEntry<_, _, _> = match map.entry("a") {
    ///     Entry::Vacant(view) => view,
    ///     Entry::Occupied(_) => unreachable!(),
    /// };
    /// entry_v.insert(10);
    /// assert!(map[&"a"] == 10 && map.len() == 1);
    ///
    /// // Nonexistent key (insert and update)
    /// match map.entry("b") {
    ///     Entry::Occupied(_) => unreachable!(),
    ///     Entry::Vacant(view) => {
    ///         let value = view.insert(2);
    ///         assert_eq!(*value, 2);
    ///         *value = 20;
    ///     }
    /// }
    /// assert!(map[&"b"] == 20 && map.len() == 2);
    /// ```
    pub struct VacantEntry<'a, K, V, S, A: Allocator + Clone = Global> {
        hash: u64,
        key: K,
        table: &'a mut HashMap<K, V, S, A>,
    }

    impl<K: Debug, V, S, A: Allocator + Clone> Debug for VacantEntry<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_tuple("VacantEntry").field(self.key()).finish()
        }
    }

    /// A view into a single entry in a map, which may either be vacant or occupied,
    /// with any borrowed form of the map's key type.
    ///
    ///
    /// This `enum` is constructed from the [`entry_ref`] method on [`HashMap`].
    ///
    /// [`Hash`] and [`Eq`] on the borrowed form of the map's key type *must* match those
    /// for the key type. It also require that key may be constructed from the borrowed
    /// form through the [`From`] trait.
    ///
    /// [`HashMap`]: struct.HashMap.html
    /// [`entry_ref`]: struct.HashMap.html#method.entry_ref
    /// [`Eq`]: https://doc.rust-lang.org/std/cmp/trait.Eq.html
    /// [`Hash`]: https://doc.rust-lang.org/std/hash/trait.Hash.html
    /// [`From`]: https://doc.rust-lang.org/std/convert/trait.From.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([("a".to_owned(), 10), ("b".into(), 20), ("c".into(), 30)]);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (insert)
    /// let key = String::from("a");
    /// let entry: EntryRef<_, _, _, _> = map.entry_ref(&key);
    /// let _raw_o: OccupiedEntryRef<_, _, _, _> = entry.insert(1);
    /// assert_eq!(map.len(), 3);
    /// // Nonexistent key (insert)
    /// map.entry_ref("d").insert(4);
    ///
    /// // Existing key (or_insert)
    /// let v = map.entry_ref("b").or_insert(2);
    /// assert_eq!(std::mem::replace(v, 2), 20);
    /// // Nonexistent key (or_insert)
    /// map.entry_ref("e").or_insert(5);
    ///
    /// // Existing key (or_insert_with)
    /// let v = map.entry_ref("c").or_insert_with(|| 3);
    /// assert_eq!(std::mem::replace(v, 3), 30);
    /// // Nonexistent key (or_insert_with)
    /// map.entry_ref("f").or_insert_with(|| 6);
    ///
    /// println!("Our HashMap: {:?}", map);
    ///
    /// for (key, value) in ["a", "b", "c", "d", "e", "f"].into_iter().zip(1..=6) {
    ///     assert_eq!(map[key], value)
    /// }
    /// assert_eq!(map.len(), 6);
    /// ```
    pub enum EntryRef<'a, 'b, K, Q: ?Sized, V, S, A = Global>
    where
        A: Allocator + Clone,
    {
        /// An occupied entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        /// let mut map: HashMap<_, _> = [("a".to_owned(), 100), ("b".into(), 200)].into();
        ///
        /// match map.entry_ref("a") {
        ///     EntryRef::Vacant(_) => unreachable!(),
        ///     EntryRef::Occupied(_) => { }
        /// }
        /// ```
        Occupied(OccupiedEntryRef<'a, 'b, K, Q, V, S, A>),

        /// A vacant entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        /// let mut map: HashMap<String, i32> = HashMap::new();
        ///
        /// match map.entry_ref("a") {
        ///     EntryRef::Occupied(_) => unreachable!(),
        ///     EntryRef::Vacant(_) => { }
        /// }
        /// ```
        Vacant(VacantEntryRef<'a, 'b, K, Q, V, S, A>),
    }

    impl<K: Borrow<Q>, Q: ?Sized + Debug, V: Debug, S, A: Allocator + Clone> Debug
        for EntryRef<'_, '_, K, Q, V, S, A>
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            match *self {
                EntryRef::Vacant(ref v) => f.debug_tuple("EntryRef").field(v).finish(),
                EntryRef::Occupied(ref o) => f.debug_tuple("EntryRef").field(o).finish(),
            }
        }
    }

    enum KeyOrRef<'a, K, Q: ?Sized> {
        Borrowed(&'a Q),
        Owned(K),
    }

    impl<'a, K, Q: ?Sized> KeyOrRef<'a, K, Q> {
        fn into_owned(self) -> K
        where
            K: From<&'a Q>,
        {
            match self {
                Self::Borrowed(borrowed) => borrowed.into(),
                Self::Owned(owned) => owned,
            }
        }
    }

    impl<'a, K: Borrow<Q>, Q: ?Sized> AsRef<Q> for KeyOrRef<'a, K, Q> {
        fn as_ref(&self) -> &Q {
            match self {
                Self::Borrowed(borrowed) => borrowed,
                Self::Owned(owned) => owned.borrow(),
            }
        }
    }

    /// A view into an occupied entry in a `HashMap`.
    /// It is part of the [`EntryRef`] enum.
    ///
    /// [`EntryRef`]: enum.EntryRef.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{EntryRef, HashMap, OccupiedEntryRef};
    ///
    /// let mut map = HashMap::new();
    /// map.extend([("a".to_owned(), 10), ("b".into(), 20), ("c".into(), 30)]);
    ///
    /// let key = String::from("a");
    /// let _entry_o: OccupiedEntryRef<_, _, _, _> = map.entry_ref(&key).insert(100);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (insert and update)
    /// match map.entry_ref("a") {
    ///     EntryRef::Vacant(_) => unreachable!(),
    ///     EntryRef::Occupied(mut view) => {
    ///         assert_eq!(view.get(), &100);
    ///         let v = view.get_mut();
    ///         *v *= 10;
    ///         assert_eq!(view.insert(1111), 1000);
    ///     }
    /// }
    ///
    /// assert_eq!(map["a"], 1111);
    /// assert_eq!(map.len(), 3);
    ///
    /// // Existing key (take)
    /// match map.entry_ref("c") {
    ///     EntryRef::Vacant(_) => unreachable!(),
    ///     EntryRef::Occupied(view) => {
    ///         assert_eq!(view.remove_entry(), ("c".to_owned(), 30));
    ///     }
    /// }
    /// assert_eq!(map.get("c"), None);
    /// assert_eq!(map.len(), 2);
    /// ```
    pub struct OccupiedEntryRef<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone = Global> {
        hash: u64,
        key: Option<KeyOrRef<'b, K, Q>>,
        elem: Bucket<(K, V)>,
        table: &'a mut HashMap<K, V, S, A>,
    }

    unsafe impl<'a, 'b, K, Q, V, S, A> Send for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
    where
        K: Send,
        Q: Sync + ?Sized,
        V: Send,
        S: Send,
        A: Send + Allocator + Clone,
    {
    }
    unsafe impl<'a, 'b, K, Q, V, S, A> Sync for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
    where
        K: Sync,
        Q: Sync + ?Sized,
        V: Sync,
        S: Sync,
        A: Sync + Allocator + Clone,
    {
    }

    impl<K: Borrow<Q>, Q: ?Sized + Debug, V: Debug, S, A: Allocator + Clone> Debug
        for OccupiedEntryRef<'_, '_, K, Q, V, S, A>
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("OccupiedEntryRef")
                .field("key", &self.key())
                .field("value", &self.get())
                .finish()
        }
    }

    /// A view into a vacant entry in a `HashMap`.
    /// It is part of the [`EntryRef`] enum.
    ///
    /// [`EntryRef`]: enum.EntryRef.html
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{EntryRef, HashMap, VacantEntryRef};
    ///
    /// let mut map = HashMap::<String, i32>::new();
    ///
    /// let entry_v: VacantEntryRef<_, _, _, _> = match map.entry_ref("a") {
    ///     EntryRef::Vacant(view) => view,
    ///     EntryRef::Occupied(_) => unreachable!(),
    /// };
    /// entry_v.insert(10);
    /// assert!(map["a"] == 10 && map.len() == 1);
    ///
    /// // Nonexistent key (insert and update)
    /// match map.entry_ref("b") {
    ///     EntryRef::Occupied(_) => unreachable!(),
    ///     EntryRef::Vacant(view) => {
    ///         let value = view.insert(2);
    ///         assert_eq!(*value, 2);
    ///         *value = 20;
    ///     }
    /// }
    /// assert!(map["b"] == 20 && map.len() == 2);
    /// ```
    pub struct VacantEntryRef<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone = Global> {
        hash: u64,
        key: KeyOrRef<'b, K, Q>,
        table: &'a mut HashMap<K, V, S, A>,
    }

    impl<K: Borrow<Q>, Q: ?Sized + Debug, V, S, A: Allocator + Clone> Debug
        for VacantEntryRef<'_, '_, K, Q, V, S, A>
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_tuple("VacantEntryRef").field(&self.key()).finish()
        }
    }

    /// The error returned by [`try_insert`](HashMap::try_insert) when the key already exists.
    ///
    /// Contains the occupied entry, and the value that was not inserted.
    ///
    /// # Examples
    ///
    /// ```
    /// use hashbrown::hash_map::{HashMap, OccupiedError};
    ///
    /// let mut map: HashMap<_, _> = [("a", 10), ("b", 20)].into();
    ///
    /// // try_insert method returns mutable reference to the value if keys are vacant,
    /// // but if the map did have key present, nothing is updated, and the provided
    /// // value is returned inside `Err(_)` variant
    /// match map.try_insert("a", 100) {
    ///     Err(OccupiedError { mut entry, value }) => {
    ///         assert_eq!(entry.key(), &"a");
    ///         assert_eq!(value, 100);
    ///         assert_eq!(entry.insert(100), 10)
    ///     }
    ///     _ => unreachable!(),
    /// }
    /// assert_eq!(map[&"a"], 100);
    /// ```
    pub struct OccupiedError<'a, K, V, S, A: Allocator + Clone = Global> {
        /// The entry in the map that was already occupied.
        pub entry: OccupiedEntry<'a, K, V, S, A>,
        /// The value which was not inserted, because the entry was already occupied.
        pub value: V,
    }

    impl<K: Debug, V: Debug, S, A: Allocator + Clone> Debug for OccupiedError<'_, K, V, S, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_struct("OccupiedError")
                .field("key", self.entry.key())
                .field("old_value", self.entry.get())
                .field("new_value", &self.value)
                .finish()
        }
    }

    impl<'a, K: Debug, V: Debug, S, A: Allocator + Clone> fmt::Display
        for OccupiedError<'a, K, V, S, A>
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            write!(
                f,
                "failed to insert {:?}, key {:?} already exists with value {:?}",
                self.value,
                self.entry.key(),
                self.entry.get(),
            )
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> IntoIterator for &'a HashMap<K, V, S, A> {
        type Item = (&'a K, &'a V);
        type IntoIter = Iter<'a, K, V>;

        /// Creates an iterator over the entries of a `HashMap` in arbitrary order.
        /// The iterator element type is `(&'a K, &'a V)`.
        ///
        /// Return the same `Iter` struct as by the [`iter`] method on [`HashMap`].
        ///
        /// [`iter`]: struct.HashMap.html#method.iter
        /// [`HashMap`]: struct.HashMap.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let map_one: HashMap<_, _> = [(1, "a"), (2, "b"), (3, "c")].into();
        /// let mut map_two = HashMap::new();
        ///
        /// for (key, value) in &map_one {
        ///     println!("Key: {}, Value: {}", key, value);
        ///     map_two.insert_unique_unchecked(*key, *value);
        /// }
        ///
        /// assert_eq!(map_one, map_two);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn into_iter(self) -> Iter<'a, K, V> {
            self.iter()
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> IntoIterator for &'a mut HashMap<K, V, S, A> {
        type Item = (&'a K, &'a mut V);
        type IntoIter = IterMut<'a, K, V>;

        /// Creates an iterator over the entries of a `HashMap` in arbitrary order
        /// with mutable references to the values. The iterator element type is
        /// `(&'a K, &'a mut V)`.
        ///
        /// Return the same `IterMut` struct as by the [`iter_mut`] method on
        /// [`HashMap`].
        ///
        /// [`iter_mut`]: struct.HashMap.html#method.iter_mut
        /// [`HashMap`]: struct.HashMap.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// let mut map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
        ///
        /// for (key, value) in &mut map {
        ///     println!("Key: {}, Value: {}", key, value);
        ///     *value *= 2;
        /// }
        ///
        /// let mut vec = map.iter().collect::<Vec<_>>();
        /// // The `Iter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [(&"a", &2), (&"b", &4), (&"c", &6)]);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn into_iter(self) -> IterMut<'a, K, V> {
            self.iter_mut()
        }
    }

    impl<K, V, S, A: Allocator + Clone> IntoIterator for HashMap<K, V, S, A> {
        type Item = (K, V);
        type IntoIter = IntoIter<K, V, A>;

        /// Creates a consuming iterator, that is, one that moves each key-value
        /// pair out of the map in arbitrary order. The map cannot be used after
        /// calling this.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let map: HashMap<_, _> = [("a", 1), ("b", 2), ("c", 3)].into();
        ///
        /// // Not possible with .iter()
        /// let mut vec: Vec<(&str, i32)> = map.into_iter().collect();
        /// // The `IntoIter` iterator produces items in arbitrary order, so
        /// // the items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [("a", 1), ("b", 2), ("c", 3)]);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn into_iter(self) -> IntoIter<K, V, A> {
            IntoIter {
                inner: self.table.into_iter(),
            }
        }
    }

    impl<'a, K, V> Iterator for Iter<'a, K, V> {
        type Item = (&'a K, &'a V);

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<(&'a K, &'a V)> {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.inner.next() {
                Some(x) => unsafe {
                    let r = x.as_ref();
                    Some((&r.0, &r.1))
                },
                None => None,
            }
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V> ExactSizeIterator for Iter<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }

    impl<K, V> FusedIterator for Iter<'_, K, V> {}

    impl<'a, K, V> Iterator for IterMut<'a, K, V> {
        type Item = (&'a K, &'a mut V);

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<(&'a K, &'a mut V)> {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.inner.next() {
                Some(x) => unsafe {
                    let r = x.as_mut();
                    Some((&r.0, &mut r.1))
                },
                None => None,
            }
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V> ExactSizeIterator for IterMut<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V> FusedIterator for IterMut<'_, K, V> {}

    impl<K, V> fmt::Debug for IterMut<'_, K, V>
    where
        K: fmt::Debug,
        V: fmt::Debug,
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.iter()).finish()
        }
    }

    impl<K, V, A: Allocator + Clone> Iterator for IntoIter<K, V, A> {
        type Item = (K, V);

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<(K, V)> {
            self.inner.next()
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V, A: Allocator + Clone> ExactSizeIterator for IntoIter<K, V, A> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V, A: Allocator + Clone> FusedIterator for IntoIter<K, V, A> {}

    impl<K: Debug, V: Debug, A: Allocator + Clone> fmt::Debug for IntoIter<K, V, A> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.iter()).finish()
        }
    }

    impl<'a, K, V> Iterator for Keys<'a, K, V> {
        type Item = &'a K;

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<&'a K> {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.inner.next() {
                Some((k, _)) => Some(k),
                None => None,
            }
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V> ExactSizeIterator for Keys<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V> FusedIterator for Keys<'_, K, V> {}

    impl<'a, K, V> Iterator for Values<'a, K, V> {
        type Item = &'a V;

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<&'a V> {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.inner.next() {
                Some((_, v)) => Some(v),
                None => None,
            }
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V> ExactSizeIterator for Values<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V> FusedIterator for Values<'_, K, V> {}

    impl<'a, K, V> Iterator for ValuesMut<'a, K, V> {
        type Item = &'a mut V;

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<&'a mut V> {
            // Avoid `Option::map` because it bloats LLVM IR.
            match self.inner.next() {
                Some((_, v)) => Some(v),
                None => None,
            }
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V> ExactSizeIterator for ValuesMut<'_, K, V> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V> FusedIterator for ValuesMut<'_, K, V> {}

    impl<K, V: Debug> fmt::Debug for ValuesMut<'_, K, V> {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list()
                .entries(self.inner.iter().map(|(_, val)| val))
                .finish()
        }
    }

    impl<'a, K, V, A: Allocator + Clone> Iterator for Drain<'a, K, V, A> {
        type Item = (K, V);

        #[cfg_attr(feature = "inline-more", inline)]
        fn next(&mut self) -> Option<(K, V)> {
            self.inner.next()
        }
        #[cfg_attr(feature = "inline-more", inline)]
        fn size_hint(&self) -> (usize, Option<usize>) {
            self.inner.size_hint()
        }
    }
    impl<K, V, A: Allocator + Clone> ExactSizeIterator for Drain<'_, K, V, A> {
        #[cfg_attr(feature = "inline-more", inline)]
        fn len(&self) -> usize {
            self.inner.len()
        }
    }
    impl<K, V, A: Allocator + Clone> FusedIterator for Drain<'_, K, V, A> {}

    impl<K, V, A> fmt::Debug for Drain<'_, K, V, A>
    where
        K: fmt::Debug,
        V: fmt::Debug,
        A: Allocator + Clone,
    {
        fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
            f.debug_list().entries(self.iter()).finish()
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> Entry<'a, K, V, S, A> {
        /// Sets the value of the entry, and returns an OccupiedEntry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// let entry = map.entry("horseyland").insert(37);
        ///
        /// assert_eq!(entry.key(), &"horseyland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, value: V) -> OccupiedEntry<'a, K, V, S, A>
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                Entry::Occupied(mut entry) => {
                    entry.insert(value);
                    entry
                }
                Entry::Vacant(entry) => entry.insert_entry(value),
            }
        }

        /// Ensures a value is in the entry by inserting the default if empty, and returns
        /// a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry("poneyland").or_insert(3);
        /// assert_eq!(map["poneyland"], 3);
        ///
        /// // existing key
        /// *map.entry("poneyland").or_insert(10) *= 2;
        /// assert_eq!(map["poneyland"], 6);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert(self, default: V) -> &'a mut V
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                Entry::Occupied(entry) => entry.into_mut(),
                Entry::Vacant(entry) => entry.insert(default),
            }
        }

        /// Ensures a value is in the entry by inserting the result of the default function if empty,
        /// and returns a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry("poneyland").or_insert_with(|| 3);
        /// assert_eq!(map["poneyland"], 3);
        ///
        /// // existing key
        /// *map.entry("poneyland").or_insert_with(|| 10) *= 2;
        /// assert_eq!(map["poneyland"], 6);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                Entry::Occupied(entry) => entry.into_mut(),
                Entry::Vacant(entry) => entry.insert(default()),
            }
        }

        /// Ensures a value is in the entry by inserting, if empty, the result of the default function.
        /// This method allows for generating key-derived values for insertion by providing the default
        /// function a reference to the key that was moved during the `.entry(key)` method call.
        ///
        /// The reference to the moved key is provided so that cloning or copying the key is
        /// unnecessary, unlike with `.or_insert_with(|| ... )`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, usize> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry("poneyland").or_insert_with_key(|key| key.chars().count());
        /// assert_eq!(map["poneyland"], 9);
        ///
        /// // existing key
        /// *map.entry("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;
        /// assert_eq!(map["poneyland"], 18);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert_with_key<F: FnOnce(&K) -> V>(self, default: F) -> &'a mut V
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                Entry::Occupied(entry) => entry.into_mut(),
                Entry::Vacant(entry) => {
                    let value = default(entry.key());
                    entry.insert(value)
                }
            }
        }

        /// Returns a reference to this entry's key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(3);
        /// // existing key
        /// assert_eq!(map.entry("poneyland").key(), &"poneyland");
        /// // nonexistent key
        /// assert_eq!(map.entry("horseland").key(), &"horseland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &K {
            match *self {
                Entry::Occupied(ref entry) => entry.key(),
                Entry::Vacant(ref entry) => entry.key(),
            }
        }

        /// Provides in-place mutable access to an occupied entry before any
        /// potential inserts into the map.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// map.entry("poneyland")
        ///    .and_modify(|e| { *e += 1 })
        ///    .or_insert(42);
        /// assert_eq!(map["poneyland"], 42);
        ///
        /// map.entry("poneyland")
        ///    .and_modify(|e| { *e += 1 })
        ///    .or_insert(42);
        /// assert_eq!(map["poneyland"], 43);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_modify<F>(self, f: F) -> Self
        where
            F: FnOnce(&mut V),
        {
            match self {
                Entry::Occupied(mut entry) => {
                    f(entry.get_mut());
                    Entry::Occupied(entry)
                }
                Entry::Vacant(entry) => Entry::Vacant(entry),
            }
        }

        /// Provides shared access to the key and owned access to the value of
        /// an occupied entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// let entry = map
        ///     .entry("poneyland")
        ///     .and_replace_entry_with(|_k, _v| panic!());
        ///
        /// match entry {
        ///     Entry::Vacant(e) => {
        ///         assert_eq!(e.key(), &"poneyland");
        ///     }
        ///     Entry::Occupied(_) => panic!(),
        /// }
        ///
        /// map.insert("poneyland", 42);
        ///
        /// let entry = map
        ///     .entry("poneyland")
        ///     .and_replace_entry_with(|k, v| {
        ///         assert_eq!(k, &"poneyland");
        ///         assert_eq!(v, 42);
        ///         Some(v + 1)
        ///     });
        ///
        /// match entry {
        ///     Entry::Occupied(e) => {
        ///         assert_eq!(e.key(), &"poneyland");
        ///         assert_eq!(e.get(), &43);
        ///     }
        ///     Entry::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(map["poneyland"], 43);
        ///
        /// let entry = map
        ///     .entry("poneyland")
        ///     .and_replace_entry_with(|_k, _v| None);
        ///
        /// match entry {
        ///     Entry::Vacant(e) => assert_eq!(e.key(), &"poneyland"),
        ///     Entry::Occupied(_) => panic!(),
        /// }
        ///
        /// assert!(!map.contains_key("poneyland"));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_replace_entry_with<F>(self, f: F) -> Self
        where
            F: FnOnce(&K, V) -> Option<V>,
        {
            match self {
                Entry::Occupied(entry) => entry.replace_entry_with(f),
                Entry::Vacant(_) => self,
            }
        }
    }

    impl<'a, K, V: Default, S, A: Allocator + Clone> Entry<'a, K, V, S, A> {
        /// Ensures a value is in the entry by inserting the default value if empty,
        /// and returns a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, Option<u32>> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry("poneyland").or_default();
        /// assert_eq!(map["poneyland"], None);
        ///
        /// map.insert("horseland", Some(3));
        ///
        /// // existing key
        /// assert_eq!(map.entry("horseland").or_default(), &mut Some(3));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_default(self) -> &'a mut V
        where
            K: Hash,
            S: BuildHasher,
        {
            match self {
                Entry::Occupied(entry) => entry.into_mut(),
                Entry::Vacant(entry) => entry.insert(Default::default()),
            }
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> OccupiedEntry<'a, K, V, S, A> {
        /// Gets a reference to the key in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(12);
        ///
        /// match map.entry("poneyland") {
        ///     Entry::Vacant(_) => panic!(),
        ///     Entry::Occupied(entry) => assert_eq!(entry.key(), &"poneyland"),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &K {
            unsafe { &self.elem.as_ref().0 }
        }

        /// Take the ownership of the key and value from the map.
        /// Keeps the allocated memory for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.entry("poneyland").or_insert(12);
        /// let capacity_before_remove = map.capacity();
        ///
        /// if let Entry::Occupied(o) = map.entry("poneyland") {
        ///     // We delete the entry from the map.
        ///     assert_eq!(o.remove_entry(), ("poneyland", 12));
        /// }
        ///
        /// assert_eq!(map.contains_key("poneyland"), false);
        /// // Now map hold none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove_entry(self) -> (K, V) {
            unsafe { self.table.table.remove(self.elem) }
        }

        /// Gets a reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(12);
        ///
        /// match map.entry("poneyland") {
        ///     Entry::Vacant(_) => panic!(),
        ///     Entry::Occupied(entry) => assert_eq!(entry.get(), &12),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get(&self) -> &V {
            unsafe { &self.elem.as_ref().1 }
        }

        /// Gets a mutable reference to the value in the entry.
        ///
        /// If you need a reference to the `OccupiedEntry` which may outlive the
        /// destruction of the `Entry` value, see [`into_mut`].
        ///
        /// [`into_mut`]: #method.into_mut
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(12);
        ///
        /// assert_eq!(map["poneyland"], 12);
        /// if let Entry::Occupied(mut o) = map.entry("poneyland") {
        ///     *o.get_mut() += 10;
        ///     assert_eq!(*o.get(), 22);
        ///
        ///     // We can use the same Entry multiple times.
        ///     *o.get_mut() += 2;
        /// }
        ///
        /// assert_eq!(map["poneyland"], 24);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_mut(&mut self) -> &mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Converts the OccupiedEntry into a mutable reference to the value in the entry
        /// with a lifetime bound to the map itself.
        ///
        /// If you need multiple references to the `OccupiedEntry`, see [`get_mut`].
        ///
        /// [`get_mut`]: #method.get_mut
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(12);
        ///
        /// assert_eq!(map["poneyland"], 12);
        ///
        /// let value: &mut u32;
        /// match map.entry("poneyland") {
        ///     Entry::Occupied(entry) => value = entry.into_mut(),
        ///     Entry::Vacant(_) => panic!(),
        /// }
        /// *value += 10;
        ///
        /// assert_eq!(map["poneyland"], 22);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_mut(self) -> &'a mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Sets the value of the entry, and returns the entry's old value.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.entry("poneyland").or_insert(12);
        ///
        /// if let Entry::Occupied(mut o) = map.entry("poneyland") {
        ///     assert_eq!(o.insert(15), 12);
        /// }
        ///
        /// assert_eq!(map["poneyland"], 15);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(&mut self, value: V) -> V {
            mem::replace(self.get_mut(), value)
        }

        /// Takes the value out of the entry, and returns it.
        /// Keeps the allocated memory for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.entry("poneyland").or_insert(12);
        /// let capacity_before_remove = map.capacity();
        ///
        /// if let Entry::Occupied(o) = map.entry("poneyland") {
        ///     assert_eq!(o.remove(), 12);
        /// }
        ///
        /// assert_eq!(map.contains_key("poneyland"), false);
        /// // Now map hold none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove(self) -> V {
            self.remove_entry().1
        }

        /// Replaces the entry, returning the old key and value. The new key in the hash map will be
        /// the key used to create this entry.
        ///
        /// # Panics
        ///
        /// Will panic if this OccupiedEntry was created through [`Entry::insert`].
        ///
        /// # Examples
        ///
        /// ```
        ///  use hashbrown::hash_map::{Entry, HashMap};
        ///  use std::rc::Rc;
        ///
        ///  let mut map: HashMap<Rc<String>, u32> = HashMap::new();
        ///  let key_one = Rc::new("Stringthing".to_string());
        ///  let key_two = Rc::new("Stringthing".to_string());
        ///
        ///  map.insert(key_one.clone(), 15);
        ///  assert!(Rc::strong_count(&key_one) == 2 && Rc::strong_count(&key_two) == 1);
        ///
        ///  match map.entry(key_two.clone()) {
        ///      Entry::Occupied(entry) => {
        ///          let (old_key, old_value): (Rc<String>, u32) = entry.replace_entry(16);
        ///          assert!(Rc::ptr_eq(&key_one, &old_key) && old_value == 15);
        ///      }
        ///      Entry::Vacant(_) => panic!(),
        ///  }
        ///
        ///  assert!(Rc::strong_count(&key_one) == 1 && Rc::strong_count(&key_two) == 2);
        ///  assert_eq!(map[&"Stringthing".to_owned()], 16);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_entry(self, value: V) -> (K, V) {
            let entry = unsafe { self.elem.as_mut() };

            let old_key = mem::replace(&mut entry.0, self.key.unwrap());
            let old_value = mem::replace(&mut entry.1, value);

            (old_key, old_value)
        }

        /// Replaces the key in the hash map with the key used to create this entry.
        ///
        /// # Panics
        ///
        /// Will panic if this OccupiedEntry was created through [`Entry::insert`].
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        /// use std::rc::Rc;
        ///
        /// let mut map: HashMap<Rc<String>, usize> = HashMap::with_capacity(6);
        /// let mut keys_one: Vec<Rc<String>> = Vec::with_capacity(6);
        /// let mut keys_two: Vec<Rc<String>> = Vec::with_capacity(6);
        ///
        /// for (value, key) in ["a", "b", "c", "d", "e", "f"].into_iter().enumerate() {
        ///     let rc_key = Rc::new(key.to_owned());
        ///     keys_one.push(rc_key.clone());
        ///     map.insert(rc_key.clone(), value);
        ///     keys_two.push(Rc::new(key.to_owned()));
        /// }
        ///
        /// assert!(
        ///     keys_one.iter().all(|key| Rc::strong_count(key) == 2)
        ///         && keys_two.iter().all(|key| Rc::strong_count(key) == 1)
        /// );
        ///
        /// reclaim_memory(&mut map, &keys_two);
        ///
        /// assert!(
        ///     keys_one.iter().all(|key| Rc::strong_count(key) == 1)
        ///         && keys_two.iter().all(|key| Rc::strong_count(key) == 2)
        /// );
        ///
        /// fn reclaim_memory(map: &mut HashMap<Rc<String>, usize>, keys: &[Rc<String>]) {
        ///     for key in keys {
        ///         if let Entry::Occupied(entry) = map.entry(key.clone()) {
        ///         // Replaces the entry's key with our version of it in `keys`.
        ///             entry.replace_key();
        ///         }
        ///     }
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_key(self) -> K {
            let entry = unsafe { self.elem.as_mut() };
            mem::replace(&mut entry.0, self.key.unwrap())
        }

        /// Provides shared access to the key and owned access to the value of
        /// the entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// map.insert("poneyland", 42);
        ///
        /// let entry = match map.entry("poneyland") {
        ///     Entry::Occupied(e) => {
        ///         e.replace_entry_with(|k, v| {
        ///             assert_eq!(k, &"poneyland");
        ///             assert_eq!(v, 42);
        ///             Some(v + 1)
        ///         })
        ///     }
        ///     Entry::Vacant(_) => panic!(),
        /// };
        ///
        /// match entry {
        ///     Entry::Occupied(e) => {
        ///         assert_eq!(e.key(), &"poneyland");
        ///         assert_eq!(e.get(), &43);
        ///     }
        ///     Entry::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(map["poneyland"], 43);
        ///
        /// let entry = match map.entry("poneyland") {
        ///     Entry::Occupied(e) => e.replace_entry_with(|_k, _v| None),
        ///     Entry::Vacant(_) => panic!(),
        /// };
        ///
        /// match entry {
        ///     Entry::Vacant(e) => {
        ///         assert_eq!(e.key(), &"poneyland");
        ///     }
        ///     Entry::Occupied(_) => panic!(),
        /// }
        ///
        /// assert!(!map.contains_key("poneyland"));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_entry_with<F>(self, f: F) -> Entry<'a, K, V, S, A>
        where
            F: FnOnce(&K, V) -> Option<V>,
        {
            unsafe {
                let mut spare_key = None;

                self.table
                    .table
                    .replace_bucket_with(self.elem.clone(), |(key, value)| {
                        if let Some(new_value) = f(&key, value) {
                            Some((key, new_value))
                        } else {
                            spare_key = Some(key);
                            None
                        }
                    });

                if let Some(key) = spare_key {
                    Entry::Vacant(VacantEntry {
                        hash: self.hash,
                        key,
                        table: self.table,
                    })
                } else {
                    Entry::Occupied(self)
                }
            }
        }
    }

    impl<'a, K, V, S, A: Allocator + Clone> VacantEntry<'a, K, V, S, A> {
        /// Gets a reference to the key that would be used when inserting a value
        /// through the `VacantEntry`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        /// assert_eq!(map.entry("poneyland").key(), &"poneyland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &K {
            &self.key
        }

        /// Take ownership of the key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{Entry, HashMap};
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// match map.entry("poneyland") {
        ///     Entry::Occupied(_) => panic!(),
        ///     Entry::Vacant(v) => assert_eq!(v.into_key(), "poneyland"),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_key(self) -> K {
            self.key
        }

        /// Sets the value of the entry with the VacantEntry's key,
        /// and returns a mutable reference to it.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::Entry;
        ///
        /// let mut map: HashMap<&str, u32> = HashMap::new();
        ///
        /// if let Entry::Vacant(o) = map.entry("poneyland") {
        ///     o.insert(37);
        /// }
        /// assert_eq!(map["poneyland"], 37);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, value: V) -> &'a mut V
        where
            K: Hash,
            S: BuildHasher,
        {
            let table = &mut self.table.table;
            let entry = table.insert_entry(
                self.hash,
                (self.key, value),
                make_hasher::<K, _, V, S>(&self.table.hash_builder),
            );
            &mut entry.1
        }

        #[cfg_attr(feature = "inline-more", inline)]
        pub(crate) fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, S, A>
        where
            K: Hash,
            S: BuildHasher,
        {
            let elem = self.table.table.insert(
                self.hash,
                (self.key, value),
                make_hasher::<K, _, V, S>(&self.table.hash_builder),
            );
            OccupiedEntry {
                hash: self.hash,
                key: None,
                elem,
                table: self.table,
            }
        }
    }

    impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone> EntryRef<'a, 'b, K, Q, V, S, A> {
        /// Sets the value of the entry, and returns an OccupiedEntryRef.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// let entry = map.entry_ref("horseyland").insert(37);
        ///
        /// assert_eq!(entry.key(), "horseyland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, value: V) -> OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            match self {
                EntryRef::Occupied(mut entry) => {
                    entry.insert(value);
                    entry
                }
                EntryRef::Vacant(entry) => entry.insert_entry(value),
            }
        }

        /// Ensures a value is in the entry by inserting the default if empty, and returns
        /// a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry_ref("poneyland").or_insert(3);
        /// assert_eq!(map["poneyland"], 3);
        ///
        /// // existing key
        /// *map.entry_ref("poneyland").or_insert(10) *= 2;
        /// assert_eq!(map["poneyland"], 6);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert(self, default: V) -> &'a mut V
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            match self {
                EntryRef::Occupied(entry) => entry.into_mut(),
                EntryRef::Vacant(entry) => entry.insert(default),
            }
        }

        /// Ensures a value is in the entry by inserting the result of the default function if empty,
        /// and returns a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry_ref("poneyland").or_insert_with(|| 3);
        /// assert_eq!(map["poneyland"], 3);
        ///
        /// // existing key
        /// *map.entry_ref("poneyland").or_insert_with(|| 10) *= 2;
        /// assert_eq!(map["poneyland"], 6);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert_with<F: FnOnce() -> V>(self, default: F) -> &'a mut V
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            match self {
                EntryRef::Occupied(entry) => entry.into_mut(),
                EntryRef::Vacant(entry) => entry.insert(default()),
            }
        }

        /// Ensures a value is in the entry by inserting, if empty, the result of the default function.
        /// This method allows for generating key-derived values for insertion by providing the default
        /// function a reference to the key that was moved during the `.entry_ref(key)` method call.
        ///
        /// The reference to the moved key is provided so that cloning or copying the key is
        /// unnecessary, unlike with `.or_insert_with(|| ... )`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, usize> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count());
        /// assert_eq!(map["poneyland"], 9);
        ///
        /// // existing key
        /// *map.entry_ref("poneyland").or_insert_with_key(|key| key.chars().count() * 10) *= 2;
        /// assert_eq!(map["poneyland"], 18);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_insert_with_key<F: FnOnce(&Q) -> V>(self, default: F) -> &'a mut V
        where
            K: Hash + Borrow<Q> + From<&'b Q>,
            S: BuildHasher,
        {
            match self {
                EntryRef::Occupied(entry) => entry.into_mut(),
                EntryRef::Vacant(entry) => {
                    let value = default(entry.key.as_ref());
                    entry.insert(value)
                }
            }
        }

        /// Returns a reference to this entry's key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(3);
        /// // existing key
        /// assert_eq!(map.entry_ref("poneyland").key(), "poneyland");
        /// // nonexistent key
        /// assert_eq!(map.entry_ref("horseland").key(), "horseland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &Q
        where
            K: Borrow<Q>,
        {
            match *self {
                EntryRef::Occupied(ref entry) => entry.key(),
                EntryRef::Vacant(ref entry) => entry.key(),
            }
        }

        /// Provides in-place mutable access to an occupied entry before any
        /// potential inserts into the map.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        ///
        /// map.entry_ref("poneyland")
        ///    .and_modify(|e| { *e += 1 })
        ///    .or_insert(42);
        /// assert_eq!(map["poneyland"], 42);
        ///
        /// map.entry_ref("poneyland")
        ///    .and_modify(|e| { *e += 1 })
        ///    .or_insert(42);
        /// assert_eq!(map["poneyland"], 43);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_modify<F>(self, f: F) -> Self
        where
            F: FnOnce(&mut V),
        {
            match self {
                EntryRef::Occupied(mut entry) => {
                    f(entry.get_mut());
                    EntryRef::Occupied(entry)
                }
                EntryRef::Vacant(entry) => EntryRef::Vacant(entry),
            }
        }

        /// Provides shared access to the key and owned access to the value of
        /// an occupied entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        ///
        /// let entry = map
        ///     .entry_ref("poneyland")
        ///     .and_replace_entry_with(|_k, _v| panic!());
        ///
        /// match entry {
        ///     EntryRef::Vacant(e) => {
        ///         assert_eq!(e.key(), "poneyland");
        ///     }
        ///     EntryRef::Occupied(_) => panic!(),
        /// }
        ///
        /// map.insert("poneyland".to_string(), 42);
        ///
        /// let entry = map
        ///     .entry_ref("poneyland")
        ///     .and_replace_entry_with(|k, v| {
        ///         assert_eq!(k, "poneyland");
        ///         assert_eq!(v, 42);
        ///         Some(v + 1)
        ///     });
        ///
        /// match entry {
        ///     EntryRef::Occupied(e) => {
        ///         assert_eq!(e.key(), "poneyland");
        ///         assert_eq!(e.get(), &43);
        ///     }
        ///     EntryRef::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(map["poneyland"], 43);
        ///
        /// let entry = map
        ///     .entry_ref("poneyland")
        ///     .and_replace_entry_with(|_k, _v| None);
        ///
        /// match entry {
        ///     EntryRef::Vacant(e) => assert_eq!(e.key(), "poneyland"),
        ///     EntryRef::Occupied(_) => panic!(),
        /// }
        ///
        /// assert!(!map.contains_key("poneyland"));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn and_replace_entry_with<F>(self, f: F) -> Self
        where
            F: FnOnce(&Q, V) -> Option<V>,
            K: Borrow<Q>,
        {
            match self {
                EntryRef::Occupied(entry) => entry.replace_entry_with(f),
                EntryRef::Vacant(_) => self,
            }
        }
    }

    impl<'a, 'b, K, Q: ?Sized, V: Default, S, A: Allocator + Clone> EntryRef<'a, 'b, K, Q, V, S, A> {
        /// Ensures a value is in the entry by inserting the default value if empty,
        /// and returns a mutable reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, Option<u32>> = HashMap::new();
        ///
        /// // nonexistent key
        /// map.entry_ref("poneyland").or_default();
        /// assert_eq!(map["poneyland"], None);
        ///
        /// map.insert("horseland".to_string(), Some(3));
        ///
        /// // existing key
        /// assert_eq!(map.entry_ref("horseland").or_default(), &mut Some(3));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn or_default(self) -> &'a mut V
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            match self {
                EntryRef::Occupied(entry) => entry.into_mut(),
                EntryRef::Vacant(entry) => entry.insert(Default::default()),
            }
        }
    }

    impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone> OccupiedEntryRef<'a, 'b, K, Q, V, S, A> {
        /// Gets a reference to the key in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(12);
        ///
        /// match map.entry_ref("poneyland") {
        ///     EntryRef::Vacant(_) => panic!(),
        ///     EntryRef::Occupied(entry) => assert_eq!(entry.key(), "poneyland"),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &Q
        where
            K: Borrow<Q>,
        {
            unsafe { &self.elem.as_ref().0 }.borrow()
        }

        /// Take the ownership of the key and value from the map.
        /// Keeps the allocated memory for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.entry_ref("poneyland").or_insert(12);
        /// let capacity_before_remove = map.capacity();
        ///
        /// if let EntryRef::Occupied(o) = map.entry_ref("poneyland") {
        ///     // We delete the entry from the map.
        ///     assert_eq!(o.remove_entry(), ("poneyland".to_owned(), 12));
        /// }
        ///
        /// assert_eq!(map.contains_key("poneyland"), false);
        /// // Now map hold none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove_entry(self) -> (K, V) {
            unsafe { self.table.table.remove(self.elem) }
        }

        /// Gets a reference to the value in the entry.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(12);
        ///
        /// match map.entry_ref("poneyland") {
        ///     EntryRef::Vacant(_) => panic!(),
        ///     EntryRef::Occupied(entry) => assert_eq!(entry.get(), &12),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get(&self) -> &V {
            unsafe { &self.elem.as_ref().1 }
        }

        /// Gets a mutable reference to the value in the entry.
        ///
        /// If you need a reference to the `OccupiedEntryRef` which may outlive the
        /// destruction of the `EntryRef` value, see [`into_mut`].
        ///
        /// [`into_mut`]: #method.into_mut
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(12);
        ///
        /// assert_eq!(map["poneyland"], 12);
        /// if let EntryRef::Occupied(mut o) = map.entry_ref("poneyland") {
        ///     *o.get_mut() += 10;
        ///     assert_eq!(*o.get(), 22);
        ///
        ///     // We can use the same Entry multiple times.
        ///     *o.get_mut() += 2;
        /// }
        ///
        /// assert_eq!(map["poneyland"], 24);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn get_mut(&mut self) -> &mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Converts the OccupiedEntryRef into a mutable reference to the value in the entry
        /// with a lifetime bound to the map itself.
        ///
        /// If you need multiple references to the `OccupiedEntryRef`, see [`get_mut`].
        ///
        /// [`get_mut`]: #method.get_mut
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(12);
        ///
        /// let value: &mut u32;
        /// match map.entry_ref("poneyland") {
        ///     EntryRef::Occupied(entry) => value = entry.into_mut(),
        ///     EntryRef::Vacant(_) => panic!(),
        /// }
        /// *value += 10;
        ///
        /// assert_eq!(map["poneyland"], 22);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_mut(self) -> &'a mut V {
            unsafe { &mut self.elem.as_mut().1 }
        }

        /// Sets the value of the entry, and returns the entry's old value.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.entry_ref("poneyland").or_insert(12);
        ///
        /// if let EntryRef::Occupied(mut o) = map.entry_ref("poneyland") {
        ///     assert_eq!(o.insert(15), 12);
        /// }
        ///
        /// assert_eq!(map["poneyland"], 15);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(&mut self, value: V) -> V {
            mem::replace(self.get_mut(), value)
        }

        /// Takes the value out of the entry, and returns it.
        /// Keeps the allocated memory for reuse.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// // The map is empty
        /// assert!(map.is_empty() && map.capacity() == 0);
        ///
        /// map.entry_ref("poneyland").or_insert(12);
        /// let capacity_before_remove = map.capacity();
        ///
        /// if let EntryRef::Occupied(o) = map.entry_ref("poneyland") {
        ///     assert_eq!(o.remove(), 12);
        /// }
        ///
        /// assert_eq!(map.contains_key("poneyland"), false);
        /// // Now map hold none elements but capacity is equal to the old one
        /// assert!(map.len() == 0 && map.capacity() == capacity_before_remove);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn remove(self) -> V {
            self.remove_entry().1
        }

        /// Replaces the entry, returning the old key and value. The new key in the hash map will be
        /// the key used to create this entry.
        ///
        /// # Panics
        ///
        /// Will panic if this OccupiedEntry was created through [`EntryRef::insert`].
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        /// use std::rc::Rc;
        ///
        /// let mut map: HashMap<Rc<str>, u32> = HashMap::new();
        /// let key: Rc<str> = Rc::from("Stringthing");
        ///
        /// map.insert(key.clone(), 15);
        /// assert_eq!(Rc::strong_count(&key), 2);
        ///
        /// match map.entry_ref("Stringthing") {
        ///     EntryRef::Occupied(entry) => {
        ///         let (old_key, old_value): (Rc<str>, u32) = entry.replace_entry(16);
        ///         assert!(Rc::ptr_eq(&key, &old_key) && old_value == 15);
        ///     }
        ///     EntryRef::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(Rc::strong_count(&key), 1);
        /// assert_eq!(map["Stringthing"], 16);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_entry(self, value: V) -> (K, V)
        where
            K: From<&'b Q>,
        {
            let entry = unsafe { self.elem.as_mut() };

            let old_key = mem::replace(&mut entry.0, self.key.unwrap().into_owned());
            let old_value = mem::replace(&mut entry.1, value);

            (old_key, old_value)
        }

        /// Replaces the key in the hash map with the key used to create this entry.
        ///
        /// # Panics
        ///
        /// Will panic if this OccupiedEntry was created through [`Entry::insert`].
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        /// use std::rc::Rc;
        ///
        /// let mut map: HashMap<Rc<str>, usize> = HashMap::with_capacity(6);
        /// let mut keys: Vec<Rc<str>> = Vec::with_capacity(6);
        ///
        /// for (value, key) in ["a", "b", "c", "d", "e", "f"].into_iter().enumerate() {
        ///     let rc_key: Rc<str> = Rc::from(key);
        ///     keys.push(rc_key.clone());
        ///     map.insert(rc_key.clone(), value);
        /// }
        ///
        /// assert!(keys.iter().all(|key| Rc::strong_count(key) == 2));
        ///
        /// // It doesn't matter that we kind of use a vector with the same keys,
        /// // because all keys will be newly created from the references
        /// reclaim_memory(&mut map, &keys);
        ///
        /// assert!(keys.iter().all(|key| Rc::strong_count(key) == 1));
        ///
        /// fn reclaim_memory(map: &mut HashMap<Rc<str>, usize>, keys: &[Rc<str>]) {
        ///     for key in keys {
        ///         if let EntryRef::Occupied(entry) = map.entry_ref(key.as_ref()) {
        ///         /// Replaces the entry's key with our version of it in `keys`.
        ///             entry.replace_key();
        ///         }
        ///     }
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_key(self) -> K
        where
            K: From<&'b Q>,
        {
            let entry = unsafe { self.elem.as_mut() };
            mem::replace(&mut entry.0, self.key.unwrap().into_owned())
        }

        /// Provides shared access to the key and owned access to the value of
        /// the entry and allows to replace or remove it based on the
        /// value of the returned option.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// map.insert("poneyland".to_string(), 42);
        ///
        /// let entry = match map.entry_ref("poneyland") {
        ///     EntryRef::Occupied(e) => {
        ///         e.replace_entry_with(|k, v| {
        ///             assert_eq!(k, "poneyland");
        ///             assert_eq!(v, 42);
        ///             Some(v + 1)
        ///         })
        ///     }
        ///     EntryRef::Vacant(_) => panic!(),
        /// };
        ///
        /// match entry {
        ///     EntryRef::Occupied(e) => {
        ///         assert_eq!(e.key(), "poneyland");
        ///         assert_eq!(e.get(), &43);
        ///     }
        ///     EntryRef::Vacant(_) => panic!(),
        /// }
        ///
        /// assert_eq!(map["poneyland"], 43);
        ///
        /// let entry = match map.entry_ref("poneyland") {
        ///     EntryRef::Occupied(e) => e.replace_entry_with(|_k, _v| None),
        ///     EntryRef::Vacant(_) => panic!(),
        /// };
        ///
        /// match entry {
        ///     EntryRef::Vacant(e) => {
        ///         assert_eq!(e.key(), "poneyland");
        ///     }
        ///     EntryRef::Occupied(_) => panic!(),
        /// }
        ///
        /// assert!(!map.contains_key("poneyland"));
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn replace_entry_with<F>(self, f: F) -> EntryRef<'a, 'b, K, Q, V, S, A>
        where
            F: FnOnce(&Q, V) -> Option<V>,
            K: Borrow<Q>,
        {
            unsafe {
                let mut spare_key = None;

                self.table
                    .table
                    .replace_bucket_with(self.elem.clone(), |(key, value)| {
                        if let Some(new_value) = f(key.borrow(), value) {
                            Some((key, new_value))
                        } else {
                            spare_key = Some(KeyOrRef::Owned(key));
                            None
                        }
                    });

                if let Some(key) = spare_key {
                    EntryRef::Vacant(VacantEntryRef {
                        hash: self.hash,
                        key,
                        table: self.table,
                    })
                } else {
                    EntryRef::Occupied(self)
                }
            }
        }
    }

    impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone> VacantEntryRef<'a, 'b, K, Q, V, S, A> {
        /// Gets a reference to the key that would be used when inserting a value
        /// through the `VacantEntryRef`.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// let key: &str = "poneyland";
        /// assert_eq!(map.entry_ref(key).key(), "poneyland");
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn key(&self) -> &Q
        where
            K: Borrow<Q>,
        {
            self.key.as_ref()
        }

        /// Take ownership of the key.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::{EntryRef, HashMap};
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// let key: &str = "poneyland";
        ///
        /// match map.entry_ref(key) {
        ///     EntryRef::Occupied(_) => panic!(),
        ///     EntryRef::Vacant(v) => assert_eq!(v.into_key(), "poneyland".to_owned()),
        /// }
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn into_key(self) -> K
        where
            K: From<&'b Q>,
        {
            self.key.into_owned()
        }

        /// Sets the value of the entry with the VacantEntryRef's key,
        /// and returns a mutable reference to it.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::HashMap;
        /// use hashbrown::hash_map::EntryRef;
        ///
        /// let mut map: HashMap<String, u32> = HashMap::new();
        /// let key: &str = "poneyland";
        ///
        /// if let EntryRef::Vacant(o) = map.entry_ref(key) {
        ///     o.insert(37);
        /// }
        /// assert_eq!(map["poneyland"], 37);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        pub fn insert(self, value: V) -> &'a mut V
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            let table = &mut self.table.table;
            let entry = table.insert_entry(
                self.hash,
                (self.key.into_owned(), value),
                make_hasher::<K, _, V, S>(&self.table.hash_builder),
            );
            &mut entry.1
        }

        #[cfg_attr(feature = "inline-more", inline)]
        fn insert_entry(self, value: V) -> OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
        where
            K: Hash + From<&'b Q>,
            S: BuildHasher,
        {
            let elem = self.table.table.insert(
                self.hash,
                (self.key.into_owned(), value),
                make_hasher::<K, _, V, S>(&self.table.hash_builder),
            );
            OccupiedEntryRef {
                hash: self.hash,
                key: None,
                elem,
                table: self.table,
            }
        }
    }

    impl<K, V, S, A> FromIterator<(K, V)> for HashMap<K, V, S, A>
    where
        K: Eq + Hash,
        S: BuildHasher + Default,
        A: Default + Allocator + Clone,
    {
        #[cfg_attr(feature = "inline-more", inline)]
        fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> Self {
            let iter = iter.into_iter();
            let mut map =
                Self::with_capacity_and_hasher_in(iter.size_hint().0, S::default(), A::default());
            iter.for_each(|(k, v)| {
                map.insert(k, v);
            });
            map
        }
    }

    /// Inserts all new key-values from the iterator and replaces values with existing
    /// keys with new values returned from the iterator.
    impl<K, V, S, A> Extend<(K, V)> for HashMap<K, V, S, A>
    where
        K: Eq + Hash,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        /// Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`.
        /// Replace values with existing keys with new values returned from the iterator.
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, 100);
        ///
        /// let some_iter = [(1, 1), (2, 2)].into_iter();
        /// map.extend(some_iter);
        /// // Replace values with existing keys with new values returned from the iterator.
        /// // So that the map.get(&1) doesn't return Some(&100).
        /// assert_eq!(map.get(&1), Some(&1));
        ///
        /// let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
        /// map.extend(some_vec);
        ///
        /// let some_arr = [(5, 5), (6, 6)];
        /// map.extend(some_arr);
        /// let old_map_len = map.len();
        ///
        /// // You can also extend from another HashMap
        /// let mut new_map = HashMap::new();
        /// new_map.extend(map);
        /// assert_eq!(new_map.len(), old_map_len);
        ///
        /// let mut vec: Vec<_> = new_map.into_iter().collect();
        /// // The `IntoIter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T) {
            // Keys may be already present or show multiple times in the iterator.
            // Reserve the entire hint lower bound if the map is empty.
            // Otherwise reserve half the hint (rounded up), so the map
            // will only resize twice in the worst case.
            let iter = iter.into_iter();
            let reserve = if self.is_empty() {
                iter.size_hint().0
            } else {
                (iter.size_hint().0 + 1) / 2
            };
            self.reserve(reserve);
            iter.for_each(move |(k, v)| {
                self.insert(k, v);
            });
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_one(&mut self, (k, v): (K, V)) {
            self.insert(k, v);
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_reserve(&mut self, additional: usize) {
            // Keys may be already present or show multiple times in the iterator.
            // Reserve the entire hint lower bound if the map is empty.
            // Otherwise reserve half the hint (rounded up), so the map
            // will only resize twice in the worst case.
            let reserve = if self.is_empty() {
                additional
            } else {
                (additional + 1) / 2
            };
            self.reserve(reserve);
        }
    }

    /// Inserts all new key-values from the iterator and replaces values with existing
    /// keys with new values returned from the iterator.
    impl<'a, K, V, S, A> Extend<(&'a K, &'a V)> for HashMap<K, V, S, A>
    where
        K: Eq + Hash + Copy,
        V: Copy,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        /// Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`.
        /// Replace values with existing keys with new values returned from the iterator.
        /// The keys and values must implement [`Copy`] trait.
        ///
        /// [`Copy`]: https://doc.rust-lang.org/core/marker/trait.Copy.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, 100);
        ///
        /// let arr = [(1, 1), (2, 2)];
        /// let some_iter = arr.iter().map(|&(k, v)| (k, v));
        /// map.extend(some_iter);
        /// // Replace values with existing keys with new values returned from the iterator.
        /// // So that the map.get(&1) doesn't return Some(&100).
        /// assert_eq!(map.get(&1), Some(&1));
        ///
        /// let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
        /// map.extend(some_vec.iter().map(|&(k, v)| (k, v)));
        ///
        /// let some_arr = [(5, 5), (6, 6)];
        /// map.extend(some_arr.iter().map(|&(k, v)| (k, v)));
        ///
        /// // You can also extend from another HashMap
        /// let mut new_map = HashMap::new();
        /// new_map.extend(&map);
        /// assert_eq!(new_map, map);
        ///
        /// let mut vec: Vec<_> = new_map.into_iter().collect();
        /// // The `IntoIter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T) {
            self.extend(iter.into_iter().map(|(&key, &value)| (key, value)));
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_one(&mut self, (k, v): (&'a K, &'a V)) {
            self.insert(*k, *v);
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_reserve(&mut self, additional: usize) {
            Extend::<(K, V)>::extend_reserve(self, additional);
        }
    }

    /// Inserts all new key-values from the iterator and replaces values with existing
    /// keys with new values returned from the iterator.
    impl<'a, K, V, S, A> Extend<&'a (K, V)> for HashMap<K, V, S, A>
    where
        K: Eq + Hash + Copy,
        V: Copy,
        S: BuildHasher,
        A: Allocator + Clone,
    {
        /// Inserts all new key-values from the iterator to existing `HashMap<K, V, S, A>`.
        /// Replace values with existing keys with new values returned from the iterator.
        /// The keys and values must implement [`Copy`] trait.
        ///
        /// [`Copy`]: https://doc.rust-lang.org/core/marker/trait.Copy.html
        ///
        /// # Examples
        ///
        /// ```
        /// use hashbrown::hash_map::HashMap;
        ///
        /// let mut map = HashMap::new();
        /// map.insert(1, 100);
        ///
        /// let arr = [(1, 1), (2, 2)];
        /// let some_iter = arr.iter();
        /// map.extend(some_iter);
        /// // Replace values with existing keys with new values returned from the iterator.
        /// // So that the map.get(&1) doesn't return Some(&100).
        /// assert_eq!(map.get(&1), Some(&1));
        ///
        /// let some_vec: Vec<_> = vec![(3, 3), (4, 4)];
        /// map.extend(&some_vec);
        ///
        /// let some_arr = [(5, 5), (6, 6)];
        /// map.extend(&some_arr);
        ///
        /// let mut vec: Vec<_> = map.into_iter().collect();
        /// // The `IntoIter` iterator produces items in arbitrary order, so the
        /// // items must be sorted to test them against a sorted array.
        /// vec.sort_unstable();
        /// assert_eq!(vec, [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)]);
        /// ```
        #[cfg_attr(feature = "inline-more", inline)]
        fn extend<T: IntoIterator<Item = &'a (K, V)>>(&mut self, iter: T) {
            self.extend(iter.into_iter().map(|&(key, value)| (key, value)));
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_one(&mut self, &(k, v): &'a (K, V)) {
            self.insert(k, v);
        }

        #[inline]
        #[cfg(feature = "nightly")]
        fn extend_reserve(&mut self, additional: usize) {
            Extend::<(K, V)>::extend_reserve(self, additional);
        }
    }

    #[allow(dead_code)]
    fn assert_covariance() {
        fn map_key<'new>(v: HashMap<&'static str, u8>) -> HashMap<&'new str, u8> {
            v
        }
        fn map_val<'new>(v: HashMap<u8, &'static str>) -> HashMap<u8, &'new str> {
            v
        }
        fn iter_key<'a, 'new>(v: Iter<'a, &'static str, u8>) -> Iter<'a, &'new str, u8> {
            v
        }
        fn iter_val<'a, 'new>(v: Iter<'a, u8, &'static str>) -> Iter<'a, u8, &'new str> {
            v
        }
        fn into_iter_key<'new, A: Allocator + Clone>(
            v: IntoIter<&'static str, u8, A>,
        ) -> IntoIter<&'new str, u8, A> {
            v
        }
        fn into_iter_val<'new, A: Allocator + Clone>(
            v: IntoIter<u8, &'static str, A>,
        ) -> IntoIter<u8, &'new str, A> {
            v
        }
        fn keys_key<'a, 'new>(v: Keys<'a, &'static str, u8>) -> Keys<'a, &'new str, u8> {
            v
        }
        fn keys_val<'a, 'new>(v: Keys<'a, u8, &'static str>) -> Keys<'a, u8, &'new str> {
            v
        }
        fn values_key<'a, 'new>(v: Values<'a, &'static str, u8>) -> Values<'a, &'new str, u8> {
            v
        }
        fn values_val<'a, 'new>(v: Values<'a, u8, &'static str>) -> Values<'a, u8, &'new str> {
            v
        }
        fn drain<'new>(
            d: Drain<'static, &'static str, &'static str>,
        ) -> Drain<'new, &'new str, &'new str> {
            d
        }
    }

    #[cfg(test)]
    mod test_map {
        use super::DefaultHashBuilder;
        use super::Entry::{Occupied, Vacant};
        use super::EntryRef;
        use super::{HashMap, RawEntryMut};
        use rand::{rngs::SmallRng, Rng, SeedableRng};
        use std::borrow::ToOwned;
        use std::cell::RefCell;
        use std::usize;
        use std::vec::Vec;

        #[test]
        fn test_zero_capacities() {
            type HM = HashMap<i32, i32>;

            let m = HM::new();
            assert_eq!(m.capacity(), 0);

            let m = HM::default();
            assert_eq!(m.capacity(), 0);

            let m = HM::with_hasher(DefaultHashBuilder::default());
            assert_eq!(m.capacity(), 0);

            let m = HM::with_capacity(0);
            assert_eq!(m.capacity(), 0);

            let m = HM::with_capacity_and_hasher(0, DefaultHashBuilder::default());
            assert_eq!(m.capacity(), 0);

            let mut m = HM::new();
            m.insert(1, 1);
            m.insert(2, 2);
            m.remove(&1);
            m.remove(&2);
            m.shrink_to_fit();
            assert_eq!(m.capacity(), 0);

            let mut m = HM::new();
            m.reserve(0);
            assert_eq!(m.capacity(), 0);
        }

        #[test]
        fn test_create_capacity_zero() {
            let mut m = HashMap::with_capacity(0);

            assert!(m.insert(1, 1).is_none());

            assert!(m.contains_key(&1));
            assert!(!m.contains_key(&0));
        }

        #[test]
        fn test_insert() {
            let mut m = HashMap::new();
            assert_eq!(m.len(), 0);
            assert!(m.insert(1, 2).is_none());
            assert_eq!(m.len(), 1);
            assert!(m.insert(2, 4).is_none());
            assert_eq!(m.len(), 2);
            assert_eq!(*m.get(&1).unwrap(), 2);
            assert_eq!(*m.get(&2).unwrap(), 4);
        }

        #[test]
        fn test_clone() {
            let mut m = HashMap::new();
            assert_eq!(m.len(), 0);
            assert!(m.insert(1, 2).is_none());
            assert_eq!(m.len(), 1);
            assert!(m.insert(2, 4).is_none());
            assert_eq!(m.len(), 2);
            #[allow(clippy::redundant_clone)]
            let m2 = m.clone();
            assert_eq!(*m2.get(&1).unwrap(), 2);
            assert_eq!(*m2.get(&2).unwrap(), 4);
            assert_eq!(m2.len(), 2);
        }

        #[test]
        fn test_clone_from() {
            let mut m = HashMap::new();
            let mut m2 = HashMap::new();
            assert_eq!(m.len(), 0);
            assert!(m.insert(1, 2).is_none());
            assert_eq!(m.len(), 1);
            assert!(m.insert(2, 4).is_none());
            assert_eq!(m.len(), 2);
            m2.clone_from(&m);
            assert_eq!(*m2.get(&1).unwrap(), 2);
            assert_eq!(*m2.get(&2).unwrap(), 4);
            assert_eq!(m2.len(), 2);
        }

        thread_local! { static DROP_VECTOR: RefCell<Vec<i32>> = RefCell::new(Vec::new()) }

        #[derive(Hash, PartialEq, Eq)]
        struct Droppable {
            k: usize,
        }

        impl Droppable {
            fn new(k: usize) -> Droppable {
                DROP_VECTOR.with(|slot| {
                    slot.borrow_mut()[k] += 1;
                });

                Droppable { k }
            }
        }

        impl Drop for Droppable {
            fn drop(&mut self) {
                DROP_VECTOR.with(|slot| {
                    slot.borrow_mut()[self.k] -= 1;
                });
            }
        }

        impl Clone for Droppable {
            fn clone(&self) -> Self {
                Droppable::new(self.k)
            }
        }

        #[test]
        fn test_drops() {
            DROP_VECTOR.with(|slot| {
                *slot.borrow_mut() = vec![0; 200];
            });

            {
                let mut m = HashMap::new();

                DROP_VECTOR.with(|v| {
                    for i in 0..200 {
                        assert_eq!(v.borrow()[i], 0);
                    }
                });

                for i in 0..100 {
                    let d1 = Droppable::new(i);
                    let d2 = Droppable::new(i + 100);
                    m.insert(d1, d2);
                }

                DROP_VECTOR.with(|v| {
                    for i in 0..200 {
                        assert_eq!(v.borrow()[i], 1);
                    }
                });

                for i in 0..50 {
                    let k = Droppable::new(i);
                    let v = m.remove(&k);

                    assert!(v.is_some());

                    DROP_VECTOR.with(|v| {
                        assert_eq!(v.borrow()[i], 1);
                        assert_eq!(v.borrow()[i + 100], 1);
                    });
                }

                DROP_VECTOR.with(|v| {
                    for i in 0..50 {
                        assert_eq!(v.borrow()[i], 0);
                        assert_eq!(v.borrow()[i + 100], 0);
                    }

                    for i in 50..100 {
                        assert_eq!(v.borrow()[i], 1);
                        assert_eq!(v.borrow()[i + 100], 1);
                    }
                });
            }

            DROP_VECTOR.with(|v| {
                for i in 0..200 {
                    assert_eq!(v.borrow()[i], 0);
                }
            });
        }

        #[test]
        fn test_into_iter_drops() {
            DROP_VECTOR.with(|v| {
                *v.borrow_mut() = vec![0; 200];
            });

            let hm = {
                let mut hm = HashMap::new();

                DROP_VECTOR.with(|v| {
                    for i in 0..200 {
                        assert_eq!(v.borrow()[i], 0);
                    }
                });

                for i in 0..100 {
                    let d1 = Droppable::new(i);
                    let d2 = Droppable::new(i + 100);
                    hm.insert(d1, d2);
                }

                DROP_VECTOR.with(|v| {
                    for i in 0..200 {
                        assert_eq!(v.borrow()[i], 1);
                    }
                });

                hm
            };

            // By the way, ensure that cloning doesn't screw up the dropping.
            drop(hm.clone());

            {
                let mut half = hm.into_iter().take(50);

                DROP_VECTOR.with(|v| {
                    for i in 0..200 {
                        assert_eq!(v.borrow()[i], 1);
                    }
                });

                #[allow(clippy::let_underscore_drop)] // kind-of a false positive
                for _ in half.by_ref() {}

                DROP_VECTOR.with(|v| {
                    let nk = (0..100).filter(|&i| v.borrow()[i] == 1).count();

                    let nv = (0..100).filter(|&i| v.borrow()[i + 100] == 1).count();

                    assert_eq!(nk, 50);
                    assert_eq!(nv, 50);
                });
            };

            DROP_VECTOR.with(|v| {
                for i in 0..200 {
                    assert_eq!(v.borrow()[i], 0);
                }
            });
        }

        #[test]
        fn test_empty_remove() {
            let mut m: HashMap<i32, bool> = HashMap::new();
            assert_eq!(m.remove(&0), None);
        }

        #[test]
        fn test_empty_entry() {
            let mut m: HashMap<i32, bool> = HashMap::new();
            match m.entry(0) {
                Occupied(_) => panic!(),
                Vacant(_) => {}
            }
            assert!(*m.entry(0).or_insert(true));
            assert_eq!(m.len(), 1);
        }

        #[test]
        fn test_empty_entry_ref() {
            let mut m: HashMap<std::string::String, bool> = HashMap::new();
            match m.entry_ref("poneyland") {
                EntryRef::Occupied(_) => panic!(),
                EntryRef::Vacant(_) => {}
            }
            assert!(*m.entry_ref("poneyland").or_insert(true));
            assert_eq!(m.len(), 1);
        }

        #[test]
        fn test_empty_iter() {
            let mut m: HashMap<i32, bool> = HashMap::new();
            assert_eq!(m.drain().next(), None);
            assert_eq!(m.keys().next(), None);
            assert_eq!(m.values().next(), None);
            assert_eq!(m.values_mut().next(), None);
            assert_eq!(m.iter().next(), None);
            assert_eq!(m.iter_mut().next(), None);
            assert_eq!(m.len(), 0);
            assert!(m.is_empty());
            assert_eq!(m.into_iter().next(), None);
        }

        #[test]
        #[cfg_attr(miri, ignore)] // FIXME: takes too long
        fn test_lots_of_insertions() {
            let mut m = HashMap::new();

            // Try this a few times to make sure we never screw up the hashmap's
            // internal state.
            for _ in 0..10 {
                assert!(m.is_empty());

                for i in 1..1001 {
                    assert!(m.insert(i, i).is_none());

                    for j in 1..=i {
                        let r = m.get(&j);
                        assert_eq!(r, Some(&j));
                    }

                    for j in i + 1..1001 {
                        let r = m.get(&j);
                        assert_eq!(r, None);
                    }
                }

                for i in 1001..2001 {
                    assert!(!m.contains_key(&i));
                }

                // remove forwards
                for i in 1..1001 {
                    assert!(m.remove(&i).is_some());

                    for j in 1..=i {
                        assert!(!m.contains_key(&j));
                    }

                    for j in i + 1..1001 {
                        assert!(m.contains_key(&j));
                    }
                }

                for i in 1..1001 {
                    assert!(!m.contains_key(&i));
                }

                for i in 1..1001 {
                    assert!(m.insert(i, i).is_none());
                }

                // remove backwards
                for i in (1..1001).rev() {
                    assert!(m.remove(&i).is_some());

                    for j in i..1001 {
                        assert!(!m.contains_key(&j));
                    }

                    for j in 1..i {
                        assert!(m.contains_key(&j));
                    }
                }
            }
        }

        #[test]
        fn test_find_mut() {
            let mut m = HashMap::new();
            assert!(m.insert(1, 12).is_none());
            assert!(m.insert(2, 8).is_none());
            assert!(m.insert(5, 14).is_none());
            let new = 100;
            match m.get_mut(&5) {
                None => panic!(),
                Some(x) => *x = new,
            }
            assert_eq!(m.get(&5), Some(&new));
        }

        #[test]
        fn test_insert_overwrite() {
            let mut m = HashMap::new();
            assert!(m.insert(1, 2).is_none());
            assert_eq!(*m.get(&1).unwrap(), 2);
            assert!(m.insert(1, 3).is_some());
            assert_eq!(*m.get(&1).unwrap(), 3);
        }

        #[test]
        fn test_insert_conflicts() {
            let mut m = HashMap::with_capacity(4);
            assert!(m.insert(1, 2).is_none());
            assert!(m.insert(5, 3).is_none());
            assert!(m.insert(9, 4).is_none());
            assert_eq!(*m.get(&9).unwrap(), 4);
            assert_eq!(*m.get(&5).unwrap(), 3);
            assert_eq!(*m.get(&1).unwrap(), 2);
        }

        #[test]
        fn test_conflict_remove() {
            let mut m = HashMap::with_capacity(4);
            assert!(m.insert(1, 2).is_none());
            assert_eq!(*m.get(&1).unwrap(), 2);
            assert!(m.insert(5, 3).is_none());
            assert_eq!(*m.get(&1).unwrap(), 2);
            assert_eq!(*m.get(&5).unwrap(), 3);
            assert!(m.insert(9, 4).is_none());
            assert_eq!(*m.get(&1).unwrap(), 2);
            assert_eq!(*m.get(&5).unwrap(), 3);
            assert_eq!(*m.get(&9).unwrap(), 4);
            assert!(m.remove(&1).is_some());
            assert_eq!(*m.get(&9).unwrap(), 4);
            assert_eq!(*m.get(&5).unwrap(), 3);
        }

        #[test]
        fn test_insert_unique_unchecked() {
            let mut map = HashMap::new();
            let (k1, v1) = map.insert_unique_unchecked(10, 11);
            assert_eq!((&10, &mut 11), (k1, v1));
            let (k2, v2) = map.insert_unique_unchecked(20, 21);
            assert_eq!((&20, &mut 21), (k2, v2));
            assert_eq!(Some(&11), map.get(&10));
            assert_eq!(Some(&21), map.get(&20));
            assert_eq!(None, map.get(&30));
        }

        #[test]
        fn test_is_empty() {
            let mut m = HashMap::with_capacity(4);
            assert!(m.insert(1, 2).is_none());
            assert!(!m.is_empty());
            assert!(m.remove(&1).is_some());
            assert!(m.is_empty());
        }

        #[test]
        fn test_remove() {
            let mut m = HashMap::new();
            m.insert(1, 2);
            assert_eq!(m.remove(&1), Some(2));
            assert_eq!(m.remove(&1), None);
        }

        #[test]
        fn test_remove_entry() {
            let mut m = HashMap::new();
            m.insert(1, 2);
            assert_eq!(m.remove_entry(&1), Some((1, 2)));
            assert_eq!(m.remove(&1), None);
        }

        #[test]
        fn test_iterate() {
            let mut m = HashMap::with_capacity(4);
            for i in 0..32 {
                assert!(m.insert(i, i * 2).is_none());
            }
            assert_eq!(m.len(), 32);

            let mut observed: u32 = 0;

            for (k, v) in &m {
                assert_eq!(*v, *k * 2);
                observed |= 1 << *k;
            }
            assert_eq!(observed, 0xFFFF_FFFF);
        }

        #[test]
        fn test_keys() {
            let vec = vec![(1, 'a'), (2, 'b'), (3, 'c')];
            let map: HashMap<_, _> = vec.into_iter().collect();
            let keys: Vec<_> = map.keys().copied().collect();
            assert_eq!(keys.len(), 3);
            assert!(keys.contains(&1));
            assert!(keys.contains(&2));
            assert!(keys.contains(&3));
        }

        #[test]
        fn test_values() {
            let vec = vec![(1, 'a'), (2, 'b'), (3, 'c')];
            let map: HashMap<_, _> = vec.into_iter().collect();
            let values: Vec<_> = map.values().copied().collect();
            assert_eq!(values.len(), 3);
            assert!(values.contains(&'a'));
            assert!(values.contains(&'b'));
            assert!(values.contains(&'c'));
        }

        #[test]
        fn test_values_mut() {
            let vec = vec![(1, 1), (2, 2), (3, 3)];
            let mut map: HashMap<_, _> = vec.into_iter().collect();
            for value in map.values_mut() {
                *value *= 2;
            }
            let values: Vec<_> = map.values().copied().collect();
            assert_eq!(values.len(), 3);
            assert!(values.contains(&2));
            assert!(values.contains(&4));
            assert!(values.contains(&6));
        }

        #[test]
        fn test_into_keys() {
            let vec = vec![(1, 'a'), (2, 'b'), (3, 'c')];
            let map: HashMap<_, _> = vec.into_iter().collect();
            let keys: Vec<_> = map.into_keys().collect();

            assert_eq!(keys.len(), 3);
            assert!(keys.contains(&1));
            assert!(keys.contains(&2));
            assert!(keys.contains(&3));
        }

        #[test]
        fn test_into_values() {
            let vec = vec![(1, 'a'), (2, 'b'), (3, 'c')];
            let map: HashMap<_, _> = vec.into_iter().collect();
            let values: Vec<_> = map.into_values().collect();

            assert_eq!(values.len(), 3);
            assert!(values.contains(&'a'));
            assert!(values.contains(&'b'));
            assert!(values.contains(&'c'));
        }

        #[test]
        fn test_find() {
            let mut m = HashMap::new();
            assert!(m.get(&1).is_none());
            m.insert(1, 2);
            match m.get(&1) {
                None => panic!(),
                Some(v) => assert_eq!(*v, 2),
            }
        }

        #[test]
        fn test_eq() {
            let mut m1 = HashMap::new();
            m1.insert(1, 2);
            m1.insert(2, 3);
            m1.insert(3, 4);

            let mut m2 = HashMap::new();
            m2.insert(1, 2);
            m2.insert(2, 3);

            assert!(m1 != m2);

            m2.insert(3, 4);

            assert_eq!(m1, m2);
        }

        #[test]
        fn test_show() {
            let mut map = HashMap::new();
            let empty: HashMap<i32, i32> = HashMap::new();

            map.insert(1, 2);
            map.insert(3, 4);

            let map_str = format!("{:?}", map);

            assert!(map_str == "{1: 2, 3: 4}" || map_str == "{3: 4, 1: 2}");
            assert_eq!(format!("{:?}", empty), "{}");
        }

        #[test]
        fn test_expand() {
            let mut m = HashMap::new();

            assert_eq!(m.len(), 0);
            assert!(m.is_empty());

            let mut i = 0;
            let old_raw_cap = m.raw_capacity();
            while old_raw_cap == m.raw_capacity() {
                m.insert(i, i);
                i += 1;
            }

            assert_eq!(m.len(), i);
            assert!(!m.is_empty());
        }

        #[test]
        fn test_behavior_resize_policy() {
            let mut m = HashMap::new();

            assert_eq!(m.len(), 0);
            assert_eq!(m.raw_capacity(), 1);
            assert!(m.is_empty());

            m.insert(0, 0);
            m.remove(&0);
            assert!(m.is_empty());
            let initial_raw_cap = m.raw_capacity();
            m.reserve(initial_raw_cap);
            let raw_cap = m.raw_capacity();

            assert_eq!(raw_cap, initial_raw_cap * 2);

            let mut i = 0;
            for _ in 0..raw_cap * 3 / 4 {
                m.insert(i, i);
                i += 1;
            }
            // three quarters full

            assert_eq!(m.len(), i);
            assert_eq!(m.raw_capacity(), raw_cap);

            for _ in 0..raw_cap / 4 {
                m.insert(i, i);
                i += 1;
            }
            // half full

            let new_raw_cap = m.raw_capacity();
            assert_eq!(new_raw_cap, raw_cap * 2);

            for _ in 0..raw_cap / 2 - 1 {
                i -= 1;
                m.remove(&i);
                assert_eq!(m.raw_capacity(), new_raw_cap);
            }
            // A little more than one quarter full.
            m.shrink_to_fit();
            assert_eq!(m.raw_capacity(), raw_cap);
            // again, a little more than half full
            for _ in 0..raw_cap / 2 {
                i -= 1;
                m.remove(&i);
            }
            m.shrink_to_fit();

            assert_eq!(m.len(), i);
            assert!(!m.is_empty());
            assert_eq!(m.raw_capacity(), initial_raw_cap);
        }

        #[test]
        fn test_reserve_shrink_to_fit() {
            let mut m = HashMap::new();
            m.insert(0, 0);
            m.remove(&0);
            assert!(m.capacity() >= m.len());
            for i in 0..128 {
                m.insert(i, i);
            }
            m.reserve(256);

            let usable_cap = m.capacity();
            for i in 128..(128 + 256) {
                m.insert(i, i);
                assert_eq!(m.capacity(), usable_cap);
            }

            for i in 100..(128 + 256) {
                assert_eq!(m.remove(&i), Some(i));
            }
            m.shrink_to_fit();

            assert_eq!(m.len(), 100);
            assert!(!m.is_empty());
            assert!(m.capacity() >= m.len());

            for i in 0..100 {
                assert_eq!(m.remove(&i), Some(i));
            }
            m.shrink_to_fit();
            m.insert(0, 0);

            assert_eq!(m.len(), 1);
            assert!(m.capacity() >= m.len());
            assert_eq!(m.remove(&0), Some(0));
        }

        #[test]
        fn test_from_iter() {
            let xs = [(1, 1), (2, 2), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)];

            let map: HashMap<_, _> = xs.iter().copied().collect();

            for &(k, v) in &xs {
                assert_eq!(map.get(&k), Some(&v));
            }

            assert_eq!(map.iter().len(), xs.len() - 1);
        }

        #[test]
        fn test_size_hint() {
            let xs = [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)];

            let map: HashMap<_, _> = xs.iter().copied().collect();

            let mut iter = map.iter();

            for _ in iter.by_ref().take(3) {}

            assert_eq!(iter.size_hint(), (3, Some(3)));
        }

        #[test]
        fn test_iter_len() {
            let xs = [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)];

            let map: HashMap<_, _> = xs.iter().copied().collect();

            let mut iter = map.iter();

            for _ in iter.by_ref().take(3) {}

            assert_eq!(iter.len(), 3);
        }

        #[test]
        fn test_mut_size_hint() {
            let xs = [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)];

            let mut map: HashMap<_, _> = xs.iter().copied().collect();

            let mut iter = map.iter_mut();

            for _ in iter.by_ref().take(3) {}

            assert_eq!(iter.size_hint(), (3, Some(3)));
        }

        #[test]
        fn test_iter_mut_len() {
            let xs = [(1, 1), (2, 2), (3, 3), (4, 4), (5, 5), (6, 6)];

            let mut map: HashMap<_, _> = xs.iter().copied().collect();

            let mut iter = map.iter_mut();

            for _ in iter.by_ref().take(3) {}

            assert_eq!(iter.len(), 3);
        }

        #[test]
        fn test_index() {
            let mut map = HashMap::new();

            map.insert(1, 2);
            map.insert(2, 1);
            map.insert(3, 4);

            assert_eq!(map[&2], 1);
        }

        #[test]
        #[should_panic]
        fn test_index_nonexistent() {
            let mut map = HashMap::new();

            map.insert(1, 2);
            map.insert(2, 1);
            map.insert(3, 4);

            #[allow(clippy::no_effect)] // false positive lint
            map[&4];
        }

        #[test]
        fn test_entry() {
            let xs = [(1, 10), (2, 20), (3, 30), (4, 40), (5, 50), (6, 60)];

            let mut map: HashMap<_, _> = xs.iter().copied().collect();

            // Existing key (insert)
            match map.entry(1) {
                Vacant(_) => unreachable!(),
                Occupied(mut view) => {
                    assert_eq!(view.get(), &10);
                    assert_eq!(view.insert(100), 10);
                }
            }
            assert_eq!(map.get(&1).unwrap(), &100);
            assert_eq!(map.len(), 6);

            // Existing key (update)
            match map.entry(2) {
                Vacant(_) => unreachable!(),
                Occupied(mut view) => {
                    let v = view.get_mut();
                    let new_v = (*v) * 10;
                    *v = new_v;
                }
            }
            assert_eq!(map.get(&2).unwrap(), &200);
            assert_eq!(map.len(), 6);

            // Existing key (take)
            match map.entry(3) {
                Vacant(_) => unreachable!(),
                Occupied(view) => {
                    assert_eq!(view.remove(), 30);
                }
            }
            assert_eq!(map.get(&3), None);
            assert_eq!(map.len(), 5);

            // Inexistent key (insert)
            match map.entry(10) {
                Occupied(_) => unreachable!(),
                Vacant(view) => {
                    assert_eq!(*view.insert(1000), 1000);
                }
            }
            assert_eq!(map.get(&10).unwrap(), &1000);
            assert_eq!(map.len(), 6);
        }

        #[test]
        fn test_entry_ref() {
            let xs = [
                ("One".to_owned(), 10),
                ("Two".to_owned(), 20),
                ("Three".to_owned(), 30),
                ("Four".to_owned(), 40),
                ("Five".to_owned(), 50),
                ("Six".to_owned(), 60),
            ];

            let mut map: HashMap<_, _> = xs.iter().cloned().collect();

            // Existing key (insert)
            match map.entry_ref("One") {
                EntryRef::Vacant(_) => unreachable!(),
                EntryRef::Occupied(mut view) => {
                    assert_eq!(view.get(), &10);
                    assert_eq!(view.insert(100), 10);
                }
            }
            assert_eq!(map.get("One").unwrap(), &100);
            assert_eq!(map.len(), 6);

            // Existing key (update)
            match map.entry_ref("Two") {
                EntryRef::Vacant(_) => unreachable!(),
                EntryRef::Occupied(mut view) => {
                    let v = view.get_mut();
                    let new_v = (*v) * 10;
                    *v = new_v;
                }
            }
            assert_eq!(map.get("Two").unwrap(), &200);
            assert_eq!(map.len(), 6);

            // Existing key (take)
            match map.entry_ref("Three") {
                EntryRef::Vacant(_) => unreachable!(),
                EntryRef::Occupied(view) => {
                    assert_eq!(view.remove(), 30);
                }
            }
            assert_eq!(map.get("Three"), None);
            assert_eq!(map.len(), 5);

            // Inexistent key (insert)
            match map.entry_ref("Ten") {
                EntryRef::Occupied(_) => unreachable!(),
                EntryRef::Vacant(view) => {
                    assert_eq!(*view.insert(1000), 1000);
                }
            }
            assert_eq!(map.get("Ten").unwrap(), &1000);
            assert_eq!(map.len(), 6);
        }

        #[test]
        fn test_entry_take_doesnt_corrupt() {
            #![allow(deprecated)] //rand
                                  // Test for #19292
            fn check(m: &HashMap<i32, ()>) {
                for k in m.keys() {
                    assert!(m.contains_key(k), "{} is in keys() but not in the map?", k);
                }
            }

            let mut m = HashMap::new();

            let mut rng = {
                let seed = u64::from_le_bytes(*b"testseed");
                SmallRng::seed_from_u64(seed)
            };

            // Populate the map with some items.
            for _ in 0..50 {
                let x = rng.gen_range(-10..10);
                m.insert(x, ());
            }

            for _ in 0..1000 {
                let x = rng.gen_range(-10..10);
                match m.entry(x) {
                    Vacant(_) => {}
                    Occupied(e) => {
                        e.remove();
                    }
                }

                check(&m);
            }
        }

        #[test]
        fn test_entry_ref_take_doesnt_corrupt() {
            #![allow(deprecated)] //rand
                                  // Test for #19292
            fn check(m: &HashMap<std::string::String, ()>) {
                for k in m.keys() {
                    assert!(m.contains_key(k), "{} is in keys() but not in the map?", k);
                }
            }

            let mut m = HashMap::new();

            let mut rng = {
                let seed = u64::from_le_bytes(*b"testseed");
                SmallRng::seed_from_u64(seed)
            };

            // Populate the map with some items.
            for _ in 0..50 {
                let mut x = std::string::String::with_capacity(1);
                x.push(rng.gen_range('a'..='z'));
                m.insert(x, ());
            }

            for _ in 0..1000 {
                let mut x = std::string::String::with_capacity(1);
                x.push(rng.gen_range('a'..='z'));
                match m.entry_ref(x.as_str()) {
                    EntryRef::Vacant(_) => {}
                    EntryRef::Occupied(e) => {
                        e.remove();
                    }
                }

                check(&m);
            }
        }

        #[test]
        fn test_extend_ref_k_ref_v() {
            let mut a = HashMap::new();
            a.insert(1, "one");
            let mut b = HashMap::new();
            b.insert(2, "two");
            b.insert(3, "three");

            a.extend(&b);

            assert_eq!(a.len(), 3);
            assert_eq!(a[&1], "one");
            assert_eq!(a[&2], "two");
            assert_eq!(a[&3], "three");
        }

        #[test]
        fn test_extend_ref_kv_tuple() {
            use std::ops::AddAssign;
            let mut a = HashMap::new();
            a.insert(0, 0);

            fn create_arr<T: AddAssign<T> + Copy, const N: usize>(start: T, step: T) -> [(T, T); N] {
                let mut outs: [(T, T); N] = [(start, start); N];
                let mut element = step;
                outs.iter_mut().skip(1).for_each(|(k, v)| {
                    *k += element;
                    *v += element;
                    element += step;
                });
                outs
            }

            let for_iter: Vec<_> = (0..100).map(|i| (i, i)).collect();
            let iter = for_iter.iter();
            let vec: Vec<_> = (100..200).map(|i| (i, i)).collect();
            a.extend(iter);
            a.extend(&vec);
            a.extend(&create_arr::<i32, 100>(200, 1));

            assert_eq!(a.len(), 300);

            for item in 0..300 {
                assert_eq!(a[&item], item);
            }
        }

        #[test]
        fn test_capacity_not_less_than_len() {
            let mut a = HashMap::new();
            let mut item = 0;

            for _ in 0..116 {
                a.insert(item, 0);
                item += 1;
            }

            assert!(a.capacity() > a.len());

            let free = a.capacity() - a.len();
            for _ in 0..free {
                a.insert(item, 0);
                item += 1;
            }

            assert_eq!(a.len(), a.capacity());

            // Insert at capacity should cause allocation.
            a.insert(item, 0);
            assert!(a.capacity() > a.len());
        }

        #[test]
        fn test_occupied_entry_key() {
            let mut a = HashMap::new();
            let key = "hello there";
            let value = "value goes here";
            assert!(a.is_empty());
            a.insert(key, value);
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);

            match a.entry(key) {
                Vacant(_) => panic!(),
                Occupied(e) => assert_eq!(key, *e.key()),
            }
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);
        }

        #[test]
        fn test_occupied_entry_ref_key() {
            let mut a = HashMap::new();
            let key = "hello there";
            let value = "value goes here";
            assert!(a.is_empty());
            a.insert(key.to_owned(), value);
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);

            match a.entry_ref(key) {
                EntryRef::Vacant(_) => panic!(),
                EntryRef::Occupied(e) => assert_eq!(key, e.key()),
            }
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);
        }

        #[test]
        fn test_vacant_entry_key() {
            let mut a = HashMap::new();
            let key = "hello there";
            let value = "value goes here";

            assert!(a.is_empty());
            match a.entry(key) {
                Occupied(_) => panic!(),
                Vacant(e) => {
                    assert_eq!(key, *e.key());
                    e.insert(value);
                }
            }
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);
        }

        #[test]
        fn test_vacant_entry_ref_key() {
            let mut a: HashMap<std::string::String, &str> = HashMap::new();
            let key = "hello there";
            let value = "value goes here";

            assert!(a.is_empty());
            match a.entry_ref(key) {
                EntryRef::Occupied(_) => panic!(),
                EntryRef::Vacant(e) => {
                    assert_eq!(key, e.key());
                    e.insert(value);
                }
            }
            assert_eq!(a.len(), 1);
            assert_eq!(a[key], value);
        }

        #[test]
        fn test_occupied_entry_replace_entry_with() {
            let mut a = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a.entry(key).insert(value).replace_entry_with(|k, v| {
                assert_eq!(k, &key);
                assert_eq!(v, value);
                Some(new_value)
            });

            match entry {
                Occupied(e) => {
                    assert_eq!(e.key(), &key);
                    assert_eq!(e.get(), &new_value);
                }
                Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = match a.entry(key) {
                Occupied(e) => e.replace_entry_with(|k, v| {
                    assert_eq!(k, &key);
                    assert_eq!(v, new_value);
                    None
                }),
                Vacant(_) => panic!(),
            };

            match entry {
                Vacant(e) => assert_eq!(e.key(), &key),
                Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_occupied_entry_ref_replace_entry_with() {
            let mut a: HashMap<std::string::String, &str> = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a.entry_ref(key).insert(value).replace_entry_with(|k, v| {
                assert_eq!(k, key);
                assert_eq!(v, value);
                Some(new_value)
            });

            match entry {
                EntryRef::Occupied(e) => {
                    assert_eq!(e.key(), key);
                    assert_eq!(e.get(), &new_value);
                }
                EntryRef::Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = match a.entry_ref(key) {
                EntryRef::Occupied(e) => e.replace_entry_with(|k, v| {
                    assert_eq!(k, key);
                    assert_eq!(v, new_value);
                    None
                }),
                EntryRef::Vacant(_) => panic!(),
            };

            match entry {
                EntryRef::Vacant(e) => assert_eq!(e.key(), key),
                EntryRef::Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_entry_and_replace_entry_with() {
            let mut a = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a.entry(key).and_replace_entry_with(|_, _| panic!());

            match entry {
                Vacant(e) => assert_eq!(e.key(), &key),
                Occupied(_) => panic!(),
            }

            a.insert(key, value);

            let entry = a.entry(key).and_replace_entry_with(|k, v| {
                assert_eq!(k, &key);
                assert_eq!(v, value);
                Some(new_value)
            });

            match entry {
                Occupied(e) => {
                    assert_eq!(e.key(), &key);
                    assert_eq!(e.get(), &new_value);
                }
                Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = a.entry(key).and_replace_entry_with(|k, v| {
                assert_eq!(k, &key);
                assert_eq!(v, new_value);
                None
            });

            match entry {
                Vacant(e) => assert_eq!(e.key(), &key),
                Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_entry_ref_and_replace_entry_with() {
            let mut a = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a.entry_ref(key).and_replace_entry_with(|_, _| panic!());

            match entry {
                EntryRef::Vacant(e) => assert_eq!(e.key(), key),
                EntryRef::Occupied(_) => panic!(),
            }

            a.insert(key.to_owned(), value);

            let entry = a.entry_ref(key).and_replace_entry_with(|k, v| {
                assert_eq!(k, key);
                assert_eq!(v, value);
                Some(new_value)
            });

            match entry {
                EntryRef::Occupied(e) => {
                    assert_eq!(e.key(), key);
                    assert_eq!(e.get(), &new_value);
                }
                EntryRef::Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = a.entry_ref(key).and_replace_entry_with(|k, v| {
                assert_eq!(k, key);
                assert_eq!(v, new_value);
                None
            });

            match entry {
                EntryRef::Vacant(e) => assert_eq!(e.key(), key),
                EntryRef::Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_raw_occupied_entry_replace_entry_with() {
            let mut a = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a
                .raw_entry_mut()
                .from_key(&key)
                .insert(key, value)
                .replace_entry_with(|k, v| {
                    assert_eq!(k, &key);
                    assert_eq!(v, value);
                    Some(new_value)
                });

            match entry {
                RawEntryMut::Occupied(e) => {
                    assert_eq!(e.key(), &key);
                    assert_eq!(e.get(), &new_value);
                }
                RawEntryMut::Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = match a.raw_entry_mut().from_key(&key) {
                RawEntryMut::Occupied(e) => e.replace_entry_with(|k, v| {
                    assert_eq!(k, &key);
                    assert_eq!(v, new_value);
                    None
                }),
                RawEntryMut::Vacant(_) => panic!(),
            };

            match entry {
                RawEntryMut::Vacant(_) => {}
                RawEntryMut::Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_raw_entry_and_replace_entry_with() {
            let mut a = HashMap::new();

            let key = "a key";
            let value = "an initial value";
            let new_value = "a new value";

            let entry = a
                .raw_entry_mut()
                .from_key(&key)
                .and_replace_entry_with(|_, _| panic!());

            match entry {
                RawEntryMut::Vacant(_) => {}
                RawEntryMut::Occupied(_) => panic!(),
            }

            a.insert(key, value);

            let entry = a
                .raw_entry_mut()
                .from_key(&key)
                .and_replace_entry_with(|k, v| {
                    assert_eq!(k, &key);
                    assert_eq!(v, value);
                    Some(new_value)
                });

            match entry {
                RawEntryMut::Occupied(e) => {
                    assert_eq!(e.key(), &key);
                    assert_eq!(e.get(), &new_value);
                }
                RawEntryMut::Vacant(_) => panic!(),
            }

            assert_eq!(a[key], new_value);
            assert_eq!(a.len(), 1);

            let entry = a
                .raw_entry_mut()
                .from_key(&key)
                .and_replace_entry_with(|k, v| {
                    assert_eq!(k, &key);
                    assert_eq!(v, new_value);
                    None
                });

            match entry {
                RawEntryMut::Vacant(_) => {}
                RawEntryMut::Occupied(_) => panic!(),
            }

            assert!(!a.contains_key(key));
            assert_eq!(a.len(), 0);
        }

        #[test]
        fn test_replace_entry_with_doesnt_corrupt() {
            #![allow(deprecated)] //rand
                                  // Test for #19292
            fn check(m: &HashMap<i32, ()>) {
                for k in m.keys() {
                    assert!(m.contains_key(k), "{} is in keys() but not in the map?", k);
                }
            }

            let mut m = HashMap::new();

            let mut rng = {
                let seed = u64::from_le_bytes(*b"testseed");
                SmallRng::seed_from_u64(seed)
            };

            // Populate the map with some items.
            for _ in 0..50 {
                let x = rng.gen_range(-10..10);
                m.insert(x, ());
            }

            for _ in 0..1000 {
                let x = rng.gen_range(-10..10);
                m.entry(x).and_replace_entry_with(|_, _| None);
                check(&m);
            }
        }

        #[test]
        fn test_replace_entry_ref_with_doesnt_corrupt() {
            #![allow(deprecated)] //rand
                                  // Test for #19292
            fn check(m: &HashMap<std::string::String, ()>) {
                for k in m.keys() {
                    assert!(m.contains_key(k), "{} is in keys() but not in the map?", k);
                }
            }

            let mut m = HashMap::new();

            let mut rng = {
                let seed = u64::from_le_bytes(*b"testseed");
                SmallRng::seed_from_u64(seed)
            };

            // Populate the map with some items.
            for _ in 0..50 {
                let mut x = std::string::String::with_capacity(1);
                x.push(rng.gen_range('a'..='z'));
                m.insert(x, ());
            }

            for _ in 0..1000 {
                let mut x = std::string::String::with_capacity(1);
                x.push(rng.gen_range('a'..='z'));
                m.entry_ref(x.as_str()).and_replace_entry_with(|_, _| None);
                check(&m);
            }
        }

        #[test]
        fn test_retain() {
            let mut map: HashMap<i32, i32> = (0..100).map(|x| (x, x * 10)).collect();

            map.retain(|&k, _| k % 2 == 0);
            assert_eq!(map.len(), 50);
            assert_eq!(map[&2], 20);
            assert_eq!(map[&4], 40);
            assert_eq!(map[&6], 60);
        }

        #[test]
        fn test_drain_filter() {
            {
                let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x * 10)).collect();
                let drained = map.drain_filter(|&k, _| k % 2 == 0);
                let mut out = drained.collect::<Vec<_>>();
                out.sort_unstable();
                assert_eq!(vec![(0, 0), (2, 20), (4, 40), (6, 60)], out);
                assert_eq!(map.len(), 4);
            }
            {
                let mut map: HashMap<i32, i32> = (0..8).map(|x| (x, x * 10)).collect();
                drop(map.drain_filter(|&k, _| k % 2 == 0));
                assert_eq!(map.len(), 4);
            }
        }

        #[test]
        #[cfg_attr(miri, ignore)] // FIXME: no OOM signalling (https://github.com/rust-lang/miri/issues/613)
        fn test_try_reserve() {
            use crate::TryReserveError::{AllocError, CapacityOverflow};

            const MAX_USIZE: usize = usize::MAX;

            let mut empty_bytes: HashMap<u8, u8> = HashMap::new();

            if let Err(CapacityOverflow) = empty_bytes.try_reserve(MAX_USIZE) {
            } else {
                panic!("usize::MAX should trigger an overflow!");
            }

            if let Err(AllocError { .. }) = empty_bytes.try_reserve(MAX_USIZE / 16) {
            } else {
                // This may succeed if there is enough free memory. Attempt to
                // allocate a few more hashmaps to ensure the allocation will fail.
                let mut empty_bytes2: HashMap<u8, u8> = HashMap::new();
                let _ = empty_bytes2.try_reserve(MAX_USIZE / 16);
                let mut empty_bytes3: HashMap<u8, u8> = HashMap::new();
                let _ = empty_bytes3.try_reserve(MAX_USIZE / 16);
                let mut empty_bytes4: HashMap<u8, u8> = HashMap::new();
                if let Err(AllocError { .. }) = empty_bytes4.try_reserve(MAX_USIZE / 16) {
                } else {
                    panic!("usize::MAX / 8 should trigger an OOM!");
                }
            }
        }

        #[test]
        fn test_raw_entry() {
            use super::RawEntryMut::{Occupied, Vacant};

            let xs = [(1_i32, 10_i32), (2, 20), (3, 30), (4, 40), (5, 50), (6, 60)];

            let mut map: HashMap<_, _> = xs.iter().copied().collect();

            let compute_hash = |map: &HashMap<i32, i32>, k: i32| -> u64 {
                super::make_insert_hash::<i32, _>(map.hasher(), &k)
            };

            // Existing key (insert)
            match map.raw_entry_mut().from_key(&1) {
                Vacant(_) => unreachable!(),
                Occupied(mut view) => {
                    assert_eq!(view.get(), &10);
                    assert_eq!(view.insert(100), 10);
                }
            }
            let hash1 = compute_hash(&map, 1);
            assert_eq!(map.raw_entry().from_key(&1).unwrap(), (&1, &100));
            assert_eq!(
                map.raw_entry().from_hash(hash1, |k| *k == 1).unwrap(),
                (&1, &100)
            );
            assert_eq!(
                map.raw_entry().from_key_hashed_nocheck(hash1, &1).unwrap(),
                (&1, &100)
            );
            assert_eq!(map.len(), 6);

            // Existing key (update)
            match map.raw_entry_mut().from_key(&2) {
                Vacant(_) => unreachable!(),
                Occupied(mut view) => {
                    let v = view.get_mut();
                    let new_v = (*v) * 10;
                    *v = new_v;
                }
            }
            let hash2 = compute_hash(&map, 2);
            assert_eq!(map.raw_entry().from_key(&2).unwrap(), (&2, &200));
            assert_eq!(
                map.raw_entry().from_hash(hash2, |k| *k == 2).unwrap(),
                (&2, &200)
            );
            assert_eq!(
                map.raw_entry().from_key_hashed_nocheck(hash2, &2).unwrap(),
                (&2, &200)
            );
            assert_eq!(map.len(), 6);

            // Existing key (take)
            let hash3 = compute_hash(&map, 3);
            match map.raw_entry_mut().from_key_hashed_nocheck(hash3, &3) {
                Vacant(_) => unreachable!(),
                Occupied(view) => {
                    assert_eq!(view.remove_entry(), (3, 30));
                }
            }
            assert_eq!(map.raw_entry().from_key(&3), None);
            assert_eq!(map.raw_entry().from_hash(hash3, |k| *k == 3), None);
            assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash3, &3), None);
            assert_eq!(map.len(), 5);

            // Nonexistent key (insert)
            match map.raw_entry_mut().from_key(&10) {
                Occupied(_) => unreachable!(),
                Vacant(view) => {
                    assert_eq!(view.insert(10, 1000), (&mut 10, &mut 1000));
                }
            }
            assert_eq!(map.raw_entry().from_key(&10).unwrap(), (&10, &1000));
            assert_eq!(map.len(), 6);

            // Ensure all lookup methods produce equivalent results.
            for k in 0..12 {
                let hash = compute_hash(&map, k);
                let v = map.get(&k).copied();
                let kv = v.as_ref().map(|v| (&k, v));

                assert_eq!(map.raw_entry().from_key(&k), kv);
                assert_eq!(map.raw_entry().from_hash(hash, |q| *q == k), kv);
                assert_eq!(map.raw_entry().from_key_hashed_nocheck(hash, &k), kv);

                match map.raw_entry_mut().from_key(&k) {
                    Occupied(o) => assert_eq!(Some(o.get_key_value()), kv),
                    Vacant(_) => assert_eq!(v, None),
                }
                match map.raw_entry_mut().from_key_hashed_nocheck(hash, &k) {
                    Occupied(o) => assert_eq!(Some(o.get_key_value()), kv),
                    Vacant(_) => assert_eq!(v, None),
                }
                match map.raw_entry_mut().from_hash(hash, |q| *q == k) {
                    Occupied(o) => assert_eq!(Some(o.get_key_value()), kv),
                    Vacant(_) => assert_eq!(v, None),
                }
            }
        }

        #[test]
        fn test_key_without_hash_impl() {
            #[derive(Debug)]
            struct IntWrapper(u64);

            let mut m: HashMap<IntWrapper, (), ()> = HashMap::default();
            {
                assert!(m.raw_entry().from_hash(0, |k| k.0 == 0).is_none());
            }
            {
                let vacant_entry = match m.raw_entry_mut().from_hash(0, |k| k.0 == 0) {
                    RawEntryMut::Occupied(..) => panic!("Found entry for key 0"),
                    RawEntryMut::Vacant(e) => e,
                };
                vacant_entry.insert_with_hasher(0, IntWrapper(0), (), |k| k.0);
            }
            {
                assert!(m.raw_entry().from_hash(0, |k| k.0 == 0).is_some());
                assert!(m.raw_entry().from_hash(1, |k| k.0 == 1).is_none());
                assert!(m.raw_entry().from_hash(2, |k| k.0 == 2).is_none());
            }
            {
                let vacant_entry = match m.raw_entry_mut().from_hash(1, |k| k.0 == 1) {
                    RawEntryMut::Occupied(..) => panic!("Found entry for key 1"),
                    RawEntryMut::Vacant(e) => e,
                };
                vacant_entry.insert_with_hasher(1, IntWrapper(1), (), |k| k.0);
            }
            {
                assert!(m.raw_entry().from_hash(0, |k| k.0 == 0).is_some());
                assert!(m.raw_entry().from_hash(1, |k| k.0 == 1).is_some());
                assert!(m.raw_entry().from_hash(2, |k| k.0 == 2).is_none());
            }
            {
                let occupied_entry = match m.raw_entry_mut().from_hash(0, |k| k.0 == 0) {
                    RawEntryMut::Occupied(e) => e,
                    RawEntryMut::Vacant(..) => panic!("Couldn't find entry for key 0"),
                };
                occupied_entry.remove();
            }
            assert!(m.raw_entry().from_hash(0, |k| k.0 == 0).is_none());
            assert!(m.raw_entry().from_hash(1, |k| k.0 == 1).is_some());
            assert!(m.raw_entry().from_hash(2, |k| k.0 == 2).is_none());
        }

        #[test]
        #[cfg(feature = "raw")]
        fn test_into_iter_refresh() {
            #[cfg(miri)]
            const N: usize = 32;
            #[cfg(not(miri))]
            const N: usize = 128;

            let mut rng = rand::thread_rng();
            for n in 0..N {
                let mut map = HashMap::new();
                for i in 0..n {
                    assert!(map.insert(i, 2 * i).is_none());
                }
                let hash_builder = map.hasher().clone();

                let mut it = unsafe { map.table.iter() };
                assert_eq!(it.len(), n);

                let mut i = 0;
                let mut left = n;
                let mut removed = Vec::new();
                loop {
                    // occasionally remove some elements
                    if i < n && rng.gen_bool(0.1) {
                        let hash_value = super::make_insert_hash(&hash_builder, &i);

                        unsafe {
                            let e = map.table.find(hash_value, |q| q.0.eq(&i));
                            if let Some(e) = e {
                                it.reflect_remove(&e);
                                let t = map.table.remove(e);
                                removed.push(t);
                                left -= 1;
                            } else {
                                assert!(removed.contains(&(i, 2 * i)), "{} not in {:?}", i, removed);
                                let e = map.table.insert(
                                    hash_value,
                                    (i, 2 * i),
                                    super::make_hasher::<usize, _, usize, _>(&hash_builder),
                                );
                                it.reflect_insert(&e);
                                if let Some(p) = removed.iter().position(|e| e == &(i, 2 * i)) {
                                    removed.swap_remove(p);
                                }
                                left += 1;
                            }
                        }
                    }

                    let e = it.next();
                    if e.is_none() {
                        break;
                    }
                    assert!(i < n);
                    let t = unsafe { e.unwrap().as_ref() };
                    assert!(!removed.contains(t));
                    let (key, value) = t;
                    assert_eq!(*value, 2 * key);
                    i += 1;
                }
                assert!(i <= n);

                // just for safety:
                assert_eq!(map.table.len(), left);
            }
        }

        #[test]
        fn test_const_with_hasher() {
            use core::hash::BuildHasher;
            use std::collections::hash_map::DefaultHasher;

            #[derive(Clone)]
            struct MyHasher;
            impl BuildHasher for MyHasher {
                type Hasher = DefaultHasher;

                fn build_hasher(&self) -> DefaultHasher {
                    DefaultHasher::new()
                }
            }

            const EMPTY_MAP: HashMap<u32, std::string::String, MyHasher> =
                HashMap::with_hasher(MyHasher);

            let mut map = EMPTY_MAP;
            map.insert(17, "seventeen".to_owned());
            assert_eq!("seventeen", map[&17]);
        }

        #[test]
        fn test_get_each_mut() {
            let mut map = HashMap::new();
            map.insert("foo".to_owned(), 0);
            map.insert("bar".to_owned(), 10);
            map.insert("baz".to_owned(), 20);
            map.insert("qux".to_owned(), 30);

            let xs = map.get_many_mut(["foo", "qux"]);
            assert_eq!(xs, Some([&mut 0, &mut 30]));

            let xs = map.get_many_mut(["foo", "dud"]);
            assert_eq!(xs, None);

            let xs = map.get_many_mut(["foo", "foo"]);
            assert_eq!(xs, None);

            let ys = map.get_many_key_value_mut(["bar", "baz"]);
            assert_eq!(
                ys,
                Some([(&"bar".to_owned(), &mut 10), (&"baz".to_owned(), &mut 20),]),
            );

            let ys = map.get_many_key_value_mut(["bar", "dip"]);
            assert_eq!(ys, None);

            let ys = map.get_many_key_value_mut(["baz", "baz"]);
            assert_eq!(ys, None);
        }

        #[test]
        #[should_panic = "panic in drop"]
        fn test_clone_from_double_drop() {
            #[derive(Clone)]
            struct CheckedDrop {
                panic_in_drop: bool,
                dropped: bool,
            }
            impl Drop for CheckedDrop {
                fn drop(&mut self) {
                    if self.panic_in_drop {
                        self.dropped = true;
                        panic!("panic in drop");
                    }
                    if self.dropped {
                        panic!("double drop");
                    }
                    self.dropped = true;
                }
            }
            const DISARMED: CheckedDrop = CheckedDrop {
                panic_in_drop: false,
                dropped: false,
            };
            const ARMED: CheckedDrop = CheckedDrop {
                panic_in_drop: true,
                dropped: false,
            };

            let mut map1 = HashMap::new();
            map1.insert(1, DISARMED);
            map1.insert(2, DISARMED);
            map1.insert(3, DISARMED);
            map1.insert(4, DISARMED);

            let mut map2 = HashMap::new();
            map2.insert(1, DISARMED);
            map2.insert(2, ARMED);
            map2.insert(3, DISARMED);
            map2.insert(4, DISARMED);

            map2.clone_from(&map1);
        }
    }