Nov 04 02:53:28.453 INFO checking megesdal/bedtree-rs against try#e740b9aa0b624fa39feb39613e76d15bdf57e594 for pr-55655
Nov 04 02:53:28.453 INFO running `"docker" "create" "-v" "/mnt/big/crater/work/local/target-dirs/pr-55655/worker-0/try#e740b9aa0b624fa39feb39613e76d15bdf57e594:/target:rw,Z" "-v" "/mnt/big/crater/work/local/test-source/worker-0/pr-55655/try#e740b9aa0b624fa39feb39613e76d15bdf57e594:/source:ro,Z" "-v" "/mnt/big/crater/work/local/cargo-home:/cargo-home:ro,Z" "-v" "/mnt/big/crater/work/local/rustup-home:/rustup-home:ro,Z" "-e" "USER_ID=1000" "-e" "SOURCE_DIR=/source" "-e" "USER_ID=1000" "-e" "CMD=cargo +e740b9aa0b624fa39feb39613e76d15bdf57e594-alt check --frozen --all --all-targets" "-e" "CARGO_TARGET_DIR=/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/cargo-home" "-e" "RUSTUP_HOME=/rustup-home" "-m" "1536M" "--network" "none" "crater"`
Nov 04 02:53:28.757 INFO blam! 411272a7e7f27150b8d1113aa7961f441db8b38041f29382f1a6c9aa6a366538
Nov 04 02:53:28.764 INFO running `"docker" "start" "-a" "411272a7e7f27150b8d1113aa7961f441db8b38041f29382f1a6c9aa6a366538"`
Nov 04 02:53:29.129 INFO kablam! usermod: no changes
Nov 04 02:53:29.140 INFO kablam!     Checking hello_world v0.0.1 (/source)
Nov 04 02:53:29.322 INFO kablam! warning: unused import: `max`
Nov 04 02:53:29.322 INFO kablam!  --> src/main.rs:2:16
Nov 04 02:53:29.322 INFO kablam!   |
Nov 04 02:53:29.322 INFO kablam! 2 | use std::cmp::{max, min, Ordering};
Nov 04 02:53:29.322 INFO kablam!   |                ^^^
Nov 04 02:53:29.322 INFO kablam!   |
Nov 04 02:53:29.322 INFO kablam!   = note: #[warn(unused_imports)] on by default
Nov 04 02:53:29.322 INFO kablam! 
Nov 04 02:53:29.389 INFO kablam! warning: unused variable: `node_to_insert`
Nov 04 02:53:29.389 INFO kablam!    --> src/main.rs:114:14
Nov 04 02:53:29.389 INFO kablam!     |
Nov 04 02:53:29.389 INFO kablam! 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 04 02:53:29.390 INFO kablam!     |              ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead
Nov 04 02:53:29.390 INFO kablam!     |
Nov 04 02:53:29.390 INFO kablam!     = note: #[warn(unused_variables)] on by default
Nov 04 02:53:29.390 INFO kablam! 
Nov 04 02:53:29.390 INFO kablam! warning: unused variable: `insert_idx`
Nov 04 02:53:29.390 INFO kablam!    --> src/main.rs:114:30
Nov 04 02:53:29.390 INFO kablam!     |
Nov 04 02:53:29.390 INFO kablam! 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 04 02:53:29.390 INFO kablam!     |                              ^^^^^^^^^^ help: consider using `_insert_idx` instead
Nov 04 02:53:29.390 INFO kablam! 
Nov 04 02:53:29.390 INFO kablam! warning: unused variable: `q`
Nov 04 02:53:29.390 INFO kablam!    --> src/main.rs:125:68
Nov 04 02:53:29.390 INFO kablam!     |
Nov 04 02:53:29.390 INFO kablam! 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 04 02:53:29.390 INFO kablam!     |                                                                    ^ help: consider using `_q` instead
Nov 04 02:53:29.390 INFO kablam! 
Nov 04 02:53:29.398 INFO kablam! warning: unused import: `max`
Nov 04 02:53:29.398 INFO kablam!  --> src/main.rs:2:16
Nov 04 02:53:29.398 INFO kablam!   |
Nov 04 02:53:29.398 INFO kablam! 2 | use std::cmp::{max, min, Ordering};
Nov 04 02:53:29.398 INFO kablam!   |                ^^^
Nov 04 02:53:29.398 INFO kablam!   |
Nov 04 02:53:29.403 INFO kablam!   = note: #[warn(unused_imports)] on by default
Nov 04 02:53:29.403 INFO kablam! 
Nov 04 02:53:29.407 INFO kablam! warning: struct is never constructed: `BPlusTree`
Nov 04 02:53:29.407 INFO kablam!   --> src/main.rs:42:1
Nov 04 02:53:29.407 INFO kablam!    |
Nov 04 02:53:29.407 INFO kablam! 42 | struct BPlusTree<'a> {
Nov 04 02:53:29.407 INFO kablam!    | ^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.407 INFO kablam!    |
Nov 04 02:53:29.407 INFO kablam!    = note: #[warn(dead_code)] on by default
Nov 04 02:53:29.407 INFO kablam! 
Nov 04 02:53:29.407 INFO kablam! warning: struct is never constructed: `BPlusTreeNode`
Nov 04 02:53:29.407 INFO kablam!   --> src/main.rs:48:1
Nov 04 02:53:29.407 INFO kablam!    |
Nov 04 02:53:29.407 INFO kablam! 48 | struct BPlusTreeNode<'a> {
Nov 04 02:53:29.407 INFO kablam!    | ^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.407 INFO kablam! 
Nov 04 02:53:29.407 INFO kablam! warning: method is never used: `is_leaf_node`
Nov 04 02:53:29.407 INFO kablam!   --> src/main.rs:57:5
Nov 04 02:53:29.407 INFO kablam!    |
Nov 04 02:53:29.407 INFO kablam! 57 |     fn is_leaf_node(&self) -> bool {
Nov 04 02:53:29.407 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.407 INFO kablam! 
Nov 04 02:53:29.407 INFO kablam! warning: method is never used: `insert`
Nov 04 02:53:29.408 INFO kablam!   --> src/main.rs:64:5
Nov 04 02:53:29.408 INFO kablam!    |
Nov 04 02:53:29.408 INFO kablam! 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.408 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.408 INFO kablam! 
Nov 04 02:53:29.408 INFO kablam! warning: method is never used: `find_node`
Nov 04 02:53:29.408 INFO kablam!   --> src/main.rs:70:5
Nov 04 02:53:29.408 INFO kablam!    |
Nov 04 02:53:29.408 INFO kablam! 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.408 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.408 INFO kablam! 
Nov 04 02:53:29.409 INFO kablam! warning: function is never used: `check_split`
Nov 04 02:53:29.409 INFO kablam!   --> src/main.rs:75:13
Nov 04 02:53:29.409 INFO kablam!    |
Nov 04 02:53:29.409 INFO kablam! 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
Nov 04 02:53:29.409 INFO kablam! 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.409 INFO kablam! 77 | |                 if child_idx == node.splits.len() {
Nov 04 02:53:29.409 INFO kablam! 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
Nov 04 02:53:29.409 INFO kablam! ...  |
Nov 04 02:53:29.409 INFO kablam! 83 | |                 }
Nov 04 02:53:29.409 INFO kablam! 84 | |             };
Nov 04 02:53:29.409 INFO kablam!    | |_____________^
Nov 04 02:53:29.409 INFO kablam! 
Nov 04 02:53:29.409 INFO kablam! warning: method is never used: `rec_insert`
Nov 04 02:53:29.409 INFO kablam!    --> src/main.rs:89:5
Nov 04 02:53:29.409 INFO kablam!     |
Nov 04 02:53:29.409 INFO kablam! 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
Nov 04 02:53:29.409 INFO kablam! 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.410 INFO kablam! 91  | |
Nov 04 02:53:29.410 INFO kablam! 92  | |         // TODO: recursive closure via struct?
Nov 04 02:53:29.410 INFO kablam! ...   |
Nov 04 02:53:29.410 INFO kablam! 122 | |         parent
Nov 04 02:53:29.410 INFO kablam! 123 | |     }
Nov 04 02:53:29.410 INFO kablam!     | |_____^
Nov 04 02:53:29.410 INFO kablam! 
Nov 04 02:53:29.410 INFO kablam! warning: function is never used: `find_insert_loc`
Nov 04 02:53:29.410 INFO kablam!    --> src/main.rs:93:9
Nov 04 02:53:29.410 INFO kablam!     |
Nov 04 02:53:29.410 INFO kablam! 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
Nov 04 02:53:29.410 INFO kablam! 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
Nov 04 02:53:29.410 INFO kablam! 95  | |             if idx == splits.len() {
Nov 04 02:53:29.410 INFO kablam! 96  | |                 (splits.len(), true)
Nov 04 02:53:29.410 INFO kablam! ...   |
Nov 04 02:53:29.410 INFO kablam! 103 | |             }
Nov 04 02:53:29.410 INFO kablam! 104 | |         }
Nov 04 02:53:29.410 INFO kablam!     | |_________^
Nov 04 02:53:29.410 INFO kablam! 
Nov 04 02:53:29.410 INFO kablam! warning: method is never used: `split_if_necessary`
Nov 04 02:53:29.410 INFO kablam!    --> src/main.rs:125:5
Nov 04 02:53:29.410 INFO kablam!     |
Nov 04 02:53:29.410 INFO kablam! 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 04 02:53:29.410 INFO kablam! 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
Nov 04 02:53:29.410 INFO kablam! 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
Nov 04 02:53:29.410 INFO kablam! 128 | |         if !should_split {
Nov 04 02:53:29.410 INFO kablam! ...   |
Nov 04 02:53:29.410 INFO kablam! 133 | |         }
Nov 04 02:53:29.410 INFO kablam! 134 | |     }
Nov 04 02:53:29.411 INFO kablam!     | |_____^
Nov 04 02:53:29.411 INFO kablam! 
Nov 04 02:53:29.411 INFO kablam! warning: function is never used: `verify_edit_distance`
Nov 04 02:53:29.411 INFO kablam!    --> src/main.rs:137:1
Nov 04 02:53:29.411 INFO kablam!     |
Nov 04 02:53:29.411 INFO kablam! 137 | fn verify_edit_distance(x: &str, y: &str, distance_threshold: usize) -> Option<usize> {
Nov 04 02:53:29.411 INFO kablam!     | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.411 INFO kablam! 
Nov 04 02:53:29.411 INFO kablam! warning: function is never used: `create_verification_table`
Nov 04 02:53:29.411 INFO kablam!    --> src/main.rs:171:1
Nov 04 02:53:29.411 INFO kablam!     |
Nov 04 02:53:29.411 INFO kablam! 171 | / fn create_verification_table<F>(
Nov 04 02:53:29.411 INFO kablam! 172 | |     nrows: usize,
Nov 04 02:53:29.411 INFO kablam! 173 | |     ncols: usize,
Nov 04 02:53:29.411 INFO kablam! 174 | |     distance_threshold: usize,
Nov 04 02:53:29.411 INFO kablam! ...   |
Nov 04 02:53:29.411 INFO kablam! 225 | |     (row0, Some(m))
Nov 04 02:53:29.411 INFO kablam! 226 | | }
Nov 04 02:53:29.411 INFO kablam!     | |_^
Nov 04 02:53:29.411 INFO kablam! 
Nov 04 02:53:29.502 INFO kablam! warning: unused variable: `node_to_insert`
Nov 04 02:53:29.502 INFO kablam!    --> src/main.rs:114:14
Nov 04 02:53:29.502 INFO kablam!     |
Nov 04 02:53:29.502 INFO kablam! 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 04 02:53:29.502 INFO kablam!     |              ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead
Nov 04 02:53:29.502 INFO kablam!     |
Nov 04 02:53:29.502 INFO kablam!     = note: #[warn(unused_variables)] on by default
Nov 04 02:53:29.502 INFO kablam! 
Nov 04 02:53:29.502 INFO kablam! warning: unused variable: `insert_idx`
Nov 04 02:53:29.502 INFO kablam!    --> src/main.rs:114:30
Nov 04 02:53:29.502 INFO kablam!     |
Nov 04 02:53:29.502 INFO kablam! 114 |         let (node_to_insert, insert_idx) = match split_result {
Nov 04 02:53:29.502 INFO kablam!     |                              ^^^^^^^^^^ help: consider using `_insert_idx` instead
Nov 04 02:53:29.502 INFO kablam! 
Nov 04 02:53:29.502 INFO kablam! warning: unused variable: `q`
Nov 04 02:53:29.502 INFO kablam!    --> src/main.rs:125:68
Nov 04 02:53:29.502 INFO kablam!     |
Nov 04 02:53:29.502 INFO kablam! 125 |     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 04 02:53:29.502 INFO kablam!     |                                                                    ^ help: consider using `_q` instead
Nov 04 02:53:29.502 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: struct is never constructed: `BPlusTree`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:42:1
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 42 | struct BPlusTree<'a> {
Nov 04 02:53:29.531 INFO kablam!    | ^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam!    = note: #[warn(dead_code)] on by default
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: struct is never constructed: `BPlusTreeNode`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:48:1
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 48 | struct BPlusTreeNode<'a> {
Nov 04 02:53:29.531 INFO kablam!    | ^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: method is never used: `is_leaf_node`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:57:5
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 57 |     fn is_leaf_node(&self) -> bool {
Nov 04 02:53:29.531 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: method is never used: `insert`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:64:5
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 64 |     fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.531 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: method is never used: `find_node`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:70:5
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 70 |     fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.531 INFO kablam!    |     ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: function is never used: `check_split`
Nov 04 02:53:29.531 INFO kablam!   --> src/main.rs:75:13
Nov 04 02:53:29.531 INFO kablam!    |
Nov 04 02:53:29.531 INFO kablam! 75 | /             fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>,
Nov 04 02:53:29.531 INFO kablam! 76 | |                                child_idx: usize) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.531 INFO kablam! 77 | |                 if child_idx == node.splits.len() {
Nov 04 02:53:29.531 INFO kablam! 78 | |                     tree.find_node(q, &node.children[node.splits.len()])
Nov 04 02:53:29.531 INFO kablam! ...  |
Nov 04 02:53:29.531 INFO kablam! 83 | |                 }
Nov 04 02:53:29.531 INFO kablam! 84 | |             };
Nov 04 02:53:29.531 INFO kablam!    | |_____________^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: method is never used: `rec_insert`
Nov 04 02:53:29.531 INFO kablam!    --> src/main.rs:89:5
Nov 04 02:53:29.531 INFO kablam!     |
Nov 04 02:53:29.531 INFO kablam! 89  | /     fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>,
Nov 04 02:53:29.531 INFO kablam! 90  | |                   child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> {
Nov 04 02:53:29.531 INFO kablam! 91  | |
Nov 04 02:53:29.531 INFO kablam! 92  | |         // TODO: recursive closure via struct?
Nov 04 02:53:29.531 INFO kablam! ...   |
Nov 04 02:53:29.531 INFO kablam! 122 | |         parent
Nov 04 02:53:29.531 INFO kablam! 123 | |     }
Nov 04 02:53:29.531 INFO kablam!     | |_____^
Nov 04 02:53:29.531 INFO kablam! 
Nov 04 02:53:29.531 INFO kablam! warning: function is never used: `find_insert_loc`
Nov 04 02:53:29.531 INFO kablam!    --> src/main.rs:93:9
Nov 04 02:53:29.531 INFO kablam!     |
Nov 04 02:53:29.532 INFO kablam! 93  | /         fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize,
Nov 04 02:53:29.532 INFO kablam! 94  | |                                q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) {
Nov 04 02:53:29.532 INFO kablam! 95  | |             if idx == splits.len() {
Nov 04 02:53:29.532 INFO kablam! 96  | |                 (splits.len(), true)
Nov 04 02:53:29.532 INFO kablam! ...   |
Nov 04 02:53:29.532 INFO kablam! 103 | |             }
Nov 04 02:53:29.532 INFO kablam! 104 | |         }
Nov 04 02:53:29.532 INFO kablam!     | |_________^
Nov 04 02:53:29.532 INFO kablam! 
Nov 04 02:53:29.532 INFO kablam! warning: method is never used: `split_if_necessary`
Nov 04 02:53:29.532 INFO kablam!    --> src/main.rs:125:5
Nov 04 02:53:29.532 INFO kablam!     |
Nov 04 02:53:29.532 INFO kablam! 125 | /     fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str)
Nov 04 02:53:29.532 INFO kablam! 126 | |                           -> (Option<&'a BPlusTreeNode<'a>>, bool) {
Nov 04 02:53:29.532 INFO kablam! 127 | |         let should_split = parent.splits.len() == self.branch_factor - 1;
Nov 04 02:53:29.532 INFO kablam! 128 | |         if !should_split {
Nov 04 02:53:29.532 INFO kablam! ...   |
Nov 04 02:53:29.532 INFO kablam! 133 | |         }
Nov 04 02:53:29.532 INFO kablam! 134 | |     }
Nov 04 02:53:29.532 INFO kablam!     | |_____^
Nov 04 02:53:29.532 INFO kablam! 
Nov 04 02:53:29.542 INFO kablam!     Finished dev [unoptimized + debuginfo] target(s) in 0.41s
Nov 04 02:53:29.545 INFO kablam! su: No module specific data is present
Nov 04 02:53:29.933 INFO running `"docker" "rm" "-f" "411272a7e7f27150b8d1113aa7961f441db8b38041f29382f1a6c9aa6a366538"`
Nov 04 02:53:30.014 INFO blam! 411272a7e7f27150b8d1113aa7961f441db8b38041f29382f1a6c9aa6a366538