[INFO] updating cached repository megesdal/bedtree-rs
[INFO] running `"git" "fetch" "--all"`
[INFO] [stdout] Fetching origin
[INFO] [stderr] From git://github.com/megesdal/bedtree-rs
[INFO] [stderr]  * branch            HEAD       -> FETCH_HEAD
[INFO] running `"git" "clone" "work/cache/sources/gh/megesdal/bedtree-rs" "work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/megesdal/bedtree-rs"`
[INFO] [stderr] Cloning into 'work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/megesdal/bedtree-rs'...
[INFO] [stderr] done.
[INFO] running `"git" "clone" "work/cache/sources/gh/megesdal/bedtree-rs" "work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/megesdal/bedtree-rs"`
[INFO] [stderr] Cloning into 'work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/megesdal/bedtree-rs'...
[INFO] [stderr] done.
[INFO] running `"git" "rev-parse" "HEAD"`
[INFO] [stdout] 619e6a2c8e1ed408362deaa39469d5f685c0c4a1
[INFO] sha for GitHub repo megesdal/bedtree-rs: 619e6a2c8e1ed408362deaa39469d5f685c0c4a1
[INFO] validating manifest of megesdal/bedtree-rs on toolchain master#a850a426491e14186af2250549bf41256b5938d2
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] validating manifest of megesdal/bedtree-rs on toolchain try#06a150c7d11500b41499224f165e9de1de096768
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "read-manifest" "--manifest-path" "Cargo.toml"`
[INFO] started frobbing megesdal/bedtree-rs
[INFO] finished frobbing megesdal/bedtree-rs
[INFO] frobbed toml for megesdal/bedtree-rs written to work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/megesdal/bedtree-rs/Cargo.toml
[INFO] started frobbing megesdal/bedtree-rs
[INFO] finished frobbing megesdal/bedtree-rs
[INFO] frobbed toml for megesdal/bedtree-rs written to work/ex/pr-60162/sources/try#06a150c7d11500b41499224f165e9de1de096768/gh/megesdal/bedtree-rs/Cargo.toml
[INFO] crate megesdal/bedtree-rs already has a lockfile, it will not be regenerated
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] running `"/mnt/crater-raid/crater/work/local/cargo-home/bin/cargo" "+06a150c7d11500b41499224f165e9de1de096768-alt" "fetch" "--locked" "--manifest-path" "Cargo.toml"`
[INFO] checking megesdal/bedtree-rs against master#a850a426491e14186af2250549bf41256b5938d2 for pr-60162
[INFO] running `"docker" "create" "-v" "/mnt/crater-raid/crater/work/local/target-dirs/pr-60162/worker-0/master#a850a426491e14186af2250549bf41256b5938d2:/opt/crater/target:rw,Z" "-v" "/mnt/crater-raid/crater/work/ex/pr-60162/sources/master#a850a426491e14186af2250549bf41256b5938d2/gh/megesdal/bedtree-rs:/opt/crater/workdir:ro,Z" "-v" "/mnt/crater-raid/crater/work/local/cargo-home:/opt/crater/cargo-home:ro,Z" "-v" "/mnt/crater-raid/crater/work/local/rustup-home:/opt/crater/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/opt/crater/workdir" "-e" "MAP_USER_ID=1000" "-e" "CARGO_TARGET_DIR=/opt/crater/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/crater/cargo-home" "-e" "RUSTUP_HOME=/opt/crater/rustup-home" "-w" "/opt/crater/workdir" "-m" "1536M" "--network" "none" "rustops/crates-build-env" "/opt/crater/cargo-home/bin/cargo" "+a850a426491e14186af2250549bf41256b5938d2-alt" "check" "--frozen" "--all" "--all-targets"`
[INFO] [stdout] 16370c75b6d15b73f9883e930ab5d0b42ee6f2559ad7020ef8015c78e4801fb5
[INFO] running `"docker" "start" "-a" "16370c75b6d15b73f9883e930ab5d0b42ee6f2559ad7020ef8015c78e4801fb5"`
[INFO] [stderr]     Checking hello_world v0.0.1 (/opt/crater/workdir)
[INFO] [stderr] warning: unused import: `max`
[INFO] [stderr]  --> src/main.rs:2:16
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::{max, min, Ordering};
[INFO] [stderr]   |                ^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_imports)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused import: `max`
[INFO] [stderr]  --> src/main.rs:2:16
[INFO] [stderr]   |
[INFO] [stderr] 2 | use std::cmp::{max, min, Ordering};
[INFO] [stderr]   |                ^^^
[INFO] [stderr]   |
[INFO] [stderr]   = note: #[warn(unused_imports)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `node_to_insert`
[INFO] [stderr]    --> src/main.rs:114:14
[INFO] [stderr]     |
[INFO] [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
[INFO] [stderr]     |              ^^^^^^^^^^^^^^ help: consider prefixing with an underscore: `_node_to_insert`
[INFO] [stderr]     |
[INFO] [stderr]     = note: #[warn(unused_variables)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `insert_idx`
[INFO] [stderr]    --> src/main.rs:114:30
[INFO] [stderr]     |
[INFO] [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
[INFO] [stderr]     |                              ^^^^^^^^^^ help: consider prefixing with an underscore: `_insert_idx`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `q`
[INFO] [stderr]    --> src/main.rs:125:68
[INFO] [stderr]     |
[INFO] [stderr] 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
[INFO] [stderr]     |                                                                    ^ help: consider prefixing with an underscore: `_q`
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `BPlusTree`
[INFO] [stderr]   --> src/main.rs:42:1
[INFO] [stderr]    |
[INFO] [stderr] 42 | struct BPlusTree<'a> {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(dead_code)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `BPlusTreeNode`
[INFO] [stderr]   --> src/main.rs:48:1
[INFO] [stderr]    |
[INFO] [stderr] 48 | struct BPlusTreeNode<'a> {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_leaf_node`
[INFO] [stderr]   --> src/main.rs:57:5
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn is_leaf_node(&self) -> bool {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `insert`
[INFO] [stderr]   --> src/main.rs:64:5
[INFO] [stderr]    |
[INFO] [stderr] 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `find_node`
[INFO] [stderr]   --> src/main.rs:70:5
[INFO] [stderr]    |
[INFO] [stderr] 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `check_split`
[INFO] [stderr]   --> src/main.rs:75:13
[INFO] [stderr]    |
[INFO] [stderr] 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
[INFO] [stderr] 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr] 77 | |                 if child_idx == node.splits.len() {
[INFO] [stderr] 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
[INFO] [stderr] ...  |
[INFO] [stderr] 83 | |                 }
[INFO] [stderr] 84 | |             };
[INFO] [stderr]    | |_____________^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `rec_insert`
[INFO] [stderr]    --> src/main.rs:89:5
[INFO] [stderr]     |
[INFO] [stderr] 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
[INFO] [stderr] 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr] 91  | |
[INFO] [stderr] 92  | |         // TODO: recursive closure via struct?
[INFO] [stderr] ...   |
[INFO] [stderr] 122 | |         parent
[INFO] [stderr] 123 | |     }
[INFO] [stderr]     | |_____^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_insert_loc`
[INFO] [stderr]    --> src/main.rs:93:9
[INFO] [stderr]     |
[INFO] [stderr] 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
[INFO] [stderr] 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
[INFO] [stderr] 95  | |             if idx == splits.len() {
[INFO] [stderr] 96  | |                 (splits.len(), true)
[INFO] [stderr] ...   |
[INFO] [stderr] 103 | |             }
[INFO] [stderr] 104 | |         }
[INFO] [stderr]     | |_________^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `split_if_necessary`
[INFO] [stderr]    --> src/main.rs:125:5
[INFO] [stderr]     |
[INFO] [stderr] 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
[INFO] [stderr] 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
[INFO] [stderr] 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
[INFO] [stderr] 128 | |         if !should_split {
[INFO] [stderr] ...   |
[INFO] [stderr] 133 | |         }
[INFO] [stderr] 134 | |     }
[INFO] [stderr]     | |_____^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `verify_edit_distance`
[INFO] [stderr]    --> src/main.rs:137:1
[INFO] [stderr]     |
[INFO] [stderr] 137 | fn verify_edit_distance(x: &str, y: &str, distance_threshold: usize) -> Option<usize> {
[INFO] [stderr]     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `create_verification_table`
[INFO] [stderr]    --> src/main.rs:171:1
[INFO] [stderr]     |
[INFO] [stderr] 171 | / fn create_verification_table<F>(
[INFO] [stderr] 172 | |     nrows: usize,
[INFO] [stderr] 173 | |     ncols: usize,
[INFO] [stderr] 174 | |     distance_threshold: usize,
[INFO] [stderr] ...   |
[INFO] [stderr] 225 | |     (row0, Some(m))
[INFO] [stderr] 226 | | }
[INFO] [stderr]     | |_^
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `node_to_insert`
[INFO] [stderr]    --> src/main.rs:114:14
[INFO] [stderr]     |
[INFO] [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
[INFO] [stderr]     |              ^^^^^^^^^^^^^^ help: consider prefixing with an underscore: `_node_to_insert`
[INFO] [stderr]     |
[INFO] [stderr]     = note: #[warn(unused_variables)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `insert_idx`
[INFO] [stderr]    --> src/main.rs:114:30
[INFO] [stderr]     |
[INFO] [stderr] 114 |         let (node_to_insert, insert_idx) = match split_result {
[INFO] [stderr]     |                              ^^^^^^^^^^ help: consider prefixing with an underscore: `_insert_idx`
[INFO] [stderr] 
[INFO] [stderr] warning: unused variable: `q`
[INFO] [stderr]    --> src/main.rs:125:68
[INFO] [stderr]     |
[INFO] [stderr] 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
[INFO] [stderr]     |                                                                    ^ help: consider prefixing with an underscore: `_q`
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `BPlusTree`
[INFO] [stderr]   --> src/main.rs:42:1
[INFO] [stderr]    |
[INFO] [stderr] 42 | struct BPlusTree<'a> {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr]    |
[INFO] [stderr]    = note: #[warn(dead_code)] on by default
[INFO] [stderr] 
[INFO] [stderr] warning: struct is never constructed: `BPlusTreeNode`
[INFO] [stderr]   --> src/main.rs:48:1
[INFO] [stderr]    |
[INFO] [stderr] 48 | struct BPlusTreeNode<'a> {
[INFO] [stderr]    | ^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `is_leaf_node`
[INFO] [stderr]   --> src/main.rs:57:5
[INFO] [stderr]    |
[INFO] [stderr] 57 |     fn is_leaf_node(&self) -> bool {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `insert`
[INFO] [stderr]   --> src/main.rs:64:5
[INFO] [stderr]    |
[INFO] [stderr] 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `find_node`
[INFO] [stderr]   --> src/main.rs:70:5
[INFO] [stderr]    |
[INFO] [stderr] 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr]    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `check_split`
[INFO] [stderr]   --> src/main.rs:75:13
[INFO] [stderr]    |
[INFO] [stderr] 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
[INFO] [stderr] 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr] 77 | |                 if child_idx == node.splits.len() {
[INFO] [stderr] 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
[INFO] [stderr] ...  |
[INFO] [stderr] 83 | |                 }
[INFO] [stderr] 84 | |             };
[INFO] [stderr]    | |_____________^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `rec_insert`
[INFO] [stderr]    --> src/main.rs:89:5
[INFO] [stderr]     |
[INFO] [stderr] 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
[INFO] [stderr] 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
[INFO] [stderr] 91  | |
[INFO] [stderr] 92  | |         // TODO: recursive closure via struct?
[INFO] [stderr] ...   |
[INFO] [stderr] 122 | |         parent
[INFO] [stderr] 123 | |     }
[INFO] [stderr]     | |_____^
[INFO] [stderr] 
[INFO] [stderr] warning: function is never used: `find_insert_loc`
[INFO] [stderr]    --> src/main.rs:93:9
[INFO] [stderr]     |
[INFO] [stderr] 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
[INFO] [stderr] 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
[INFO] [stderr] 95  | |             if idx == splits.len() {
[INFO] [stderr] 96  | |                 (splits.len(), true)
[INFO] [stderr] ...   |
[INFO] [stderr] 103 | |             }
[INFO] [stderr] 104 | |         }
[INFO] [stderr]     | |_________^
[INFO] [stderr] 
[INFO] [stderr] warning: method is never used: `split_if_necessary`
[INFO] [stderr]    --> src/main.rs:125:5
[INFO] [stderr]     |
[INFO] [stderr] 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
[INFO] [stderr] 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
[INFO] [stderr] 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
[INFO] [stderr] 128 | |         if !should_split {
[INFO] [stderr] ...   |
[INFO] [stderr] 133 | |         }
[INFO] [stderr] 134 | |     }
[INFO] [stderr]     | |_____^
[INFO] [stderr] 
[INFO] [stderr]     Finished dev [unoptimized + debuginfo] target(s) in 0.34s
[INFO] running `"docker" "inspect" "16370c75b6d15b73f9883e930ab5d0b42ee6f2559ad7020ef8015c78e4801fb5"`
[INFO] running `"docker" "rm" "-f" "16370c75b6d15b73f9883e930ab5d0b42ee6f2559ad7020ef8015c78e4801fb5"`
[INFO] [stdout] 16370c75b6d15b73f9883e930ab5d0b42ee6f2559ad7020ef8015c78e4801fb5