[INFO] fetching crate ka 0.1.3... [INFO] documenting ka-0.1.3 against beta-2022-05-20 for beta-1.62-rustdoc-1 [INFO] extracting crate ka 0.1.3 into /workspace/builds/worker-23/source [INFO] validating manifest of crates.io crate ka 0.1.3 on toolchain beta-2022-05-20 [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-05-20" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking crates.io crate ka 0.1.3 [INFO] finished tweaking crates.io crate ka 0.1.3 [INFO] tweaked toml for crates.io crate ka 0.1.3 written to /workspace/builds/worker-23/source/Cargo.toml [INFO] crate crates.io crate ka 0.1.3 already has a lockfile, it will not be regenerated [INFO] running `Command { std: "/workspace/cargo-home/bin/cargo" "+beta-2022-05-20" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-05-20" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] cadc7adeeaccbb507df7770e6f05fce5fe7469e978592fa477b500bdc5fab5e1 [INFO] running `Command { std: "docker" "start" "-a" "cadc7adeeaccbb507df7770e6f05fce5fe7469e978592fa477b500bdc5fab5e1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "cadc7adeeaccbb507df7770e6f05fce5fe7469e978592fa477b500bdc5fab5e1", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "cadc7adeeaccbb507df7770e6f05fce5fe7469e978592fa477b500bdc5fab5e1", kill_on_drop: false }` [INFO] [stdout] cadc7adeeaccbb507df7770e6f05fce5fe7469e978592fa477b500bdc5fab5e1 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTDOCFLAGS=--cap-lints=warn" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-05-20" "doc" "--frozen" "--no-deps" "--document-private-items" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 2ff5864af2652b3d43d889070fed16a4d4a0fd73551a719abbf3c8fbfb6f5737 [INFO] running `Command { std: "docker" "start" "-a" "2ff5864af2652b3d43d889070fed16a4d4a0fd73551a719abbf3c8fbfb6f5737", kill_on_drop: false }` [INFO] [stderr] Documenting ka v0.1.3 (/opt/rustwide/workdir) [INFO] [stdout] warning: lint `missing_doc_code_examples` has been renamed to `rustdoc::missing_doc_code_examples` [INFO] [stdout] --> src/lib.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | #![warn(missing_doc_code_examples)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ help: use the new name: `rustdoc::missing_doc_code_examples` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(renamed_and_removed_lints)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 1 warning emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.99s [INFO] running `Command { std: "docker" "inspect" "2ff5864af2652b3d43d889070fed16a4d4a0fd73551a719abbf3c8fbfb6f5737", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2ff5864af2652b3d43d889070fed16a4d4a0fd73551a719abbf3c8fbfb6f5737", kill_on_drop: false }` [INFO] [stdout] 2ff5864af2652b3d43d889070fed16a4d4a0fd73551a719abbf3c8fbfb6f5737 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-23/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=warn" "-e" "DOCS_RS=1" "-e" "RUSTC_BOOTSTRAP=1" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:d190cb871061d98bc6d0581d85cb2ecb09a0f8a142ba5463de30be9999fc3251" "/opt/rustwide/cargo-home/bin/cargo" "+beta-2022-05-20" "rustdoc" "--lib" "-Zrustdoc-map" "--frozen" "--message-format=json" "--" "-Z" "unstable-options" "--document-private-items", kill_on_drop: false }` [INFO] [stdout] a13da06c01d15e3925c3dcff2c33f2e4274a310172897cec4832e2b558b712bf [INFO] running `Command { std: "docker" "start" "-a" "a13da06c01d15e3925c3dcff2c33f2e4274a310172897cec4832e2b558b712bf", kill_on_drop: false }` [INFO] [stderr] Documenting ka v0.1.3 (/opt/rustwide/workdir) [INFO] [stdout] warning: lint `missing_doc_code_examples` has been renamed to `rustdoc::missing_doc_code_examples` [INFO] [stdout] --> src/lib.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | #![warn(missing_doc_code_examples)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ help: use the new name: `rustdoc::missing_doc_code_examples` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(renamed_and_removed_lints)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / //! The `ka` crate provides several common ***bench***marking ***fun***ctions that are commonly [INFO] [stdout] 6 | | //! used to test new optimization algorithms. More specifically, the function is part of a struct [INFO] [stdout] 7 | | //! that contains the objective function as well as other important information. Currently a variety [INFO] [stdout] 8 | | //! of single-objective and multi-objective functions are implemented. [INFO] [stdout] | |______________________________________________________________________^ [INFO] [stdout] | [INFO] [stdout] note: the lint level is defined here [INFO] [stdout] --> src/lib.rs:2:9 [INFO] [stdout] | [INFO] [stdout] 2 | #![warn(missing_doc_code_examples)] [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/multi.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | //! This module contains multi-objective functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/multi.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / /// This is the Chankong-Haimes function. [INFO] [stdout] 6 | | /// [INFO] [stdout] 7 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 8 | | /// This function is specificaly 2 dimensional, and has a Pareto fron that looks like this: [INFO] [stdout] 9 | | /// [INFO] [stdout] 10 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/a/a8/Chakong_and_Haimes_function.pdf/page1-796px-Chakong_and_Haimes_function.pdf.jpg) [INFO] [stdout] | |__________________________________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/multi.rs:73:1 [INFO] [stdout] | [INFO] [stdout] 73 | / /// This is the Fonseca-Fleming function. [INFO] [stdout] 74 | | /// [INFO] [stdout] 75 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 76 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what the [INFO] [stdout] 77 | | /// Pareto front looks like in 2D: [INFO] [stdout] 78 | | /// [INFO] [stdout] 79 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/5/59/Fonseca_and_Fleming_function.pdf/page1-796px-Fonseca_and_Fleming_function.pdf.jpg) [INFO] [stdout] | |____________________________________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/multi.rs:127:1 [INFO] [stdout] | [INFO] [stdout] 127 | / /// This is the Viennet function. [INFO] [stdout] 128 | | /// [INFO] [stdout] 129 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 130 | | /// This function is specifically 2 dimensional, and has a Pareto fron that looks like this: [INFO] [stdout] 131 | | /// [INFO] [stdout] 132 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/f/f2/Viennet_function.pdf/page1-796px-Viennet_function.pdf.jpg) [INFO] [stdout] | |____________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:1:1 [INFO] [stdout] | [INFO] [stdout] 1 | //! This module contains single-objective functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:5:1 [INFO] [stdout] | [INFO] [stdout] 5 | / /// This is the Sphere function. [INFO] [stdout] 6 | | /// [INFO] [stdout] 7 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 8 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 9 | | /// like in 2D: [INFO] [stdout] 10 | | /// [INFO] [stdout] 11 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/a/a4/Sphere_function_in_3D.pdf/page1-800px-Sphere_function_in_3D.pdf.jpg) [INFO] [stdout] | |______________________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:52:1 [INFO] [stdout] | [INFO] [stdout] 52 | / /// This is the Rastrigin function. [INFO] [stdout] 53 | | /// [INFO] [stdout] 54 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 55 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 56 | | /// like in 2D: [INFO] [stdout] 57 | | /// [INFO] [stdout] 58 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/8/8b/Rastrigin_function.png/800px-Rastrigin_function.png) [INFO] [stdout] | |______________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:106:1 [INFO] [stdout] | [INFO] [stdout] 106 | / /// This is the Rosenbrock function. [INFO] [stdout] 107 | | /// [INFO] [stdout] 108 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 109 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 110 | | /// like in 2D: [INFO] [stdout] 111 | | /// [INFO] [stdout] 112 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/7/7e/Rosenbrock%27s_function_in_3D.pdf/page1-800px-Rosenbrock%27s_function_in_3D.pdf.jpg) [INFO] [stdout] | |______________________________________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:158:1 [INFO] [stdout] | [INFO] [stdout] 158 | / /// This is the Ackley function. [INFO] [stdout] 159 | | /// [INFO] [stdout] 160 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 161 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 162 | | /// like in 2D: [INFO] [stdout] 163 | | /// [INFO] [stdout] 164 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/9/98/Ackley%27s_function.pdf/page1-800px-Ackley%27s_function.pdf.jpg) [INFO] [stdout] | |__________________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:215:1 [INFO] [stdout] | [INFO] [stdout] 215 | / /// This is the Matyas function. [INFO] [stdout] 216 | | /// [INFO] [stdout] 217 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 218 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 219 | | /// like in 2D: [INFO] [stdout] 220 | | /// [INFO] [stdout] 221 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/6/63/Matyas_function.pdf/page1-800px-Matyas_function.pdf.jpg) [INFO] [stdout] | |__________________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:268:1 [INFO] [stdout] | [INFO] [stdout] 268 | / /// This is the Griewank function. [INFO] [stdout] 269 | | /// [INFO] [stdout] 270 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/griewankfcn.html). [INFO] [stdout] 271 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 272 | | /// like in 2D: [INFO] [stdout] 273 | | /// [INFO] [stdout] 274 | | /// ![](http://benchmarkfcns.xyz/benchmarkfcns/plots/griewankfcn_10_0.png) [INFO] [stdout] | |__________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:321:1 [INFO] [stdout] | [INFO] [stdout] 321 | / /// This is the Ridge function. [INFO] [stdout] 322 | | /// [INFO] [stdout] 323 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/ridgefcn.html). [INFO] [stdout] 324 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 325 | | /// like in 2D: [INFO] [stdout] 326 | | /// [INFO] [stdout] 327 | | /// ![](http://benchmarkfcns.xyz/benchmarkfcns/plots/ridgefcn.png) [INFO] [stdout] | |__________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:376:1 [INFO] [stdout] | [INFO] [stdout] 376 | / /// This is the Zakharov function. [INFO] [stdout] 377 | | /// [INFO] [stdout] 378 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/zakharov.html). [INFO] [stdout] 379 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 380 | | /// like in 2D: [INFO] [stdout] 381 | | /// [INFO] [stdout] 382 | | /// ![](http://benchmarkfcns.xyz/benchmarkfcns/plots/zakharovfcn.png) [INFO] [stdout] | |_____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:429:1 [INFO] [stdout] | [INFO] [stdout] 429 | / /// This is the Salomon function. [INFO] [stdout] 430 | | /// [INFO] [stdout] 431 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/salomonfcn.html). [INFO] [stdout] 432 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stdout] 433 | | /// like in 2D: [INFO] [stdout] 434 | | /// [INFO] [stdout] 435 | | /// ![](http://benchmarkfcns.xyz/benchmarkfcns/plots/salomonfcn.png) [INFO] [stdout] | |____________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:480:1 [INFO] [stdout] | [INFO] [stdout] 480 | / /// This is a constrained version of the Rosenbrock function. [INFO] [stdout] 481 | | /// [INFO] [stdout] 482 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 483 | | /// This function is specifically 2 dimensional, and has a feasible region that looks like this: [INFO] [stdout] 484 | | /// [INFO] [stdout] 485 | | /// [INFO] [stdout] 486 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/thumb/0/0b/ConstrTestFunc04.png/664px-ConstrTestFunc04.png) [INFO] [stdout] | |__________________________________________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/single.rs:539:1 [INFO] [stdout] | [INFO] [stdout] 539 | / /// This is a constrained version of the Rosenbrock function. [INFO] [stdout] 540 | | /// [INFO] [stdout] 541 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stdout] 542 | | /// This function is specifically 2 dimensional, and has a feasible region that looks like this: [INFO] [stdout] 543 | | /// [INFO] [stdout] 544 | | /// [INFO] [stdout] 545 | | /// ![](https://upload.wikimedia.org/wikipedia/commons/3/38/ConstrTestFunc03.png) [INFO] [stdout] | |_________________________________________________________________________________^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:16:1 [INFO] [stdout] | [INFO] [stdout] 16 | /// This is a trait that ensures consistent implementation of single objective benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:18:5 [INFO] [stdout] | [INFO] [stdout] 18 | /// The global minimum is constant and zero [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:21:5 [INFO] [stdout] | [INFO] [stdout] 21 | /// Function for evaluating the objective function [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:24:5 [INFO] [stdout] | [INFO] [stdout] 24 | /// This function returns the minimizer (argument that will return the global minimum) [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:27:5 [INFO] [stdout] | [INFO] [stdout] 27 | /// This function is used for testing, and checks the correctness of the minimizer [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:33:1 [INFO] [stdout] | [INFO] [stdout] 33 | /// This is a trait that ensures consistent implementation of multi-objective benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:35:5 [INFO] [stdout] | [INFO] [stdout] 35 | /// This constant indicates the number of objectives [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:38:5 [INFO] [stdout] | [INFO] [stdout] 38 | /// Function for evaluating the set of objective functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:42:1 [INFO] [stdout] | [INFO] [stdout] 42 | /// This is a trait that ensures consistent implementation of bounded benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:44:5 [INFO] [stdout] | [INFO] [stdout] 44 | /// The bounds of the canonical optimization problem [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:47:5 [INFO] [stdout] | [INFO] [stdout] 47 | /// Function to check bounds [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:60:1 [INFO] [stdout] | [INFO] [stdout] 60 | /// This is a trait that ensures consistent implementation of unbounded benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:65:5 [INFO] [stdout] | [INFO] [stdout] 65 | /// Function to check bounds [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:71:1 [INFO] [stdout] | [INFO] [stdout] 71 | /// This is a trait that ensures consistent implementation of constrained benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:76:5 [INFO] [stdout] | [INFO] [stdout] 76 | /// This constant indicates the number of equality functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:79:5 [INFO] [stdout] | [INFO] [stdout] 79 | /// This constant indicates the number of inequality functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:82:5 [INFO] [stdout] | [INFO] [stdout] 82 | /// This function returns the value of equality constraints [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:85:5 [INFO] [stdout] | [INFO] [stdout] 85 | /// This function returns the value of inequality constraints [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:88:5 [INFO] [stdout] | [INFO] [stdout] 88 | /// This is an alias for the equality constraint function [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:93:5 [INFO] [stdout] | [INFO] [stdout] 93 | /// This is an alias for the inequality constraint function [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:99:1 [INFO] [stdout] | [INFO] [stdout] 99 | /// This is a trait that ensures consistent implementation of unconstrained benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:105:1 [INFO] [stdout] | [INFO] [stdout] 105 | /// This is a trait that ensures consistent implementation of N-dimensional benchmark functions [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:117:1 [INFO] [stdout] | [INFO] [stdout] 117 | /// This is a trait that ensures consistent implementation of benchmark functions with fixed dimensionality [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:119:5 [INFO] [stdout] | [INFO] [stdout] 119 | /// This is a constant containing the correct dimensionality for the function [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: missing code example in this documentation [INFO] [stdout] --> src/lib.rs:122:5 [INFO] [stdout] | [INFO] [stdout] 122 | /// This function is used to check inputs [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: 43 warnings emitted [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.94s [INFO] running `Command { std: "docker" "inspect" "a13da06c01d15e3925c3dcff2c33f2e4274a310172897cec4832e2b558b712bf", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "a13da06c01d15e3925c3dcff2c33f2e4274a310172897cec4832e2b558b712bf", kill_on_drop: false }` [INFO] [stdout] a13da06c01d15e3925c3dcff2c33f2e4274a310172897cec4832e2b558b712bf