@@ -290,7 +290,9 @@ impl<K, V> HashMap<K, V, DefaultHashBuilder> {
290
290
/// The hash map is initially created with a capacity of 0, so it will not allocate until it
291
291
/// is first inserted into.
292
292
///
293
- /// Warning: `hash_builder` normally use a fixed key by default and that does
293
+ /// # HashDoS resistance
294
+ ///
295
+ /// The `hash_builder` normally use a fixed key by default and that does
294
296
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
295
297
/// Users who require HashDoS resistance should explicitly use
296
298
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -318,7 +320,9 @@ impl<K, V> HashMap<K, V, DefaultHashBuilder> {
318
320
/// The hash map will be able to hold at least `capacity` elements without
319
321
/// reallocating. If `capacity` is 0, the hash map will not allocate.
320
322
///
321
- /// Warning: `hash_builder` normally use a fixed key by default and that does
323
+ /// # HashDoS resistance
324
+ ///
325
+ /// The `hash_builder` normally use a fixed key by default and that does
322
326
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
323
327
/// Users who require HashDoS resistance should explicitly use
324
328
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -349,7 +353,9 @@ impl<K, V, A: Allocator + Clone> HashMap<K, V, DefaultHashBuilder, A> {
349
353
/// The hash map is initially created with a capacity of 0, so it will not allocate until it
350
354
/// is first inserted into.
351
355
///
352
- /// Warning: `hash_builder` normally use a fixed key by default and that does
356
+ /// # HashDoS resistance
357
+ ///
358
+ /// The `hash_builder` normally use a fixed key by default and that does
353
359
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
354
360
/// Users who require HashDoS resistance should explicitly use
355
361
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -398,7 +404,9 @@ impl<K, V, A: Allocator + Clone> HashMap<K, V, DefaultHashBuilder, A> {
398
404
/// The hash map will be able to hold at least `capacity` elements without
399
405
/// reallocating. If `capacity` is 0, the hash map will not allocate.
400
406
///
401
- /// Warning: `hash_builder` normally use a fixed key by default and that does
407
+ /// # HashDoS resistance
408
+ ///
409
+ /// The `hash_builder` normally use a fixed key by default and that does
402
410
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
403
411
/// Users who require HashDoS resistance should explicitly use
404
412
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -455,7 +463,9 @@ impl<K, V, S> HashMap<K, V, S> {
455
463
/// The hash map is initially created with a capacity of 0, so it will not
456
464
/// allocate until it is first inserted into.
457
465
///
458
- /// Warning: `hash_builder` normally use a fixed key by default and that does
466
+ /// # HashDoS resistance
467
+ ///
468
+ /// The `hash_builder` normally use a fixed key by default and that does
459
469
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
460
470
/// Users who require HashDoS resistance should explicitly use
461
471
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -495,7 +505,9 @@ impl<K, V, S> HashMap<K, V, S> {
495
505
/// The hash map will be able to hold at least `capacity` elements without
496
506
/// reallocating. If `capacity` is 0, the hash map will not allocate.
497
507
///
498
- /// Warning: `hash_builder` normally use a fixed key by default and that does
508
+ /// # HashDoS resistance
509
+ ///
510
+ /// The `hash_builder` normally use a fixed key by default and that does
499
511
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
500
512
/// Users who require HashDoS resistance should explicitly use
501
513
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -543,7 +555,9 @@ impl<K, V, S, A: Allocator + Clone> HashMap<K, V, S, A> {
543
555
/// The hash map is initially created with a capacity of 0, so it will not allocate until it
544
556
/// is first inserted into.
545
557
///
546
- /// Warning: `hash_builder` normally use a fixed key by default and that does
558
+ /// # HashDoS resistance
559
+ ///
560
+ /// The `hash_builder` normally use a fixed key by default and that does
547
561
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
548
562
/// Users who require HashDoS resistance should explicitly use
549
563
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -576,7 +590,9 @@ impl<K, V, S, A: Allocator + Clone> HashMap<K, V, S, A> {
576
590
/// The hash map will be able to hold at least `capacity` elements without
577
591
/// reallocating. If `capacity` is 0, the hash map will not allocate.
578
592
///
579
- /// Warning: `hash_builder` normally use a fixed key by default and that does
593
+ /// # HashDoS resistance
594
+ ///
595
+ /// The `hash_builder` normally use a fixed key by default and that does
580
596
/// not allow the `HashMap` to be protected against attacks such as [`HashDoS`].
581
597
/// Users who require HashDoS resistance should explicitly use
582
598
/// [`ahash::RandomState`] or [`std::collections::hash_map::RandomState`]
@@ -6193,7 +6209,7 @@ impl<'a, 'b, K, Q: ?Sized, V, S, A: Allocator + Clone> OccupiedEntryRef<'a, 'b,
6193
6209
///
6194
6210
/// # Panics
6195
6211
///
6196
- /// Will panic if this OccupiedEntryRef was created through [`Entry ::insert`].
6212
+ /// Will panic if this OccupiedEntryRef was created through [`EntryRef ::insert`].
6197
6213
///
6198
6214
/// # Examples
6199
6215
///
0 commit comments