[INFO] cloning repository https://github.com/SamLejeune/PocketDB [INFO] running `Command { std: "git" "-c" "credential.helper=" "-c" "credential.helper=/workspace/cargo-home/bin/git-credential-null" "clone" "--bare" "https://github.com/SamLejeune/PocketDB" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSamLejeune%2FPocketDB", kill_on_drop: false }` [INFO] [stderr] Cloning into bare repository '/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSamLejeune%2FPocketDB'... [INFO] running `Command { std: "git" "rev-parse" "HEAD", kill_on_drop: false }` [INFO] [stdout] 1830799f42c29e61754b855832562b3dc645ee35 [INFO] building SamLejeune/PocketDB against master#11663cd3bfefef7d34e8f0892c250bf698049392+rustflags=-Dtail-expr-drop-order for pr-134523 [INFO] running `Command { std: "git" "clone" "/workspace/cache/git-repos/https%3A%2F%2Fgithub.com%2FSamLejeune%2FPocketDB" "/workspace/builds/worker-0-tc1/source", kill_on_drop: false }` [INFO] [stderr] Cloning into '/workspace/builds/worker-0-tc1/source'... [INFO] [stderr] done. [INFO] validating manifest of git repo https://github.com/SamLejeune/PocketDB on toolchain 11663cd3bfefef7d34e8f0892c250bf698049392 [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--manifest-path" "Cargo.toml" "--no-deps", kill_on_drop: false }` [INFO] started tweaking git repo https://github.com/SamLejeune/PocketDB [INFO] finished tweaking git repo https://github.com/SamLejeune/PocketDB [INFO] tweaked toml for git repo https://github.com/SamLejeune/PocketDB written to /workspace/builds/worker-0-tc1/source/Cargo.toml [INFO] crate git repo https://github.com/SamLejeune/PocketDB already has a lockfile, it will not be regenerated [INFO] running `Command { std: CARGO_HOME="/workspace/cargo-home" RUSTUP_HOME="/workspace/rustup-home" "/workspace/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "fetch" "--manifest-path" "Cargo.toml", kill_on_drop: false }` [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "metadata" "--no-deps" "--format-version=1", kill_on_drop: false }` [INFO] [stdout] 736a91b45c04c163bf7e9d1b04475fbe1314cb4756f4fa72a31c07b9975d1a3d [INFO] running `Command { std: "docker" "start" "-a" "736a91b45c04c163bf7e9d1b04475fbe1314cb4756f4fa72a31c07b9975d1a3d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "inspect" "736a91b45c04c163bf7e9d1b04475fbe1314cb4756f4fa72a31c07b9975d1a3d", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "736a91b45c04c163bf7e9d1b04475fbe1314cb4756f4fa72a31c07b9975d1a3d", kill_on_drop: false }` [INFO] [stdout] 736a91b45c04c163bf7e9d1b04475fbe1314cb4756f4fa72a31c07b9975d1a3d [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail-expr-drop-order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "build" "--frozen" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 7f5f26d88351c7dfee9ac557b081e018d2ef26c143939dc1633ce55f3dd62f20 [INFO] running `Command { std: "docker" "start" "-a" "7f5f26d88351c7dfee9ac557b081e018d2ef26c143939dc1633ce55f3dd62f20", kill_on_drop: false }` [INFO] [stderr] Compiling rand_chacha v0.3.1 [INFO] [stderr] Compiling rand v0.8.5 [INFO] [stderr] Compiling pocket-db v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/db/b_tree/btree.rs:1:16 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::{max, min}; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `NODE_MAX_CHILDREN`, `disk_storage`, and `enums::DataType` [INFO] [stdout] --> src/db/b_tree/btree.rs:3:125 [INFO] [stdout] | [INFO] [stdout] 3 | ...::{NODE_MAX_CHILDREN, NODE_MIN_CHILDREN}, node_key::{NODE_MAX_KEYS, NODE_MIN_KEYS}}, enums::DataType}, table::{disk_storage::row::Row, table::Table, disk_storage... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> src/db/b_tree/btree.rs:5:34 [INFO] [stdout] | [INFO] [stdout] 5 | use super::disk_storage::{node::{Node, NodeIndexType, NodeType}, node_overflow::NodeOverflow}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/db/b_tree/btree.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | (left_child.take_key(left_child.keys_len() - 1)) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - (left_child.take_key(left_child.keys_len() - 1)) [INFO] [stdout] 73 + left_child.take_key(left_child.keys_len() - 1) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/db/b_tree/btree.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | (right_child.take_key(0)) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 75 - (right_child.take_key(0)) [INFO] [stdout] 75 + right_child.take_key(0) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> src/db/b_tree/tree_node.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/db/b_tree/disk_storage/node.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::{max, min}, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `NODE_MIN_CHILDREN`, `NODE_MIN_KEYS`, and `self` [INFO] [stdout] --> src/db/b_tree/disk_storage/node.rs:3:44 [INFO] [stdout] | [INFO] [stdout] 3 | ...::{self, NODE_CHILDREN_OFFSET, NODE_CHILDREN_SIZE, NODE_INDEXED_COLUMN_OFFSET, NODE_INDEXED_COLUMN_SIZE, NODE_INDEX_TYPE_OFFSET, NODE_INDEX_TYPE_SIZE, NODE_IS_ROOT_OFFSET, NODE_IS_ROOT_SIZE, NODE_KEYS_OFFSET, NODE_KEYS_SIZE, NODE_NUMBER_CHILDREN_OFFSET, NODE_NUMBER_CHILDREN_SIZE, NODE_NUMBER_KEYS_OFFSET, NODE_NUMBER_KEYS_SIZE, NODE_SIZE, NODE_TYPE_OFFSET, NODE_TYPE_SIZE}, node_child::{NODE_CHILD_CHILD_SIZE, NODE_CHILD_OFFSET_SIZE, NODE_CHILD_OVERFLOWING_SIZE, NODE_CHILD_SIZE, NODE_MAX_CHILDREN, NODE_MIN_CHILDREN}, node_key::{NODE_KEY_REMOTE_ITEM_SIZE, NODE_KEY_SIZE, NODE_KEY_VALUE_SIZE, NODE_MAX_KEYS, NODE_MIN_KEYS}},... [INFO] [stdout] | ^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ops::Deref` [INFO] [stdout] --> src/db/table/table.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, ops::Deref}; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::num` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::num; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `str` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:2:45 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bytes_to_u32` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:3:219 [INFO] [stdout] | [INFO] [stdout] 3 | ...D_SIZE, CELL_META_DATA_SIZE}, enums::DataType, utils::{self, bytes_to_u32}}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:4:166 [INFO] [stdout] | [INFO] [stdout] 4 | ...NAME_SIZE_SIZE, COLUMN_TYPE_OFFSET, COLUMN_TYPE_SIZE}, columns::{self, COLUMNS_META_DATA_SIZE, COLUMNS_NUMBER_COLUMNS_OFFSET, COLUMNS_... [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/db/meta/disk_storage/master.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `f32::consts::E` [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{f32::consts::E, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `shared::enums::ColumnType` [INFO] [stdout] --> src/main.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use db::{db::PocketDB, shared::enums::ColumnType}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/db/table/disk_storage/row.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/db/file_stystem/pager.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/db/db.rs:39:37 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn insert(&mut self, key: u32, mut row: Row) -> Result<(), String> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num_keys_pre_split` [INFO] [stdout] --> src/db/b_tree/btree.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let num_keys_pre_split = node.keys_len(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_num_keys_pre_split` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:185:29 [INFO] [stdout] | [INFO] [stdout] 185 | let (splice_at, dup_key) = BTree::key_index_from_node(&right_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:188:29 [INFO] [stdout] | [INFO] [stdout] 188 | let (splice_at, dup_key) = BTree::key_index_from_node(&left_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `duplicate_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:173:58 [INFO] [stdout] | [INFO] [stdout] 173 | ...: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_duplicate_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:235:33 [INFO] [stdout] | [INFO] [stdout] 235 | let (splice_at, dup_key) = BTree::key_index_from_node(&left_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:238:33 [INFO] [stdout] | [INFO] [stdout] 238 | let (splice_at, dup_key) = BTree::key_index_from_node(&right_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `duplicate_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:219:78 [INFO] [stdout] | [INFO] [stdout] 219 | ..., i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_duplicate_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `table` [INFO] [stdout] --> src/db/b_tree/btree.rs:285:137 [INFO] [stdout] | [INFO] [stdout] 285 | ...2, usize), pager: &mut Pager, table: &mut Table) { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_table` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/db/b_tree/btree.rs:417:20 [INFO] [stdout] | [INFO] [stdout] 417 | fn delete_node(mut node: TreeNode, key: Vec, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/db.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl PocketDB { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn add_column(&mut self, column_name: &str, column_type: ColumnType) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_indexed_column(&mut self, column_name: &str, column_type: ColumnType) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn insert(&mut self, key: u32, mut row: Row) -> Result<(), String> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | pub fn delete_by_primary_index(&mut self, key: DataType) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 135 | pub fn delete_by_secondary_index(&mut self, key: DataType, column_name: &str) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 184 | fn flush_table(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn flush_trees(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 270 | pub fn row(key: u32, cells: Vec) -> Row { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 274 | pub fn cell(data: DataType) -> Cell { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `index_type` is never read [INFO] [stdout] --> src/db/b_tree/btree.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct BTree { [INFO] [stdout] | ----- field in this struct [INFO] [stdout] 9 | root: Option, [INFO] [stdout] 10 | index_type: NodeIndexType, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/btree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl BTree { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn insert(&mut self, key: u32, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn insert_node(node: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (... [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_internal(mut node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table... [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn insert_leaf(mut node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &m... [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn insert_balance_internal(node: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 195 | fn insert_balance_leaf(node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 219 | fn insert_balance_root_internal(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mu... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 246 | fn insert_balance_root_leaf(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pa... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 285 | fn insert_row_to_leaf(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, t... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 406 | pub fn delete(&mut self, key: Vec, pager: &mut Pager, table: &mut Table) -> Option> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 417 | fn delete_node(mut node: TreeNode, key: Vec, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 427 | fn delete_internal(mut node: TreeNode, key: Vec, i: usize, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 487 | fn delete_leaf(mut node: TreeNode, key: Vec, i: usize, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 547 | fn delete_balance(parent_node: &mut TreeNode, i: usize, pager: &mut Pager, table: &mut Table) -> Option<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 607 | fn merge_left_right_child_to_parent(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut Page... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 628 | fn demote_key_move_left_child_to_right(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut P... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 674 | fn demote_key_move_right_child_to_left(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut P... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 726 | fn demote_key_merge_left_to_right(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut Pager,... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 788 | fn node_take_child(parent_node: &mut TreeNode, i: usize, pager: &mut Pager) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 801 | fn node_take_left_right_children(parent_node: &mut TreeNode, i: usize, pager: &mut Pager) -> Option<(TreeNode, TreeNode)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 837 | pub fn root(&self) -> Option<&TreeNode> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/tree_node.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl TreeNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 15 | pub fn new(is_root: bool, node_type: NodeType, node_index_type: NodeIndexType, node_indexed_column: Option, key: u32, remote_k... [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn take_cached_tree_node_child(&mut self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | pub fn take_cached_left_right_tree_node_child(&mut self, i: usize) -> Option<(Option, Option)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | pub fn add_tree_node_child(&mut self, tree_child: TreeNode, offset: u32, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn splice_tree_node_child(&mut self, tree_child: TreeNode, offset: u32, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | pub fn remove_tree_node_child(&mut self, remove_at: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | pub fn take_cached_node_overflow_child(&mut self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | pub fn remove_node_overflow_child(&mut self, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 182 | pub fn prepend_merge(&mut self, merge_with_node: &mut TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 202 | pub fn append_merge(&mut self, merge_with_node: &mut TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 232 | pub fn take_node_and_split(mut self, split_keys_at: usize, split_children_at: usize) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 255 | pub fn split_off_left_node_right_node(&mut self) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 291 | pub fn split_node_at_midpoint(&mut self) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 370 | pub fn append_key(&mut self, key: u32, remote_key_size: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 374 | pub fn prepend_key(&mut self, key: u32, remote_key_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 378 | pub fn splice_key(&mut self, key: u32, remote_key_size: usize, i: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 382 | pub fn remove_key(&mut self, remove_at: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 386 | pub fn take_key(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 405 | pub fn add_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 409 | pub fn splice_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 413 | pub fn replace_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 417 | pub fn remove_node_child(&mut self, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 421 | pub fn take_node_child(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 425 | pub fn clear_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 441 | pub fn child_offset_child_size(&self, i: usize) -> Option<(u32, usize)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 452 | pub fn child_offset(&self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 462 | pub fn child_size(&self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 476 | pub fn child_is_overflowing(&self, i: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 489 | pub fn children_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 493 | pub fn add_node_overflow_child(&mut self, child_offset: u32, size: usize, i: usize ) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 519 | pub fn overflow_child(&self, i: usize) -> Option<&NodeOverflow> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 539 | pub fn overflow_child_len(&self, i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 548 | pub fn overflow_children_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 557 | pub fn left_right_children_of_index(&self, i: usize) -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 565 | pub fn set_node_type(&mut self, node_type: NodeType) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 569 | pub fn has_children(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 573 | pub fn is_root(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 592 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 596 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 600 | pub fn overflow_data(&self, i: usize) -> Option<&[u8]> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 609 | fn split_overflow_children_at(mut overflow_children: Vec>, split_at: usize) -> (Vec>, Vec src/db/b_tree/disk_storage/node.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 20 | impl Node { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | pub fn new(is_root: bool, node_type: NodeType, node_index_type: NodeIndexType, node_indexed_column: Option, key: u32, remote_k... [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn from_split_new(mut node: Node, split_keys_at: usize, split_children_at: usize) -> (Node, Node) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | pub fn from_split_range(&mut self, i: usize, len: usize) -> Node { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | pub fn from_cleave(&mut self) -> (Node, Node) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn append_merge(merge_to: &mut Node, merge_from: &mut Node) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 160 | pub fn prepend_merge(merge_to: &mut Node, merge_from: &mut Node) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | pub fn append_key(&mut self, key: u32, remote_key_item_size: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 210 | fn append_key_bytes(&mut self, key: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 221 | pub fn prepend_key(&mut self, key: u32, remote_key_item_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 236 | fn prepend_key_bytes(&mut self, mut key: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 248 | pub fn splice_key(&mut self, key: u32, remote_key_item_size: usize, i: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 265 | pub fn append_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 283 | fn append_child_bytes(&mut self, child: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 294 | pub fn prepend_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | pub fn replace_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 327 | pub fn splice_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 347 | fn prepend_child_bytes(&mut self, mut child: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 359 | pub fn clear_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 367 | pub fn shift_keys(&mut self, i: usize, num_keys: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 396 | pub fn shift_children(&mut self, i: usize, num_children: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 424 | pub fn take_key(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 432 | pub fn take_child(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 440 | pub fn increment_key(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 447 | pub fn decrement_key(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 454 | pub fn increment_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 461 | pub fn decrement_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 468 | pub fn is_root(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 505 | pub fn num_children(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 511 | pub fn keys(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 536 | pub fn children(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 569 | pub fn children_as_u32(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 594 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 598 | fn set_num_keys(&mut self, num_keys: u32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 604 | fn set_num_children(&mut self, num_children: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 610 | pub fn set_node_type(&mut self, node_type: NodeType) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 616 | pub fn set_is_overflowing(&mut self, i: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 638 | fn is_root_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 658 | fn number_children_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl NodeOverflow { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new(offset: u32, size: usize) -> NodeOverflow { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn add_item(&mut self, offset: u32, size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn num_items(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn item(&self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn increment_num_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn num_items_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `add_column`, `delete_row`, `row_mut`, `columns_len`, and `columns_data` are never used [INFO] [stdout] --> src/db/table/table.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Table { [INFO] [stdout] | ---------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn add_column(&mut self, column_name: &str, column_type: ColumnType) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn delete_row(&mut self, row_offset: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn row_mut(&mut self, row_offset: u32) -> Option<&mut Row> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | pub fn columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn columns_data(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `CellType` is never used [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:6:10 [INFO] [stdout] | [INFO] [stdout] 6 | pub enum CellType { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `CellType` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Cell { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 47 | pub fn new_head(size: usize) -> Cell { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn new_body(data: DataType) -> Cell { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn new_padding(size: usize) -> Cell { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | pub fn is_head(&self) -> CellType { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | pub fn set_size(&mut self, data_size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn is_head_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/table/disk_storage/row.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Row { [INFO] [stdout] | -------- associated items in this implementation [INFO] [stdout] 13 | pub fn from_cells(mut cells: Vec, primary_key: u32) -> Row { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | pub fn append_cell(&mut self, cell: Cell) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 128 | pub fn cell_mut(&mut self, at: usize) -> Option<&mut Cell> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn num_cells(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn data(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | pub fn set_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 153 | pub fn increment_size(&mut self, add_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | fn head_mut(&mut self) -> Option<&mut Cell> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 174 | fn calc_size(cells: &Vec) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `columns_len` and `data` are never used [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Columns { [INFO] [stdout] | ------------ methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `free_list`, `write_buffers`, and `eof_buffer` are never read [INFO] [stdout] --> src/db/file_stystem/pager.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Pager { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 9 | free_list: FreeList, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] 10 | write_buffers: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] 11 | eof_buffer: Option, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Pager` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/file_stystem/pager.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Pager { [INFO] [stdout] | ---------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn add_to_write_buffer(&mut self, bytes: &[u8], prev_offset_prev_size: Option<(u32, usize)>) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | pub fn flush_write_buffer_trees(&mut self, primary_root: (u32, usize), secondary_index_list: (u32, usize)) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | pub fn flush_table_columns(&mut self, table_columns: (u32, usize)) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn mark_free(&mut self, size: usize, offset: u32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn free_list_buffer(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | fn reclaim_list_buffer(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 216 | fn free_list_offset(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 226 | fn reclaim_list_offset(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 246 | fn free_list_to_file(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `seek_write` and `seek_end` are never used [INFO] [stdout] --> src/db/file_stystem/file_handler.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl FileHandler { [INFO] [stdout] | ---------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn seek_write(&mut self) -> Result { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn seek_end(&mut self) -> Result<(), io::Error> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `bytes`, `size`, and `offset` are never read [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct WriteBufferItem { [INFO] [stdout] | --------------- fields in this struct [INFO] [stdout] 3 | bytes: Vec, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 4 | size: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] 5 | offset: usize, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `WriteBufferItem` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_bytes`, `bytes`, `size`, and `offset` are never used [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl WriteBufferItem { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 9 | pub fn new(bytes: &[u8], size: usize, offset: usize) -> WriteBufferItem { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn add_bytes(&mut self, bytes: &[u8]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn bytes(&self) -> &[u8] { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WriteBuffer` is never constructed [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct WriteBuffer { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `WriteBuffer` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl WriteBuffer { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 40 | pub fn new() -> WriteBuffer { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn from_write_buffer_item(item: WriteBufferItem, offset: usize) -> WriteBuffer { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn add_item(&mut self, item: WriteBufferItem) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn remove_item(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn clear_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn items(&self) -> &Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn items_mut(&mut self) -> &mut Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn root_offset(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn data(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/meta/disk_storage/master.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Master { [INFO] [stdout] | ----------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn set_primary_root_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn set_primary_root_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn set_secondary_index_list_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn set_secondary_index_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn set_table_columns_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn set_table_columns_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn set_free_list_number_items(&mut self, count: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn set_free_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn set_reclaim_list_number_items(&mut self, count: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn set_reclaim_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 139 | pub fn secondary_index_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | pub fn table_columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | pub fn free_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | pub fn reclaim_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl FreeListItem { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new(offset: usize, size: usize) -> FreeListItem { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn move_offset(&mut self, move_by: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn increase_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn decrease_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn offset_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn size_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `free_list` and `reclaim_list` are never read [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 83 | pub struct FreeList { [INFO] [stdout] | -------- fields in this struct [INFO] [stdout] 84 | free_list: Vec, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] 85 | reclaim_list: Vec, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `FreeList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:107:12 [INFO] [stdout] | [INFO] [stdout] 88 | impl FreeList { [INFO] [stdout] | ------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 107 | pub fn add_to_free_list(&mut self, item: FreeListItem) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | pub fn reclaim_from_free_list(&mut self, size: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | pub fn condense_free_list(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | pub fn free_list_data(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 176 | pub fn recliam_list_data(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 184 | pub fn free_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 188 | pub fn reclaim_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `add_item`, `set_item_offset`, `size`, `data`, `increment_size`, and `increment_num_items` are never used [INFO] [stdout] --> src/db/secondary_index/disk_storage/secondary_index_list.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl SecondaryIndexList { [INFO] [stdout] | ----------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_item(&mut self, offset: u32, column_index: u32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn set_item_offset(&mut self, offset: u32, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn increment_size(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn increment_num_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `secondary_index_list` is never read [INFO] [stdout] --> src/db/secondary_index/secondary_index.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct SecondaryIndex { [INFO] [stdout] | -------------- field in this struct [INFO] [stdout] 7 | secondary_index_trees: Vec, [INFO] [stdout] 8 | secondary_index_list: SecondaryIndexList, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `SecondaryIndex` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/secondary_index/secondary_index.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl SecondaryIndex { [INFO] [stdout] | ------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_secondary_index(&mut self, indexed_column: usize, pager: &mut Pager) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn set_secondary_index_item_offset(&mut self, offset: u32, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn secondary_index_tree(&mut self, i: usize) -> Option<&BTree> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn secondary_index_tree_mut(&mut self, i: usize) -> Option<&mut BTree> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn secondary_index_trees(&self) -> &Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn secondary_index_item(&self, i: usize) -> Option<(u32, usize)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn num_secondary_index_items(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn secondary_index_data(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ELEMENT_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:3:15 [INFO] [stdout] | [INFO] [stdout] 3 | pub const ELEMENT_SIZE: usize = 92; // 92 1112 [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_MIN_KEYS` is never used [INFO] [stdout] --> src/db/shared/constants.rs:54:15 [INFO] [stdout] | [INFO] [stdout] 54 | pub const NODE_MIN_KEYS: usize = NODE_MAX_DEGREE / 2; // 2 [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_MIN_CHILDREN` is never used [INFO] [stdout] --> src/db/shared/constants.rs:65:15 [INFO] [stdout] | [INFO] [stdout] 65 | pub const NODE_MIN_CHILDREN: usize = (NODE_MAX_DEGREE / 2) + 1; // 3 [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_OVERFLOW_NUMBER_ITEMS_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:98:15 [INFO] [stdout] | [INFO] [stdout] 98 | pub const NODE_OVERFLOW_NUMBER_ITEMS_OFFSET: usize = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `CELL_META_DATA_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:109:15 [INFO] [stdout] | [INFO] [stdout] 109 | pub const CELL_META_DATA_SIZE: usize = CELL_DATA_SIZE + CELL_IS_HEAD_SIZE + CELL_DATA_TYPE_SIZE; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ROW_HEAD_CELL_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:116:15 [INFO] [stdout] | [INFO] [stdout] 116 | pub const ROW_HEAD_CELL_SIZE: usize = CELL_DATA_SIZE + CELL_IS_HEAD_SIZE + CELL_DATA_TYPE_SIZE + ROW_DATA_SIZE; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `FREE_ITEM_DATA_OFFSET_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:137:15 [INFO] [stdout] | [INFO] [stdout] 137 | pub const FREE_ITEM_DATA_OFFSET_OFFSET: usize = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `FREE_ITEM_DATA_SIZE_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:139:15 [INFO] [stdout] | [INFO] [stdout] 139 | pub const FREE_ITEM_DATA_SIZE_OFFSET: usize = FREE_ITEM_DATA_OFFSET_OFFSET + FREE_ITEM_DATA_OFFSET; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `matches` is never used [INFO] [stdout] --> src/db/shared/enums.rs:13:11 [INFO] [stdout] | [INFO] [stdout] 12 | impl ColumnType { [INFO] [stdout] | --------------- method in this implementation [INFO] [stdout] 13 | pub fn matches(&self, data_type: &DataType) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `pad_bytes` is never used [INFO] [stdout] --> src/db/shared/utils.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn pad_bytes(bytes: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.72s [INFO] running `Command { std: "docker" "inspect" "7f5f26d88351c7dfee9ac557b081e018d2ef26c143939dc1633ce55f3dd62f20", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "7f5f26d88351c7dfee9ac557b081e018d2ef26c143939dc1633ce55f3dd62f20", kill_on_drop: false }` [INFO] [stdout] 7f5f26d88351c7dfee9ac557b081e018d2ef26c143939dc1633ce55f3dd62f20 [INFO] running `Command { std: "docker" "create" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/target:/opt/rustwide/target:rw,Z" "-v" "/var/lib/crater-agent-workspace/builds/worker-0-tc1/source:/opt/rustwide/workdir:ro,Z" "-v" "/var/lib/crater-agent-workspace/cargo-home:/opt/rustwide/cargo-home:ro,Z" "-v" "/var/lib/crater-agent-workspace/rustup-home:/opt/rustwide/rustup-home:ro,Z" "-e" "SOURCE_DIR=/opt/rustwide/workdir" "-e" "CARGO_TARGET_DIR=/opt/rustwide/target" "-e" "CARGO_INCREMENTAL=0" "-e" "RUST_BACKTRACE=full" "-e" "RUSTFLAGS=--cap-lints=forbid -Dtail-expr-drop-order" "-e" "RUSTDOCFLAGS=--cap-lints=forbid" "-e" "CARGO_HOME=/opt/rustwide/cargo-home" "-e" "RUSTUP_HOME=/opt/rustwide/rustup-home" "-w" "/opt/rustwide/workdir" "-m" "1610612736" "--user" "0:0" "--network" "none" "ghcr.io/rust-lang/crates-build-env/linux@sha256:f3a9d4ad9d972b27faf3965f35b62e55ba32bbce8f20bc8fe909558a86702fde" "/opt/rustwide/cargo-home/bin/cargo" "+11663cd3bfefef7d34e8f0892c250bf698049392" "test" "--frozen" "--no-run" "--message-format=json", kill_on_drop: false }` [INFO] [stdout] 2a5ffedd5f661329a8fdfe251167b34b076fdd82fc121a37378176630e486d69 [INFO] running `Command { std: "docker" "start" "-a" "2a5ffedd5f661329a8fdfe251167b34b076fdd82fc121a37378176630e486d69", kill_on_drop: false }` [INFO] [stderr] Compiling pocket-db v0.1.0 (/opt/rustwide/workdir) [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/db/b_tree/btree.rs:1:16 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp::{max, min}; [INFO] [stdout] | ^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_imports)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `NODE_MAX_CHILDREN`, `disk_storage`, and `enums::DataType` [INFO] [stdout] --> src/db/b_tree/btree.rs:3:125 [INFO] [stdout] | [INFO] [stdout] 3 | ...::{NODE_MAX_CHILDREN, NODE_MIN_CHILDREN}, node_key::{NODE_MAX_KEYS, NODE_MIN_KEYS}}, enums::DataType}, table::{disk_storage::row::Row, table::Table, disk_storage... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^ ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `Node` [INFO] [stdout] --> src/db/b_tree/btree.rs:5:34 [INFO] [stdout] | [INFO] [stdout] 5 | use super::disk_storage::{node::{Node, NodeIndexType, NodeType}, node_overflow::NodeOverflow}; [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/db/b_tree/btree.rs:73:17 [INFO] [stdout] | [INFO] [stdout] 73 | (left_child.take_key(left_child.keys_len() - 1)) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_parens)]` on by default [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 73 - (left_child.take_key(left_child.keys_len() - 1)) [INFO] [stdout] 73 + left_child.take_key(left_child.keys_len() - 1) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unnecessary parentheses around block return value [INFO] [stdout] --> src/db/b_tree/btree.rs:75:17 [INFO] [stdout] | [INFO] [stdout] 75 | (right_child.take_key(0)) [INFO] [stdout] | ^ ^ [INFO] [stdout] | [INFO] [stdout] help: remove these parentheses [INFO] [stdout] | [INFO] [stdout] 75 - (right_child.take_key(0)) [INFO] [stdout] 75 + right_child.take_key(0) [INFO] [stdout] | [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::cmp` [INFO] [stdout] --> src/db/b_tree/tree_node.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::cmp; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `max` [INFO] [stdout] --> src/db/b_tree/disk_storage/node.rs:1:17 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{cmp::{max, min}, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused imports: `NODE_MIN_CHILDREN`, `NODE_MIN_KEYS`, and `self` [INFO] [stdout] --> src/db/b_tree/disk_storage/node.rs:3:44 [INFO] [stdout] | [INFO] [stdout] 3 | ...::{self, NODE_CHILDREN_OFFSET, NODE_CHILDREN_SIZE, NODE_INDEXED_COLUMN_OFFSET, NODE_INDEXED_COLUMN_SIZE, NODE_INDEX_TYPE_OFFSET, NODE_INDEX_TYPE_SIZE, NODE_IS_ROOT_OFFSET, NODE_IS_ROOT_SIZE, NODE_KEYS_OFFSET, NODE_KEYS_SIZE, NODE_NUMBER_CHILDREN_OFFSET, NODE_NUMBER_CHILDREN_SIZE, NODE_NUMBER_KEYS_OFFSET, NODE_NUMBER_KEYS_SIZE, NODE_SIZE, NODE_TYPE_OFFSET, NODE_TYPE_SIZE}, node_child::{NODE_CHILD_CHILD_SIZE, NODE_CHILD_OFFSET_SIZE, NODE_CHILD_OVERFLOWING_SIZE, NODE_CHILD_SIZE, NODE_MAX_CHILDREN, NODE_MIN_CHILDREN}, node_key::{NODE_KEY_REMOTE_ITEM_SIZE, NODE_KEY_SIZE, NODE_KEY_VALUE_SIZE, NODE_MAX_KEYS, NODE_MIN_KEYS}},... [INFO] [stdout] | ^^^^ ^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `ops::Deref` [INFO] [stdout] --> src/db/table/table.rs:1:33 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{collections::HashMap, ops::Deref}; [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::num` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::num; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `str` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:2:45 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `bytes_to_u32` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:3:219 [INFO] [stdout] | [INFO] [stdout] 3 | ...D_SIZE, CELL_META_DATA_SIZE}, enums::DataType, utils::{self, bytes_to_u32}}; [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `self` [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:4:166 [INFO] [stdout] | [INFO] [stdout] 4 | ...NAME_SIZE_SIZE, COLUMN_TYPE_OFFSET, COLUMN_TYPE_SIZE}, columns::{self, COLUMNS_META_DATA_SIZE, COLUMNS_NUMBER_COLUMNS_OFFSET, COLUMNS_... [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `core::num` [INFO] [stdout] --> src/db/meta/disk_storage/master.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use core::num; [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `f32::consts::E` [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:1:11 [INFO] [stdout] | [INFO] [stdout] 1 | use std::{f32::consts::E, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `shared::enums::ColumnType` [INFO] [stdout] --> src/main.rs:2:24 [INFO] [stdout] | [INFO] [stdout] 2 | use db::{db::PocketDB, shared::enums::ColumnType}; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/db/table/disk_storage/row.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `io::Read` [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:2:11 [INFO] [stdout] | [INFO] [stdout] 2 | use std::{io::Read, ops::{Deref, DerefMut}, str}; [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused import: `std::io::Read` [INFO] [stdout] --> src/db/file_stystem/pager.rs:1:5 [INFO] [stdout] | [INFO] [stdout] 1 | use std::io::Read; [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/db/db.rs:39:37 [INFO] [stdout] | [INFO] [stdout] 39 | pub fn insert(&mut self, key: u32, mut row: Row) -> Result<(), String> { [INFO] [stdout] | ----^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_mut)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `num_keys_pre_split` [INFO] [stdout] --> src/db/b_tree/btree.rs:56:13 [INFO] [stdout] | [INFO] [stdout] 56 | let num_keys_pre_split = node.keys_len(); [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_num_keys_pre_split` [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(unused_variables)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:185:29 [INFO] [stdout] | [INFO] [stdout] 185 | let (splice_at, dup_key) = BTree::key_index_from_node(&right_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:188:29 [INFO] [stdout] | [INFO] [stdout] 188 | let (splice_at, dup_key) = BTree::key_index_from_node(&left_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `duplicate_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:173:58 [INFO] [stdout] | [INFO] [stdout] 173 | ...: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_duplicate_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:235:33 [INFO] [stdout] | [INFO] [stdout] 235 | let (splice_at, dup_key) = BTree::key_index_from_node(&left_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `dup_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:238:33 [INFO] [stdout] | [INFO] [stdout] 238 | let (splice_at, dup_key) = BTree::key_index_from_node(&right_node, &key_value, pager, table); [INFO] [stdout] | ^^^^^^^ help: if this is intentional, prefix it with an underscore: `_dup_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `duplicate_key` [INFO] [stdout] --> src/db/b_tree/btree.rs:219:78 [INFO] [stdout] | [INFO] [stdout] 219 | ..., i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ help: if this is intentional, prefix it with an underscore: `_duplicate_key` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: unused variable: `table` [INFO] [stdout] --> src/db/b_tree/btree.rs:285:137 [INFO] [stdout] | [INFO] [stdout] 285 | ...2, usize), pager: &mut Pager, table: &mut Table) { [INFO] [stdout] | ^^^^^ help: if this is intentional, prefix it with an underscore: `_table` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: variable does not need to be mutable [INFO] [stdout] --> src/db/b_tree/btree.rs:417:20 [INFO] [stdout] | [INFO] [stdout] 417 | fn delete_node(mut node: TreeNode, key: Vec, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ----^^^^ [INFO] [stdout] | | [INFO] [stdout] | help: remove this `mut` [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/db.rs:23:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl PocketDB { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 23 | pub fn add_column(&mut self, column_name: &str, column_type: ColumnType) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_indexed_column(&mut self, column_name: &str, column_type: ColumnType) -> &mut Self { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 39 | pub fn insert(&mut self, key: u32, mut row: Row) -> Result<(), String> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 120 | pub fn delete_by_primary_index(&mut self, key: DataType) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 135 | pub fn delete_by_secondary_index(&mut self, key: DataType, column_name: &str) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 184 | fn flush_table(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | fn flush_trees(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 270 | pub fn row(key: u32, cells: Vec) -> Row { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 274 | pub fn cell(data: DataType) -> Cell { [INFO] [stdout] | ^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `#[warn(dead_code)]` on by default [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `index_type` is never read [INFO] [stdout] --> src/db/b_tree/btree.rs:10:5 [INFO] [stdout] | [INFO] [stdout] 8 | pub struct BTree { [INFO] [stdout] | ----- field in this struct [INFO] [stdout] 9 | root: Option, [INFO] [stdout] 10 | index_type: NodeIndexType, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `BTree` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/btree.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl BTree { [INFO] [stdout] | ---------- associated items in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn insert(&mut self, key: u32, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | fn insert_node(node: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut Table) -> (... [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | fn insert_internal(mut node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table... [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 147 | fn insert_leaf(mut node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &m... [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn insert_balance_internal(node: TreeNode, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table: &mut... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 195 | fn insert_balance_leaf(node: TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, table... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 219 | fn insert_balance_root_internal(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mu... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 246 | fn insert_balance_root_leaf(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pa... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 285 | fn insert_row_to_leaf(node: &mut TreeNode, i: usize, key: u32, duplicate_key: bool, row_meta_data: (u32, usize), pager: &mut Pager, t... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 406 | pub fn delete(&mut self, key: Vec, pager: &mut Pager, table: &mut Table) -> Option> { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 417 | fn delete_node(mut node: TreeNode, key: Vec, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 427 | fn delete_internal(mut node: TreeNode, key: Vec, i: usize, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 487 | fn delete_leaf(mut node: TreeNode, key: Vec, i: usize, pager: &mut Pager, table: &mut Table) -> (TreeNode, Option>) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 547 | fn delete_balance(parent_node: &mut TreeNode, i: usize, pager: &mut Pager, table: &mut Table) -> Option<()> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 607 | fn merge_left_right_child_to_parent(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut Page... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 628 | fn demote_key_move_left_child_to_right(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut P... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 674 | fn demote_key_move_right_child_to_left(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut P... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 726 | fn demote_key_merge_left_to_right(parent_node: &mut TreeNode, mut left_child: TreeNode, mut right_child: TreeNode, pager: &mut Pager,... [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 788 | fn node_take_child(parent_node: &mut TreeNode, i: usize, pager: &mut Pager) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 801 | fn node_take_left_right_children(parent_node: &mut TreeNode, i: usize, pager: &mut Pager) -> Option<(TreeNode, TreeNode)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 837 | pub fn root(&self) -> Option<&TreeNode> { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/tree_node.rs:15:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl TreeNode { [INFO] [stdout] | ------------- associated items in this implementation [INFO] [stdout] 15 | pub fn new(is_root: bool, node_type: NodeType, node_index_type: NodeIndexType, node_indexed_column: Option, key: u32, remote_k... [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn take_cached_tree_node_child(&mut self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | pub fn take_cached_left_right_tree_node_child(&mut self, i: usize) -> Option<(Option, Option)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 93 | pub fn add_tree_node_child(&mut self, tree_child: TreeNode, offset: u32, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 106 | pub fn splice_tree_node_child(&mut self, tree_child: TreeNode, offset: u32, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | pub fn remove_tree_node_child(&mut self, remove_at: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 165 | pub fn take_cached_node_overflow_child(&mut self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | pub fn remove_node_overflow_child(&mut self, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 182 | pub fn prepend_merge(&mut self, merge_with_node: &mut TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 202 | pub fn append_merge(&mut self, merge_with_node: &mut TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 232 | pub fn take_node_and_split(mut self, split_keys_at: usize, split_children_at: usize) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 255 | pub fn split_off_left_node_right_node(&mut self) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 291 | pub fn split_node_at_midpoint(&mut self) -> (TreeNode, TreeNode) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 370 | pub fn append_key(&mut self, key: u32, remote_key_size: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 374 | pub fn prepend_key(&mut self, key: u32, remote_key_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 378 | pub fn splice_key(&mut self, key: u32, remote_key_size: usize, i: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 382 | pub fn remove_key(&mut self, remove_at: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 386 | pub fn take_key(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 405 | pub fn add_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 409 | pub fn splice_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 413 | pub fn replace_node_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 417 | pub fn remove_node_child(&mut self, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 421 | pub fn take_node_child(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 425 | pub fn clear_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 441 | pub fn child_offset_child_size(&self, i: usize) -> Option<(u32, usize)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 452 | pub fn child_offset(&self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 462 | pub fn child_size(&self, i: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 476 | pub fn child_is_overflowing(&self, i: usize) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 489 | pub fn children_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 493 | pub fn add_node_overflow_child(&mut self, child_offset: u32, size: usize, i: usize ) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 519 | pub fn overflow_child(&self, i: usize) -> Option<&NodeOverflow> { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 539 | pub fn overflow_child_len(&self, i: usize) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 548 | pub fn overflow_children_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 557 | pub fn left_right_children_of_index(&self, i: usize) -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 565 | pub fn set_node_type(&mut self, node_type: NodeType) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 569 | pub fn has_children(&self) -> bool { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 573 | pub fn is_root(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 592 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 596 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 600 | pub fn overflow_data(&self, i: usize) -> Option<&[u8]> { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 609 | fn split_overflow_children_at(mut overflow_children: Vec>, split_at: usize) -> (Vec>, Vec src/db/b_tree/disk_storage/node.rs:22:12 [INFO] [stdout] | [INFO] [stdout] 20 | impl Node { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 21 | [INFO] [stdout] 22 | pub fn new(is_root: bool, node_type: NodeType, node_index_type: NodeIndexType, node_indexed_column: Option, key: u32, remote_k... [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 46 | pub fn from_split_new(mut node: Node, split_keys_at: usize, split_children_at: usize) -> (Node, Node) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 77 | pub fn from_split_range(&mut self, i: usize, len: usize) -> Node { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 102 | pub fn from_cleave(&mut self) -> (Node, Node) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn append_merge(merge_to: &mut Node, merge_from: &mut Node) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 160 | pub fn prepend_merge(merge_to: &mut Node, merge_from: &mut Node) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 194 | pub fn append_key(&mut self, key: u32, remote_key_item_size: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 210 | fn append_key_bytes(&mut self, key: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 221 | pub fn prepend_key(&mut self, key: u32, remote_key_item_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 236 | fn prepend_key_bytes(&mut self, mut key: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 248 | pub fn splice_key(&mut self, key: u32, remote_key_item_size: usize, i: usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 265 | pub fn append_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 283 | fn append_child_bytes(&mut self, child: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 294 | pub fn prepend_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 312 | pub fn replace_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 327 | pub fn splice_child(&mut self, child_offset: u32, size: usize, is_overflowing: bool, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 347 | fn prepend_child_bytes(&mut self, mut child: Vec) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 359 | pub fn clear_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 367 | pub fn shift_keys(&mut self, i: usize, num_keys: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 396 | pub fn shift_children(&mut self, i: usize, num_children: usize) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 424 | pub fn take_key(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 432 | pub fn take_child(&mut self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 440 | pub fn increment_key(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 447 | pub fn decrement_key(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 454 | pub fn increment_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 461 | pub fn decrement_children(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 468 | pub fn is_root(&self) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 505 | pub fn num_children(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 511 | pub fn keys(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 536 | pub fn children(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 569 | pub fn children_as_u32(&self) -> Option> { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 594 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 598 | fn set_num_keys(&mut self, num_keys: u32) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 604 | fn set_num_children(&mut self, num_children: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 610 | pub fn set_node_type(&mut self, node_type: NodeType) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 616 | pub fn set_is_overflowing(&mut self, i: usize, is_overflowing: bool) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 638 | fn is_root_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 658 | fn number_children_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/b_tree/disk_storage/node_overflow.rs:11:12 [INFO] [stdout] | [INFO] [stdout] 10 | impl NodeOverflow { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 11 | pub fn new(offset: u32, size: usize) -> NodeOverflow { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 27 | pub fn add_item(&mut self, offset: u32, size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn num_items(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn item(&self, i: usize) -> (u32, usize) { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn increment_num_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 74 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 78 | fn num_items_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `add_column`, `delete_row`, `row_mut`, `columns_len`, and `columns_data` are never used [INFO] [stdout] --> src/db/table/table.rs:53:12 [INFO] [stdout] | [INFO] [stdout] 42 | impl Table { [INFO] [stdout] | ---------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 53 | pub fn add_column(&mut self, column_name: &str, column_type: ColumnType) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn delete_row(&mut self, row_offset: u32) -> Option { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn row_mut(&mut self, row_offset: u32) -> Option<&mut Row> { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | pub fn columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn columns_data(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: enum `CellType` is never used [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:6:10 [INFO] [stdout] | [INFO] [stdout] 6 | pub enum CellType { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `CellType` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/table/disk_storage/cell.rs:47:12 [INFO] [stdout] | [INFO] [stdout] 46 | impl Cell { [INFO] [stdout] | --------- associated items in this implementation [INFO] [stdout] 47 | pub fn new_head(size: usize) -> Cell { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn new_body(data: DataType) -> Cell { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn new_padding(size: usize) -> Cell { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 117 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 121 | pub fn is_head(&self) -> CellType { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 162 | pub fn set_size(&mut self, data_size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 173 | fn is_head_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/table/disk_storage/row.rs:13:12 [INFO] [stdout] | [INFO] [stdout] 12 | impl Row { [INFO] [stdout] | -------- associated items in this implementation [INFO] [stdout] 13 | pub fn from_cells(mut cells: Vec, primary_key: u32) -> Row { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 89 | pub fn append_cell(&mut self, cell: Cell) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 128 | pub fn cell_mut(&mut self, at: usize) -> Option<&mut Cell> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 132 | pub fn num_cells(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 136 | pub fn data(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 145 | pub fn set_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 153 | pub fn increment_size(&mut self, add_size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | fn head_mut(&mut self) -> Option<&mut Cell> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 174 | fn calc_size(cells: &Vec) -> usize { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `columns_len` and `data` are never used [INFO] [stdout] --> src/db/table/disk_storage/columns.rs:90:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Columns { [INFO] [stdout] | ------------ methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 90 | pub fn columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 96 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `free_list`, `write_buffers`, and `eof_buffer` are never read [INFO] [stdout] --> src/db/file_stystem/pager.rs:9:5 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct Pager { [INFO] [stdout] | ----- fields in this struct [INFO] [stdout] ... [INFO] [stdout] 9 | free_list: FreeList, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] 10 | write_buffers: Vec, [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] 11 | eof_buffer: Option, [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `Pager` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/file_stystem/pager.rs:51:12 [INFO] [stdout] | [INFO] [stdout] 14 | impl Pager { [INFO] [stdout] | ---------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 51 | pub fn add_to_write_buffer(&mut self, bytes: &[u8], prev_offset_prev_size: Option<(u32, usize)>) -> u32 { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 95 | pub fn flush_write_buffer_trees(&mut self, primary_root: (u32, usize), secondary_index_list: (u32, usize)) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 122 | pub fn flush_table_columns(&mut self, table_columns: (u32, usize)) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 146 | pub fn mark_free(&mut self, size: usize, offset: u32) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 150 | fn free_list_buffer(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 166 | fn reclaim_list_buffer(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 216 | fn free_list_offset(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 226 | fn reclaim_list_offset(&self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 246 | fn free_list_to_file(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `seek_write` and `seek_end` are never used [INFO] [stdout] --> src/db/file_stystem/file_handler.rs:45:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl FileHandler { [INFO] [stdout] | ---------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn seek_write(&mut self) -> Result { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn seek_end(&mut self) -> Result<(), io::Error> { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `bytes`, `size`, and `offset` are never read [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:3:5 [INFO] [stdout] | [INFO] [stdout] 2 | pub struct WriteBufferItem { [INFO] [stdout] | --------------- fields in this struct [INFO] [stdout] 3 | bytes: Vec, [INFO] [stdout] | ^^^^^ [INFO] [stdout] 4 | size: usize, [INFO] [stdout] | ^^^^ [INFO] [stdout] 5 | offset: usize, [INFO] [stdout] | ^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `WriteBufferItem` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: associated items `new`, `add_bytes`, `bytes`, `size`, and `offset` are never used [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:9:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl WriteBufferItem { [INFO] [stdout] | -------------------- associated items in this implementation [INFO] [stdout] 9 | pub fn new(bytes: &[u8], size: usize, offset: usize) -> WriteBufferItem { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 13 | pub fn add_bytes(&mut self, bytes: &[u8]) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn bytes(&self) -> &[u8] { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 26 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: struct `WriteBuffer` is never constructed [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:33:12 [INFO] [stdout] | [INFO] [stdout] 33 | pub struct WriteBuffer { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `WriteBuffer` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/file_stystem/write_buffer.rs:40:12 [INFO] [stdout] | [INFO] [stdout] 39 | impl WriteBuffer { [INFO] [stdout] | ---------------- associated items in this implementation [INFO] [stdout] 40 | pub fn new() -> WriteBuffer { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 44 | pub fn from_write_buffer_item(item: WriteBufferItem, offset: usize) -> WriteBuffer { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn add_item(&mut self, item: WriteBufferItem) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 55 | pub fn remove_item(&mut self) -> Option { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn clear_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 68 | pub fn items(&self) -> &Vec { [INFO] [stdout] | ^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn items_mut(&mut self) -> &mut Vec { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 76 | pub fn root_offset(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 84 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 88 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 92 | pub fn data(&self) -> Vec { [INFO] [stdout] | ^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/meta/disk_storage/master.rs:18:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl Master { [INFO] [stdout] | ----------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 18 | pub fn set_primary_root_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 24 | pub fn set_primary_root_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn set_secondary_index_list_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 36 | pub fn set_secondary_index_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn set_table_columns_size(&mut self, size: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 48 | pub fn set_table_columns_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 54 | pub fn set_free_list_number_items(&mut self, count: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 60 | pub fn set_free_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 66 | pub fn set_reclaim_list_number_items(&mut self, count: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 72 | pub fn set_reclaim_list_offset(&mut self, offset: u32) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 139 | pub fn secondary_index_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 151 | pub fn table_columns_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 163 | pub fn free_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 175 | pub fn reclaim_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple associated items are never used [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:10:12 [INFO] [stdout] | [INFO] [stdout] 9 | impl FreeListItem { [INFO] [stdout] | ----------------- associated items in this implementation [INFO] [stdout] 10 | pub fn new(offset: usize, size: usize) -> FreeListItem { [INFO] [stdout] | ^^^ [INFO] [stdout] ... [INFO] [stdout] 22 | pub fn offset(&self) -> usize { [INFO] [stdout] | ^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 28 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 34 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 38 | pub fn move_offset(&mut self, move_by: usize) { [INFO] [stdout] | ^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn increase_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 52 | pub fn decrease_size(&mut self, size: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 59 | fn offset_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | fn size_range() -> (usize, usize) { [INFO] [stdout] | ^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: fields `free_list` and `reclaim_list` are never read [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:84:5 [INFO] [stdout] | [INFO] [stdout] 83 | pub struct FreeList { [INFO] [stdout] | -------- fields in this struct [INFO] [stdout] 84 | free_list: Vec, [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] 85 | reclaim_list: Vec, [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `FreeList` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/meta/disk_storage/free_list.rs:107:12 [INFO] [stdout] | [INFO] [stdout] 88 | impl FreeList { [INFO] [stdout] | ------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 107 | pub fn add_to_free_list(&mut self, item: FreeListItem) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 111 | pub fn reclaim_from_free_list(&mut self, size: usize) -> Option { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 142 | pub fn condense_free_list(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 168 | pub fn free_list_data(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 176 | pub fn recliam_list_data(&self) -> Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 184 | pub fn free_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 188 | pub fn reclaim_list_len(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: methods `add_item`, `set_item_offset`, `size`, `data`, `increment_size`, and `increment_num_items` are never used [INFO] [stdout] --> src/db/secondary_index/disk_storage/secondary_index_list.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 8 | impl SecondaryIndexList { [INFO] [stdout] | ----------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_item(&mut self, offset: u32, column_index: u32) { [INFO] [stdout] | ^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 42 | pub fn set_item_offset(&mut self, offset: u32, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 63 | pub fn size(&self) -> usize { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 75 | pub fn data(&self) -> &[u8] { [INFO] [stdout] | ^^^^ [INFO] [stdout] ... [INFO] [stdout] 79 | fn increment_size(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 86 | fn increment_num_items(&mut self) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: field `secondary_index_list` is never read [INFO] [stdout] --> src/db/secondary_index/secondary_index.rs:8:5 [INFO] [stdout] | [INFO] [stdout] 6 | pub struct SecondaryIndex { [INFO] [stdout] | -------------- field in this struct [INFO] [stdout] 7 | secondary_index_trees: Vec, [INFO] [stdout] 8 | secondary_index_list: SecondaryIndexList, [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] | [INFO] [stdout] = note: `SecondaryIndex` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: multiple methods are never used [INFO] [stdout] --> src/db/secondary_index/secondary_index.rs:30:12 [INFO] [stdout] | [INFO] [stdout] 11 | impl SecondaryIndex { [INFO] [stdout] | ------------------- methods in this implementation [INFO] [stdout] ... [INFO] [stdout] 30 | pub fn add_secondary_index(&mut self, indexed_column: usize, pager: &mut Pager) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 37 | pub fn set_secondary_index_item_offset(&mut self, offset: u32, i: usize) { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 41 | pub fn secondary_index_tree(&mut self, i: usize) -> Option<&BTree> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 45 | pub fn secondary_index_tree_mut(&mut self, i: usize) -> Option<&mut BTree> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 49 | pub fn secondary_index_trees(&self) -> &Vec { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 57 | pub fn secondary_index_item(&self, i: usize) -> Option<(u32, usize)> { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 61 | pub fn num_secondary_index_items(&self) -> usize { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] ... [INFO] [stdout] 65 | pub fn secondary_index_data(&self) -> &[u8] { [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ELEMENT_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:3:15 [INFO] [stdout] | [INFO] [stdout] 3 | pub const ELEMENT_SIZE: usize = 92; // 92 1112 [INFO] [stdout] | ^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_MIN_KEYS` is never used [INFO] [stdout] --> src/db/shared/constants.rs:54:15 [INFO] [stdout] | [INFO] [stdout] 54 | pub const NODE_MIN_KEYS: usize = NODE_MAX_DEGREE / 2; // 2 [INFO] [stdout] | ^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_MIN_CHILDREN` is never used [INFO] [stdout] --> src/db/shared/constants.rs:65:15 [INFO] [stdout] | [INFO] [stdout] 65 | pub const NODE_MIN_CHILDREN: usize = (NODE_MAX_DEGREE / 2) + 1; // 3 [INFO] [stdout] | ^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `NODE_OVERFLOW_NUMBER_ITEMS_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:98:15 [INFO] [stdout] | [INFO] [stdout] 98 | pub const NODE_OVERFLOW_NUMBER_ITEMS_OFFSET: usize = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `CELL_META_DATA_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:109:15 [INFO] [stdout] | [INFO] [stdout] 109 | pub const CELL_META_DATA_SIZE: usize = CELL_DATA_SIZE + CELL_IS_HEAD_SIZE + CELL_DATA_TYPE_SIZE; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `ROW_HEAD_CELL_SIZE` is never used [INFO] [stdout] --> src/db/shared/constants.rs:116:15 [INFO] [stdout] | [INFO] [stdout] 116 | pub const ROW_HEAD_CELL_SIZE: usize = CELL_DATA_SIZE + CELL_IS_HEAD_SIZE + CELL_DATA_TYPE_SIZE + ROW_DATA_SIZE; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `FREE_ITEM_DATA_OFFSET_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:137:15 [INFO] [stdout] | [INFO] [stdout] 137 | pub const FREE_ITEM_DATA_OFFSET_OFFSET: usize = 0; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: constant `FREE_ITEM_DATA_SIZE_OFFSET` is never used [INFO] [stdout] --> src/db/shared/constants.rs:139:15 [INFO] [stdout] | [INFO] [stdout] 139 | pub const FREE_ITEM_DATA_SIZE_OFFSET: usize = FREE_ITEM_DATA_OFFSET_OFFSET + FREE_ITEM_DATA_OFFSET; [INFO] [stdout] | ^^^^^^^^^^^^^^^^^^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: method `matches` is never used [INFO] [stdout] --> src/db/shared/enums.rs:13:11 [INFO] [stdout] | [INFO] [stdout] 12 | impl ColumnType { [INFO] [stdout] | --------------- method in this implementation [INFO] [stdout] 13 | pub fn matches(&self, data_type: &DataType) -> bool { [INFO] [stdout] | ^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stdout] warning: function `pad_bytes` is never used [INFO] [stdout] --> src/db/shared/utils.rs:11:8 [INFO] [stdout] | [INFO] [stdout] 11 | pub fn pad_bytes(bytes: &mut Vec) { [INFO] [stdout] | ^^^^^^^^^ [INFO] [stdout] [INFO] [stdout] [INFO] [stderr] Finished `test` profile [unoptimized + debuginfo] target(s) in 0.48s [INFO] running `Command { std: "docker" "inspect" "2a5ffedd5f661329a8fdfe251167b34b076fdd82fc121a37378176630e486d69", kill_on_drop: false }` [INFO] running `Command { std: "docker" "rm" "-f" "2a5ffedd5f661329a8fdfe251167b34b076fdd82fc121a37378176630e486d69", kill_on_drop: false }` [INFO] [stdout] 2a5ffedd5f661329a8fdfe251167b34b076fdd82fc121a37378176630e486d69