contest-algorithms 0.3.0

Common algorithms and data structures for programming contests
Documentation
Build #2188261 2025-06-03 01:49:38
# rustc version
rustc 1.89.0-nightly (5d707b07e 2025-06-02)# docs.rs version
docsrs 0.6.0 (d2911047 2025-05-28)# build log
[INFO] running `Command { std: "docker" "create" "-v" "/home/cratesfyi/workspace-builder/builds/contest-algorithms-0.3.0/target:/opt/rustwide/target:rw,Z" "-v" "/home/cratesfyi/workspace-builder/builds/contest-algorithms-0.3.0/source:/opt/rustwide/workdir:ro,Z" "-v" "/home/cratesfyi/workspace-builder/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/home/cratesfyi/workspace-builder/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" "6442450944" "--cpus" "6" "--user" "1001:1001" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:eea15d5475069c3ef791f10c2c6b5af2ee421ef2da1e680ecce1cba46243983b" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "rustdoc" "--lib" "-Zrustdoc-map" "--config" "build.rustdocflags=[\"--cfg\", \"docsrs\", \"-Z\", \"unstable-options\", \"--emit=invocation-specific\", \"--resource-suffix\", \"-20250602-1.89.0-nightly-5d707b07e\", \"--static-root-path\", \"/-/rustdoc.static/\", \"--cap-lints\", \"warn\", \"--extern-html-root-takes-precedence\"]" "--offline" "-Zunstable-options" "--config=doc.extern-map.registries.crates-io=\"https://docs.rs/{pkg_name}/{version}/x86_64-unknown-linux-gnu\"" "-Zrustdoc-scrape-examples" "-j6" "--target" "x86_64-unknown-linux-gnu" "--config" "build.rustdocflags=[\"-Zmetrics-dir=/opt/rustwide/target/metrics\"]", kill_on_drop: false }`
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] [stdout] 6d3a68ce8004186ce2fb1ea8b26fb0f6f7ab4656aa2669f3e4b6d5060d0f3c69
[INFO] running `Command { std: "docker" "start" "-a" "6d3a68ce8004186ce2fb1ea8b26fb0f6f7ab4656aa2669f3e4b6d5060d0f3c69", kill_on_drop: false }`
[INFO] [stderr] warning: target filter specified, but no targets matched; this is a no-op
[INFO] [stderr]  Documenting contest-algorithms v0.3.0 (/opt/rustwide/workdir)
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/math/fft.rs:165:45
[INFO] [stderr]     |
[INFO] [stderr] 165 | /// Given two polynomials (vectors) sum_i a[i] x^i and sum_i b[i] x^i,
[INFO] [stderr]     |                                             ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr]     = note: `#[warn(rustdoc::broken_intra_doc_links)]` on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/math/fft.rs:165:64
[INFO] [stderr]     |
[INFO] [stderr] 165 | /// Given two polynomials (vectors) sum_i a[i] x^i and sum_i b[i] x^i,
[INFO] [stderr]     |                                                                ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `k`
[INFO] [stderr]    --> src/math/fft.rs:166:44
[INFO] [stderr]     |
[INFO] [stderr] 166 | /// computes their product (convolution) c[k] = sum_(i+j=k) a[i]*b[j].
[INFO] [stderr]     |                                            ^ no item named `k` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/math/fft.rs:166:63
[INFO] [stderr]     |
[INFO] [stderr] 166 | /// computes their product (convolution) c[k] = sum_(i+j=k) a[i]*b[j].
[INFO] [stderr]     |                                                               ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `j`
[INFO] [stderr]    --> src/math/fft.rs:166:68
[INFO] [stderr]     |
[INFO] [stderr] 166 | /// computes their product (convolution) c[k] = sum_(i+j=k) a[i]*b[j].
[INFO] [stderr]     |                                                                    ^ no item named `j` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]   --> src/order.rs:18:11
[INFO] [stderr]    |
[INFO] [stderr] 18 | /// slice[i] >= key, or slice.len() if no such i exists
[INFO] [stderr]    |           ^ no item named `i` in scope
[INFO] [stderr]    |
[INFO] [stderr]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]   --> src/order.rs:26:11
[INFO] [stderr]    |
[INFO] [stderr] 26 | /// slice[i] > key, or slice.len() if no such i exists
[INFO] [stderr]    |           ^ no item named `i` in scope
[INFO] [stderr]    |
[INFO] [stderr]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]   --> src/string_proc.rs:52:43
[INFO] [stderr]    |
[INFO] [stderr] 52 |     /// KMP match failure automaton. fail[i] is the length of the longest
[INFO] [stderr]    |                                           ^ no item named `i` in scope
[INFO] [stderr]    |
[INFO] [stderr]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]   --> src/string_proc.rs:95:37
[INFO] [stderr]    |
[INFO] [stderr] 95 |     /// KMP algorithm, sets @return[i] = length of longest prefix of pattern
[INFO] [stderr]    |                                     ^ no item named `i` in scope
[INFO] [stderr]    |
[INFO] [stderr]    = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/string_proc.rs:122:46
[INFO] [stderr]     |
[INFO] [stderr] 122 |     /// Aho-Corasick failure automaton. fail[i] is the node corresponding to the
[INFO] [stderr]     |                                              ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/string_proc.rs:173:46
[INFO] [stderr]     |
[INFO] [stderr] 173 |     /// Aho-Corasick algorithm, sets @return[i] = node corresponding to
[INFO] [stderr]     |                                              ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `j`
[INFO] [stderr]    --> src/string_proc.rs:205:17
[INFO] [stderr]     |
[INFO] [stderr] 205 |     /// rank[i][j] = rank of the j'th suffix, considering only 2^i chars.
[INFO] [stderr]     |                 ^ no item named `j` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/string_proc.rs:206:30
[INFO] [stderr]     |
[INFO] [stderr] 206 |     /// In other words, rank[i] is a ranking of the substrings text[j..j+2^i].
[INFO] [stderr]     |                              ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `2*i`
[INFO] [stderr]    --> src/string_proc.rs:287:9
[INFO] [stderr]     |
[INFO] [stderr] 287 | /// pal[2*i] = odd length of palindrome centred at text[i].
[INFO] [stderr]     |         ^^^ no item named `2*i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: unresolved link to `i`
[INFO] [stderr]    --> src/string_proc.rs:287:57
[INFO] [stderr]     |
[INFO] [stderr] 287 | /// pal[2*i] = odd length of palindrome centred at text[i].
[INFO] [stderr]     |                                                         ^ no item named `i` in scope
[INFO] [stderr]     |
[INFO] [stderr]     = help: to escape `[` and `]` characters, add '\' before them like `\[` or `\]`
[INFO] [stderr] 
[INFO] [stderr] warning: this URL is not a hyperlink
[INFO] [stderr]   --> src/range_query/specs.rs:98:31
[INFO] [stderr]    |
[INFO] [stderr] 98 | /// Supply & Demand, based on https://codeforces.com/gym/102218/problem/F
[INFO] [stderr]    |                               ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: bare URLs are not automatically turned into clickable links
[INFO] [stderr]    = note: `#[warn(rustdoc::bare_urls)]` on by default
[INFO] [stderr] help: use an automatic link instead
[INFO] [stderr]    |
[INFO] [stderr] 98 | /// Supply & Demand, based on <https://codeforces.com/gym/102218/problem/F>
[INFO] [stderr]    |                               +                                           +
[INFO] [stderr] 
[INFO] [stderr] warning: this URL is not a hyperlink
[INFO] [stderr]   --> src/range_query/static_arq.rs:12:6
[INFO] [stderr]    |
[INFO] [stderr] 12 | /// (http://codeforces.com/blog/entry/18051). All nodes have 0 or 2 children.
[INFO] [stderr]    |      ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: bare URLs are not automatically turned into clickable links
[INFO] [stderr] help: use an automatic link instead
[INFO] [stderr]    |
[INFO] [stderr] 12 | /// (<http://codeforces.com/blog/entry/18051>). All nodes have 0 or 2 children.
[INFO] [stderr]    |      +                                      +
[INFO] [stderr] 
[INFO] [stderr] warning: unclosed HTML tag `T`
[INFO] [stderr]   --> src/scanner.rs:20:39
[INFO] [stderr]    |
[INFO] [stderr] 20 |     /// Use "turbofish" syntax token::<T>() to select data type of next token.
[INFO] [stderr]    |                                       ^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: `#[warn(rustdoc::invalid_html_tags)]` on by default
[INFO] [stderr] help: try marking as source code
[INFO] [stderr]    |
[INFO] [stderr] 20 |     /// Use "turbofish" syntax `token::<T>`() to select data type of next token.
[INFO] [stderr]    |                                +          +
[INFO] [stderr] 
[INFO] [stderr] warning: `contest-algorithms` (lib doc) generated 18 warnings (run `cargo fix --lib -p contest-algorithms` to apply 2 suggestions)
[INFO] [stderr]     Finished `dev` profile [unoptimized + debuginfo] target(s) in 0.47s
[INFO] [stderr]    Generated /opt/rustwide/target/x86_64-unknown-linux-gnu/doc/contest_algorithms/index.html
[INFO] running `Command { std: "docker" "inspect" "6d3a68ce8004186ce2fb1ea8b26fb0f6f7ab4656aa2669f3e4b6d5060d0f3c69", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "6d3a68ce8004186ce2fb1ea8b26fb0f6f7ab4656aa2669f3e4b6d5060d0f3c69", kill_on_drop: false }`
[INFO] [stdout] 6d3a68ce8004186ce2fb1ea8b26fb0f6f7ab4656aa2669f3e4b6d5060d0f3c69