Dec 02 04:58:59.719 INFO documenting ordsearch-0.2.2 against try#f86f76f89ea2b1ccbfb3741962ec2029d878a389 for pr-55318-1
Dec 02 04:58:59.720 INFO running `"docker" "create" "-v" "/mnt/big/crater/work/local/target-dirs/pr-55318-1/worker-5/try#f86f76f89ea2b1ccbfb3741962ec2029d878a389:/target:rw,Z" "-v" "/mnt/big/crater/work/local/test-source/worker-5/pr-55318-1/try#f86f76f89ea2b1ccbfb3741962ec2029d878a389:/source:ro,Z" "-v" "/mnt/big/crater/work/local/cargo-home:/cargo-home:ro,Z" "-v" "/mnt/big/crater/work/local/rustup-home:/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/source" "-e" "USER_ID=1000" "-e" "CMD=cargo +f86f76f89ea2b1ccbfb3741962ec2029d878a389-alt doc --frozen --no-deps --document-private-items" "-e" "CARGO_TARGET_DIR=/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/cargo-home" "-e" "RUSTUP_HOME=/rustup-home" "-m" "1536M" "--network" "none" "crater"`
Dec 02 04:59:00.178 INFO [stdout] 0051bab53d218da5a95a0886e0490af773d5550179db9dcaa50c6f208218b354
Dec 02 04:59:00.184 INFO running `"docker" "start" "-a" "0051bab53d218da5a95a0886e0490af773d5550179db9dcaa50c6f208218b354"`
Dec 02 04:59:01.007 INFO [stderr] usermod: no changes
Dec 02 04:59:01.028 INFO [stderr]  Documenting ordsearch v0.2.2 (/source)
Dec 02 04:59:02.444 INFO [stderr] warning: `[]` cannot be resolved, ignoring it...
Dec 02 04:59:02.445 INFO [stderr]   --> src/lib.rs:1:1
Dec 02 04:59:02.445 INFO [stderr]    |
Dec 02 04:59:02.445 INFO [stderr] 1  | / //! This crate provides an efficient data structure for approximate lookups in ordered collections.
Dec 02 04:59:02.445 INFO [stderr] 2  | | //!
Dec 02 04:59:02.445 INFO [stderr] 3  | | //! More concretely, given a set `A` of `n` values, and a query value `x`, this library provides an
Dec 02 04:59:02.445 INFO [stderr] 4  | | //! efficient mechanism for finding the smallest value in `A` that is greater than or equal to `x`.
Dec 02 04:59:02.445 INFO [stderr] ...  |
Dec 02 04:59:02.445 INFO [stderr] 93 | | //!  - [ ] Implement deep prefetching for large `T`: https://github.com/patmorin/arraylayout/blob/3f20174a2a0ab52c6f37f2ea87d087307f19b5ee/src/eytzinger_array.h#L128
Dec 02 04:59:02.445 INFO [stderr] 94 | | //!
Dec 02 04:59:02.445 INFO [stderr]    | |___^
Dec 02 04:59:02.445 INFO [stderr]    |
Dec 02 04:59:02.445 INFO [stderr]    = note: #[warn(intra_doc_link_resolution_failure)] on by default
Dec 02 04:59:02.445 INFO [stderr]    = note: the link appears in this line:
Dec 02 04:59:02.445 INFO [stderr]            
Dec 02 04:59:02.445 INFO [stderr]              - [ ] Implement aligned operation: https://github.com/patmorin/arraylayout/blob/3f20174a2a0ab52c6f37f2ea87d087307f19b5ee/src/eytzinger_array.h#L204
Dec 02 04:59:02.445 INFO [stderr]                 ^
Dec 02 04:59:02.445 INFO [stderr]    = help: to escape `[` and `]` characters, just add '\' before them like `\[` or `\]`
Dec 02 04:59:02.445 INFO [stderr] 
Dec 02 04:59:02.445 INFO [stderr] warning: `[]` cannot be resolved, ignoring it...
Dec 02 04:59:02.445 INFO [stderr]   --> src/lib.rs:1:1
Dec 02 04:59:02.445 INFO [stderr]    |
Dec 02 04:59:02.445 INFO [stderr] 1  | / //! This crate provides an efficient data structure for approximate lookups in ordered collections.
Dec 02 04:59:02.445 INFO [stderr] 2  | | //!
Dec 02 04:59:02.445 INFO [stderr] 3  | | //! More concretely, given a set `A` of `n` values, and a query value `x`, this library provides an
Dec 02 04:59:02.445 INFO [stderr] 4  | | //! efficient mechanism for finding the smallest value in `A` that is greater than or equal to `x`.
Dec 02 04:59:02.445 INFO [stderr] ...  |
Dec 02 04:59:02.445 INFO [stderr] 93 | | //!  - [ ] Implement deep prefetching for large `T`: https://github.com/patmorin/arraylayout/blob/3f20174a2a0ab52c6f37f2ea87d087307f19b5ee/src/eytzinger_array.h#L128
Dec 02 04:59:02.445 INFO [stderr] 94 | | //!
Dec 02 04:59:02.445 INFO [stderr]    | |___^
Dec 02 04:59:02.445 INFO [stderr]    |
Dec 02 04:59:02.445 INFO [stderr]    = note: the link appears in this line:
Dec 02 04:59:02.445 INFO [stderr]            
Dec 02 04:59:02.445 INFO [stderr]              - [ ] Implement deep prefetching for large `T`: https://github.com/patmorin/arraylayout/blob/3f20174a2a0ab52c6f37f2ea87d087307f19b5ee/src/eytzinger_array.h#L128
Dec 02 04:59:02.445 INFO [stderr]                 ^
Dec 02 04:59:02.445 INFO [stderr]    = help: to escape `[` and `]` characters, just add '\' before them like `\[` or `\]`
Dec 02 04:59:02.445 INFO [stderr] 
Dec 02 04:59:02.525 INFO [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 1.50s
Dec 02 04:59:02.526 INFO [stderr] su: No module specific data is present
Dec 02 04:59:02.823 INFO running `"docker" "inspect" "0051bab53d218da5a95a0886e0490af773d5550179db9dcaa50c6f208218b354"`
Dec 02 04:59:02.902 INFO running `"docker" "rm" "-f" "0051bab53d218da5a95a0886e0490af773d5550179db9dcaa50c6f208218b354"`
Dec 02 04:59:02.979 INFO [stdout] 0051bab53d218da5a95a0886e0490af773d5550179db9dcaa50c6f208218b354