Oct 27 00:43:18.549 INFO checking megesdal/bedtree-rs against try#19f01b935b91481fd445b16b533d2f87661bf12e for pr-55192-2 Oct 27 00:43:18.549 INFO running `"docker" "create" "-v" "/mnt/big/crater/./work/local/target-dirs/pr-55192-2/worker-0/try#19f01b935b91481fd445b16b533d2f87661bf12e:/target:rw,Z" "-v" "/mnt/big/crater/./work/local/test-source/worker-0/pr-55192-2/try#19f01b935b91481fd445b16b533d2f87661bf12e:/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 +19f01b935b91481fd445b16b533d2f87661bf12e-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"` Oct 27 00:43:18.783 INFO blam! 23200f7f8b404dd7bc3ea1f5bae874036c4aa9cc87a60457b42dabf01f8a27a4 Oct 27 00:43:18.785 INFO running `"docker" "start" "-a" "23200f7f8b404dd7bc3ea1f5bae874036c4aa9cc87a60457b42dabf01f8a27a4"` Oct 27 00:43:19.542 INFO kablam! usermod: no changes Oct 27 00:43:19.575 INFO kablam! Checking hello_world v0.0.1 (/source) Oct 27 00:43:19.819 INFO kablam! warning: unused import: `max` Oct 27 00:43:19.819 INFO kablam! --> src/main.rs:2:16 Oct 27 00:43:19.819 INFO kablam! | Oct 27 00:43:19.819 INFO kablam! 2 | use std::cmp::{max, min, Ordering}; Oct 27 00:43:19.819 INFO kablam! | ^^^ Oct 27 00:43:19.819 INFO kablam! | Oct 27 00:43:19.819 INFO kablam! = note: #[warn(unused_imports)] on by default Oct 27 00:43:19.819 INFO kablam! Oct 27 00:43:19.859 INFO kablam! warning: unused import: `max` Oct 27 00:43:19.860 INFO kablam! --> src/main.rs:2:16 Oct 27 00:43:19.860 INFO kablam! | Oct 27 00:43:19.860 INFO kablam! 2 | use std::cmp::{max, min, Ordering}; Oct 27 00:43:19.860 INFO kablam! | ^^^ Oct 27 00:43:19.861 INFO kablam! | Oct 27 00:43:19.861 INFO kablam! = note: #[warn(unused_imports)] on by default Oct 27 00:43:19.861 INFO kablam! Oct 27 00:43:19.887 INFO kablam! warning: unused variable: `node_to_insert` Oct 27 00:43:19.887 INFO kablam! --> src/main.rs:114:14 Oct 27 00:43:19.887 INFO kablam! | Oct 27 00:43:19.888 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Oct 27 00:43:19.888 INFO kablam! | ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead Oct 27 00:43:19.888 INFO kablam! | Oct 27 00:43:19.888 INFO kablam! = note: #[warn(unused_variables)] on by default Oct 27 00:43:19.888 INFO kablam! Oct 27 00:43:19.888 INFO kablam! warning: unused variable: `insert_idx` Oct 27 00:43:19.888 INFO kablam! --> src/main.rs:114:30 Oct 27 00:43:19.888 INFO kablam! | Oct 27 00:43:19.888 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Oct 27 00:43:19.888 INFO kablam! | ^^^^^^^^^^ help: consider using `_insert_idx` instead Oct 27 00:43:19.888 INFO kablam! Oct 27 00:43:19.888 INFO kablam! warning: unused variable: `q` Oct 27 00:43:19.888 INFO kablam! --> src/main.rs:125:68 Oct 27 00:43:19.888 INFO kablam! | Oct 27 00:43:19.888 INFO kablam! 125 | fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Oct 27 00:43:19.888 INFO kablam! | ^ help: consider using `_q` instead Oct 27 00:43:19.888 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: struct is never constructed: `BPlusTree` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:42:1 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 42 | struct BPlusTree<'a> { Oct 27 00:43:19.912 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! = note: #[warn(dead_code)] on by default Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: struct is never constructed: `BPlusTreeNode` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:48:1 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 48 | struct BPlusTreeNode<'a> { Oct 27 00:43:19.912 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: method is never used: `is_leaf_node` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:57:5 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 57 | fn is_leaf_node(&self) -> bool { Oct 27 00:43:19.912 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: method is never used: `insert` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:64:5 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 64 | fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:19.912 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: method is never used: `find_node` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:70:5 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 70 | fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:19.912 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.912 INFO kablam! warning: function is never used: `check_split` Oct 27 00:43:19.912 INFO kablam! --> src/main.rs:75:13 Oct 27 00:43:19.912 INFO kablam! | Oct 27 00:43:19.912 INFO kablam! 75 | / fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>, Oct 27 00:43:19.912 INFO kablam! 76 | | child_idx: usize) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:19.912 INFO kablam! 77 | | if child_idx == node.splits.len() { Oct 27 00:43:19.912 INFO kablam! 78 | | tree.find_node(q, &node.children[node.splits.len()]) Oct 27 00:43:19.912 INFO kablam! ... | Oct 27 00:43:19.912 INFO kablam! 83 | | } Oct 27 00:43:19.912 INFO kablam! 84 | | }; Oct 27 00:43:19.912 INFO kablam! | |_____________^ Oct 27 00:43:19.912 INFO kablam! Oct 27 00:43:19.913 INFO kablam! warning: method is never used: `rec_insert` Oct 27 00:43:19.913 INFO kablam! --> src/main.rs:89:5 Oct 27 00:43:19.913 INFO kablam! | Oct 27 00:43:19.913 INFO kablam! 89 | / fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>, Oct 27 00:43:19.913 INFO kablam! 90 | | child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:19.913 INFO kablam! 91 | | Oct 27 00:43:19.913 INFO kablam! 92 | | // TODO: recursive closure via struct? Oct 27 00:43:19.913 INFO kablam! ... | Oct 27 00:43:19.913 INFO kablam! 122 | | parent Oct 27 00:43:19.913 INFO kablam! 123 | | } Oct 27 00:43:19.913 INFO kablam! | |_____^ Oct 27 00:43:19.913 INFO kablam! Oct 27 00:43:19.913 INFO kablam! warning: function is never used: `find_insert_loc` Oct 27 00:43:19.913 INFO kablam! --> src/main.rs:93:9 Oct 27 00:43:19.913 INFO kablam! | Oct 27 00:43:19.913 INFO kablam! 93 | / fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize, Oct 27 00:43:19.913 INFO kablam! 94 | | q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) { Oct 27 00:43:19.913 INFO kablam! 95 | | if idx == splits.len() { Oct 27 00:43:19.913 INFO kablam! 96 | | (splits.len(), true) Oct 27 00:43:19.913 INFO kablam! ... | Oct 27 00:43:19.913 INFO kablam! 103 | | } Oct 27 00:43:19.913 INFO kablam! 104 | | } Oct 27 00:43:19.913 INFO kablam! | |_________^ Oct 27 00:43:19.913 INFO kablam! Oct 27 00:43:19.913 INFO kablam! warning: method is never used: `split_if_necessary` Oct 27 00:43:19.913 INFO kablam! --> src/main.rs:125:5 Oct 27 00:43:19.913 INFO kablam! | Oct 27 00:43:19.913 INFO kablam! 125 | / fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Oct 27 00:43:19.913 INFO kablam! 126 | | -> (Option<&'a BPlusTreeNode<'a>>, bool) { Oct 27 00:43:19.913 INFO kablam! 127 | | let should_split = parent.splits.len() == self.branch_factor - 1; Oct 27 00:43:19.913 INFO kablam! 128 | | if !should_split { Oct 27 00:43:19.913 INFO kablam! ... | Oct 27 00:43:19.913 INFO kablam! 133 | | } Oct 27 00:43:19.913 INFO kablam! 134 | | } Oct 27 00:43:19.913 INFO kablam! | |_____^ Oct 27 00:43:19.913 INFO kablam! Oct 27 00:43:19.913 INFO kablam! warning: function is never used: `verify_edit_distance` Oct 27 00:43:19.913 INFO kablam! --> src/main.rs:137:1 Oct 27 00:43:19.913 INFO kablam! | Oct 27 00:43:19.913 INFO kablam! 137 | fn verify_edit_distance(x: &str, y: &str, distance_threshold: usize) -> Option { Oct 27 00:43:19.913 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:19.913 INFO kablam! Oct 27 00:43:19.913 INFO kablam! warning: function is never used: `create_verification_table` Oct 27 00:43:19.913 INFO kablam! --> src/main.rs:171:1 Oct 27 00:43:19.913 INFO kablam! | Oct 27 00:43:19.913 INFO kablam! 171 | / fn create_verification_table( Oct 27 00:43:19.913 INFO kablam! 172 | | nrows: usize, Oct 27 00:43:19.913 INFO kablam! 173 | | ncols: usize, Oct 27 00:43:19.913 INFO kablam! 174 | | distance_threshold: usize, Oct 27 00:43:19.913 INFO kablam! ... | Oct 27 00:43:19.913 INFO kablam! 225 | | (row0, Some(m)) Oct 27 00:43:19.913 INFO kablam! 226 | | } Oct 27 00:43:19.913 INFO kablam! | |_^ Oct 27 00:43:19.913 INFO kablam! Oct 27 00:43:19.998 INFO kablam! warning: unused variable: `node_to_insert` Oct 27 00:43:19.999 INFO kablam! --> src/main.rs:114:14 Oct 27 00:43:19.999 INFO kablam! | Oct 27 00:43:19.999 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Oct 27 00:43:19.999 INFO kablam! | ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead Oct 27 00:43:19.999 INFO kablam! | Oct 27 00:43:19.999 INFO kablam! = note: #[warn(unused_variables)] on by default Oct 27 00:43:19.999 INFO kablam! Oct 27 00:43:19.999 INFO kablam! warning: unused variable: `insert_idx` Oct 27 00:43:19.999 INFO kablam! --> src/main.rs:114:30 Oct 27 00:43:19.999 INFO kablam! | Oct 27 00:43:19.999 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Oct 27 00:43:19.999 INFO kablam! | ^^^^^^^^^^ help: consider using `_insert_idx` instead Oct 27 00:43:19.999 INFO kablam! Oct 27 00:43:19.999 INFO kablam! warning: unused variable: `q` Oct 27 00:43:19.999 INFO kablam! --> src/main.rs:125:68 Oct 27 00:43:19.999 INFO kablam! | Oct 27 00:43:19.999 INFO kablam! 125 | fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Oct 27 00:43:19.999 INFO kablam! | ^ help: consider using `_q` instead Oct 27 00:43:19.999 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: struct is never constructed: `BPlusTree` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:42:1 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 42 | struct BPlusTree<'a> { Oct 27 00:43:20.015 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! = note: #[warn(dead_code)] on by default Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: struct is never constructed: `BPlusTreeNode` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:48:1 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 48 | struct BPlusTreeNode<'a> { Oct 27 00:43:20.015 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: method is never used: `is_leaf_node` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:57:5 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 57 | fn is_leaf_node(&self) -> bool { Oct 27 00:43:20.015 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: method is never used: `insert` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:64:5 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 64 | fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:20.015 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: method is never used: `find_node` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:70:5 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 70 | fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:20.015 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: function is never used: `check_split` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:75:13 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 75 | / fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>, Oct 27 00:43:20.015 INFO kablam! 76 | | child_idx: usize) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:20.015 INFO kablam! 77 | | if child_idx == node.splits.len() { Oct 27 00:43:20.015 INFO kablam! 78 | | tree.find_node(q, &node.children[node.splits.len()]) Oct 27 00:43:20.015 INFO kablam! ... | Oct 27 00:43:20.015 INFO kablam! 83 | | } Oct 27 00:43:20.015 INFO kablam! 84 | | }; Oct 27 00:43:20.015 INFO kablam! | |_____________^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: method is never used: `rec_insert` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:89:5 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 89 | / fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>, Oct 27 00:43:20.015 INFO kablam! 90 | | child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> { Oct 27 00:43:20.015 INFO kablam! 91 | | Oct 27 00:43:20.015 INFO kablam! 92 | | // TODO: recursive closure via struct? Oct 27 00:43:20.015 INFO kablam! ... | Oct 27 00:43:20.015 INFO kablam! 122 | | parent Oct 27 00:43:20.015 INFO kablam! 123 | | } Oct 27 00:43:20.015 INFO kablam! | |_____^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: function is never used: `find_insert_loc` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:93:9 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 93 | / fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize, Oct 27 00:43:20.015 INFO kablam! 94 | | q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) { Oct 27 00:43:20.015 INFO kablam! 95 | | if idx == splits.len() { Oct 27 00:43:20.015 INFO kablam! 96 | | (splits.len(), true) Oct 27 00:43:20.015 INFO kablam! ... | Oct 27 00:43:20.015 INFO kablam! 103 | | } Oct 27 00:43:20.015 INFO kablam! 104 | | } Oct 27 00:43:20.015 INFO kablam! | |_________^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.015 INFO kablam! warning: method is never used: `split_if_necessary` Oct 27 00:43:20.015 INFO kablam! --> src/main.rs:125:5 Oct 27 00:43:20.015 INFO kablam! | Oct 27 00:43:20.015 INFO kablam! 125 | / fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Oct 27 00:43:20.015 INFO kablam! 126 | | -> (Option<&'a BPlusTreeNode<'a>>, bool) { Oct 27 00:43:20.015 INFO kablam! 127 | | let should_split = parent.splits.len() == self.branch_factor - 1; Oct 27 00:43:20.015 INFO kablam! 128 | | if !should_split { Oct 27 00:43:20.015 INFO kablam! ... | Oct 27 00:43:20.015 INFO kablam! 133 | | } Oct 27 00:43:20.015 INFO kablam! 134 | | } Oct 27 00:43:20.015 INFO kablam! | |_____^ Oct 27 00:43:20.015 INFO kablam! Oct 27 00:43:20.059 INFO kablam! Finished dev [unoptimized + debuginfo] target(s) in 0.48s Oct 27 00:43:20.059 INFO kablam! su: No module specific data is present Oct 27 00:43:20.557 INFO running `"docker" "rm" "-f" "23200f7f8b404dd7bc3ea1f5bae874036c4aa9cc87a60457b42dabf01f8a27a4"` Oct 27 00:43:20.679 INFO blam! 23200f7f8b404dd7bc3ea1f5bae874036c4aa9cc87a60457b42dabf01f8a27a4