Nov 01 01:01:48.625 INFO checking megesdal/bedtree-rs against try#d7816399d50d407bbce1efe9dbadf8faaaf568fc for pr-55538 Nov 01 01:01:48.625 INFO running `"docker" "create" "-v" "/mnt/big/crater/work/local/target-dirs/pr-55538/worker-7/try#d7816399d50d407bbce1efe9dbadf8faaaf568fc:/target:rw,Z" "-v" "/mnt/big/crater/work/local/test-source/worker-7/pr-55538/try#d7816399d50d407bbce1efe9dbadf8faaaf568fc:/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 +d7816399d50d407bbce1efe9dbadf8faaaf568fc-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 01 01:01:48.864 INFO blam! 66e03afb1407da78ae133518b2f5ddd92a31b049d0b7d09a2282709737cb97fd Nov 01 01:01:48.872 INFO running `"docker" "start" "-a" "66e03afb1407da78ae133518b2f5ddd92a31b049d0b7d09a2282709737cb97fd"` Nov 01 01:01:49.319 INFO kablam! usermod: no changes Nov 01 01:01:49.339 INFO kablam! Checking hello_world v0.0.1 (/source) Nov 01 01:01:49.573 INFO kablam! warning: unused import: `max` Nov 01 01:01:49.573 INFO kablam! --> src/main.rs:2:16 Nov 01 01:01:49.573 INFO kablam! | Nov 01 01:01:49.574 INFO kablam! 2 | use std::cmp::{max, min, Ordering}; Nov 01 01:01:49.574 INFO kablam! | ^^^ Nov 01 01:01:49.574 INFO kablam! | Nov 01 01:01:49.574 INFO kablam! = note: #[warn(unused_imports)] on by default Nov 01 01:01:49.575 INFO kablam! Nov 01 01:01:49.586 INFO kablam! warning: unused import: `max` Nov 01 01:01:49.586 INFO kablam! --> src/main.rs:2:16 Nov 01 01:01:49.586 INFO kablam! | Nov 01 01:01:49.586 INFO kablam! 2 | use std::cmp::{max, min, Ordering}; Nov 01 01:01:49.587 INFO kablam! | ^^^ Nov 01 01:01:49.587 INFO kablam! | Nov 01 01:01:49.587 INFO kablam! = note: #[warn(unused_imports)] on by default Nov 01 01:01:49.587 INFO kablam! Nov 01 01:01:49.648 INFO kablam! warning: unused variable: `node_to_insert` Nov 01 01:01:49.648 INFO kablam! --> src/main.rs:114:14 Nov 01 01:01:49.648 INFO kablam! | Nov 01 01:01:49.648 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Nov 01 01:01:49.648 INFO kablam! | ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead Nov 01 01:01:49.648 INFO kablam! | Nov 01 01:01:49.648 INFO kablam! = note: #[warn(unused_variables)] on by default Nov 01 01:01:49.648 INFO kablam! Nov 01 01:01:49.648 INFO kablam! warning: unused variable: `insert_idx` Nov 01 01:01:49.648 INFO kablam! --> src/main.rs:114:30 Nov 01 01:01:49.648 INFO kablam! | Nov 01 01:01:49.648 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Nov 01 01:01:49.648 INFO kablam! | ^^^^^^^^^^ help: consider using `_insert_idx` instead Nov 01 01:01:49.648 INFO kablam! Nov 01 01:01:49.648 INFO kablam! warning: unused variable: `q` Nov 01 01:01:49.648 INFO kablam! --> src/main.rs:125:68 Nov 01 01:01:49.648 INFO kablam! | Nov 01 01:01:49.648 INFO kablam! 125 | fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Nov 01 01:01:49.648 INFO kablam! | ^ help: consider using `_q` instead Nov 01 01:01:49.648 INFO kablam! Nov 01 01:01:49.657 INFO kablam! warning: unused variable: `node_to_insert` Nov 01 01:01:49.657 INFO kablam! --> src/main.rs:114:14 Nov 01 01:01:49.657 INFO kablam! | Nov 01 01:01:49.657 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Nov 01 01:01:49.657 INFO kablam! | ^^^^^^^^^^^^^^ help: consider using `_node_to_insert` instead Nov 01 01:01:49.657 INFO kablam! | Nov 01 01:01:49.657 INFO kablam! = note: #[warn(unused_variables)] on by default Nov 01 01:01:49.657 INFO kablam! Nov 01 01:01:49.657 INFO kablam! warning: unused variable: `insert_idx` Nov 01 01:01:49.657 INFO kablam! --> src/main.rs:114:30 Nov 01 01:01:49.657 INFO kablam! | Nov 01 01:01:49.657 INFO kablam! 114 | let (node_to_insert, insert_idx) = match split_result { Nov 01 01:01:49.657 INFO kablam! | ^^^^^^^^^^ help: consider using `_insert_idx` instead Nov 01 01:01:49.657 INFO kablam! Nov 01 01:01:49.657 INFO kablam! warning: unused variable: `q` Nov 01 01:01:49.657 INFO kablam! --> src/main.rs:125:68 Nov 01 01:01:49.657 INFO kablam! | Nov 01 01:01:49.657 INFO kablam! 125 | fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Nov 01 01:01:49.657 INFO kablam! | ^ help: consider using `_q` instead Nov 01 01:01:49.657 INFO kablam! Nov 01 01:01:49.658 INFO kablam! warning: struct is never constructed: `BPlusTree` Nov 01 01:01:49.659 INFO kablam! --> src/main.rs:42:1 Nov 01 01:01:49.659 INFO kablam! | Nov 01 01:01:49.659 INFO kablam! 42 | struct BPlusTree<'a> { Nov 01 01:01:49.659 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.659 INFO kablam! | Nov 01 01:01:49.659 INFO kablam! = note: #[warn(dead_code)] on by default Nov 01 01:01:49.659 INFO kablam! Nov 01 01:01:49.659 INFO kablam! warning: struct is never constructed: `BPlusTreeNode` Nov 01 01:01:49.659 INFO kablam! --> src/main.rs:48:1 Nov 01 01:01:49.659 INFO kablam! | Nov 01 01:01:49.659 INFO kablam! 48 | struct BPlusTreeNode<'a> { Nov 01 01:01:49.659 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.659 INFO kablam! Nov 01 01:01:49.659 INFO kablam! warning: method is never used: `is_leaf_node` Nov 01 01:01:49.660 INFO kablam! --> src/main.rs:57:5 Nov 01 01:01:49.660 INFO kablam! | Nov 01 01:01:49.660 INFO kablam! 57 | fn is_leaf_node(&self) -> bool { Nov 01 01:01:49.660 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.660 INFO kablam! Nov 01 01:01:49.660 INFO kablam! warning: method is never used: `insert` Nov 01 01:01:49.660 INFO kablam! --> src/main.rs:64:5 Nov 01 01:01:49.660 INFO kablam! | Nov 01 01:01:49.660 INFO kablam! 64 | fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.660 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.660 INFO kablam! Nov 01 01:01:49.660 INFO kablam! warning: method is never used: `find_node` Nov 01 01:01:49.660 INFO kablam! --> src/main.rs:70:5 Nov 01 01:01:49.660 INFO kablam! | Nov 01 01:01:49.660 INFO kablam! 70 | fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.660 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.660 INFO kablam! Nov 01 01:01:49.661 INFO kablam! warning: function is never used: `check_split` Nov 01 01:01:49.661 INFO kablam! --> src/main.rs:75:13 Nov 01 01:01:49.661 INFO kablam! | Nov 01 01:01:49.661 INFO kablam! 75 | / fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>, Nov 01 01:01:49.661 INFO kablam! 76 | | child_idx: usize) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.661 INFO kablam! 77 | | if child_idx == node.splits.len() { Nov 01 01:01:49.661 INFO kablam! 78 | | tree.find_node(q, &node.children[node.splits.len()]) Nov 01 01:01:49.661 INFO kablam! ... | Nov 01 01:01:49.661 INFO kablam! 83 | | } Nov 01 01:01:49.661 INFO kablam! 84 | | }; Nov 01 01:01:49.661 INFO kablam! | |_____________^ Nov 01 01:01:49.661 INFO kablam! Nov 01 01:01:49.661 INFO kablam! warning: method is never used: `rec_insert` Nov 01 01:01:49.661 INFO kablam! --> src/main.rs:89:5 Nov 01 01:01:49.661 INFO kablam! | Nov 01 01:01:49.661 INFO kablam! 89 | / fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>, Nov 01 01:01:49.661 INFO kablam! 90 | | child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.661 INFO kablam! 91 | | Nov 01 01:01:49.661 INFO kablam! 92 | | // TODO: recursive closure via struct? Nov 01 01:01:49.661 INFO kablam! ... | Nov 01 01:01:49.661 INFO kablam! 122 | | parent Nov 01 01:01:49.661 INFO kablam! 123 | | } Nov 01 01:01:49.661 INFO kablam! | |_____^ Nov 01 01:01:49.661 INFO kablam! Nov 01 01:01:49.661 INFO kablam! warning: function is never used: `find_insert_loc` Nov 01 01:01:49.661 INFO kablam! --> src/main.rs:93:9 Nov 01 01:01:49.661 INFO kablam! | Nov 01 01:01:49.662 INFO kablam! 93 | / fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize, Nov 01 01:01:49.662 INFO kablam! 94 | | q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) { Nov 01 01:01:49.662 INFO kablam! 95 | | if idx == splits.len() { Nov 01 01:01:49.662 INFO kablam! 96 | | (splits.len(), true) Nov 01 01:01:49.662 INFO kablam! ... | Nov 01 01:01:49.662 INFO kablam! 103 | | } Nov 01 01:01:49.662 INFO kablam! 104 | | } Nov 01 01:01:49.662 INFO kablam! | |_________^ Nov 01 01:01:49.662 INFO kablam! Nov 01 01:01:49.662 INFO kablam! warning: method is never used: `split_if_necessary` Nov 01 01:01:49.662 INFO kablam! --> src/main.rs:125:5 Nov 01 01:01:49.662 INFO kablam! | Nov 01 01:01:49.662 INFO kablam! 125 | / fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Nov 01 01:01:49.662 INFO kablam! 126 | | -> (Option<&'a BPlusTreeNode<'a>>, bool) { Nov 01 01:01:49.662 INFO kablam! 127 | | let should_split = parent.splits.len() == self.branch_factor - 1; Nov 01 01:01:49.662 INFO kablam! 128 | | if !should_split { Nov 01 01:01:49.662 INFO kablam! ... | Nov 01 01:01:49.662 INFO kablam! 133 | | } Nov 01 01:01:49.662 INFO kablam! 134 | | } Nov 01 01:01:49.662 INFO kablam! | |_____^ Nov 01 01:01:49.662 INFO kablam! Nov 01 01:01:49.662 INFO kablam! warning: function is never used: `verify_edit_distance` Nov 01 01:01:49.662 INFO kablam! --> src/main.rs:137:1 Nov 01 01:01:49.663 INFO kablam! | Nov 01 01:01:49.663 INFO kablam! 137 | fn verify_edit_distance(x: &str, y: &str, distance_threshold: usize) -> Option { Nov 01 01:01:49.663 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.663 INFO kablam! Nov 01 01:01:49.663 INFO kablam! warning: function is never used: `create_verification_table` Nov 01 01:01:49.663 INFO kablam! --> src/main.rs:171:1 Nov 01 01:01:49.663 INFO kablam! | Nov 01 01:01:49.663 INFO kablam! 171 | / fn create_verification_table( Nov 01 01:01:49.663 INFO kablam! 172 | | nrows: usize, Nov 01 01:01:49.663 INFO kablam! 173 | | ncols: usize, Nov 01 01:01:49.663 INFO kablam! 174 | | distance_threshold: usize, Nov 01 01:01:49.663 INFO kablam! ... | Nov 01 01:01:49.663 INFO kablam! 225 | | (row0, Some(m)) Nov 01 01:01:49.663 INFO kablam! 226 | | } Nov 01 01:01:49.663 INFO kablam! | |_^ Nov 01 01:01:49.663 INFO kablam! Nov 01 01:01:49.683 INFO kablam! warning: struct is never constructed: `BPlusTree` Nov 01 01:01:49.683 INFO kablam! --> src/main.rs:42:1 Nov 01 01:01:49.683 INFO kablam! | Nov 01 01:01:49.683 INFO kablam! 42 | struct BPlusTree<'a> { Nov 01 01:01:49.684 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! = note: #[warn(dead_code)] on by default Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: struct is never constructed: `BPlusTreeNode` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:48:1 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 48 | struct BPlusTreeNode<'a> { Nov 01 01:01:49.684 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: method is never used: `is_leaf_node` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:57:5 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 57 | fn is_leaf_node(&self) -> bool { Nov 01 01:01:49.684 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: method is never used: `insert` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:64:5 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 64 | fn insert(&'a self, q: &str) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.684 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: method is never used: `find_node` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:70:5 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 70 | fn find_node(&'a self, q: &str, node: &'a BPlusTreeNode<'a>) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.684 INFO kablam! | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: function is never used: `check_split` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:75:13 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 75 | / fn check_split<'a>(tree: &'a BPlusTree<'a>, q: &str, node: &'a BPlusTreeNode<'a>, Nov 01 01:01:49.684 INFO kablam! 76 | | child_idx: usize) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.684 INFO kablam! 77 | | if child_idx == node.splits.len() { Nov 01 01:01:49.684 INFO kablam! 78 | | tree.find_node(q, &node.children[node.splits.len()]) Nov 01 01:01:49.684 INFO kablam! ... | Nov 01 01:01:49.684 INFO kablam! 83 | | } Nov 01 01:01:49.684 INFO kablam! 84 | | }; Nov 01 01:01:49.684 INFO kablam! | |_____________^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: method is never used: `rec_insert` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:89:5 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 89 | / fn rec_insert(&'a self, q: &str, parent: &'a BPlusTreeNode<'a>, Nov 01 01:01:49.684 INFO kablam! 90 | | child: Option<&'a BPlusTreeNode>) -> &'a BPlusTreeNode<'a> { Nov 01 01:01:49.684 INFO kablam! 91 | | Nov 01 01:01:49.684 INFO kablam! 92 | | // TODO: recursive closure via struct? Nov 01 01:01:49.684 INFO kablam! ... | Nov 01 01:01:49.684 INFO kablam! 122 | | parent Nov 01 01:01:49.684 INFO kablam! 123 | | } Nov 01 01:01:49.684 INFO kablam! | |_____^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: function is never used: `find_insert_loc` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:93:9 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 93 | / fn find_insert_loc<'a>(compare: fn(&str,&str)->Ordering, splits: &Vec<&str>, idx: usize, Nov 01 01:01:49.684 INFO kablam! 94 | | q: &str, child: Option<&'a BPlusTreeNode>) -> (usize, bool) { Nov 01 01:01:49.684 INFO kablam! 95 | | if idx == splits.len() { Nov 01 01:01:49.684 INFO kablam! 96 | | (splits.len(), true) Nov 01 01:01:49.684 INFO kablam! ... | Nov 01 01:01:49.684 INFO kablam! 103 | | } Nov 01 01:01:49.684 INFO kablam! 104 | | } Nov 01 01:01:49.684 INFO kablam! | |_________^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.684 INFO kablam! warning: method is never used: `split_if_necessary` Nov 01 01:01:49.684 INFO kablam! --> src/main.rs:125:5 Nov 01 01:01:49.684 INFO kablam! | Nov 01 01:01:49.684 INFO kablam! 125 | / fn split_if_necessary(&'a self, parent: &'a BPlusTreeNode<'a>, q: &str) Nov 01 01:01:49.684 INFO kablam! 126 | | -> (Option<&'a BPlusTreeNode<'a>>, bool) { Nov 01 01:01:49.684 INFO kablam! 127 | | let should_split = parent.splits.len() == self.branch_factor - 1; Nov 01 01:01:49.684 INFO kablam! 128 | | if !should_split { Nov 01 01:01:49.684 INFO kablam! ... | Nov 01 01:01:49.684 INFO kablam! 133 | | } Nov 01 01:01:49.684 INFO kablam! 134 | | } Nov 01 01:01:49.684 INFO kablam! | |_____^ Nov 01 01:01:49.684 INFO kablam! Nov 01 01:01:49.695 INFO kablam! Finished dev [unoptimized + debuginfo] target(s) in 0.36s Nov 01 01:01:49.698 INFO kablam! su: No module specific data is present Nov 01 01:01:50.044 INFO running `"docker" "rm" "-f" "66e03afb1407da78ae133518b2f5ddd92a31b049d0b7d09a2282709737cb97fd"` Nov 01 01:01:50.105 INFO blam! 66e03afb1407da78ae133518b2f5ddd92a31b049d0b7d09a2282709737cb97fd