Build #327244 2020-12-21T03:05:17.709424+00:00
# rustc version
rustc 1.50.0-nightly (c609b2eaf 2020-12-20)# docs.rs version
docsrs 0.6.0 (4145c69 2020-12-19)# build log
[INFO] running `Command { std: "docker" "create" "-v" "/home/cratesfyi/workspace/builds/griddle-0.4.1/target:/opt/rustwide/target:rw,Z" "-v" "/home/cratesfyi/workspace/builds/griddle-0.4.1/source:/opt/rustwide/workdir:ro,Z" "-v" "/home/cratesfyi/workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/home/cratesfyi/workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "DOCS_RS=1" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "3221225472" "--cpus" "2" "--user" "1001:1001" "--network" "none" "rustops/crates-build-env@sha256:b8eeb62f26c39b23691079a6cb6de528d8e88b4d71a8f6b1d30f8ba7d9c16de9" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "rustdoc" "--lib" "-Zrustdoc-map" "--features" "rayon serde raw" "-Zunstable-options" "--config=doc.extern-map.registries.crates-io=\"https://docs.rs\"" "-j2" "--" "-Z" "unstable-options" "--resource-suffix" "-20201220-1.50.0-nightly-c609b2eaf" "--static-root-path" "/" "--cap-lints" "warn" "--disable-per-crate-search", kill_on_drop: false }`
[INFO] [stdout] 397516370f9a0f0dcc3c50062fc1ce449a7af25034948613e256b9a2cea42a08
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "397516370f9a0f0dcc3c50062fc1ce449a7af25034948613e256b9a2cea42a08", kill_on_drop: false }`
[INFO] [stderr] /opt/crates-build-env/entrypoint.sh: line 7: /etc/hosts: Permission denied
[INFO] [stderr] Compiling autocfg v1.0.1
[INFO] [stderr] Checking lazy_static v1.4.0
[INFO] [stderr] Compiling libc v0.2.81
[INFO] [stderr] Compiling const_fn v0.4.4
[INFO] [stderr] Checking cfg-if v1.0.0
[INFO] [stderr] Compiling rayon-core v1.9.0
[INFO] [stderr] Checking scopeguard v1.1.0
[INFO] [stderr] Compiling version_check v0.9.2
[INFO] [stderr] Compiling getrandom v0.2.0
[INFO] [stderr] Compiling serde v1.0.118
[INFO] [stderr] Checking cfg-if v0.1.10
[INFO] [stderr] Checking either v1.6.1
[INFO] [stderr] Checking ahash v0.4.7
[INFO] [stderr] Compiling crossbeam-utils v0.8.1
[INFO] [stderr] Compiling memoffset v0.6.1
[INFO] [stderr] Compiling rayon v1.5.0
[INFO] [stderr] Compiling ahash v0.6.2
[INFO] [stderr] Checking num_cpus v1.13.0
[INFO] [stderr] Checking crossbeam-channel v0.5.0
[INFO] [stderr] Checking crossbeam-epoch v0.9.1
[INFO] [stderr] Checking crossbeam-deque v0.8.0
[INFO] [stderr] Checking hashbrown v0.9.1
[INFO] [stderr] Documenting griddle v0.4.1 (/opt/rustwide/workdir)
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/lib.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / //! A `HashMap` variant that spreads resize load across inserts.
[INFO] [stderr] 2 | | //!
[INFO] [stderr] 3 | | //! Most hash table implementations (including [`hashbrown`], the one in Rust's standard library)
[INFO] [stderr] 4 | | //! must occasionally "resize" the backing memory for the map as the number of elements grows.
[INFO] [stderr] ... |
[INFO] [stderr] 50 | | //! [`hashbrown`]: https://crates.io/crates/hashbrown
[INFO] [stderr] 51 | | //! [significant spikes]: https://twitter.com/jonhoo/status/1277618908355313670
[INFO] [stderr] | |_______________________________________________________________________________^
[INFO] [stderr] |
[INFO] [stderr] note: the lint level is defined here
[INFO] [stderr] --> src/lib.rs:56:9
[INFO] [stderr] |
[INFO] [stderr] 56 | #![warn(rustdoc)]
[INFO] [stderr] | ^^^^^^^
[INFO] [stderr] = note: `#[warn(missing_doc_code_examples)]` implied by `#[warn(rustdoc)]`
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/lib.rs:66:1
[INFO] [stderr] |
[INFO] [stderr] 66 | / /// Experimental and unsafe `RawTable` API. This module is only available if the
[INFO] [stderr] 67 | | /// `raw` feature is enabled.
[INFO] [stderr] | |_____________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / #[cfg(any(test, miri))]
[INFO] [stderr] 2 | | pub(crate) const R: usize = 4;
[INFO] [stderr] 3 | | #[cfg(not(any(test, miri)))]
[INFO] [stderr] 4 | | const R: usize = 8;
[INFO] [stderr] ... |
[INFO] [stderr] 804 | | impl<T> ExactSizeIterator for RawDrain<'_, T> {}
[INFO] [stderr] 805 | | impl<T> FusedIterator for RawDrain<'_, T> {}
[INFO] [stderr] | |____________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:10:1
[INFO] [stderr] |
[INFO] [stderr] 10 | / /// A reference to a hash table bucket containing a `T`.
[INFO] [stderr] 11 | | ///
[INFO] [stderr] 12 | | /// This is usually just a pointer to the element itself. However if the element
[INFO] [stderr] 13 | | /// is a ZST, then we instead track the index of the element in the table so
[INFO] [stderr] 14 | | /// that `erase` works properly.
[INFO] [stderr] | |________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:30:1
[INFO] [stderr] |
[INFO] [stderr] 30 | / impl<T> Bucket<T> {
[INFO] [stderr] 31 | | /// Returns true if this bucket is in the "old" table and will be moved.
[INFO] [stderr] 32 | | pub fn will_move(&self) -> bool {
[INFO] [stderr] 33 | | !self.in_main
[INFO] [stderr] 34 | | }
[INFO] [stderr] 35 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:31:5
[INFO] [stderr] |
[INFO] [stderr] 31 | /// Returns true if this bucket is in the "old" table and will be moved.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:44:1
[INFO] [stderr] |
[INFO] [stderr] 44 | / /// A raw hash table with an unsafe API.
[INFO] [stderr] 45 | | ///
[INFO] [stderr] 46 | | /// This is a wrapper around [`hashbrown::raw::RawTable`] that also implements incremental
[INFO] [stderr] 47 | | /// resizing. When you interact with this API, keep in mind that there may be two backing tables,
[INFO] [stderr] 48 | | /// and a lookup may return a reference to _either_. Eventually, entries in the old table will be
[INFO] [stderr] 49 | | /// reclaimed, which invalidates any references to them.
[INFO] [stderr] | |________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:55:1
[INFO] [stderr] |
[INFO] [stderr] 55 | / impl<T> RawTable<T> {
[INFO] [stderr] 56 | | /// Creates a new empty hash table without allocating any memory.
[INFO] [stderr] 57 | | ///
[INFO] [stderr] 58 | | /// In effect this returns a table with exactly 1 bucket. However we can
[INFO] [stderr] ... |
[INFO] [stderr] 433 | | }
[INFO] [stderr] 434 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:56:5
[INFO] [stderr] |
[INFO] [stderr] 56 | / /// Creates a new empty hash table without allocating any memory.
[INFO] [stderr] 57 | | ///
[INFO] [stderr] 58 | | /// In effect this returns a table with exactly 1 bucket. However we can
[INFO] [stderr] 59 | | /// leave the data pointer dangling since that bucket is never written to
[INFO] [stderr] 60 | | /// due to our load factor forcing us to always have at least 1 free bucket.
[INFO] [stderr] | |________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:69:5
[INFO] [stderr] |
[INFO] [stderr] 69 | / /// Attempts to allocate a new hash table with at least enough capacity
[INFO] [stderr] 70 | | /// for inserting the given number of elements without reallocating.
[INFO] [stderr] | |________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:79:5
[INFO] [stderr] |
[INFO] [stderr] 79 | / /// Allocates a new hash table with at least enough capacity for inserting
[INFO] [stderr] 80 | | /// the given number of elements without reallocating.
[INFO] [stderr] | |__________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:88:5
[INFO] [stderr] |
[INFO] [stderr] 88 | /// Returns a pointer to an element in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:97:5
[INFO] [stderr] |
[INFO] [stderr] 97 | /// Erases an element from the table, dropping it in place.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:110:5
[INFO] [stderr] |
[INFO] [stderr] 110 | / /// Finds and erases an element from the table, dropping it in place.
[INFO] [stderr] 111 | | /// Returns true if an element was found.
[INFO] [stderr] | |_____________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:124:5
[INFO] [stderr] |
[INFO] [stderr] 124 | /// Removes an element from the table, returning it.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:143:5
[INFO] [stderr] |
[INFO] [stderr] 143 | /// Finds and removes an element from the table, returning it.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:153:5
[INFO] [stderr] |
[INFO] [stderr] 153 | /// Removes all elements from the table without freeing the backing memory.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:160:5
[INFO] [stderr] |
[INFO] [stderr] 160 | / /// Shrinks the table so that it fits as close to `min_size` elements as possible.
[INFO] [stderr] 161 | | ///
[INFO] [stderr] 162 | | /// In reality, the table may end up larger than `min_size`, as must be able to hold all the
[INFO] [stderr] 163 | | /// current elements, as well as some additional elements due to incremental resizing.
[INFO] [stderr] | |__________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:183:5
[INFO] [stderr] |
[INFO] [stderr] 183 | / /// Ensures that at least `additional` items can be inserted into the table
[INFO] [stderr] 184 | | /// without reallocation.
[INFO] [stderr] 185 | | ///
[INFO] [stderr] 186 | | /// While we try to make this incremental where possible, it may require all-at-once resizing.
[INFO] [stderr] | |__________________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:222:5
[INFO] [stderr] |
[INFO] [stderr] 222 | / /// Tries to ensure that at least `additional` items can be inserted into
[INFO] [stderr] 223 | | /// the table without reallocation.
[INFO] [stderr] 224 | | ///
[INFO] [stderr] 225 | | /// While we try to make this incremental where possible, it may require all-at-once resizing.
[INFO] [stderr] | |__________________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:259:5
[INFO] [stderr] |
[INFO] [stderr] 259 | / /// Inserts a new element into the table, and returns its raw bucket.
[INFO] [stderr] 260 | | ///
[INFO] [stderr] 261 | | /// This does not check if the given element already exists in the table.
[INFO] [stderr] | |_____________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:275:5
[INFO] [stderr] |
[INFO] [stderr] 275 | / /// Inserts a new element into the table, and returns a mutable reference to it.
[INFO] [stderr] 276 | | ///
[INFO] [stderr] 277 | | /// This does not check if the given element already exists in the table.
[INFO] [stderr] | |_____________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:283:5
[INFO] [stderr] |
[INFO] [stderr] 283 | / /// Inserts a new element into the table, without growing the table.
[INFO] [stderr] 284 | | ///
[INFO] [stderr] 285 | | /// There must be enough space in the table to insert the new element.
[INFO] [stderr] 286 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 290 | | /// This is because while the insert won't grow the table, it may need to carry over some
[INFO] [stderr] 291 | | /// elements from the pre-resize table to the current table, which requires re-hashing.
[INFO] [stderr] | |___________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:307:5
[INFO] [stderr] |
[INFO] [stderr] 307 | / /// Temporary removes a bucket, applying the given function to the removed
[INFO] [stderr] 308 | | /// element and optionally put back the returned value in the same bucket.
[INFO] [stderr] 309 | | ///
[INFO] [stderr] 310 | | /// Returns `true` if the bucket still contains an element
[INFO] [stderr] 311 | | ///
[INFO] [stderr] 312 | | /// This does not check if the given bucket is actually occupied.
[INFO] [stderr] | |_____________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:335:5
[INFO] [stderr] |
[INFO] [stderr] 335 | /// Searches for an element in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:356:5
[INFO] [stderr] |
[INFO] [stderr] 356 | /// Gets a reference to an element in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:366:5
[INFO] [stderr] |
[INFO] [stderr] 366 | /// Gets a mutable reference to an element in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:376:5
[INFO] [stderr] |
[INFO] [stderr] 376 | / /// Returns the number of elements the map can hold without reallocating.
[INFO] [stderr] 377 | | ///
[INFO] [stderr] 378 | | /// This number is a lower bound; the table might be able to hold
[INFO] [stderr] 379 | | /// more, but is guaranteed to be able to hold at least this many.
[INFO] [stderr] | |______________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:385:5
[INFO] [stderr] |
[INFO] [stderr] 385 | /// Returns the number of elements in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:391:5
[INFO] [stderr] |
[INFO] [stderr] 391 | /// Returns the number of buckets in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:397:5
[INFO] [stderr] |
[INFO] [stderr] 397 | / /// Returns an iterator over every element in the table. It is up to
[INFO] [stderr] 398 | | /// the caller to ensure that the `RawTable` outlives the `RawIter`.
[INFO] [stderr] 399 | | /// Because we cannot make the `next` method unsafe on the `RawIter`
[INFO] [stderr] 400 | | /// struct, we have to make the `iter` method unsafe.
[INFO] [stderr] | |_________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:409:5
[INFO] [stderr] |
[INFO] [stderr] 409 | / /// Returns an iterator which removes all elements from the table without
[INFO] [stderr] 410 | | /// freeing the memory.
[INFO] [stderr] | |___________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:422:5
[INFO] [stderr] |
[INFO] [stderr] 422 | / /// Returns an iterator which consumes all elements from the table.
[INFO] [stderr] 423 | | ///
[INFO] [stderr] 424 | | /// Iteration starts at the provided iterator's current location.
[INFO] [stderr] 425 | | ///
[INFO] [stderr] 426 | | /// It is up to the caller to ensure that the iterator is valid for this
[INFO] [stderr] 427 | | /// `RawTable` and covers all items that remain in the table.
[INFO] [stderr] | |_________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:436:1
[INFO] [stderr] |
[INFO] [stderr] 436 | / fn and_carry_with_hasher<T: Clone>(
[INFO] [stderr] 437 | | table: &mut raw::RawTable<T>,
[INFO] [stderr] 438 | | leftovers: &Option<OldTable<T>>,
[INFO] [stderr] 439 | | hasher: impl Fn(&T) -> u64,
[INFO] [stderr] ... |
[INFO] [stderr] 447 | | }
[INFO] [stderr] 448 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:450:1
[INFO] [stderr] |
[INFO] [stderr] 450 | / impl<T: Clone> RawTable<T> {
[INFO] [stderr] 451 | | /// Variant of `clone_from` to use when a hasher is available.
[INFO] [stderr] 452 | | pub fn clone_from_with_hasher(&mut self, source: &Self, hasher: impl Fn(&T) -> u64) {
[INFO] [stderr] 453 | | let _ = self.leftovers.take();
[INFO] [stderr] ... |
[INFO] [stderr] 468 | | }
[INFO] [stderr] 469 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:451:5
[INFO] [stderr] |
[INFO] [stderr] 451 | /// Variant of `clone_from` to use when a hasher is available.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:459:5
[INFO] [stderr] |
[INFO] [stderr] 459 | /// Variant of `clone` to use when a hasher is available.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:471:1
[INFO] [stderr] |
[INFO] [stderr] 471 | / impl<T> RawTable<T> {
[INFO] [stderr] 472 | | #[cold]
[INFO] [stderr] 473 | | #[inline(never)]
[INFO] [stderr] 474 | | fn grow(&mut self, extra: usize) {
[INFO] [stderr] ... |
[INFO] [stderr] 587 | | }
[INFO] [stderr] 588 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:474:5
[INFO] [stderr] |
[INFO] [stderr] 474 | / fn grow(&mut self, extra: usize) {
[INFO] [stderr] 475 | | if let Err(_) = self.try_grow(extra, false) {
[INFO] [stderr] 476 | | unsafe { core::hint::unreachable_unchecked() };
[INFO] [stderr] 477 | | }
[INFO] [stderr] 478 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:481:5
[INFO] [stderr] |
[INFO] [stderr] 481 | / fn try_grow(&mut self, extra: usize, fallible: bool) -> Result<(), TryReserveError> {
[INFO] [stderr] 482 | | debug_assert!(self.leftovers.is_none());
[INFO] [stderr] 483 | |
[INFO] [stderr] 484 | | // We need to grow the table by at least a factor of (R + 1)/R to ensure that
[INFO] [stderr] ... |
[INFO] [stderr] 517 | | Ok(())
[INFO] [stderr] 518 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:522:5
[INFO] [stderr] |
[INFO] [stderr] 522 | / pub(crate) fn carry_all(&mut self, hasher: impl Fn(&T) -> u64) {
[INFO] [stderr] 523 | | if let Some(ref mut lo) = self.leftovers {
[INFO] [stderr] 524 | | // It is safe to continue to access this iterator because:
[INFO] [stderr] 525 | | // - we have not de-allocated the table it points into
[INFO] [stderr] ... |
[INFO] [stderr] 540 | | }
[INFO] [stderr] 541 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:545:5
[INFO] [stderr] |
[INFO] [stderr] 545 | / pub(crate) fn carry(&mut self, hasher: impl Fn(&T) -> u64) {
[INFO] [stderr] 546 | | if let Some(ref mut lo) = self.leftovers {
[INFO] [stderr] 547 | | for _ in 0..R {
[INFO] [stderr] 548 | | // It is safe to continue to access this iterator because:
[INFO] [stderr] ... |
[INFO] [stderr] 572 | | }
[INFO] [stderr] 573 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:575:5
[INFO] [stderr] |
[INFO] [stderr] 575 | / pub(crate) fn is_split(&self) -> bool {
[INFO] [stderr] 576 | | self.leftovers.is_some()
[INFO] [stderr] 577 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:580:5
[INFO] [stderr] |
[INFO] [stderr] 580 | / pub(crate) fn main(&self) -> &raw::RawTable<T> {
[INFO] [stderr] 581 | | &self.table
[INFO] [stderr] 582 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:585:5
[INFO] [stderr] |
[INFO] [stderr] 585 | / pub(crate) fn leftovers(&self) -> Option<&raw::RawTable<T>> {
[INFO] [stderr] 586 | | self.leftovers.as_ref().map(|lo| &lo.table)
[INFO] [stderr] 587 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:603:1
[INFO] [stderr] |
[INFO] [stderr] 603 | / struct OldTable<T> {
[INFO] [stderr] 604 | | table: raw::RawTable<T>,
[INFO] [stderr] 605 | |
[INFO] [stderr] 606 | | // We cache an iterator over the old table's buckets so we don't need to do a linear search
[INFO] [stderr] 607 | | // across buckets we know are empty each time we want to move more items.
[INFO] [stderr] 608 | | items: raw::RawIter<T>,
[INFO] [stderr] 609 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:611:1
[INFO] [stderr] |
[INFO] [stderr] 611 | / /// Iterator which returns a raw pointer to every full bucket in the table.
[INFO] [stderr] 612 | | ///
[INFO] [stderr] 613 | | /// For maximum flexibility this iterator is not bound by a lifetime, but you
[INFO] [stderr] 614 | | /// must observe several rules when using it:
[INFO] [stderr] ... |
[INFO] [stderr] 621 | | /// - The order in which the iterator yields bucket is unspecified and may
[INFO] [stderr] 622 | | /// change in the future.
[INFO] [stderr] | |___________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:628:1
[INFO] [stderr] |
[INFO] [stderr] 628 | / impl<T> RawIter<T> {
[INFO] [stderr] 629 | | /// Refresh the iterator so that it reflects a removal from the given bucket.
[INFO] [stderr] 630 | | ///
[INFO] [stderr] 631 | | /// For the iterator to remain valid, this method must be called once
[INFO] [stderr] ... |
[INFO] [stderr] 662 | | }
[INFO] [stderr] 663 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:629:5
[INFO] [stderr] |
[INFO] [stderr] 629 | / /// Refresh the iterator so that it reflects a removal from the given bucket.
[INFO] [stderr] 630 | | ///
[INFO] [stderr] 631 | | /// For the iterator to remain valid, this method must be called once
[INFO] [stderr] 632 | | /// for each removed bucket before `next` is called again.
[INFO] [stderr] 633 | | ///
[INFO] [stderr] 634 | | /// This method should be called _before_ the removal is made. It is not necessary to call this
[INFO] [stderr] 635 | | /// method if you are removing an item that this iterator yielded in the past.
[INFO] [stderr] | |__________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:649:5
[INFO] [stderr] |
[INFO] [stderr] 649 | / /// Refresh the iterator so that it reflects an insertion into the given bucket.
[INFO] [stderr] 650 | | ///
[INFO] [stderr] 651 | | /// For the iterator to remain valid, this method must be called once
[INFO] [stderr] 652 | | /// for each insert before `next` is called again.
[INFO] [stderr] ... |
[INFO] [stderr] 656 | | ///
[INFO] [stderr] 657 | | /// This method should be called _after_ the given insert is made.
[INFO] [stderr] | |______________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:712:1
[INFO] [stderr] |
[INFO] [stderr] 712 | /// Iterator which consumes a table and returns elements.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:718:1
[INFO] [stderr] |
[INFO] [stderr] 718 | / impl<T> RawIntoIter<T> {
[INFO] [stderr] 719 | | /// Returns a by-reference iterator over the remaining items of this iterator.
[INFO] [stderr] 720 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 721 | | pub fn iter(&self) -> RawIter<T> {
[INFO] [stderr] ... |
[INFO] [stderr] 726 | | }
[INFO] [stderr] 727 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:719:5
[INFO] [stderr] |
[INFO] [stderr] 719 | /// Returns a by-reference iterator over the remaining items of this iterator.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:753:1
[INFO] [stderr] |
[INFO] [stderr] 753 | /// Iterator which consumes elements without freeing the table storage.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:759:1
[INFO] [stderr] |
[INFO] [stderr] 759 | / impl<T> RawDrain<'_, T> {
[INFO] [stderr] 760 | | /// Returns a by-reference iterator over the remaining items of this iterator.
[INFO] [stderr] 761 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 762 | | pub fn iter(&self) -> RawIter<T> {
[INFO] [stderr] ... |
[INFO] [stderr] 767 | | }
[INFO] [stderr] 768 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/raw/mod.rs:760:5
[INFO] [stderr] |
[INFO] [stderr] 760 | /// Returns a by-reference iterator over the remaining items of this iterator.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/lib.rs:74:5
[INFO] [stderr] |
[INFO] [stderr] 74 | / /// [rayon]-based parallel iterator types for raw hash tables.
[INFO] [stderr] 75 | | /// You will rarely need to interact with it directly unless you have need
[INFO] [stderr] 76 | | /// to name one of the iterator types.
[INFO] [stderr] 77 | | ///
[INFO] [stderr] 78 | | /// [rayon]: https://docs.rs/rayon/1.0/rayon
[INFO] [stderr] | |________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/raw.rs:8:1
[INFO] [stderr] |
[INFO] [stderr] 8 | /// Parallel iterator which returns a raw pointer to every full bucket in the table.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/mod.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / #[cfg(feature = "rayon")]
[INFO] [stderr] 2 | | pub(crate) mod rayon;
[INFO] [stderr] 3 | | #[cfg(feature = "serde")]
[INFO] [stderr] 4 | | mod serde;
[INFO] [stderr] | |__________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/mod.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / mod helpers;
[INFO] [stderr] 2 | | pub(crate) mod map;
[INFO] [stderr] 3 | | pub(crate) mod raw;
[INFO] [stderr] 4 | | pub(crate) mod set;
[INFO] [stderr] | |___________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/helpers.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / use alloc::collections::LinkedList;
[INFO] [stderr] 2 | | use alloc::vec::Vec;
[INFO] [stderr] 3 | |
[INFO] [stderr] 4 | | use rayon_::iter::{IntoParallelIterator, ParallelIterator};
[INFO] [stderr] ... |
[INFO] [stderr] 25 | | (list, len)
[INFO] [stderr] 26 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/helpers.rs:6:1
[INFO] [stderr] |
[INFO] [stderr] 6 | /// Helper for collecting parallel iterators to an intermediary
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | //! Rayon extensions for `HashMap`.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:9:1
[INFO] [stderr] |
[INFO] [stderr] 9 | / /// Parallel iterator over shared references to entries in a map.
[INFO] [stderr] 10 | | ///
[INFO] [stderr] 11 | | /// This iterator is created by the [`par_iter`] method on [`HashMap`]
[INFO] [stderr] 12 | | /// (provided by the [`IntoParallelRefIterator`] trait).
[INFO] [stderr] ... |
[INFO] [stderr] 16 | | /// [`HashMap`]: /hashbrown/struct.HashMap.html
[INFO] [stderr] 17 | | /// [`IntoParallelRefIterator`]: https://docs.rs/rayon/1.0/rayon/iter/trait.IntoParallelRefIterator.html
[INFO] [stderr] | |________________________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:52:1
[INFO] [stderr] |
[INFO] [stderr] 52 | / /// Parallel iterator over shared references to keys in a map.
[INFO] [stderr] 53 | | ///
[INFO] [stderr] 54 | | /// This iterator is created by the [`par_keys`] method on [`HashMap`].
[INFO] [stderr] 55 | | /// See its documentation for more.
[INFO] [stderr] 56 | | ///
[INFO] [stderr] 57 | | /// [`par_keys`]: /hashbrown/struct.HashMap.html#method.par_keys
[INFO] [stderr] 58 | | /// [`HashMap`]: /hashbrown/struct.HashMap.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:90:1
[INFO] [stderr] |
[INFO] [stderr] 90 | / /// Parallel iterator over shared references to values in a map.
[INFO] [stderr] 91 | | ///
[INFO] [stderr] 92 | | /// This iterator is created by the [`par_values`] method on [`HashMap`].
[INFO] [stderr] 93 | | /// See its documentation for more.
[INFO] [stderr] 94 | | ///
[INFO] [stderr] 95 | | /// [`par_values`]: /hashbrown/struct.HashMap.html#method.par_values
[INFO] [stderr] 96 | | /// [`HashMap`]: /hashbrown/struct.HashMap.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:128:1
[INFO] [stderr] |
[INFO] [stderr] 128 | / /// Parallel iterator over mutable references to entries in a map.
[INFO] [stderr] 129 | | ///
[INFO] [stderr] 130 | | /// This iterator is created by the [`par_iter_mut`] method on [`HashMap`]
[INFO] [stderr] 131 | | /// (provided by the [`IntoParallelRefMutIterator`] trait).
[INFO] [stderr] ... |
[INFO] [stderr] 135 | | /// [`HashMap`]: /hashbrown/struct.HashMap.html
[INFO] [stderr] 136 | | /// [`IntoParallelRefMutIterator`]: https://docs.rs/rayon/1.0/rayon/iter/trait.IntoParallelRefMutIterator.html
[INFO] [stderr] | |______________________________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:166:1
[INFO] [stderr] |
[INFO] [stderr] 166 | / /// Parallel iterator over mutable references to values in a map.
[INFO] [stderr] 167 | | ///
[INFO] [stderr] 168 | | /// This iterator is created by the [`par_values_mut`] method on [`HashMap`].
[INFO] [stderr] 169 | | /// See its documentation for more.
[INFO] [stderr] 170 | | ///
[INFO] [stderr] 171 | | /// [`par_values_mut`]: /hashbrown/struct.HashMap.html#method.par_values_mut
[INFO] [stderr] 172 | | /// [`HashMap`]: /hashbrown/struct.HashMap.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:197:1
[INFO] [stderr] |
[INFO] [stderr] 197 | / impl<K: Sync, V: Sync, S: Sync> HashMap<K, V, S> {
[INFO] [stderr] 198 | | /// Visits (potentially in parallel) immutably borrowed keys in an arbitrary order.
[INFO] [stderr] 199 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 200 | | pub fn par_keys(&self) -> ParKeys<'_, K, V, S> {
[INFO] [stderr] ... |
[INFO] [stderr] 208 | | }
[INFO] [stderr] 209 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:198:5
[INFO] [stderr] |
[INFO] [stderr] 198 | /// Visits (potentially in parallel) immutably borrowed keys in an arbitrary order.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:204:5
[INFO] [stderr] |
[INFO] [stderr] 204 | /// Visits (potentially in parallel) immutably borrowed values in an arbitrary order.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:211:1
[INFO] [stderr] |
[INFO] [stderr] 211 | / impl<K: Send, V: Send, S: Send> HashMap<K, V, S> {
[INFO] [stderr] 212 | | /// Visits (potentially in parallel) mutably borrowed values in an arbitrary order.
[INFO] [stderr] 213 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 214 | | pub fn par_values_mut(&mut self) -> ParValuesMut<'_, K, V, S> {
[INFO] [stderr] 215 | | ParValuesMut { map: self }
[INFO] [stderr] 216 | | }
[INFO] [stderr] 217 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:212:5
[INFO] [stderr] |
[INFO] [stderr] 212 | /// Visits (potentially in parallel) mutably borrowed values in an arbitrary order.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:219:1
[INFO] [stderr] |
[INFO] [stderr] 219 | / impl<K, V, S> HashMap<K, V, S>
[INFO] [stderr] 220 | | where
[INFO] [stderr] 221 | | K: Eq + Hash + Sync,
[INFO] [stderr] 222 | | V: PartialEq + Sync,
[INFO] [stderr] ... |
[INFO] [stderr] 234 | | }
[INFO] [stderr] 235 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:225:5
[INFO] [stderr] |
[INFO] [stderr] 225 | / /// Returns `true` if the map is equal to another,
[INFO] [stderr] 226 | | /// i.e. both maps contain the same keys mapped to the same values.
[INFO] [stderr] 227 | | ///
[INFO] [stderr] 228 | | /// This method runs in a potentially parallel fashion.
[INFO] [stderr] | |___________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/map.rs:308:1
[INFO] [stderr] |
[INFO] [stderr] 308 | / fn extend<K, V, S, I>(map: &mut HashMap<K, V, S>, par_iter: I)
[INFO] [stderr] 309 | | where
[INFO] [stderr] 310 | | K: Eq + Hash,
[INFO] [stderr] 311 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 325 | | }
[INFO] [stderr] 326 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/raw.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / use crate::raw::Bucket;
[INFO] [stderr] 2 | | use crate::raw::RawTable;
[INFO] [stderr] 3 | | use rayon_::iter::{
[INFO] [stderr] 4 | | plumbing::{Reducer, UnindexedConsumer},
[INFO] [stderr] ... |
[INFO] [stderr] 58 | | }
[INFO] [stderr] 59 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/raw.rs:50:1
[INFO] [stderr] |
[INFO] [stderr] 50 | / impl<T> RawTable<T> {
[INFO] [stderr] 51 | | /// Returns a parallel iterator over the elements in a `RawTable`.
[INFO] [stderr] 52 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 53 | | pub unsafe fn par_iter(&self) -> RawParIter<T> {
[INFO] [stderr] ... |
[INFO] [stderr] 58 | | }
[INFO] [stderr] 59 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/raw.rs:51:5
[INFO] [stderr] |
[INFO] [stderr] 51 | /// Returns a parallel iterator over the elements in a `RawTable`.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | //! Rayon extensions for `HashSet`.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:8:1
[INFO] [stderr] |
[INFO] [stderr] 8 | / /// Parallel iterator over shared references to elements in a set.
[INFO] [stderr] 9 | | ///
[INFO] [stderr] 10 | | /// This iterator is created by the [`par_iter`] method on [`HashSet`]
[INFO] [stderr] 11 | | /// (provided by the [`IntoParallelRefIterator`] trait).
[INFO] [stderr] ... |
[INFO] [stderr] 15 | | /// [`HashSet`]: /hashbrown/struct.HashSet.html
[INFO] [stderr] 16 | | /// [`IntoParallelRefIterator`]: https://docs.rs/rayon/1.0/rayon/iter/trait.IntoParallelRefIterator.html
[INFO] [stderr] | |________________________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:32:1
[INFO] [stderr] |
[INFO] [stderr] 32 | / /// Parallel iterator over shared references to elements in the difference of
[INFO] [stderr] 33 | | /// sets.
[INFO] [stderr] 34 | | ///
[INFO] [stderr] 35 | | /// This iterator is created by the [`par_difference`] method on [`HashSet`].
[INFO] [stderr] ... |
[INFO] [stderr] 38 | | /// [`par_difference`]: /hashbrown/struct.HashSet.html#method.par_difference
[INFO] [stderr] 39 | | /// [`HashSet`]: /hashbrown/struct.HashSet.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:63:1
[INFO] [stderr] |
[INFO] [stderr] 63 | / /// Parallel iterator over shared references to elements in the symmetric
[INFO] [stderr] 64 | | /// difference of sets.
[INFO] [stderr] 65 | | ///
[INFO] [stderr] 66 | | /// This iterator is created by the [`par_symmetric_difference`] method on
[INFO] [stderr] ... |
[INFO] [stderr] 70 | | /// [`par_symmetric_difference`]: /hashbrown/struct.HashSet.html#method.par_symmetric_difference
[INFO] [stderr] 71 | | /// [`HashSet`]: /hashbrown/struct.HashSet.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:95:1
[INFO] [stderr] |
[INFO] [stderr] 95 | / /// Parallel iterator over shared references to elements in the intersection of
[INFO] [stderr] 96 | | /// sets.
[INFO] [stderr] 97 | | ///
[INFO] [stderr] 98 | | /// This iterator is created by the [`par_intersection`] method on [`HashSet`].
[INFO] [stderr] ... |
[INFO] [stderr] 101 | | /// [`par_intersection`]: /hashbrown/struct.HashSet.html#method.par_intersection
[INFO] [stderr] 102 | | /// [`HashSet`]: /hashbrown/struct.HashSet.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:126:1
[INFO] [stderr] |
[INFO] [stderr] 126 | / /// Parallel iterator over shared references to elements in the union of sets.
[INFO] [stderr] 127 | | ///
[INFO] [stderr] 128 | | /// This iterator is created by the [`par_union`] method on [`HashSet`].
[INFO] [stderr] 129 | | /// See its documentation for more.
[INFO] [stderr] 130 | | ///
[INFO] [stderr] 131 | | /// [`par_union`]: /hashbrown/struct.HashSet.html#method.par_union
[INFO] [stderr] 132 | | /// [`HashSet`]: /hashbrown/struct.HashSet.html
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:156:1
[INFO] [stderr] |
[INFO] [stderr] 156 | / impl<T, S> HashSet<T, S>
[INFO] [stderr] 157 | | where
[INFO] [stderr] 158 | | T: Eq + Hash + Sync,
[INFO] [stderr] 159 | | S: BuildHasher + Sync,
[INFO] [stderr] ... |
[INFO] [stderr] 226 | | }
[INFO] [stderr] 227 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:161:5
[INFO] [stderr] |
[INFO] [stderr] 161 | / /// Visits (potentially in parallel) the values representing the difference,
[INFO] [stderr] 162 | | /// i.e. the values that are in `self` but not in `other`.
[INFO] [stderr] | |______________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:168:5
[INFO] [stderr] |
[INFO] [stderr] 168 | / /// Visits (potentially in parallel) the values representing the symmetric
[INFO] [stderr] 169 | | /// difference, i.e. the values that are in `self` or in `other` but not in both.
[INFO] [stderr] | |_____________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:178:5
[INFO] [stderr] |
[INFO] [stderr] 178 | / /// Visits (potentially in parallel) the values representing the
[INFO] [stderr] 179 | | /// intersection, i.e. the values that are both in `self` and `other`.
[INFO] [stderr] | |__________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:185:5
[INFO] [stderr] |
[INFO] [stderr] 185 | / /// Visits (potentially in parallel) the values representing the union,
[INFO] [stderr] 186 | | /// i.e. all the values in `self` or `other`, without duplicates.
[INFO] [stderr] | |_____________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:192:5
[INFO] [stderr] |
[INFO] [stderr] 192 | / /// Returns `true` if `self` has no elements in common with `other`.
[INFO] [stderr] 193 | | /// This is equivalent to checking for an empty intersection.
[INFO] [stderr] 194 | | ///
[INFO] [stderr] 195 | | /// This method runs in a potentially parallel fashion.
[INFO] [stderr] | |___________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:200:5
[INFO] [stderr] |
[INFO] [stderr] 200 | / /// Returns `true` if the set is a subset of another,
[INFO] [stderr] 201 | | /// i.e. `other` contains at least all the values in `self`.
[INFO] [stderr] 202 | | ///
[INFO] [stderr] 203 | | /// This method runs in a potentially parallel fashion.
[INFO] [stderr] | |___________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:212:5
[INFO] [stderr] |
[INFO] [stderr] 212 | / /// Returns `true` if the set is a superset of another,
[INFO] [stderr] 213 | | /// i.e. `self` contains at least all the values in `other`.
[INFO] [stderr] 214 | | ///
[INFO] [stderr] 215 | | /// This method runs in a potentially parallel fashion.
[INFO] [stderr] | |___________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:220:5
[INFO] [stderr] |
[INFO] [stderr] 220 | / /// Returns `true` if the set is equal to another,
[INFO] [stderr] 221 | | /// i.e. both sets contain the same values.
[INFO] [stderr] 222 | | ///
[INFO] [stderr] 223 | | /// This method runs in a potentially parallel fashion.
[INFO] [stderr] | |___________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/rayon/set.rs:284:1
[INFO] [stderr] |
[INFO] [stderr] 284 | / fn extend<T, S, I>(set: &mut HashSet<T, S>, par_iter: I)
[INFO] [stderr] 285 | | where
[INFO] [stderr] 286 | | T: Eq + Hash,
[INFO] [stderr] 287 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 301 | | }
[INFO] [stderr] 302 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/serde.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / mod size_hint {
[INFO] [stderr] 2 | | use core::cmp;
[INFO] [stderr] 3 | |
[INFO] [stderr] 4 | | /// This presumably exists to prevent denial of service attacks.
[INFO] [stderr] ... |
[INFO] [stderr] 199 | | }
[INFO] [stderr] 200 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/serde.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / mod size_hint {
[INFO] [stderr] 2 | | use core::cmp;
[INFO] [stderr] 3 | |
[INFO] [stderr] 4 | | /// This presumably exists to prevent denial of service attacks.
[INFO] [stderr] ... |
[INFO] [stderr] 10 | | }
[INFO] [stderr] 11 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/serde.rs:4:5
[INFO] [stderr] |
[INFO] [stderr] 4 | / /// This presumably exists to prevent denial of service attacks.
[INFO] [stderr] 5 | | ///
[INFO] [stderr] 6 | | /// Original discussion: https://github.com/serde-rs/serde/issues/1114.
[INFO] [stderr] | |___________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/serde.rs:13:1
[INFO] [stderr] |
[INFO] [stderr] 13 | / mod map {
[INFO] [stderr] 14 | | use core::fmt;
[INFO] [stderr] 15 | | use core::hash::{BuildHasher, Hash};
[INFO] [stderr] 16 | | use core::marker::PhantomData;
[INFO] [stderr] ... |
[INFO] [stderr] 88 | | }
[INFO] [stderr] 89 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/external_trait_impls/serde.rs:91:1
[INFO] [stderr] |
[INFO] [stderr] 91 | / mod set {
[INFO] [stderr] 92 | | use core::fmt;
[INFO] [stderr] 93 | | use core::hash::{BuildHasher, Hash};
[INFO] [stderr] 94 | | use core::marker::PhantomData;
[INFO] [stderr] ... |
[INFO] [stderr] 199 | | }
[INFO] [stderr] 200 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / use crate::raw::{Bucket, RawDrain, RawIntoIter, RawIter, RawTable};
[INFO] [stderr] 2 | | use crate::TryReserveError;
[INFO] [stderr] 3 | | use core::borrow::Borrow;
[INFO] [stderr] 4 | | use core::fmt::{self, Debug};
[INFO] [stderr] ... |
[INFO] [stderr] 4567 | | }
[INFO] [stderr] 4568 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:14:1
[INFO] [stderr] |
[INFO] [stderr] 14 | / /// A `HashMap` variant that spreads resize load across inserts.
[INFO] [stderr] 15 | | ///
[INFO] [stderr] 16 | | /// See the [crate-level documentation] for details.
[INFO] [stderr] 17 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 185 | | /// // use the values stored in map
[INFO] [stderr] 186 | | /// ```
[INFO] [stderr] | |_______^
[INFO] [stderr] |
[INFO] [stderr] note: the lint level is defined here
[INFO] [stderr] --> src/lib.rs:56:9
[INFO] [stderr] |
[INFO] [stderr] 56 | #![warn(rustdoc)]
[INFO] [stderr] | ^^^^^^^
[INFO] [stderr] = note: `#[warn(private_doc_tests)]` implied by `#[warn(rustdoc)]`
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:216:1
[INFO] [stderr] |
[INFO] [stderr] 216 | / /// Ensures that a single closure type across uses of this which, in turn prevents multiple
[INFO] [stderr] 217 | | /// instances of any functions like RawTable::reserve from being generated
[INFO] [stderr] | |__________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:228:1
[INFO] [stderr] |
[INFO] [stderr] 228 | / /// Ensures that a single closure type across uses of this which, in turn prevents multiple
[INFO] [stderr] 229 | | /// instances of any functions like RawTable::reserve from being generated
[INFO] [stderr] | |__________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:239:1
[INFO] [stderr] |
[INFO] [stderr] 239 | / /// Ensures that a single closure type across uses of this which, in turn prevents multiple
[INFO] [stderr] 240 | | /// instances of any functions like RawTable::reserve from being generated
[INFO] [stderr] | |__________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:251:1
[INFO] [stderr] |
[INFO] [stderr] 251 | / pub(crate) fn make_hash<K, Q, S>(hash_builder: &S, val: &Q) -> u64
[INFO] [stderr] 252 | | where
[INFO] [stderr] 253 | | K: Borrow<Q>,
[INFO] [stderr] 254 | | Q: Hash + ?Sized,
[INFO] [stderr] ... |
[INFO] [stderr] 270 | | }
[INFO] [stderr] 271 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:274:1
[INFO] [stderr] |
[INFO] [stderr] 274 | / pub(crate) fn make_insert_hash<K, S>(hash_builder: &S, val: &K) -> u64
[INFO] [stderr] 275 | | where
[INFO] [stderr] 276 | | K: Hash,
[INFO] [stderr] 277 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 292 | | }
[INFO] [stderr] 293 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:296:1
[INFO] [stderr] |
[INFO] [stderr] 296 | / impl<K, V> HashMap<K, V, DefaultHashBuilder> {
[INFO] [stderr] 297 | | /// Creates an empty `HashMap`.
[INFO] [stderr] 298 | | ///
[INFO] [stderr] 299 | | /// The hash map is initially created with a capacity of 0, so it will not allocate until it
[INFO] [stderr] ... |
[INFO] [stderr] 327 | | }
[INFO] [stderr] 328 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:297:5
[INFO] [stderr] |
[INFO] [stderr] 297 | / /// Creates an empty `HashMap`.
[INFO] [stderr] 298 | | ///
[INFO] [stderr] 299 | | /// The hash map is initially created with a capacity of 0, so it will not allocate until it
[INFO] [stderr] 300 | | /// is first inserted into.
[INFO] [stderr] ... |
[INFO] [stderr] 306 | | /// let mut map: HashMap<&str, i32> = HashMap::new();
[INFO] [stderr] 307 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:313:5
[INFO] [stderr] |
[INFO] [stderr] 313 | / /// Creates an empty `HashMap` with the specified capacity.
[INFO] [stderr] 314 | | ///
[INFO] [stderr] 315 | | /// The hash map will be able to hold at least `capacity` elements without
[INFO] [stderr] 316 | | /// reallocating. If `capacity` is 0, the hash map will not allocate.
[INFO] [stderr] ... |
[INFO] [stderr] 322 | | /// let mut map: HashMap<&str, i32> = HashMap::with_capacity(10);
[INFO] [stderr] 323 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:330:1
[INFO] [stderr] |
[INFO] [stderr] 330 | / impl<K, V, S> HashMap<K, V, S> {
[INFO] [stderr] 331 | | /// Creates an empty `HashMap` which will use the given hash builder to hash
[INFO] [stderr] 332 | | /// keys.
[INFO] [stderr] 333 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 684 | | }
[INFO] [stderr] 685 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:331:5
[INFO] [stderr] |
[INFO] [stderr] 331 | / /// Creates an empty `HashMap` which will use the given hash builder to hash
[INFO] [stderr] 332 | | /// keys.
[INFO] [stderr] 333 | | ///
[INFO] [stderr] 334 | | /// The created map has the default initial capacity.
[INFO] [stderr] ... |
[INFO] [stderr] 354 | | ///
[INFO] [stderr] 355 | | /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html
[INFO] [stderr] | |______________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:364:5
[INFO] [stderr] |
[INFO] [stderr] 364 | / /// Creates an empty `HashMap` with the specified capacity, using `hash_builder`
[INFO] [stderr] 365 | | /// to hash the keys.
[INFO] [stderr] 366 | | ///
[INFO] [stderr] 367 | | /// The hash map will be able to hold at least `capacity` elements without
[INFO] [stderr] ... |
[INFO] [stderr] 388 | | ///
[INFO] [stderr] 389 | | /// [`BuildHasher`]: ../../std/hash/trait.BuildHasher.html
[INFO] [stderr] | |______________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:398:5
[INFO] [stderr] |
[INFO] [stderr] 398 | / /// Returns a reference to the map's [`BuildHasher`].
[INFO] [stderr] 399 | | ///
[INFO] [stderr] 400 | | /// [`BuildHasher`]: https://doc.rust-lang.org/std/hash/trait.BuildHasher.html
[INFO] [stderr] 401 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 410 | | /// let hasher: &DefaultHashBuilder = map.hasher();
[INFO] [stderr] 411 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:417:5
[INFO] [stderr] |
[INFO] [stderr] 417 | / /// Returns the number of elements the map can hold without reallocating.
[INFO] [stderr] 418 | | ///
[INFO] [stderr] 419 | | /// This number is a lower bound; the `HashMap<K, V>` might be able to hold
[INFO] [stderr] 420 | | /// more, but is guaranteed to be able to hold at least this many.
[INFO] [stderr] ... |
[INFO] [stderr] 427 | | /// assert!(map.capacity() >= 100);
[INFO] [stderr] 428 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:434:5
[INFO] [stderr] |
[INFO] [stderr] 434 | / /// An iterator visiting all keys in arbitrary order.
[INFO] [stderr] 435 | | /// The iterator element type is `&'a K`.
[INFO] [stderr] 436 | | ///
[INFO] [stderr] 437 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 449 | | /// }
[INFO] [stderr] 450 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:456:5
[INFO] [stderr] |
[INFO] [stderr] 456 | / /// An iterator visiting all values in arbitrary order.
[INFO] [stderr] 457 | | /// The iterator element type is `&'a V`.
[INFO] [stderr] 458 | | ///
[INFO] [stderr] 459 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 471 | | /// }
[INFO] [stderr] 472 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:478:5
[INFO] [stderr] |
[INFO] [stderr] 478 | / /// An iterator visiting all values mutably in arbitrary order.
[INFO] [stderr] 479 | | /// The iterator element type is `&'a mut V`.
[INFO] [stderr] 480 | | ///
[INFO] [stderr] 481 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 498 | | /// }
[INFO] [stderr] 499 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:507:5
[INFO] [stderr] |
[INFO] [stderr] 507 | / /// An iterator visiting all key-value pairs in arbitrary order.
[INFO] [stderr] 508 | | /// The iterator element type is `(&'a K, &'a V)`.
[INFO] [stderr] 509 | | ///
[INFO] [stderr] 510 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 522 | | /// }
[INFO] [stderr] 523 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:535:5
[INFO] [stderr] |
[INFO] [stderr] 535 | / /// An iterator visiting all key-value pairs in arbitrary order,
[INFO] [stderr] 536 | | /// with mutable references to the values.
[INFO] [stderr] 537 | | /// The iterator element type is `(&'a K, &'a mut V)`.
[INFO] [stderr] 538 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 556 | | /// }
[INFO] [stderr] 557 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:580:5
[INFO] [stderr] |
[INFO] [stderr] 580 | / /// Returns the number of elements in the map.
[INFO] [stderr] 581 | | ///
[INFO] [stderr] 582 | | /// # Examples
[INFO] [stderr] 583 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 590 | | /// assert_eq!(a.len(), 1);
[INFO] [stderr] 591 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:597:5
[INFO] [stderr] |
[INFO] [stderr] 597 | / /// Returns `true` if the map contains no elements.
[INFO] [stderr] 598 | | ///
[INFO] [stderr] 599 | | /// # Examples
[INFO] [stderr] 600 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 607 | | /// assert!(!a.is_empty());
[INFO] [stderr] 608 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:614:5
[INFO] [stderr] |
[INFO] [stderr] 614 | / /// Clears the map, returning all key-value pairs as an iterator. Keeps the
[INFO] [stderr] 615 | | /// allocated memory for reuse.
[INFO] [stderr] 616 | | ///
[INFO] [stderr] 617 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 631 | | /// assert!(a.is_empty());
[INFO] [stderr] 632 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:640:5
[INFO] [stderr] |
[INFO] [stderr] 640 | / /// Retains only the elements specified by the predicate.
[INFO] [stderr] 641 | | ///
[INFO] [stderr] 642 | | /// In other words, remove all pairs `(k, v)` such that `f(&k,&mut v)` returns `false`.
[INFO] [stderr] 643 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 651 | | /// assert_eq!(map.len(), 4);
[INFO] [stderr] 652 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:668:5
[INFO] [stderr] |
[INFO] [stderr] 668 | / /// Clears the map, removing all key-value pairs. Keeps the allocated memory
[INFO] [stderr] 669 | | /// for reuse.
[INFO] [stderr] 670 | | ///
[INFO] [stderr] 671 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 679 | | /// assert!(a.is_empty());
[INFO] [stderr] 680 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:687:1
[INFO] [stderr] |
[INFO] [stderr] 687 | / impl<K, V, S> HashMap<K, V, S>
[INFO] [stderr] 688 | | where
[INFO] [stderr] 689 | | K: Eq + Hash,
[INFO] [stderr] 690 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 1118 | | }
[INFO] [stderr] 1119 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:692:5
[INFO] [stderr] |
[INFO] [stderr] 692 | / /// Reserves capacity for at least `additional` more elements to be inserted
[INFO] [stderr] 693 | | /// in the `HashMap`. The collection may reserve more space to avoid
[INFO] [stderr] 694 | | /// frequent reallocations.
[INFO] [stderr] 695 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 710 | | /// map.reserve(10);
[INFO] [stderr] 711 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:718:5
[INFO] [stderr] |
[INFO] [stderr] 718 | / /// Tries to reserve capacity for at least `additional` more elements to be inserted
[INFO] [stderr] 719 | | /// in the given `HashMap<K,V>`. The collection may reserve more space to avoid
[INFO] [stderr] 720 | | /// frequent reallocations.
[INFO] [stderr] 721 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 735 | | /// map.try_reserve(10).expect("why is the test harness OOMing on 10 bytes?");
[INFO] [stderr] 736 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:743:5
[INFO] [stderr] |
[INFO] [stderr] 743 | / /// Shrinks the capacity of the map as much as possible. It will drop
[INFO] [stderr] 744 | | /// down as much as possible while maintaining the internal rules
[INFO] [stderr] 745 | | /// and possibly leaving some space in accordance with the resize policy.
[INFO] [stderr] 746 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 757 | | /// assert!(map.capacity() >= 2);
[INFO] [stderr] 758 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:765:5
[INFO] [stderr] |
[INFO] [stderr] 765 | / /// Shrinks the capacity of the map with a lower limit. It will drop
[INFO] [stderr] 766 | | /// down no lower than the supplied limit while maintaining the internal rules
[INFO] [stderr] 767 | | /// and possibly leaving some space in accordance with the resize policy.
[INFO] [stderr] 768 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 786 | | /// assert!(map.capacity() >= 2);
[INFO] [stderr] 787 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:794:5
[INFO] [stderr] |
[INFO] [stderr] 794 | / /// Gets the given key's corresponding entry in the map for in-place manipulation.
[INFO] [stderr] 795 | | ///
[INFO] [stderr] 796 | | /// # Examples
[INFO] [stderr] 797 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 811 | | /// assert_eq!(letters.get(&'y'), None);
[INFO] [stderr] 812 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:832:5
[INFO] [stderr] |
[INFO] [stderr] 832 | / /// Returns a reference to the value corresponding to the key.
[INFO] [stderr] 833 | | ///
[INFO] [stderr] 834 | | /// The key may be any borrowed form of the map's key type, but
[INFO] [stderr] 835 | | /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
[INFO] [stderr] ... |
[INFO] [stderr] 849 | | /// assert_eq!(map.get(&2), None);
[INFO] [stderr] 850 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:864:5
[INFO] [stderr] |
[INFO] [stderr] 864 | / /// Returns the key-value pair corresponding to the supplied key.
[INFO] [stderr] 865 | | ///
[INFO] [stderr] 866 | | /// The supplied key may be any borrowed form of the map's key type, but
[INFO] [stderr] 867 | | /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
[INFO] [stderr] ... |
[INFO] [stderr] 881 | | /// assert_eq!(map.get_key_value(&2), None);
[INFO] [stderr] 882 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:897:5
[INFO] [stderr] |
[INFO] [stderr] 897 | / fn get_inner<Q: ?Sized>(&self, k: &Q) -> Option<&(K, V)>
[INFO] [stderr] 898 | | where
[INFO] [stderr] 899 | | K: Borrow<Q>,
[INFO] [stderr] 900 | | Q: Hash + Eq,
[INFO] [stderr] ... |
[INFO] [stderr] 903 | | self.table.get(hash, equivalent_key(k))
[INFO] [stderr] 904 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:906:5
[INFO] [stderr] |
[INFO] [stderr] 906 | / /// Returns the key-value pair corresponding to the supplied key, with a mutable reference to value.
[INFO] [stderr] 907 | | ///
[INFO] [stderr] 908 | | /// The supplied key may be any borrowed form of the map's key type, but
[INFO] [stderr] 909 | | /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
[INFO] [stderr] ... |
[INFO] [stderr] 927 | | /// assert_eq!(map.get_key_value_mut(&2), None);
[INFO] [stderr] 928 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:942:5
[INFO] [stderr] |
[INFO] [stderr] 942 | / /// Returns `true` if the map contains a value for the specified key.
[INFO] [stderr] 943 | | ///
[INFO] [stderr] 944 | | /// The key may be any borrowed form of the map's key type, but
[INFO] [stderr] 945 | | /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
[INFO] [stderr] ... |
[INFO] [stderr] 959 | | /// assert_eq!(map.contains_key(&2), false);
[INFO] [stderr] 960 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:970:5
[INFO] [stderr] |
[INFO] [stderr] 970 | / /// Returns a mutable reference to the value corresponding to the key.
[INFO] [stderr] 971 | | ///
[INFO] [stderr] 972 | | /// The key may be any borrowed form of the map's key type, but
[INFO] [stderr] 973 | | /// [`Hash`] and [`Eq`] on the borrowed form *must* match those for
[INFO] [stderr] ... |
[INFO] [stderr] 989 | | /// assert_eq!(map[&1], "b");
[INFO] [stderr] 990 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1005:5
[INFO] [stderr] |
[INFO] [stderr] 1005 | / fn get_inner_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut (K, V)>
[INFO] [stderr] 1006 | | where
[INFO] [stderr] 1007 | | K: Borrow<Q>,
[INFO] [stderr] 1008 | | Q: Hash + Eq,
[INFO] [stderr] ... |
[INFO] [stderr] 1011 | | self.table.get_mut(hash, equivalent_key(k))
[INFO] [stderr] 1012 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1014:5
[INFO] [stderr] |
[INFO] [stderr] 1014 | / /// Inserts a key-value pair into the map.
[INFO] [stderr] 1015 | | ///
[INFO] [stderr] 1016 | | /// If the map did not have this key present, [`None`] is returned.
[INFO] [stderr] 1017 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 1037 | | /// assert_eq!(map[&37], "c");
[INFO] [stderr] 1038 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1057:5
[INFO] [stderr] |
[INFO] [stderr] 1057 | / /// Removes a key from the map, returning the value at the key if the key
[INFO] [stderr] 1058 | | /// was previously in the map.
[INFO] [stderr] 1059 | | ///
[INFO] [stderr] 1060 | | /// The key may be any borrowed form of the map's key type, but
[INFO] [stderr] ... |
[INFO] [stderr] 1075 | | /// assert_eq!(map.remove(&1), None);
[INFO] [stderr] 1076 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1090:5
[INFO] [stderr] |
[INFO] [stderr] 1090 | / /// Removes a key from the map, returning the stored key and value if the
[INFO] [stderr] 1091 | | /// key was previously in the map.
[INFO] [stderr] 1092 | | ///
[INFO] [stderr] 1093 | | /// The key may be any borrowed form of the map's key type, but
[INFO] [stderr] ... |
[INFO] [stderr] 1108 | | /// assert_eq!(map.remove(&1), None);
[INFO] [stderr] 1109 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1121:1
[INFO] [stderr] |
[INFO] [stderr] 1121 | / impl<K, V, S> HashMap<K, V, S> {
[INFO] [stderr] 1122 | | /// Creates a raw entry builder for the HashMap.
[INFO] [stderr] 1123 | | ///
[INFO] [stderr] 1124 | | /// Raw entries provide the lowest level of control for searching and
[INFO] [stderr] ... |
[INFO] [stderr] 1176 | | }
[INFO] [stderr] 1177 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1122:5
[INFO] [stderr] |
[INFO] [stderr] 1122 | / /// Creates a raw entry builder for the HashMap.
[INFO] [stderr] 1123 | | ///
[INFO] [stderr] 1124 | | /// Raw entries provide the lowest level of control for searching and
[INFO] [stderr] 1125 | | /// manipulating a map. They must be manually initialized with a hash and
[INFO] [stderr] ... |
[INFO] [stderr] 1151 | | /// acting erratically, with two keys randomly masking each other. Implementations
[INFO] [stderr] 1152 | | /// are free to assume this doesn't happen (within the limits of memory-safety).
[INFO] [stderr] | |____________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1158:5
[INFO] [stderr] |
[INFO] [stderr] 1158 | / /// Creates a raw immutable entry builder for the HashMap.
[INFO] [stderr] 1159 | | ///
[INFO] [stderr] 1160 | | /// Raw entries provide the lowest level of control for searching and
[INFO] [stderr] 1161 | | /// manipulating a map. They must be manually initialized with a hash and
[INFO] [stderr] ... |
[INFO] [stderr] 1171 | | ///
[INFO] [stderr] 1172 | | /// Immutable raw entries have very limited use; you might instead want `raw_entry_mut`.
[INFO] [stderr] | |____________________________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1243:1
[INFO] [stderr] |
[INFO] [stderr] 1243 | / /// An iterator over the entries of a `HashMap`.
[INFO] [stderr] 1244 | | ///
[INFO] [stderr] 1245 | | /// This `struct` is created by the [`iter`] method on [`HashMap`]. See its
[INFO] [stderr] 1246 | | /// documentation for more.
[INFO] [stderr] 1247 | | ///
[INFO] [stderr] 1248 | | /// [`iter`]: struct.HashMap.html#method.iter
[INFO] [stderr] 1249 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1272:1
[INFO] [stderr] |
[INFO] [stderr] 1272 | / /// A mutable iterator over the entries of a `HashMap`.
[INFO] [stderr] 1273 | | ///
[INFO] [stderr] 1274 | | /// This `struct` is created by the [`iter_mut`] method on [`HashMap`]. See its
[INFO] [stderr] 1275 | | /// documentation for more.
[INFO] [stderr] 1276 | | ///
[INFO] [stderr] 1277 | | /// [`iter_mut`]: struct.HashMap.html#method.iter_mut
[INFO] [stderr] 1278 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1290:1
[INFO] [stderr] |
[INFO] [stderr] 1290 | / impl<K, V> IterMut<'_, K, V> {
[INFO] [stderr] 1291 | | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] 1292 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1293 | | pub(super) fn iter(&self) -> Iter<'_, K, V> {
[INFO] [stderr] ... |
[INFO] [stderr] 1298 | | }
[INFO] [stderr] 1299 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1291:5
[INFO] [stderr] |
[INFO] [stderr] 1291 | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1301:1
[INFO] [stderr] |
[INFO] [stderr] 1301 | / /// An owning iterator over the entries of a `HashMap`.
[INFO] [stderr] 1302 | | ///
[INFO] [stderr] 1303 | | /// This `struct` is created by the [`into_iter`] method on [`HashMap`]
[INFO] [stderr] 1304 | | /// (provided by the `IntoIterator` trait). See its documentation for more.
[INFO] [stderr] 1305 | | ///
[INFO] [stderr] 1306 | | /// [`into_iter`]: struct.HashMap.html#method.into_iter
[INFO] [stderr] 1307 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1312:1
[INFO] [stderr] |
[INFO] [stderr] 1312 | / impl<K, V> IntoIter<K, V> {
[INFO] [stderr] 1313 | | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] 1314 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1315 | | pub(super) fn iter(&self) -> Iter<'_, K, V> {
[INFO] [stderr] ... |
[INFO] [stderr] 1320 | | }
[INFO] [stderr] 1321 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1313:5
[INFO] [stderr] |
[INFO] [stderr] 1313 | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1323:1
[INFO] [stderr] |
[INFO] [stderr] 1323 | / /// An iterator over the keys of a `HashMap`.
[INFO] [stderr] 1324 | | ///
[INFO] [stderr] 1325 | | /// This `struct` is created by the [`keys`] method on [`HashMap`]. See its
[INFO] [stderr] 1326 | | /// documentation for more.
[INFO] [stderr] 1327 | | ///
[INFO] [stderr] 1328 | | /// [`keys`]: struct.HashMap.html#method.keys
[INFO] [stderr] 1329 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1350:1
[INFO] [stderr] |
[INFO] [stderr] 1350 | / /// An iterator over the values of a `HashMap`.
[INFO] [stderr] 1351 | | ///
[INFO] [stderr] 1352 | | /// This `struct` is created by the [`values`] method on [`HashMap`]. See its
[INFO] [stderr] 1353 | | /// documentation for more.
[INFO] [stderr] 1354 | | ///
[INFO] [stderr] 1355 | | /// [`values`]: struct.HashMap.html#method.values
[INFO] [stderr] 1356 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1377:1
[INFO] [stderr] |
[INFO] [stderr] 1377 | / /// A draining iterator over the entries of a `HashMap`.
[INFO] [stderr] 1378 | | ///
[INFO] [stderr] 1379 | | /// This `struct` is created by the [`drain`] method on [`HashMap`]. See its
[INFO] [stderr] 1380 | | /// documentation for more.
[INFO] [stderr] 1381 | | ///
[INFO] [stderr] 1382 | | /// [`drain`]: struct.HashMap.html#method.drain
[INFO] [stderr] 1383 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1388:1
[INFO] [stderr] |
[INFO] [stderr] 1388 | / impl<K, V> Drain<'_, K, V> {
[INFO] [stderr] 1389 | | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] 1390 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1391 | | pub(super) fn iter(&self) -> Iter<'_, K, V> {
[INFO] [stderr] ... |
[INFO] [stderr] 1396 | | }
[INFO] [stderr] 1397 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1389:5
[INFO] [stderr] |
[INFO] [stderr] 1389 | /// Returns a iterator of references over the remaining items.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1399:1
[INFO] [stderr] |
[INFO] [stderr] 1399 | / /// A mutable iterator over the values of a `HashMap`.
[INFO] [stderr] 1400 | | ///
[INFO] [stderr] 1401 | | /// This `struct` is created by the [`values_mut`] method on [`HashMap`]. See its
[INFO] [stderr] 1402 | | /// documentation for more.
[INFO] [stderr] 1403 | | ///
[INFO] [stderr] 1404 | | /// [`values_mut`]: struct.HashMap.html#method.values_mut
[INFO] [stderr] 1405 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] | |____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1410:1
[INFO] [stderr] |
[INFO] [stderr] 1410 | / /// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
[INFO] [stderr] 1411 | | ///
[INFO] [stderr] 1412 | | /// See the [`HashMap::raw_entry_mut`] docs for usage examples.
[INFO] [stderr] 1413 | | ///
[INFO] [stderr] 1414 | | /// [`HashMap::raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
[INFO] [stderr] | |________________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1419:1
[INFO] [stderr] |
[INFO] [stderr] 1419 | / /// A view into a single entry in a map, which may either be vacant or occupied.
[INFO] [stderr] 1420 | | ///
[INFO] [stderr] 1421 | | /// This is a lower-level version of [`Entry`].
[INFO] [stderr] 1422 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 1428 | | /// [`raw_entry_mut`]: struct.HashMap.html#method.raw_entry_mut
[INFO] [stderr] 1429 | | /// [`RawEntryBuilderMut`]: struct.RawEntryBuilderMut.html
[INFO] [stderr] | |__________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1437:1
[INFO] [stderr] |
[INFO] [stderr] 1437 | / /// A view into an occupied entry in a `HashMap`.
[INFO] [stderr] 1438 | | /// It is part of the [`RawEntryMut`] enum.
[INFO] [stderr] 1439 | | ///
[INFO] [stderr] 1440 | | /// [`RawEntryMut`]: enum.RawEntryMut.html
[INFO] [stderr] | |__________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1460:1
[INFO] [stderr] |
[INFO] [stderr] 1460 | / /// A view into a vacant entry in a `HashMap`.
[INFO] [stderr] 1461 | | /// It is part of the [`RawEntryMut`] enum.
[INFO] [stderr] 1462 | | ///
[INFO] [stderr] 1463 | | /// [`RawEntryMut`]: enum.RawEntryMut.html
[INFO] [stderr] | |__________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1469:1
[INFO] [stderr] |
[INFO] [stderr] 1469 | / /// A builder for computing where in a [`HashMap`] a key-value pair would be stored.
[INFO] [stderr] 1470 | | ///
[INFO] [stderr] 1471 | | /// See the [`HashMap::raw_entry`] docs for usage examples.
[INFO] [stderr] 1472 | | ///
[INFO] [stderr] 1473 | | /// [`HashMap::raw_entry`]: struct.HashMap.html#method.raw_entry
[INFO] [stderr] | |________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1478:1
[INFO] [stderr] |
[INFO] [stderr] 1478 | / impl<'a, K, V, S> RawEntryBuilderMut<'a, K, V, S> {
[INFO] [stderr] 1479 | | /// Creates a `RawEntryMut` from the given key.
[INFO] [stderr] 1480 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1481 | | #[allow(clippy::wrong_self_convention)]
[INFO] [stderr] ... |
[INFO] [stderr] 1501 | | }
[INFO] [stderr] 1502 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1479:5
[INFO] [stderr] |
[INFO] [stderr] 1479 | /// Creates a `RawEntryMut` from the given key.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1492:5
[INFO] [stderr] |
[INFO] [stderr] 1492 | /// Creates a `RawEntryMut` from the given key and its hash.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1504:1
[INFO] [stderr] |
[INFO] [stderr] 1504 | / impl<'a, K, V, S> RawEntryBuilderMut<'a, K, V, S> {
[INFO] [stderr] 1505 | | /// Creates a `RawEntryMut` from the given hash.
[INFO] [stderr] 1506 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1507 | | #[allow(clippy::wrong_self_convention)]
[INFO] [stderr] ... |
[INFO] [stderr] 1531 | | }
[INFO] [stderr] 1532 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1505:5
[INFO] [stderr] |
[INFO] [stderr] 1505 | /// Creates a `RawEntryMut` from the given hash.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1516:5
[INFO] [stderr] |
[INFO] [stderr] 1516 | / fn search<F>(self, hash: u64, mut is_match: F) -> RawEntryMut<'a, K, V, S>
[INFO] [stderr] 1517 | | where
[INFO] [stderr] 1518 | | for<'b> F: FnMut(&'b K) -> bool,
[INFO] [stderr] 1519 | | {
[INFO] [stderr] ... |
[INFO] [stderr] 1530 | | }
[INFO] [stderr] 1531 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1534:1
[INFO] [stderr] |
[INFO] [stderr] 1534 | / impl<'a, K, V, S> RawEntryBuilder<'a, K, V, S> {
[INFO] [stderr] 1535 | | /// Access an entry by key.
[INFO] [stderr] 1536 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1537 | | #[allow(clippy::wrong_self_convention)]
[INFO] [stderr] ... |
[INFO] [stderr] 1578 | | }
[INFO] [stderr] 1579 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1535:5
[INFO] [stderr] |
[INFO] [stderr] 1535 | /// Access an entry by key.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1548:5
[INFO] [stderr] |
[INFO] [stderr] 1548 | /// Access an entry by a key and its hash.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1560:5
[INFO] [stderr] |
[INFO] [stderr] 1560 | / fn search<F>(self, hash: u64, mut is_match: F) -> Option<(&'a K, &'a V)>
[INFO] [stderr] 1561 | | where
[INFO] [stderr] 1562 | | F: FnMut(&K) -> bool,
[INFO] [stderr] 1563 | | {
[INFO] [stderr] ... |
[INFO] [stderr] 1567 | | }
[INFO] [stderr] 1568 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1570:5
[INFO] [stderr] |
[INFO] [stderr] 1570 | /// Access an entry by hash.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1581:1
[INFO] [stderr] |
[INFO] [stderr] 1581 | / impl<'a, K, V, S> RawEntryMut<'a, K, V, S> {
[INFO] [stderr] 1582 | | /// Sets the value of the entry, and returns a RawOccupiedEntryMut.
[INFO] [stderr] 1583 | | ///
[INFO] [stderr] 1584 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 1772 | | }
[INFO] [stderr] 1773 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1582:5
[INFO] [stderr] |
[INFO] [stderr] 1582 | / /// Sets the value of the entry, and returns a RawOccupiedEntryMut.
[INFO] [stderr] 1583 | | ///
[INFO] [stderr] 1584 | | /// # Examples
[INFO] [stderr] 1585 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 1592 | | /// assert_eq!(entry.remove_entry(), ("horseyland", 37));
[INFO] [stderr] 1593 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1609:5
[INFO] [stderr] |
[INFO] [stderr] 1609 | / /// Ensures a value is in the entry by inserting the default if empty, and returns
[INFO] [stderr] 1610 | | /// mutable references to the key and value in the entry.
[INFO] [stderr] 1611 | | ///
[INFO] [stderr] 1612 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 1623 | | /// assert_eq!(map["poneyland"], 6);
[INFO] [stderr] 1624 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1637:5
[INFO] [stderr] |
[INFO] [stderr] 1637 | / /// Ensures a value is in the entry by inserting the result of the default function if empty,
[INFO] [stderr] 1638 | | /// and returns mutable references to the key and value in the entry.
[INFO] [stderr] 1639 | | ///
[INFO] [stderr] 1640 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 1651 | | /// assert_eq!(map["poneyland"], "hoho".to_string());
[INFO] [stderr] 1652 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1669:5
[INFO] [stderr] |
[INFO] [stderr] 1669 | / /// Provides in-place mutable access to an occupied entry before any
[INFO] [stderr] 1670 | | /// potential inserts into the map.
[INFO] [stderr] 1671 | | ///
[INFO] [stderr] 1672 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 1689 | | /// assert_eq!(map["poneyland"], 43);
[INFO] [stderr] 1690 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:1708:5
[INFO] [stderr] |
[INFO] [stderr] 1708 | / /// Provides shared access to the key and owned access to the value of
[INFO] [stderr] 1709 | | /// an occupied entry and allows to replace or remove it based on the
[INFO] [stderr] 1710 | | /// value of the returned option.
[INFO] [stderr] 1711 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 1761 | | /// assert!(!map.contains_key("poneyland"));
[INFO] [stderr] 1762 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1775:1
[INFO] [stderr] |
[INFO] [stderr] 1775 | / impl<'a, K, V, S> RawOccupiedEntryMut<'a, K, V, S> {
[INFO] [stderr] 1776 | | /// Gets a reference to the key in the entry.
[INFO] [stderr] 1777 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] 1778 | | pub fn key(&self) -> &K {
[INFO] [stderr] ... |
[INFO] [stderr] 1890 | | }
[INFO] [stderr] 1891 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1776:5
[INFO] [stderr] |
[INFO] [stderr] 1776 | /// Gets a reference to the key in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1782:5
[INFO] [stderr] |
[INFO] [stderr] 1782 | /// Gets a mutable reference to the key in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1788:5
[INFO] [stderr] |
[INFO] [stderr] 1788 | / /// Converts the entry into a mutable reference to the key in the entry
[INFO] [stderr] 1789 | | /// with a lifetime bound to the map itself.
[INFO] [stderr] | |________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1795:5
[INFO] [stderr] |
[INFO] [stderr] 1795 | /// Gets a reference to the value in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1801:5
[INFO] [stderr] |
[INFO] [stderr] 1801 | / /// Converts the OccupiedEntry into a mutable reference to the value in the entry
[INFO] [stderr] 1802 | | /// with a lifetime bound to the map itself.
[INFO] [stderr] | |________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1808:5
[INFO] [stderr] |
[INFO] [stderr] 1808 | /// Gets a mutable reference to the value in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1814:5
[INFO] [stderr] |
[INFO] [stderr] 1814 | /// Gets a reference to the key and value in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1823:5
[INFO] [stderr] |
[INFO] [stderr] 1823 | /// Gets a mutable reference to the key and value in the entry.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1832:5
[INFO] [stderr] |
[INFO] [stderr] 1832 | / /// Converts the OccupiedEntry into a mutable reference to the key and value in the entry
[INFO] [stderr] 1833 | | /// with a lifetime bound to the map itself.
[INFO] [stderr] | |________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1842:5
[INFO] [stderr] |
[INFO] [stderr] 1842 | /// Sets the value of the entry, and returns the entry's old value.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1848:5
[INFO] [stderr] |
[INFO] [stderr] 1848 | /// Sets the value of the entry, and returns the entry's old value.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1854:5
[INFO] [stderr] |
[INFO] [stderr] 1854 | /// Takes the value out of the entry, and returns it.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1860:5
[INFO] [stderr] |
[INFO] [stderr] 1860 | /// Take the ownership of the key and value from the map.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1866:5
[INFO] [stderr] |
[INFO] [stderr] 1866 | / /// Provides shared access to the key and owned access to the value of
[INFO] [stderr] 1867 | | /// the entry and allows to replace or remove it based on the
[INFO] [stderr] 1868 | | /// value of the returned option.
[INFO] [stderr] | |_____________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1893:1
[INFO] [stderr] |
[INFO] [stderr] 1893 | / impl<'a, K, V, S> RawVacantEntryMut<'a, K, V, S> {
[INFO] [stderr] 1894 | | /// Sets the value of the entry with the VacantEntry's key,
[INFO] [stderr] 1895 | | /// and returns a mutable reference to it.
[INFO] [stderr] 1896 | | #[cfg_attr(feature = "inline-more", inline)]
[INFO] [stderr] ... |
[INFO] [stderr] 1958 | | }
[INFO] [stderr] 1959 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1894:5
[INFO] [stderr] |
[INFO] [stderr] 1894 | / /// Sets the value of the entry with the VacantEntry's key,
[INFO] [stderr] 1895 | | /// and returns a mutable reference to it.
[INFO] [stderr] | |______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1906:5
[INFO] [stderr] |
[INFO] [stderr] 1906 | / /// Sets the value of the entry with the VacantEntry's key,
[INFO] [stderr] 1907 | | /// and returns a mutable reference to it.
[INFO] [stderr] | |______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1923:5
[INFO] [stderr] |
[INFO] [stderr] 1923 | /// Set the value of an entry with a custom hasher function.
[INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1942:5
[INFO] [stderr] |
[INFO] [stderr] 1942 | / fn insert_entry(self, key: K, value: V) -> RawOccupiedEntryMut<'a, K, V, S>
[INFO] [stderr] 1943 | | where
[INFO] [stderr] 1944 | | K: Hash,
[INFO] [stderr] 1945 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 1957 | | }
[INFO] [stderr] 1958 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:1997:1
[INFO] [stderr] |
[INFO] [stderr] 1997 | / /// A view into a single entry in a map, which may either be vacant or occupied.
[INFO] [stderr] 1998 | | ///
[INFO] [stderr] 1999 | | /// This `enum` is constructed from the [`entry`] method on [`HashMap`].
[INFO] [stderr] 2000 | | ///
[INFO] [stderr] 2001 | | /// [`HashMap`]: struct.HashMap.html
[INFO] [stderr] 2002 | | /// [`entry`]: struct.HashMap.html#method.entry
[INFO] [stderr] | |_______________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2020:1
[INFO] [stderr] |
[INFO] [stderr] 2020 | / /// A view into an occupied entry in a `HashMap`.
[INFO] [stderr] 2021 | | /// It is part of the [`Entry`] enum.
[INFO] [stderr] 2022 | | ///
[INFO] [stderr] 2023 | | /// [`Entry`]: enum.Entry.html
[INFO] [stderr] | |______________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2055:1
[INFO] [stderr] |
[INFO] [stderr] 2055 | / /// A view into a vacant entry in a `HashMap`.
[INFO] [stderr] 2056 | | /// It is part of the [`Entry`] enum.
[INFO] [stderr] 2057 | | ///
[INFO] [stderr] 2058 | | /// [`Entry`]: enum.Entry.html
[INFO] [stderr] | |______________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2323:1
[INFO] [stderr] |
[INFO] [stderr] 2323 | / impl<'a, K, V, S> Entry<'a, K, V, S> {
[INFO] [stderr] 2324 | | /// Sets the value of the entry, and returns an OccupiedEntry.
[INFO] [stderr] 2325 | | ///
[INFO] [stderr] 2326 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2551 | | }
[INFO] [stderr] 2552 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2324:5
[INFO] [stderr] |
[INFO] [stderr] 2324 | / /// Sets the value of the entry, and returns an OccupiedEntry.
[INFO] [stderr] 2325 | | ///
[INFO] [stderr] 2326 | | /// # Examples
[INFO] [stderr] 2327 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2334 | | /// assert_eq!(entry.key(), &"horseyland");
[INFO] [stderr] 2335 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2351:5
[INFO] [stderr] |
[INFO] [stderr] 2351 | / /// Ensures a value is in the entry by inserting the default if empty, and returns
[INFO] [stderr] 2352 | | /// a mutable reference to the value in the entry.
[INFO] [stderr] 2353 | | ///
[INFO] [stderr] 2354 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2365 | | /// assert_eq!(map["poneyland"], 6);
[INFO] [stderr] 2366 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2379:5
[INFO] [stderr] |
[INFO] [stderr] 2379 | / /// Ensures a value is in the entry by inserting the result of the default function if empty,
[INFO] [stderr] 2380 | | /// and returns a mutable reference to the value in the entry.
[INFO] [stderr] 2381 | | ///
[INFO] [stderr] 2382 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2392 | | /// assert_eq!(map["poneyland"], "hoho".to_string());
[INFO] [stderr] 2393 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2406:5
[INFO] [stderr] |
[INFO] [stderr] 2406 | / /// Ensures a value is in the entry by inserting, if empty, the result of the default function,
[INFO] [stderr] 2407 | | /// which takes the key as its argument, and returns a mutable reference to the value in the
[INFO] [stderr] 2408 | | /// entry.
[INFO] [stderr] 2409 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2419 | | /// assert_eq!(map["poneyland"], 9);
[INFO] [stderr] 2420 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2436:5
[INFO] [stderr] |
[INFO] [stderr] 2436 | / /// Returns a reference to this entry's key.
[INFO] [stderr] 2437 | | ///
[INFO] [stderr] 2438 | | /// # Examples
[INFO] [stderr] 2439 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2444 | | /// assert_eq!(map.entry("poneyland").key(), &"poneyland");
[INFO] [stderr] 2445 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2454:5
[INFO] [stderr] |
[INFO] [stderr] 2454 | / /// Provides in-place mutable access to an occupied entry before any
[INFO] [stderr] 2455 | | /// potential inserts into the map.
[INFO] [stderr] 2456 | | ///
[INFO] [stderr] 2457 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2472 | | /// assert_eq!(map["poneyland"], 43);
[INFO] [stderr] 2473 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2488:5
[INFO] [stderr] |
[INFO] [stderr] 2488 | / /// Provides shared access to the key and owned access to the value of
[INFO] [stderr] 2489 | | /// an occupied entry and allows to replace or remove it based on the
[INFO] [stderr] 2490 | | /// value of the returned option.
[INFO] [stderr] 2491 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2540 | | /// assert!(!map.contains_key("poneyland"));
[INFO] [stderr] 2541 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2554:1
[INFO] [stderr] |
[INFO] [stderr] 2554 | / impl<'a, K, V: Default, S> Entry<'a, K, V, S> {
[INFO] [stderr] 2555 | | /// Ensures a value is in the entry by inserting the default value if empty,
[INFO] [stderr] 2556 | | /// and returns a mutable reference to the value in the entry.
[INFO] [stderr] 2557 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2578 | | }
[INFO] [stderr] 2579 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2555:5
[INFO] [stderr] |
[INFO] [stderr] 2555 | / /// Ensures a value is in the entry by inserting the default value if empty,
[INFO] [stderr] 2556 | | /// and returns a mutable reference to the value in the entry.
[INFO] [stderr] 2557 | | ///
[INFO] [stderr] 2558 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2566 | | /// assert_eq!(map["poneyland"], None);
[INFO] [stderr] 2567 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2581:1
[INFO] [stderr] |
[INFO] [stderr] 2581 | / impl<'a, K, V, S> OccupiedEntry<'a, K, V, S> {
[INFO] [stderr] 2582 | | /// Gets a reference to the key in the entry.
[INFO] [stderr] 2583 | | ///
[INFO] [stderr] 2584 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2885 | | }
[INFO] [stderr] 2886 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2582:5
[INFO] [stderr] |
[INFO] [stderr] 2582 | / /// Gets a reference to the key in the entry.
[INFO] [stderr] 2583 | | ///
[INFO] [stderr] 2584 | | /// # Examples
[INFO] [stderr] 2585 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2591 | | /// assert_eq!(map.entry("poneyland").key(), &"poneyland");
[INFO] [stderr] 2592 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2598:5
[INFO] [stderr] |
[INFO] [stderr] 2598 | / /// Take the ownership of the key and value from the map.
[INFO] [stderr] 2599 | | ///
[INFO] [stderr] 2600 | | /// # Examples
[INFO] [stderr] 2601 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2614 | | /// assert_eq!(map.contains_key("poneyland"), false);
[INFO] [stderr] 2615 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2621:5
[INFO] [stderr] |
[INFO] [stderr] 2621 | / /// Gets a reference to the value in the entry.
[INFO] [stderr] 2622 | | ///
[INFO] [stderr] 2623 | | /// # Examples
[INFO] [stderr] 2624 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2634 | | /// }
[INFO] [stderr] 2635 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2641:5
[INFO] [stderr] |
[INFO] [stderr] 2641 | / /// Gets a mutable reference to the value in the entry.
[INFO] [stderr] 2642 | | ///
[INFO] [stderr] 2643 | | /// If you need a reference to the `OccupiedEntry` which may outlive the
[INFO] [stderr] 2644 | | /// destruction of the `Entry` value, see [`into_mut`].
[INFO] [stderr] ... |
[INFO] [stderr] 2666 | | /// assert_eq!(map["poneyland"], 24);
[INFO] [stderr] 2667 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2673:5
[INFO] [stderr] |
[INFO] [stderr] 2673 | / /// Converts the OccupiedEntry into a mutable reference to the value in the entry
[INFO] [stderr] 2674 | | /// with a lifetime bound to the map itself.
[INFO] [stderr] 2675 | | ///
[INFO] [stderr] 2676 | | /// If you need multiple references to the `OccupiedEntry`, see [`get_mut`].
[INFO] [stderr] ... |
[INFO] [stderr] 2694 | | /// assert_eq!(map["poneyland"], 22);
[INFO] [stderr] 2695 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2701:5
[INFO] [stderr] |
[INFO] [stderr] 2701 | / /// Sets the value of the entry, and returns the entry's old value.
[INFO] [stderr] 2702 | | ///
[INFO] [stderr] 2703 | | /// # Examples
[INFO] [stderr] 2704 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2716 | | /// assert_eq!(map["poneyland"], 15);
[INFO] [stderr] 2717 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2725:5
[INFO] [stderr] |
[INFO] [stderr] 2725 | / /// Takes the value out of the entry, and returns it.
[INFO] [stderr] 2726 | | ///
[INFO] [stderr] 2727 | | /// # Examples
[INFO] [stderr] 2728 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2740 | | /// assert_eq!(map.contains_key("poneyland"), false);
[INFO] [stderr] 2741 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2747:5
[INFO] [stderr] |
[INFO] [stderr] 2747 | / /// Replaces the entry, returning the old key and value. The new key in the hash map will be
[INFO] [stderr] 2748 | | /// the key used to create this entry.
[INFO] [stderr] 2749 | | ///
[INFO] [stderr] 2750 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2766 | | /// assert_eq!(map[&my_key], 16);
[INFO] [stderr] 2767 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2778:5
[INFO] [stderr] |
[INFO] [stderr] 2778 | / /// Replaces the key in the hash map with the key used to create this entry.
[INFO] [stderr] 2779 | | ///
[INFO] [stderr] 2780 | | /// # Examples
[INFO] [stderr] 2781 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2800 | | /// }
[INFO] [stderr] 2801 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2808:5
[INFO] [stderr] |
[INFO] [stderr] 2808 | / /// Provides shared access to the key and owned access to the value of
[INFO] [stderr] 2809 | | /// the entry and allows to replace or remove it based on the
[INFO] [stderr] 2810 | | /// value of the returned option.
[INFO] [stderr] 2811 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2854 | | /// assert!(!map.contains_key("poneyland"));
[INFO] [stderr] 2855 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2888:1
[INFO] [stderr] |
[INFO] [stderr] 2888 | / impl<'a, K, V, S> VacantEntry<'a, K, V, S> {
[INFO] [stderr] 2889 | | /// Gets a reference to the key that would be used when inserting a value
[INFO] [stderr] 2890 | | /// through the `VacantEntry`.
[INFO] [stderr] 2891 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2972 | | }
[INFO] [stderr] 2973 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2889:5
[INFO] [stderr] |
[INFO] [stderr] 2889 | / /// Gets a reference to the key that would be used when inserting a value
[INFO] [stderr] 2890 | | /// through the `VacantEntry`.
[INFO] [stderr] 2891 | | ///
[INFO] [stderr] 2892 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2898 | | /// assert_eq!(map.entry("poneyland").key(), &"poneyland");
[INFO] [stderr] 2899 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2905:5
[INFO] [stderr] |
[INFO] [stderr] 2905 | / /// Take ownership of the key.
[INFO] [stderr] 2906 | | ///
[INFO] [stderr] 2907 | | /// # Examples
[INFO] [stderr] 2908 | | ///
[INFO] [stderr] ... |
[INFO] [stderr] 2917 | | /// }
[INFO] [stderr] 2918 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/map.rs:2924:5
[INFO] [stderr] |
[INFO] [stderr] 2924 | / /// Sets the value of the entry with the VacantEntry's key,
[INFO] [stderr] 2925 | | /// and returns a mutable reference to it.
[INFO] [stderr] 2926 | | ///
[INFO] [stderr] 2927 | | /// # Examples
[INFO] [stderr] ... |
[INFO] [stderr] 2938 | | /// assert_eq!(map["poneyland"], 37);
[INFO] [stderr] 2939 | | /// ```
[INFO] [stderr] | |___________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:2956:5
[INFO] [stderr] |
[INFO] [stderr] 2956 | / fn insert_entry(self, value: V) -> OccupiedEntry<'a, K, V, S>
[INFO] [stderr] 2957 | | where
[INFO] [stderr] 2958 | | K: Hash,
[INFO] [stderr] 2959 | | S: BuildHasher,
[INFO] [stderr] ... |
[INFO] [stderr] 2971 | | }
[INFO] [stderr] 2972 | | }
[INFO] [stderr] | |_____^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/map.rs:3030:1
[INFO] [stderr] |
[INFO] [stderr] 3030 | / fn assert_covariance() {
[INFO] [stderr] 3031 | | fn map_key<'new>(v: HashMap<&'static str, u8>) -> HashMap<&'new str, u8> {
[INFO] [stderr] 3032 | | v
[INFO] [stderr] 3033 | | }
[INFO] [stderr] ... |
[INFO] [stderr] 3065 | | }
[INFO] [stderr] 3066 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/set.rs:1:1
[INFO] [stderr] |
[INFO] [stderr] 1 | / use crate::TryReserveError;
[INFO] [stderr] 2 | | use alloc::borrow::ToOwned;
[INFO] [stderr] 3 | | use core::borrow::Borrow;
[INFO] [stderr] 4 | | use core::fmt;
[INFO] [stderr] ... |
[INFO] [stderr] 1912 | | }
[INFO] [stderr] 1913 | | }
[INFO] [stderr] | |_^
[INFO] [stderr]
[INFO] [stderr] warning: documentation test in private item
[INFO] [stderr] --> src/set.rs:18:1
[INFO] [stderr] |
[INFO] [stderr] 18 | / /// A hash set implemented as a `HashMap` where the value is `()`.
[INFO] [stderr] 19 | | ///
[INFO] [stderr] 20 | | /// As with the [`HashMap`] type, a `HashSet` requires that the elements
[INFO] [stderr] 21 | | /// implement the [`Eq`] and [`Hash`] traits. This can frequently be achieved by
[INFO] [stderr] ... |
[INFO] [stderr] 111 | | /// [`PartialEq`]: https://doc.rust-lang.org/std/cmp/trait.PartialEq.html
[INFO] [stderr] 112 | | /// [`RefCell`]: https://doc.rust-lang.org/std/cell/struct.RefCell.html
[INFO] [stderr] | |_______________________________________________________________________^
[INFO] [stderr]
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr] --> src/set.rs:130:1
[INFO] [stderr] |
[WARN] too much data in the log, truncating it