max/macroconf
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

implement TreeAny

Browse Source
This commit is contained in:
Max Känner 2024-07-25 13:09:18 +02:00
parent 14ce7ba845
commit 9fb96bd2c3
1 changed files with 35 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
src/lib.rs
View File

@ -159,7 +159,7 @@ fn generate_helper_struct(
let tree_key = generate_tree_key(&new_type_ident, new_type_miniconf_names.iter());
let tree_serialize = generate_tree_serialize(&new_type_ident, &new_type_miniconf_consts[..]);
let tree_deserialize = generate_tree_deserialize(&new_type_ident, miniconf_fields);
let tree_any = generate_tree_any(&new_type_ident);
let tree_any = generate_tree_any(&new_type_ident, &new_type_miniconf_consts, miniconf_fields);
Some(quote! {
#[allow(clippy::derive_partial_eq_without_eq)]
@ -522,7 +522,7 @@ fn generate_tree_deserialize(ident: &Ident, num_keys: usize) -> TokenStream2 {
};
let index = ::miniconf::Key::find::<Self>(&key).ok_or(::miniconf::Traversal::NotFound(1))?;
if !keys.finalize() {
::core::result::Result::Err(miniconf::Traversal::TooLong(1))?;
::core::result::Result::Err(::miniconf::Traversal::TooLong(1))?;
}
match index {
0 => ::miniconf::Error::increment_result((||{
@ -537,21 +537,49 @@ fn generate_tree_deserialize(ident: &Ident, num_keys: usize) -> TokenStream2 {
}
}
fn generate_tree_any(ident: &Ident) -> TokenStream2 {
fn generate_tree_any(ident: &Ident, consts: &[Ident], num_keys: usize) -> TokenStream2 {
let matches = consts.iter().enumerate().map(|(i, ident)| {
let index = i + 1;
quote! {
#index => ::core::result::Result::Ok(&Self::#ident),
}
});
quote! {
impl ::miniconf::TreeAny<1> for #ident {
fn ref_any_by_key<K>(&self, keys: K) -> Result<&dyn ::core::any::Any, ::miniconf::Traversal>
fn ref_any_by_key<K>(&self, mut keys: K) -> ::core::result::Result<&dyn ::core::any::Any, ::miniconf::Traversal>
where
K: ::miniconf::Keys,
{
unimplemented!();
let ::core::result::Result::Ok(key) = keys.next::<Self>() else {
return ::core::result::Result::Ok(&self.0);
};
let index = ::miniconf::Key::find::<Self>(&key).ok_or(miniconf::Traversal::NotFound(1))?;
if !keys.finalize() {
::core::result::Result::Err(::miniconf::Traversal::TooLong(1))?;
}
match index {
0 => ::core::result::Result::Ok(&self.0),
#(#matches)*
_ => unreachable!(),
}
}
fn mut_any_by_key<K>(&mut self, keys: K) -> Result<&mut dyn ::core::any::Any, ::miniconf::Traversal>
fn mut_any_by_key<K>(&mut self, mut keys: K) -> ::core::result::Result<&mut dyn ::core::any::Any, ::miniconf::Traversal>
where
K: ::miniconf::Keys,
{
unimplemented!();
let ::core::result::Result::Ok(key) = keys.next::<Self>() else {
return ::core::result::Result::Ok(&mut self.0);
};
let index = ::miniconf::Key::find::<Self>(&key).ok_or(::miniconf::Traversal::NotFound(1))?;
if !keys.finalize() {
::core::result::Result::Err(::miniconf::Traversal::TooLong(1))?;
}
match index {
0 => ::core::result::Result::Ok(&mut self.0),
1..=#num_keys => ::core::result::Result::Err(::miniconf::Traversal::Absent(0)),
_ => unreachable!(),
}
}
}
}