genetic-algorithm-tsp 0.1.3

Using genetic algorithms to solve Traveling salesman problems.
Documentation
Build #523477 2022-03-10 07:07:54
# rustc version
rustc 1.61.0-nightly (458262b13 2022-03-09)# docs.rs version
docsrs 0.6.0 (5188c7e 2022-03-04)# build log
[INFO] running `Command { std: "docker" "create" "-v" "/home/cratesfyi/workspace/builds/genetic-algorithm-tsp-0.1.3/target:/opt/rustwide/target:rw,Z" "-v" "/home/cratesfyi/workspace/builds/genetic-algorithm-tsp-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" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "DOCS_RS=1" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "3221225472" "--cpus" "3" "--user" "1001:1001" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:1ede1414886370302e694df474b9877c02906499f04c196936ce0973d30c5eaa" "/opt/rustwide/cargo-home/bin/cargo" "+nightly" "rustdoc" "--lib" "-Zrustdoc-map" "-Z" "unstable-options" "--config" "build.rustdocflags=[\"-Z\", \"unstable-options\", \"--emit=invocation-specific\", \"--resource-suffix\", \"-20220309-1.61.0-nightly-458262b13\", \"--static-root-path\", \"/\", \"--cap-lints\", \"warn\", \"--disable-per-crate-search\"]" "-Zunstable-options" "--config=doc.extern-map.registries.crates-io=\"https://docs.rs/{pkg_name}/{version}/x86_64-unknown-linux-gnu\"" "-j3" "--target" "x86_64-unknown-linux-gnu", kill_on_drop: false }`
[INFO] [stdout] 5d2f9e6f059d66a3ca89fb5d18c57bb8a09534fb7b0139724633927a57baf2a6
[INFO] [stderr] WARNING: Your kernel does not support swap limit capabilities or the cgroup is not mounted. Memory limited without swap.
[INFO] running `Command { std: "docker" "start" "-a" "5d2f9e6f059d66a3ca89fb5d18c57bb8a09534fb7b0139724633927a57baf2a6", kill_on_drop: false }`
[INFO] [stderr]  Documenting genetic-algorithm-tsp v0.1.3 (/opt/rustwide/workdir)
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]  --> src/lib.rs:3:1
[INFO] [stderr]   |
[INFO] [stderr] 3 | / //! # Genetic algorithms for solving TSPs.
[INFO] [stderr] 4 | | //!
[INFO] [stderr] 5 | | //! This crates contains utitlities to run genetic algorithms and solve Traveling Salesman Problems.
[INFO] [stderr]   | |____________________________________________________________________________________________________^
[INFO] [stderr]   |
[INFO] [stderr] note: the lint level is defined here
[INFO] [stderr]  --> src/lib.rs:1:9
[INFO] [stderr]   |
[INFO] [stderr] 1 | #![deny(rustdoc::missing_doc_code_examples)]
[INFO] [stderr]   |         ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]  --> src/lib.rs:7:1
[INFO] [stderr]   |
[INFO] [stderr] 7 | /// Represent a distance Matrix as a Vec<Vec<f64>>.
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]  --> src/distance_mat.rs:2:1
[INFO] [stderr]   |
[INFO] [stderr] 2 | /// A representation of a f64 based distance matrix.
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]   --> src/distance_mat.rs:8:1
[INFO] [stderr]    |
[INFO] [stderr] 8  | / impl DistanceMat {
[INFO] [stderr] 9  | |     /// Create a new distance mat based on exising
[INFO] [stderr] 10 | |     /// distances.
[INFO] [stderr] 11 | |     ///
[INFO] [stderr] ...  |
[INFO] [stderr] 92 | |     }
[INFO] [stderr] 93 | | }
[INFO] [stderr]    | |_^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]   --> src/lib.rs:9:1
[INFO] [stderr]    |
[INFO] [stderr] 9  | / /// The `route`-module contains the `Route`-class, the individual element of the TSP that implements
[INFO] [stderr] 10 | | /// important methods like `crossover` or `mutate`.
[INFO] [stderr]    | |___________________________________________________^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]  --> src/route.rs:9:1
[INFO] [stderr]   |
[INFO] [stderr] 9 | /// The `Route` is an invidiual in the traveling salemens problem that is a valid route.
[INFO] [stderr]   | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]   --> src/route.rs:23:1
[INFO] [stderr]    |
[INFO] [stderr] 23 | / impl Route {
[INFO] [stderr] 24 | |     /// Create a new route based on a vector of indexes.
[INFO] [stderr] 25 | |     ///
[INFO] [stderr] 26 | |     /// # Arguments
[INFO] [stderr] ...  |
[INFO] [stderr] 52 | |     }
[INFO] [stderr] 53 | | }
[INFO] [stderr]    | |_^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]   --> src/lib.rs:12:1
[INFO] [stderr]    |
[INFO] [stderr] 12 | / /// The `routes`-module contains the main class of this crate which is the `Routes`-class that contains
[INFO] [stderr] 13 | | /// your current subset of routes and with which you can evolve them.
[INFO] [stderr]    | |_____________________________________________________________________^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]   --> src/routes.rs:27:1
[INFO] [stderr]    |
[INFO] [stderr] 27 | /// The `Population` is your current pools of routes that you would to improve by evolving them.
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: missing code example in this documentation
[INFO] [stderr]    --> src/routes.rs:73:1
[INFO] [stderr]     |
[INFO] [stderr] 73  | / impl Routes {
[INFO] [stderr] 74  | |     /// Create a new Population of routes by creating random invidiual routes.
[INFO] [stderr] 75  | |     ///
[INFO] [stderr] 76  | |     /// # Arguments
[INFO] [stderr] ...   |
[INFO] [stderr] 180 | |     }
[INFO] [stderr] 181 | | }
[INFO] [stderr]     | |_^
[INFO] [stderr] 
[INFO] [stderr] warning: Rust code block is empty
[INFO] [stderr]    --> src/routes.rs:356:5
[INFO] [stderr]     |
[INFO] [stderr] 356 | /// ```
[INFO] [stderr]     |     ^^^
[INFO] [stderr]     |
[INFO] [stderr]     = note: `#[warn(rustdoc::invalid_rust_codeblocks)]` on by default
[INFO] [stderr] help: mark blocks that do not contain Rust code as text
[INFO] [stderr]     |
[INFO] [stderr] 356 | /// ```text
[INFO] [stderr]     |        ++++
[INFO] [stderr] 
[INFO] [stderr] warning: `genetic-algorithm-tsp` (lib doc) generated 11 warnings
[INFO] [stderr]     Finished dev [optimized + debuginfo] target(s) in 1.01s
[INFO] running `Command { std: "docker" "inspect" "5d2f9e6f059d66a3ca89fb5d18c57bb8a09534fb7b0139724633927a57baf2a6", kill_on_drop: false }`
[INFO] running `Command { std: "docker" "rm" "-f" "5d2f9e6f059d66a3ca89fb5d18c57bb8a09534fb7b0139724633927a57baf2a6", kill_on_drop: false }`
[INFO] [stdout] 5d2f9e6f059d66a3ca89fb5d18c57bb8a09534fb7b0139724633927a57baf2a6