# rustc version rustc 1.47.0-nightly (6c8927b0c 2020-07-26)
# docs.rs version docsrs 0.6.0 (232e7b6 2020-08-07)
# build log [INFO] running `Command { std: "docker" "create" "-v" "/home/cratesfyi/workspace/builds/benchfun-0.1.3/target:/opt/rustwide/target:rw,Z" "-v" "/home/cratesfyi/workspace/builds/benchfun-0.1.3/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" "MAP_USER_ID=1001" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "RUSTFLAGS=" "-e" "RUSTDOCFLAGS=-Z unstable-options --resource-suffix -20200726-1.47.0-nightly-6c8927b0c --static-root-path / --cap-lints warn" "-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" "--network" "none" "rustops/crates-build-env" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "doc" "--lib" "--no-deps" "-j2", 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] c6e074a3abf29aff329e25e0e3e8ed46a176513b8103adc4e9c5bf2b50610f47 [INFO] running `Command { std: "docker" "start" "-a" "c6e074a3abf29aff329e25e0e3e8ed46a176513b8103adc4e9c5bf2b50610f47", kill_on_drop: false }` [INFO] [stderr] Documenting benchfun v0.1.3 (/opt/rustwide/workdir) [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:5:1 [INFO] [stderr] | [INFO] [stderr] 5 | / //! The `benchfun` crate provides several common ***bench***marking ***fun***ctions that are commonly [INFO] [stderr] 6 | | //! used to test new optimization algorithms. More specifically, the function is part of a struct [INFO] [stderr] 7 | | //! that contains the objective function as well as other important information. Currently a variety [INFO] [stderr] 8 | | //! of single-objective and multi-objective functions are implemented. [INFO] [stderr] | |______________________________________________________________________^ [INFO] [stderr] | [INFO] [stderr] note: the lint level is defined here [INFO] [stderr] --> src/lib.rs:2:9 [INFO] [stderr] | [INFO] [stderr] 2 | #![warn(missing_doc_code_examples)] [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:11:1 [INFO] [stderr] | [INFO] [stderr] 11 | pub use multi::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:13:1 [INFO] [stderr] | [INFO] [stderr] 13 | pub use single::*; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | //! This module contains multi-objective functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:5:1 [INFO] [stderr] | [INFO] [stderr] 5 | / /// This is the Chankong-Haimes function. [INFO] [stderr] 6 | | /// [INFO] [stderr] 7 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 8 | | /// This function is specificaly 2 dimensional, and has a Pareto fron that looks like this: [INFO] [stderr] 9 | | /// [INFO] [stderr] 10 | | ///  [INFO] [stderr] | |__________________________________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:73:1 [INFO] [stderr] | [INFO] [stderr] 73 | / /// This is the Fonseca-Fleming function. [INFO] [stderr] 74 | | /// [INFO] [stderr] 75 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 76 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what the [INFO] [stderr] 77 | | /// Pareto front looks like in 2D: [INFO] [stderr] 78 | | /// [INFO] [stderr] 79 | | ///  [INFO] [stderr] | |____________________________________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:127:1 [INFO] [stderr] | [INFO] [stderr] 127 | / /// This is the Viennet function. [INFO] [stderr] 128 | | /// [INFO] [stderr] 129 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 130 | | /// This function is specifically 2 dimensional, and has a Pareto fron that looks like this: [INFO] [stderr] 131 | | /// [INFO] [stderr] 132 | | ///  [INFO] [stderr] | |____________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:1:1 [INFO] [stderr] | [INFO] [stderr] 1 | //! This module contains single-objective functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:5:1 [INFO] [stderr] | [INFO] [stderr] 5 | / /// This is the Sphere function. [INFO] [stderr] 6 | | /// [INFO] [stderr] 7 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 8 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 9 | | /// like in 2D: [INFO] [stderr] 10 | | /// [INFO] [stderr] 11 | | ///  [INFO] [stderr] | |______________________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:52:1 [INFO] [stderr] | [INFO] [stderr] 52 | / /// This is the Rastrigin function. [INFO] [stderr] 53 | | /// [INFO] [stderr] 54 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 55 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 56 | | /// like in 2D: [INFO] [stderr] 57 | | /// [INFO] [stderr] 58 | | ///  [INFO] [stderr] | |______________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:106:1 [INFO] [stderr] | [INFO] [stderr] 106 | / /// This is the Rosenbrock function. [INFO] [stderr] 107 | | /// [INFO] [stderr] 108 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 109 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 110 | | /// like in 2D: [INFO] [stderr] 111 | | /// [INFO] [stderr] 112 | | ///  [INFO] [stderr] | |______________________________________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:158:1 [INFO] [stderr] | [INFO] [stderr] 158 | / /// This is the Ackley function. [INFO] [stderr] 159 | | /// [INFO] [stderr] 160 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 161 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 162 | | /// like in 2D: [INFO] [stderr] 163 | | /// [INFO] [stderr] 164 | | ///  [INFO] [stderr] | |__________________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:215:1 [INFO] [stderr] | [INFO] [stderr] 215 | / /// This is the Matyas function. [INFO] [stderr] 216 | | /// [INFO] [stderr] 217 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 218 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 219 | | /// like in 2D: [INFO] [stderr] 220 | | /// [INFO] [stderr] 221 | | ///  [INFO] [stderr] | |__________________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:268:1 [INFO] [stderr] | [INFO] [stderr] 268 | / /// This is the Griewank function. [INFO] [stderr] 269 | | /// [INFO] [stderr] 270 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/griewankfcn.html). [INFO] [stderr] 271 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 272 | | /// like in 2D: [INFO] [stderr] 273 | | /// [INFO] [stderr] 274 | | ///  [INFO] [stderr] | |__________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:321:1 [INFO] [stderr] | [INFO] [stderr] 321 | / /// This is the Ridge function. [INFO] [stderr] 322 | | /// [INFO] [stderr] 323 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/ridgefcn.html). [INFO] [stderr] 324 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 325 | | /// like in 2D: [INFO] [stderr] 326 | | /// [INFO] [stderr] 327 | | ///  [INFO] [stderr] | |__________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:376:1 [INFO] [stderr] | [INFO] [stderr] 376 | / /// This is the Zakharov function. [INFO] [stderr] 377 | | /// [INFO] [stderr] 378 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/zakharov.html). [INFO] [stderr] 379 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 380 | | /// like in 2D: [INFO] [stderr] 381 | | /// [INFO] [stderr] 382 | | ///  [INFO] [stderr] | |_____________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:429:1 [INFO] [stderr] | [INFO] [stderr] 429 | / /// This is the Salomon function. [INFO] [stderr] 430 | | /// [INFO] [stderr] 431 | | /// The function is borrowed from [here](http://benchmarkfcns.xyz/benchmarkfcns/salomonfcn.html). [INFO] [stderr] 432 | | /// Although the function accepts a vector with an arbitrary number of inputs, this is what it looks [INFO] [stderr] 433 | | /// like in 2D: [INFO] [stderr] 434 | | /// [INFO] [stderr] 435 | | ///  [INFO] [stderr] | |____________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:480:1 [INFO] [stderr] | [INFO] [stderr] 480 | / /// This is a constrained version of the Rosenbrock function. [INFO] [stderr] 481 | | /// [INFO] [stderr] 482 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 483 | | /// This function is specifically 2 dimensional, and has a feasible region that looks like this: [INFO] [stderr] 484 | | /// [INFO] [stderr] 485 | | /// [INFO] [stderr] 486 | | ///  [INFO] [stderr] | |__________________________________________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:539:1 [INFO] [stderr] | [INFO] [stderr] 539 | / /// This is a constrained version of the Rosenbrock function. [INFO] [stderr] 540 | | /// [INFO] [stderr] 541 | | /// The function is borrowed from [here](https://en.wikipedia.org/wiki/Test_functions_for_optimization). [INFO] [stderr] 542 | | /// This function is specifically 2 dimensional, and has a feasible region that looks like this: [INFO] [stderr] 543 | | /// [INFO] [stderr] 544 | | /// [INFO] [stderr] 545 | | ///  [INFO] [stderr] | |_________________________________________________________________________________^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:16:1 [INFO] [stderr] | [INFO] [stderr] 16 | /// This is a trait that ensures consistent implementation of single objective benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:18:5 [INFO] [stderr] | [INFO] [stderr] 18 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:21:5 [INFO] [stderr] | [INFO] [stderr] 21 | /// Function for evaluating the objective function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:24:5 [INFO] [stderr] | [INFO] [stderr] 24 | /// This function returns the minimizer (argument that will return the global minimum) [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:27:5 [INFO] [stderr] | [INFO] [stderr] 27 | /// This function is used for testing, and checks the correctness of the minimizer [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:33:1 [INFO] [stderr] | [INFO] [stderr] 33 | /// This is a trait that ensures consistent implementation of multi-objective benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:35:5 [INFO] [stderr] | [INFO] [stderr] 35 | /// This constant indicates the number of objectives [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | /// Function for evaluating the set of objective functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:42:1 [INFO] [stderr] | [INFO] [stderr] 42 | /// This is a trait that ensures consistent implementation of bounded benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:44:5 [INFO] [stderr] | [INFO] [stderr] 44 | /// The bounds of the canonical optimization problem [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:47:5 [INFO] [stderr] | [INFO] [stderr] 47 | /// Function to check bounds [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:60:1 [INFO] [stderr] | [INFO] [stderr] 60 | /// This is a trait that ensures consistent implementation of unbounded benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:62:5 [INFO] [stderr] | [INFO] [stderr] 62 | /// The bounds of the canonical optimization problem [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | /// Function to check bounds [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:71:1 [INFO] [stderr] | [INFO] [stderr] 71 | /// This is a trait that ensures consistent implementation of constrained benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:73:5 [INFO] [stderr] | [INFO] [stderr] 73 | /// This constant indicates a constrained function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:76:5 [INFO] [stderr] | [INFO] [stderr] 76 | /// This constant indicates the number of equality functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:79:5 [INFO] [stderr] | [INFO] [stderr] 79 | /// This constant indicates the number of inequality functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:82:5 [INFO] [stderr] | [INFO] [stderr] 82 | /// This function returns the value of equality constraints [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:85:5 [INFO] [stderr] | [INFO] [stderr] 85 | /// This function returns the value of inequality constraints [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:88:5 [INFO] [stderr] | [INFO] [stderr] 88 | /// This is an alias for the equality constraint function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:93:5 [INFO] [stderr] | [INFO] [stderr] 93 | /// This is an alias for the inequality constraint function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:99:1 [INFO] [stderr] | [INFO] [stderr] 99 | /// This is a trait that ensures consistent implementation of unconstrained benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:101:5 [INFO] [stderr] | [INFO] [stderr] 101 | /// This trait indicates that the function is unconstrained [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:105:1 [INFO] [stderr] | [INFO] [stderr] 105 | /// This is a trait that ensures consistent implementation of N-dimensional benchmark functions [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:107:5 [INFO] [stderr] | [INFO] [stderr] 107 | /// This is a constant containing the correct dimensionality for the function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:110:5 [INFO] [stderr] | [INFO] [stderr] 110 | /// This constant describes a low value to use for testing [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:113:5 [INFO] [stderr] | [INFO] [stderr] 113 | /// This constant describes a high value to use for testing [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:117:1 [INFO] [stderr] | [INFO] [stderr] 117 | /// This is a trait that ensures consistent implementation of benchmark functions with fixed dimensionality [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:119:5 [INFO] [stderr] | [INFO] [stderr] 119 | /// This is a constant containing the correct dimensionality for the function [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/lib.rs:122:5 [INFO] [stderr] | [INFO] [stderr] 122 | /// This function is used to check inputs [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:18:1 [INFO] [stderr] | [INFO] [stderr] 18 | / impl SingleObjective for Sphere { [INFO] [stderr] 19 | | /// The global minimum is constant and zero [INFO] [stderr] 20 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 21 | | [INFO] [stderr] ... | [INFO] [stderr] 34 | | } [INFO] [stderr] 35 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:19:5 [INFO] [stderr] | [INFO] [stderr] 19 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:31:5 [INFO] [stderr] | [INFO] [stderr] 31 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:69:1 [INFO] [stderr] | [INFO] [stderr] 69 | / impl SingleObjective for Rastrigin { [INFO] [stderr] 70 | | /// The global minimum is constant and zero [INFO] [stderr] 71 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 72 | | [INFO] [stderr] ... | [INFO] [stderr] 88 | | } [INFO] [stderr] 89 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:70:5 [INFO] [stderr] | [INFO] [stderr] 70 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:73:5 [INFO] [stderr] | [INFO] [stderr] 73 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:85:5 [INFO] [stderr] | [INFO] [stderr] 85 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:123:1 [INFO] [stderr] | [INFO] [stderr] 123 | / impl SingleObjective for Rosenbrock { [INFO] [stderr] 124 | | /// The global minimum is constant and zero [INFO] [stderr] 125 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 126 | | [INFO] [stderr] ... | [INFO] [stderr] 140 | | } [INFO] [stderr] 141 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:124:5 [INFO] [stderr] | [INFO] [stderr] 124 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:127:5 [INFO] [stderr] | [INFO] [stderr] 127 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:137:5 [INFO] [stderr] | [INFO] [stderr] 137 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:175:1 [INFO] [stderr] | [INFO] [stderr] 175 | / impl SingleObjective for Ackley { [INFO] [stderr] 176 | | /// The global minimum is constant and zero [INFO] [stderr] 177 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 178 | | [INFO] [stderr] ... | [INFO] [stderr] 197 | | } [INFO] [stderr] 198 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:176:5 [INFO] [stderr] | [INFO] [stderr] 176 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:179:5 [INFO] [stderr] | [INFO] [stderr] 179 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:194:5 [INFO] [stderr] | [INFO] [stderr] 194 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:232:1 [INFO] [stderr] | [INFO] [stderr] 232 | / impl SingleObjective for Matyas { [INFO] [stderr] 233 | | /// The global minimum is constant and zero [INFO] [stderr] 234 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 235 | | [INFO] [stderr] ... | [INFO] [stderr] 250 | | } [INFO] [stderr] 251 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:233:5 [INFO] [stderr] | [INFO] [stderr] 233 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:236:5 [INFO] [stderr] | [INFO] [stderr] 236 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:247:5 [INFO] [stderr] | [INFO] [stderr] 247 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:285:1 [INFO] [stderr] | [INFO] [stderr] 285 | / impl SingleObjective for Griewank { [INFO] [stderr] 286 | | /// The global minimum is constant and zero [INFO] [stderr] 287 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 288 | | [INFO] [stderr] ... | [INFO] [stderr] 303 | | } [INFO] [stderr] 304 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:286:5 [INFO] [stderr] | [INFO] [stderr] 286 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:289:5 [INFO] [stderr] | [INFO] [stderr] 289 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:300:5 [INFO] [stderr] | [INFO] [stderr] 300 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:338:1 [INFO] [stderr] | [INFO] [stderr] 338 | / impl SingleObjective for Ridge { [INFO] [stderr] 339 | | /// The global minimum is constant and zero [INFO] [stderr] 340 | | const MINIMUM: f64 = -5.0; [INFO] [stderr] 341 | | [INFO] [stderr] ... | [INFO] [stderr] 358 | | } [INFO] [stderr] 359 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:339:5 [INFO] [stderr] | [INFO] [stderr] 339 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:342:5 [INFO] [stderr] | [INFO] [stderr] 342 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:353:5 [INFO] [stderr] | [INFO] [stderr] 353 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:393:1 [INFO] [stderr] | [INFO] [stderr] 393 | / impl SingleObjective for Zakharov { [INFO] [stderr] 394 | | /// The global minimum is constant and zero [INFO] [stderr] 395 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 396 | | [INFO] [stderr] ... | [INFO] [stderr] 411 | | } [INFO] [stderr] 412 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:394:5 [INFO] [stderr] | [INFO] [stderr] 394 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:397:5 [INFO] [stderr] | [INFO] [stderr] 397 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:408:5 [INFO] [stderr] | [INFO] [stderr] 408 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:446:1 [INFO] [stderr] | [INFO] [stderr] 446 | / impl SingleObjective for Salomon { [INFO] [stderr] 447 | | /// The global minimum is constant and zero [INFO] [stderr] 448 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 449 | | [INFO] [stderr] ... | [INFO] [stderr] 462 | | } [INFO] [stderr] 463 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:447:5 [INFO] [stderr] | [INFO] [stderr] 447 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:450:5 [INFO] [stderr] | [INFO] [stderr] 450 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:459:5 [INFO] [stderr] | [INFO] [stderr] 459 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:511:1 [INFO] [stderr] | [INFO] [stderr] 511 | / impl SingleObjective for RosenbrockConst1 { [INFO] [stderr] 512 | | /// The global minimum is constant and zero [INFO] [stderr] 513 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 514 | | [INFO] [stderr] ... | [INFO] [stderr] 524 | | } [INFO] [stderr] 525 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:512:5 [INFO] [stderr] | [INFO] [stderr] 512 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:515:5 [INFO] [stderr] | [INFO] [stderr] 515 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:521:5 [INFO] [stderr] | [INFO] [stderr] 521 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:569:1 [INFO] [stderr] | [INFO] [stderr] 569 | / impl SingleObjective for RosenbrockConst2 { [INFO] [stderr] 570 | | /// The global minimum is constant and zero [INFO] [stderr] 571 | | const MINIMUM: f64 = 0.0; [INFO] [stderr] 572 | | [INFO] [stderr] ... | [INFO] [stderr] 582 | | } [INFO] [stderr] 583 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:570:5 [INFO] [stderr] | [INFO] [stderr] 570 | /// The global minimum is constant and zero [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:573:5 [INFO] [stderr] | [INFO] [stderr] 573 | /// Function for evaluating [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:579:5 [INFO] [stderr] | [INFO] [stderr] 579 | /// This function returns the minimizer (argument that will return the global minimum [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:37:1 [INFO] [stderr] | [INFO] [stderr] 37 | / impl MultiObjective for ChankongHaimes { [INFO] [stderr] 38 | | const NF: usize = 2; [INFO] [stderr] 39 | | [INFO] [stderr] 40 | | fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] ... | [INFO] [stderr] 46 | | } [INFO] [stderr] 47 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:38:5 [INFO] [stderr] | [INFO] [stderr] 38 | const NF: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:40:5 [INFO] [stderr] | [INFO] [stderr] 40 | / fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 41 | | Self::check_input(x.clone()); [INFO] [stderr] 42 | | let mut fx: Vec<f64> = vec![0.0; Self::NF]; [INFO] [stderr] 43 | | fx[0] = 2.0 + (x[0] - 2.0).powi(2) - (x[1] - 1.0).powi(2); [INFO] [stderr] 44 | | fx[1] = 9.0*x[0] - (x[1] - 1.0).powi(2); [INFO] [stderr] 45 | | fx [INFO] [stderr] 46 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:89:1 [INFO] [stderr] | [INFO] [stderr] 89 | / impl MultiObjective for FonsecaFlemming { [INFO] [stderr] 90 | | const NF: usize = 2; [INFO] [stderr] 91 | | [INFO] [stderr] 92 | | fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] ... | [INFO] [stderr] 105 | | } [INFO] [stderr] 106 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:90:5 [INFO] [stderr] | [INFO] [stderr] 90 | const NF: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:92:5 [INFO] [stderr] | [INFO] [stderr] 92 | / fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 93 | | let mut fx: Vec<f64> = vec![0.0; Self::NF]; [INFO] [stderr] 94 | | let n = x.len(); [INFO] [stderr] 95 | | let mut sumxminus: f64 = 0.0; [INFO] [stderr] ... | [INFO] [stderr] 104 | | fx [INFO] [stderr] 105 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:146:1 [INFO] [stderr] | [INFO] [stderr] 146 | / impl MultiObjective for Viennet { [INFO] [stderr] 147 | | const NF: usize = 3; [INFO] [stderr] 148 | | [INFO] [stderr] 149 | | fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] ... | [INFO] [stderr] 157 | | } [INFO] [stderr] 158 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:147:5 [INFO] [stderr] | [INFO] [stderr] 147 | const NF: usize = 3; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:149:5 [INFO] [stderr] | [INFO] [stderr] 149 | / fn f(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 150 | | Self::check_input(x.clone()); [INFO] [stderr] 151 | | let mut fx: Vec<f64> = vec![0.0; Self::NF]; [INFO] [stderr] 152 | | let x2y2 = x[0].powi(2) + x[1].powi(2); [INFO] [stderr] ... | [INFO] [stderr] 156 | | fx [INFO] [stderr] 157 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:17:1 [INFO] [stderr] | [INFO] [stderr] 17 | / impl Bounded for ChankongHaimes { [INFO] [stderr] 18 | | const BOUNDS: (f64, f64) = (-20.0, 20.0); [INFO] [stderr] 19 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:18:5 [INFO] [stderr] | [INFO] [stderr] 18 | const BOUNDS: (f64, f64) = (-20.0, 20.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:85:1 [INFO] [stderr] | [INFO] [stderr] 85 | / impl Bounded for FonsecaFlemming { [INFO] [stderr] 86 | | const BOUNDS: (f64, f64) = (-4.0, 4.0); [INFO] [stderr] 87 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:86:5 [INFO] [stderr] | [INFO] [stderr] 86 | const BOUNDS: (f64, f64) = (-4.0, 4.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:142:1 [INFO] [stderr] | [INFO] [stderr] 142 | / impl Bounded for Viennet { [INFO] [stderr] 143 | | const BOUNDS: (f64, f64) = (-3.0, 3.0); [INFO] [stderr] 144 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:143:5 [INFO] [stderr] | [INFO] [stderr] 143 | const BOUNDS: (f64, f64) = (-3.0, 3.0); [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:64:1 [INFO] [stderr] | [INFO] [stderr] 64 | / impl Bounded for Rastrigin { [INFO] [stderr] 65 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 66 | | const BOUNDS: (f64, f64) = (-5.12, 5.12); [INFO] [stderr] 67 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:65:5 [INFO] [stderr] | [INFO] [stderr] 65 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:118:1 [INFO] [stderr] | [INFO] [stderr] 118 | / impl Bounded for Rosenbrock { [INFO] [stderr] 119 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 120 | | const BOUNDS: (f64, f64) = (-5.0, 10.0); [INFO] [stderr] 121 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:119:5 [INFO] [stderr] | [INFO] [stderr] 119 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:170:1 [INFO] [stderr] | [INFO] [stderr] 170 | / impl Bounded for Ackley { [INFO] [stderr] 171 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 172 | | const BOUNDS: (f64, f64) = (-5.0, 5.0); [INFO] [stderr] 173 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:171:5 [INFO] [stderr] | [INFO] [stderr] 171 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:227:1 [INFO] [stderr] | [INFO] [stderr] 227 | / impl Bounded for Matyas { [INFO] [stderr] 228 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 229 | | const BOUNDS: (f64, f64) = (-10.0, 10.0); [INFO] [stderr] 230 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:228:5 [INFO] [stderr] | [INFO] [stderr] 228 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:280:1 [INFO] [stderr] | [INFO] [stderr] 280 | / impl Bounded for Griewank { [INFO] [stderr] 281 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 282 | | const BOUNDS: (f64, f64) = (-600.0, 600.0); [INFO] [stderr] 283 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:281:5 [INFO] [stderr] | [INFO] [stderr] 281 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:333:1 [INFO] [stderr] | [INFO] [stderr] 333 | / impl Bounded for Ridge { [INFO] [stderr] 334 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 335 | | const BOUNDS: (f64, f64) = (-5.0, 5.0); [INFO] [stderr] 336 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:334:5 [INFO] [stderr] | [INFO] [stderr] 334 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:388:1 [INFO] [stderr] | [INFO] [stderr] 388 | / impl Bounded for Zakharov { [INFO] [stderr] 389 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 390 | | const BOUNDS: (f64, f64) = (-5.0, 10.0); [INFO] [stderr] 391 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:389:5 [INFO] [stderr] | [INFO] [stderr] 389 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:441:1 [INFO] [stderr] | [INFO] [stderr] 441 | / impl Bounded for Salomon { [INFO] [stderr] 442 | | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] 443 | | const BOUNDS: (f64, f64) = (-100.0, 100.0); [INFO] [stderr] 444 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:442:5 [INFO] [stderr] | [INFO] [stderr] 442 | /// The bounds of the canonical sphere optimization problem are infinite. [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:16:1 [INFO] [stderr] | [INFO] [stderr] 16 | impl UnBounded for Sphere {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:489:1 [INFO] [stderr] | [INFO] [stderr] 489 | impl UnBounded for RosenbrockConst1 {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:548:1 [INFO] [stderr] | [INFO] [stderr] 548 | impl UnBounded for RosenbrockConst2 {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:21:1 [INFO] [stderr] | [INFO] [stderr] 21 | / impl Constrained for ChankongHaimes { [INFO] [stderr] 22 | | const NH: usize = 0; [INFO] [stderr] 23 | | const NG: usize = 2; [INFO] [stderr] 24 | | [INFO] [stderr] ... | [INFO] [stderr] 34 | | } [INFO] [stderr] 35 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:22:5 [INFO] [stderr] | [INFO] [stderr] 22 | const NH: usize = 0; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:23:5 [INFO] [stderr] | [INFO] [stderr] 23 | const NG: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:25:5 [INFO] [stderr] | [INFO] [stderr] 25 | / fn equality_constraints(_x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 26 | | vec![0.0; Self::NH] [INFO] [stderr] 27 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:29:5 [INFO] [stderr] | [INFO] [stderr] 29 | / fn inequality_constraints(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 30 | | let mut fx: Vec<f64> = vec![0.0; Self::NG]; [INFO] [stderr] 31 | | fx[0] = x[0].powi(2) + x[1].powi(2) - 225.0; [INFO] [stderr] 32 | | fx[1] = x[0] - 3.0*x[1] + 10.0; [INFO] [stderr] 33 | | fx [INFO] [stderr] 34 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:491:1 [INFO] [stderr] | [INFO] [stderr] 491 | / impl Constrained for RosenbrockConst1 { [INFO] [stderr] 492 | | const NH: usize = 0; [INFO] [stderr] 493 | | const NG: usize = 2; [INFO] [stderr] 494 | | [INFO] [stderr] ... | [INFO] [stderr] 504 | | } [INFO] [stderr] 505 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:492:5 [INFO] [stderr] | [INFO] [stderr] 492 | const NH: usize = 0; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:493:5 [INFO] [stderr] | [INFO] [stderr] 493 | const NG: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:495:5 [INFO] [stderr] | [INFO] [stderr] 495 | / fn equality_constraints(_x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 496 | | vec![0.0; Self::NH] [INFO] [stderr] 497 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:499:5 [INFO] [stderr] | [INFO] [stderr] 499 | / fn inequality_constraints(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 500 | | let mut fx: Vec<f64> = vec![0.0; Self::NG]; [INFO] [stderr] 501 | | fx[0] = (x[0]-1.0).powi(3) - x[1] + 1.0; [INFO] [stderr] 502 | | fx[1] = x[0] + x[1] - 2.0; [INFO] [stderr] 503 | | fx [INFO] [stderr] 504 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:550:1 [INFO] [stderr] | [INFO] [stderr] 550 | / impl Constrained for RosenbrockConst2 { [INFO] [stderr] 551 | | const NH: usize = 0; [INFO] [stderr] 552 | | const NG: usize = 1; [INFO] [stderr] 553 | | [INFO] [stderr] ... | [INFO] [stderr] 562 | | } [INFO] [stderr] 563 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:551:5 [INFO] [stderr] | [INFO] [stderr] 551 | const NH: usize = 0; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:552:5 [INFO] [stderr] | [INFO] [stderr] 552 | const NG: usize = 1; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:554:5 [INFO] [stderr] | [INFO] [stderr] 554 | / fn equality_constraints(_x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 555 | | vec![0.0; Self::NH] [INFO] [stderr] 556 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:558:5 [INFO] [stderr] | [INFO] [stderr] 558 | / fn inequality_constraints(x: Vec<f64>) -> Vec<f64> { [INFO] [stderr] 559 | | let mut fx: Vec<f64> = vec![0.0; Self::NG]; [INFO] [stderr] 560 | | fx[0] = x[0].powi(2) + x[1].powi(2) - 2.0; [INFO] [stderr] 561 | | fx [INFO] [stderr] 562 | | } [INFO] [stderr] | |_____^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:83:1 [INFO] [stderr] | [INFO] [stderr] 83 | impl UnConstrained for FonsecaFlemming {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:136:1 [INFO] [stderr] | [INFO] [stderr] 136 | impl UnConstrained for Viennet {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:15:1 [INFO] [stderr] | [INFO] [stderr] 15 | impl UnConstrained for Sphere {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:62:1 [INFO] [stderr] | [INFO] [stderr] 62 | impl UnConstrained for Rastrigin {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:116:1 [INFO] [stderr] | [INFO] [stderr] 116 | impl UnConstrained for Rosenbrock {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:168:1 [INFO] [stderr] | [INFO] [stderr] 168 | impl UnConstrained for Ackley {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:225:1 [INFO] [stderr] | [INFO] [stderr] 225 | impl UnConstrained for Matyas {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:278:1 [INFO] [stderr] | [INFO] [stderr] 278 | impl UnConstrained for Griewank {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:331:1 [INFO] [stderr] | [INFO] [stderr] 331 | impl UnConstrained for Ridge {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:386:1 [INFO] [stderr] | [INFO] [stderr] 386 | impl UnConstrained for Zakharov {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:439:1 [INFO] [stderr] | [INFO] [stderr] 439 | impl UnConstrained for Salomon {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:82:1 [INFO] [stderr] | [INFO] [stderr] 82 | impl NDimensional for FonsecaFlemming {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:14:1 [INFO] [stderr] | [INFO] [stderr] 14 | impl NDimensional for Sphere {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:61:1 [INFO] [stderr] | [INFO] [stderr] 61 | impl NDimensional for Rastrigin {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:115:1 [INFO] [stderr] | [INFO] [stderr] 115 | impl NDimensional for Rosenbrock {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:167:1 [INFO] [stderr] | [INFO] [stderr] 167 | impl NDimensional for Ackley {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:224:1 [INFO] [stderr] | [INFO] [stderr] 224 | impl NDimensional for Matyas {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:277:1 [INFO] [stderr] | [INFO] [stderr] 277 | impl NDimensional for Griewank {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:330:1 [INFO] [stderr] | [INFO] [stderr] 330 | impl NDimensional for Ridge {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:385:1 [INFO] [stderr] | [INFO] [stderr] 385 | impl NDimensional for Zakharov {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:438:1 [INFO] [stderr] | [INFO] [stderr] 438 | impl NDimensional for Salomon {} [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:13:1 [INFO] [stderr] | [INFO] [stderr] 13 | / impl FixedDimensional for ChankongHaimes { [INFO] [stderr] 14 | | const D: usize = 2; [INFO] [stderr] 15 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:14:5 [INFO] [stderr] | [INFO] [stderr] 14 | const D: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:138:1 [INFO] [stderr] | [INFO] [stderr] 138 | / impl FixedDimensional for Viennet { [INFO] [stderr] 139 | | const D: usize = 2; [INFO] [stderr] 140 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/multi.rs:139:5 [INFO] [stderr] | [INFO] [stderr] 139 | const D: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:507:1 [INFO] [stderr] | [INFO] [stderr] 507 | / impl FixedDimensional for RosenbrockConst1 { [INFO] [stderr] 508 | | const D: usize = 2; [INFO] [stderr] 509 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:508:5 [INFO] [stderr] | [INFO] [stderr] 508 | const D: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:565:1 [INFO] [stderr] | [INFO] [stderr] 565 | / impl FixedDimensional for RosenbrockConst2 { [INFO] [stderr] 566 | | const D: usize = 2; [INFO] [stderr] 567 | | } [INFO] [stderr] | |_^ [INFO] [stderr] [INFO] [stderr] warning: missing code example in this documentation [INFO] [stderr] --> src/single.rs:566:5 [INFO] [stderr] | [INFO] [stderr] 566 | const D: usize = 2; [INFO] [stderr] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stderr] [INFO] [stderr] warning: 172 warnings emitted [INFO] [stderr] [INFO] [stderr] Finished dev [unoptimized + debuginfo] target(s) in 0.97s [INFO] running `Command { std: "docker" "inspect" "c6e074a3abf29aff329e25e0e3e8ed46a176513b8103adc4e9c5bf2b50610f47", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "c6e074a3abf29aff329e25e0e3e8ed46a176513b8103adc4e9c5bf2b50610f47", kill_on_drop: false }` [INFO] [stdout] c6e074a3abf29aff329e25e0e3e8ed46a176513b8103adc4e9c5bf2b50610f47