add comments and refactor

This commit is contained in:
Moritz Hölting 2024-06-17 23:58:24 +02:00
parent 3ab2037b31
commit 451626312f
7 changed files with 181 additions and 71 deletions

View File

@ -1,9 +1,7 @@
use std::path::Path; use std::path::Path;
use shulkerbox::{ // import the prelude to get all the necessary structs
datapack::{Command, Condition, Datapack, Execute}, use shulkerbox::prelude::*;
util::compile::CompileOptions,
};
fn main() { fn main() {
// create a new datapack // create a new datapack

View File

@ -37,6 +37,8 @@ impl Execute {
global_state: &MutCompilerState, global_state: &MutCompilerState,
function_state: &FunctionCompilerState, function_state: &FunctionCompilerState,
) -> Vec<String> { ) -> Vec<String> {
// Directly compile the command if it is a run command, skipping the execute part
// Otherwise, compile the execute command using internal function
if let Self::Run(cmd) = self { if let Self::Run(cmd) = self {
cmd.compile(options, global_state, function_state) cmd.compile(options, global_state, function_state)
} else { } else {
@ -53,6 +55,8 @@ impl Execute {
} }
} }
/// Compile the execute command into strings with the given prefix.
/// Each first tuple element is a boolean indicating if the prefix should be used for that command.
fn compile_internal( fn compile_internal(
&self, &self,
prefix: String, prefix: String,
@ -72,19 +76,15 @@ impl Execute {
| Self::Positioned(arg, next) | Self::Positioned(arg, next)
| Self::Rotated(arg, next) | Self::Rotated(arg, next)
| Self::Store(arg, next) | Self::Store(arg, next)
| Self::Summon(arg, next) => format_execute( | Self::Summon(arg, next) => next.compile_internal(
prefix, format!("{prefix}{op} {arg} ", op = self.variant_name()),
&format!("{op} {arg} ", op = self.variant_name()),
next,
require_grouping, require_grouping,
options, options,
global_state, global_state,
function_state, function_state,
), ),
Self::AsAt(selector, next) => format_execute( Self::AsAt(selector, next) => next.compile_internal(
prefix, format!("{prefix}as {selector} at @s "),
&format!("as {selector} at @s "),
next,
require_grouping, require_grouping,
options, options,
global_state, global_state,
@ -167,6 +167,7 @@ impl Execute {
} }
/// Combine command parts, respecting if the second part is a comment /// Combine command parts, respecting if the second part is a comment
/// The first tuple element is a boolean indicating if the prefix should be used
fn map_run_cmd(cmd: String, prefix: &str) -> (bool, String) { fn map_run_cmd(cmd: String, prefix: &str) -> (bool, String) {
if cmd.starts_with('#') { if cmd.starts_with('#') {
(false, cmd) (false, cmd)
@ -175,25 +176,8 @@ fn map_run_cmd(cmd: String, prefix: &str) -> (bool, String) {
} }
} }
/// Format the execute command, compiling the next command /// Compile an if condition command.
fn format_execute( /// The first tuple element is a boolean indicating if the prefix should be used for that command.
prefix: String,
new: &str,
next: &Execute,
require_grouping: bool,
options: &CompileOptions,
global_state: &MutCompilerState,
function_state: &FunctionCompilerState,
) -> Vec<(bool, String)> {
next.compile_internal(
prefix + new,
require_grouping,
options,
global_state,
function_state,
)
}
#[tracing::instrument(skip_all)] #[tracing::instrument(skip_all)]
fn compile_if_cond( fn compile_if_cond(
cond: &Condition, cond: &Condition,
@ -208,6 +192,7 @@ fn compile_if_cond(
let str_cond = cond.clone().compile(options, global_state, function_state); let str_cond = cond.clone().compile(options, global_state, function_state);
let require_grouping_uid = (el.is_some() || then_count > 1).then(|| { let require_grouping_uid = (el.is_some() || then_count > 1).then(|| {
// calculate a unique condition id for the else check
let uid = function_state.request_uid(); let uid = function_state.request_uid();
let pre_hash = function_state.path().to_owned() + ":" + &uid.to_string(); let pre_hash = function_state.path().to_owned() + ":" + &uid.to_string();
@ -215,11 +200,14 @@ fn compile_if_cond(
}); });
#[allow(clippy::option_if_let_else)] #[allow(clippy::option_if_let_else)]
let then = if let Some(success_uid) = require_grouping_uid.as_deref() { let then = if let Some(success_uid) = require_grouping_uid.as_deref() {
// prepare commands for grouping
let mut group_cmd = match then.clone() { let mut group_cmd = match then.clone() {
Execute::Run(cmd) => vec![*cmd], Execute::Run(cmd) => vec![*cmd],
Execute::Runs(cmds) => cmds, Execute::Runs(cmds) => cmds,
ex => vec![Command::Execute(ex)], ex => vec![Command::Execute(ex)],
}; };
// add success condition to the group
// this condition will be checked after the group ran to determine if the else part should be executed
if el.is_some() && str_cond.len() <= 1 { if el.is_some() && str_cond.len() <= 1 {
group_cmd.push( group_cmd.push(
format!("data modify storage shulkerbox:cond {success_uid} set value true") format!("data modify storage shulkerbox:cond {success_uid} set value true")
@ -241,6 +229,7 @@ fn compile_if_cond(
function_state, function_state,
) )
}; };
// if the conditions have multiple parts joined by a disjunction, commands need to be grouped
let each_or_cmd = (str_cond.len() > 1).then(|| { let each_or_cmd = (str_cond.len() > 1).then(|| {
let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| { let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| {
tracing::error!("No success_uid found for each_or_cmd, using default"); tracing::error!("No success_uid found for each_or_cmd, using default");
@ -257,6 +246,7 @@ fn compile_if_cond(
), ),
) )
}); });
// build the condition for each then command
let successful_cond = if each_or_cmd.is_some() { let successful_cond = if each_or_cmd.is_some() {
let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| { let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| {
tracing::error!("No success_uid found for each_or_cmd, using default"); tracing::error!("No success_uid found for each_or_cmd, using default");
@ -270,7 +260,9 @@ fn compile_if_cond(
} else { } else {
str_cond str_cond
}; };
// combine the conditions with the then commands
let then_commands = combine_conditions_commands(successful_cond, &then); let then_commands = combine_conditions_commands(successful_cond, &then);
// build the else part
let el_commands = el let el_commands = el
.map(|el| { .map(|el| {
let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| { let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| {
@ -291,6 +283,7 @@ fn compile_if_cond(
}) })
.unwrap_or_default(); .unwrap_or_default();
// reset the success storage if needed
let reset_success_storage = if each_or_cmd.is_some() || el.is_some() { let reset_success_storage = if each_or_cmd.is_some() || el.is_some() {
let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| { let success_uid = require_grouping_uid.as_deref().unwrap_or_else(|| {
tracing::error!("No success_uid found for each_or_cmd, using default"); tracing::error!("No success_uid found for each_or_cmd, using default");
@ -304,6 +297,7 @@ fn compile_if_cond(
None None
}; };
// combine all parts
reset_success_storage reset_success_storage
.clone() .clone()
.into_iter() .into_iter()
@ -330,6 +324,7 @@ fn combine_conditions_commands(
.into_iter() .into_iter()
.flat_map(|cond| { .flat_map(|cond| {
commands.iter().map(move |(use_prefix, cmd)| { commands.iter().map(move |(use_prefix, cmd)| {
// combine the condition with the command if it uses a prefix
let cmd = if *use_prefix { let cmd = if *use_prefix {
cond.clone() + " " + cmd cond.clone() + " " + cmd
} else { } else {
@ -351,7 +346,8 @@ pub enum Condition {
Or(Box<Condition>, Box<Condition>), Or(Box<Condition>, Box<Condition>),
} }
impl Condition { impl Condition {
/// Normalize the condition. /// Normalize the condition to eliminate complex negations.
/// Uses De Morgan's laws to simplify the condition.
#[must_use] #[must_use]
pub fn normalize(&self) -> Self { pub fn normalize(&self) -> Self {
match self { match self {
@ -359,43 +355,77 @@ impl Condition {
Self::Not(c) => match *c.clone() { Self::Not(c) => match *c.clone() {
Self::Atom(c) => Self::Not(Box::new(Self::Atom(c))), Self::Atom(c) => Self::Not(Box::new(Self::Atom(c))),
Self::Not(c) => c.normalize(), Self::Not(c) => c.normalize(),
Self::And(c1, c2) => ((!*c1).normalize()) | ((!*c2).normalize()), Self::And(a, b) => ((!*a).normalize()) | ((!*b).normalize()),
Self::Or(c1, c2) => ((!*c1).normalize()) & ((!*c2).normalize()), Self::Or(a, b) => ((!*a).normalize()) & ((!*b).normalize()),
}, },
Self::And(c1, c2) => c1.normalize() & c2.normalize(), Self::And(a, b) => a.normalize() & b.normalize(),
Self::Or(c1, c2) => c1.normalize() | c2.normalize(), Self::Or(a, b) => a.normalize() | b.normalize(),
} }
} }
/// Compile the condition into a list of strings. /// Convert the condition into a truth table.
/// This will expand the condition into all possible combinations of its atoms.
/// All vector elements are in disjunction with each other and do not contain disjunctions and complex negations in them.
#[must_use]
pub fn to_truth_table(&self) -> Vec<Self> {
match self.normalize() {
Self::Atom(_) | Self::Not(_) => vec![self.clone()],
Self::Or(a, b) => a
.to_truth_table()
.into_iter()
.chain(b.to_truth_table())
.collect(),
Self::And(a, b) => {
let a = a.to_truth_table();
let b = b.to_truth_table();
a.into_iter()
.flat_map(|el1| {
b.iter()
.map(move |el2| Self::And(Box::new(el1.clone()), Box::new(el2.clone())))
})
.collect()
}
}
}
/// Convert the condition into a string.
///
/// Will fail if the condition contains an `Or` variant. Use `compile` instead.
fn str_cond(&self) -> Option<String> {
match self {
Self::Atom(s) => Some("if ".to_string() + &s),
Self::Not(n) => match *(*n).clone() {
Self::Atom(s) => Some("unless ".to_string() + &s),
_ => None,
},
Self::And(a, b) => {
let a = a.str_cond()?;
let b = b.str_cond()?;
Some(a + " " + &b)
}
Self::Or(..) => None,
}
}
/// Compile the condition into a list of strings that can be used in Minecraft.
#[allow(clippy::only_used_in_recursion)] #[allow(clippy::only_used_in_recursion)]
pub fn compile( pub fn compile(
&self, &self,
options: &CompileOptions, _options: &CompileOptions,
global_state: &MutCompilerState, _global_state: &MutCompilerState,
function_state: &FunctionCompilerState, _function_state: &FunctionCompilerState,
) -> Vec<String> { ) -> Vec<String> {
match self.normalize() { let truth_table = self.to_truth_table();
Self::Atom(a) => vec!["if ".to_string() + &a],
Self::Not(n) => match n.as_ref() {
Self::Atom(a) => vec!["unless ".to_string() + a],
_ => unreachable!("Cannot happen because of normalization"),
},
Self::And(c1, c2) => {
let c1 = c1.compile(options, global_state, function_state);
let c2 = c2.compile(options, global_state, function_state);
c1.into_iter() truth_table
.flat_map(|c1| c2.iter().map(move |c2| c1.clone() + " " + c2)) .into_iter()
.collect() .map(|c| {
} c.str_cond()
Self::Or(c1, c2) => { .expect("Truth table should not contain Or variants")
let mut c1 = c1.compile(options, global_state, function_state); })
let c2 = c2.compile(options, global_state, function_state); .collect()
c1.extend(c2);
c1
}
}
} }
} }
@ -431,6 +461,7 @@ impl BitOr for Condition {
mod tests { mod tests {
use super::*; use super::*;
#[allow(clippy::redundant_clone)]
#[test] #[test]
fn test_condition() { fn test_condition() {
let c1 = Condition::Atom("foo".to_string()); let c1 = Condition::Atom("foo".to_string());
@ -463,8 +494,57 @@ mod tests {
); );
assert_eq!( assert_eq!(
(c1.clone() & c2.clone() | c3.clone() & c1.clone()).normalize(), (c1.clone() & c2.clone() | c3.clone() & c1.clone()).normalize(),
c1.clone() & c2.clone() | c3 & c1.clone() c1.clone() & c2.clone() | c3.clone() & c1.clone()
);
assert_eq!(
(!(c1.clone() | c2.clone())).normalize(),
!c1.clone() & !c2.clone()
);
assert_eq!(
(!(c1.clone() & c2.clone())).normalize(),
!c1.clone() | !c2.clone()
);
}
#[allow(clippy::redundant_clone)]
#[test]
fn test_truth_table() {
let c1 = Condition::Atom("foo".to_string());
let c2 = Condition::Atom("bar".to_string());
let c3 = Condition::Atom("baz".to_string());
let c4 = Condition::Atom("foobar".to_string());
assert_eq!(
(c1.clone() & c2.clone()).to_truth_table(),
vec![c1.clone() & c2.clone()]
);
assert_eq!(
(c1.clone() & c2.clone() & c3.clone()).to_truth_table(),
vec![c1.clone() & c2.clone() & c3.clone()]
);
assert_eq!(
(c1.clone() | c2.clone()).to_truth_table(),
vec![c1.clone(), c2.clone()]
);
assert_eq!(
((c1.clone() | c2.clone()) & c3.clone()).to_truth_table(),
vec![c1.clone() & c3.clone(), c2.clone() & c3.clone()]
);
assert_eq!(
((c1.clone() & c2.clone()) | c3.clone()).to_truth_table(),
vec![c1.clone() & c2.clone(), c3.clone()]
);
assert_eq!(
(c1.clone() & !(c2.clone() | (c3.clone() & c4.clone()))).to_truth_table(),
vec![
c1.clone() & (!c2.clone() & !c3.clone()),
c1.clone() & (!c2.clone() & !c4.clone())
]
); );
assert_eq!((!(c1.clone() | c2.clone())).normalize(), !c1 & !c2);
} }
} }

View File

@ -1,14 +1,12 @@
//! Represents a command that can be included in a function. //! Represents a command that can be included in a function.
mod execute; mod execute;
pub use execute::{Condition, Execute}; pub use execute::{Condition, Execute};
use chksum_md5 as md5; use chksum_md5 as md5;
use crate::util::compile::{CompileOptions, FunctionCompilerState, MutCompilerState};
use super::Function; use super::Function;
use crate::util::compile::{CompileOptions, FunctionCompilerState, MutCompilerState};
/// Represents a command that can be included in a function. /// Represents a command that can be included in a function.
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))] #[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
@ -100,9 +98,11 @@ fn compile_group(
.iter() .iter()
.map(|cmd| cmd.get_count(options)) .map(|cmd| cmd.get_count(options))
.sum::<usize>(); .sum::<usize>();
// only create a function if there are more than one command
if command_count > 1 { if command_count > 1 {
let uid = function_state.request_uid(); let uid = function_state.request_uid();
// calculate a hashed path for the function in the `sb` subfolder
let function_path = { let function_path = {
let function_path = function_state.path(); let function_path = function_state.path();
let function_path = function_path.strip_prefix("sb/").unwrap_or(function_path); let function_path = function_path.strip_prefix("sb/").unwrap_or(function_path);
@ -115,6 +115,7 @@ fn compile_group(
let namespace = function_state.namespace(); let namespace = function_state.namespace();
// create a new function with the commands
let mut function = Function::new(namespace, &function_path); let mut function = Function::new(namespace, &function_path);
function.get_commands_mut().extend(commands.iter().cloned()); function.get_commands_mut().extend(commands.iter().cloned());
function_state.add_function(&function_path, function); function_state.add_function(&function_path, function);

View File

@ -82,7 +82,7 @@ impl Datapack {
self.namespaces.get(name) self.namespaces.get(name)
} }
/// Butably get a namespace by name or create a new one if it doesn't exist. /// Mutably get a namespace by name or create a new one if it doesn't exist.
pub fn namespace_mut(&mut self, name: &str) -> &mut Namespace { pub fn namespace_mut(&mut self, name: &str) -> &mut Namespace {
self.namespaces self.namespaces
.entry(name.to_string()) .entry(name.to_string())

View File

@ -85,7 +85,7 @@ impl Namespace {
let mut root_folder = VFolder::new(); let mut root_folder = VFolder::new();
// Compile functions // collect functions
let mut functions = self let mut functions = self
.functions .functions
.iter() .iter()
@ -96,8 +96,8 @@ impl Namespace {
functions.push_front(("main".to_string(), self.main_function.clone())); functions.push_front(("main".to_string(), self.main_function.clone()));
} }
// compile all functions, allow adding new functions while compiling
let mut functions = ExtendableQueue::from(functions); let mut functions = ExtendableQueue::from(functions);
while let Some((path, function)) = functions.next() { while let Some((path, function)) = functions.next() {
let function_state = FunctionCompilerState::new(&path, &self.name, functions.clone()); let function_state = FunctionCompilerState::new(&path, &self.name, functions.clone());
root_folder.add_file( root_folder.add_file(
@ -106,7 +106,7 @@ impl Namespace {
); );
} }
// Compile tags // compile tags
for (path, tag) in &self.tags { for (path, tag) in &self.tags {
let (tag_type, vfile) = tag.compile(options, state); let (tag_type, vfile) = tag.compile(options, state);
root_folder.add_file(&format!("tags/{tag_type}/{path}.json"), vfile); root_folder.add_file(&format!("tags/{tag_type}/{path}.json"), vfile);

View File

@ -14,3 +14,13 @@
pub mod datapack; pub mod datapack;
pub mod util; pub mod util;
pub mod virtual_fs; pub mod virtual_fs;
/// Prelude for shulkerbox.
///
/// This module contains the most common types and traits that you may want to import.
pub mod prelude {
pub use crate::{
datapack::{Command, Condition, Datapack, Execute},
util::compile::CompileOptions,
};
}

View File

@ -39,10 +39,12 @@ impl VFolder {
} }
/// Recursively add an existing folder to the folder. /// Recursively add an existing folder to the folder.
pub fn add_existing_folder(&mut self, path: &str, folder: Self) { pub fn add_existing_folder(&mut self, path: &str, folder: Self) {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
if let Some(tail) = tail { if let Some(tail) = tail {
// if the folder already exists, add the subfolder to it
if let Some(subfolder) = self.get_folder_mut(head) { if let Some(subfolder) = self.get_folder_mut(head) {
subfolder.add_folder(tail); subfolder.add_folder(tail);
} else { } else {
@ -56,10 +58,12 @@ impl VFolder {
} }
/// Recursively add a new file to the folder. /// Recursively add a new file to the folder.
pub fn add_file(&mut self, path: &str, file: VFile) { pub fn add_file(&mut self, path: &str, file: VFile) {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
if let Some(tail) = tail { if let Some(tail) = tail {
// if the folder already exists, add the file to it
if let Some(subfolder) = self.get_folder_mut(head) { if let Some(subfolder) = self.get_folder_mut(head) {
subfolder.add_file(tail, file); subfolder.add_file(tail, file);
} else { } else {
@ -75,6 +79,7 @@ impl VFolder {
/// Recursively get a subfolder by path. /// Recursively get a subfolder by path.
#[must_use] #[must_use]
pub fn get_folder(&self, path: &str) -> Option<&Self> { pub fn get_folder(&self, path: &str) -> Option<&Self> {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
@ -86,6 +91,7 @@ impl VFolder {
} }
/// Recursively get a mutable subfolder by path. /// Recursively get a mutable subfolder by path.
pub fn get_folder_mut(&mut self, path: &str) -> Option<&mut Self> { pub fn get_folder_mut(&mut self, path: &str) -> Option<&mut Self> {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
@ -98,6 +104,7 @@ impl VFolder {
/// Recursively get a file by path. /// Recursively get a file by path.
#[must_use] #[must_use]
pub fn get_file(&self, path: &str) -> Option<&VFile> { pub fn get_file(&self, path: &str) -> Option<&VFile> {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
@ -109,6 +116,7 @@ impl VFolder {
} }
/// Recursively get a mutable file by path. /// Recursively get a mutable file by path.
pub fn get_file_mut(&mut self, path: &str) -> Option<&mut VFile> { pub fn get_file_mut(&mut self, path: &str) -> Option<&mut VFile> {
// extract first folder name and the rest of the path
let (head, tail) = path let (head, tail) = path
.split_once('/') .split_once('/')
.map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t))); .map_or((path, None), |(h, t)| (h, (!t.is_empty()).then_some(t)));
@ -125,9 +133,11 @@ impl VFolder {
/// - If the folder cannot be written /// - If the folder cannot be written
pub fn place(&self, path: &Path) -> io::Result<()> { pub fn place(&self, path: &Path) -> io::Result<()> {
fs::create_dir_all(path)?; fs::create_dir_all(path)?;
// place each subfolder recursively
for (name, folder) in &self.folders { for (name, folder) in &self.folders {
folder.place(&path.join(name))?; folder.place(&path.join(name))?;
} }
// create each file
for (name, file) in &self.files { for (name, file) in &self.files {
match file { match file {
VFile::Text(text) => { VFile::Text(text) => {
@ -149,10 +159,12 @@ impl VFolder {
pub fn zip(&self, path: &Path) -> io::Result<()> { pub fn zip(&self, path: &Path) -> io::Result<()> {
use io::Write; use io::Write;
// open target file
let file = fs::File::create(path)?; let file = fs::File::create(path)?;
let mut writer = ZipWriter::new(file); let mut writer = ZipWriter::new(file);
let virtual_files = self.flatten(); let virtual_files = self.flatten();
// write each file to the zip archive
for (path, file) in virtual_files { for (path, file) in virtual_files {
writer.start_file(path, zip::write::SimpleFileOptions::default())?; writer.start_file(path, zip::write::SimpleFileOptions::default())?;
match file { match file {
@ -232,8 +244,8 @@ impl TryFrom<&Path> for VFolder {
if path.is_dir() { if path.is_dir() {
root_vfolder.add_existing_folder(&name, Self::try_from(path.as_path())?); root_vfolder.add_existing_folder(&name, Self::try_from(path.as_path())?);
} else if path.is_file() { } else if path.is_file() {
let data = fs::read(path)?; let file = VFile::try_from(path.as_path())?;
root_vfolder.add_file(&name, VFile::Binary(data)); root_vfolder.add_file(&name, file);
} else { } else {
unreachable!("Path is neither file nor directory"); unreachable!("Path is neither file nor directory");
} }
@ -275,6 +287,15 @@ impl Default for VFile {
} }
} }
impl TryFrom<&Path> for VFile {
type Error = io::Error;
fn try_from(value: &Path) -> Result<Self, Self::Error> {
let data = fs::read(value)?;
Ok(Self::Binary(data))
}
}
#[cfg(test)] #[cfg(test)]
mod tests { mod tests {
use super::*; use super::*;