1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288
use crate::{ error::Result, schema::*, types::{self, static_objects, AttrStr, ObjectRef, TupleRef}, }; use indexmap::IndexMap; use std::collections::HashMap; fn collect_members(mems: &IndexMap<String, FieldSchema>) -> (IndexMap<String, FieldSchema>, bool) { let mut has_flatten = false; let mems = mems .iter() .flat_map(|(key, field)| { if field.attr.flatten { match &field.schema { Schema::Class(cls) => { has_flatten = true; return collect_members(&cls.fields).0; } _ => {} } } let mut map = IndexMap::new(); map.insert(key.to_string(), field.clone()); map }) .collect(); (mems, has_flatten) } fn collect_flatten_members(mems: &IndexMap<String, FieldSchema>) -> IndexMap<String, FieldSchema> { let (mems, has_flatten) = collect_members(mems); if has_flatten { mems } else { IndexMap::new() } } fn convert_stringcase(s: &str, case: Option<StrCase>) -> String { use inflections::Inflect; match case { Some(StrCase::Lower) => s.to_lower_case(), Some(StrCase::Upper) => s.to_upper_case(), Some(StrCase::Pascal) => s.to_pascal_case(), Some(StrCase::Camel) => s.to_camel_case(), Some(StrCase::Snake) => s.to_snake_case(), Some(StrCase::ScreamingSnake) => s.to_constant_case(), Some(StrCase::Kebab) => s.to_kebab_case(), Some(StrCase::ScreamingKebab) => s.to_kebab_case().to_upper_case(), None => s.into(), } } lazy_static::lazy_static! { static ref SCHEMA_CACHE: AttrStr = AttrStr::new("__perde_schema__"); static ref DATACLASS_FIELDS: AttrStr = AttrStr::new("__dataclass_fields__"); static ref ATTR_NAME: AttrStr = AttrStr::new("name"); static ref ATTR_TYPE: AttrStr = AttrStr::new("type"); static ref ATTR_METADATA: AttrStr = AttrStr::new("metadata"); static ref ATTR_VALUE: AttrStr = AttrStr::new("value"); static ref ATTR_ARGS: AttrStr = AttrStr::new("__args__"); static ref ATTR_ORIGIN: AttrStr = AttrStr::new("__origin__"); } pub fn resolve_schema<'a>( p: &'a ObjectRef, attr: Option<HashMap<&str, &ObjectRef>>, ) -> Result<&'a Schema> { match p.get_capsule(&SCHEMA_CACHE) { Ok(p) => return Ok(p), _ => {} } if p.is_bool() { Ok(&static_schema().boolean) } else if p.is_str() { Ok(&static_schema().string) } else if p.is_int() { Ok(&static_schema().int) } else if p.is_float() { Ok(&static_schema().float) } else if p.is_bytes() { Ok(&static_schema().bytes) } else if p.is_bytearray() { Ok(&static_schema().bytearray) } else if p.is_dict() { Ok(&static_schema().dict) } else if p.is_list() { Ok(&static_schema().list) } else if p.is_set() { Ok(&static_schema().set) } else if let Some(s) = maybe_dataclass(p, &attr)? { p.set_capsule(&SCHEMA_CACHE, s) } else if let Some(s) = maybe_generic(p)? { p.set_capsule(&SCHEMA_CACHE, s) } else if let Some(s) = maybe_enum(p, &attr)? { p.set_capsule(&SCHEMA_CACHE, s) } else { bail!("unsupported type") } } pub fn to_schema(p: &ObjectRef) -> Result<Schema> { resolve_schema(p, None).map(|s| s.clone()) } fn maybe_dataclass( p: &ObjectRef, attr: &Option<HashMap<&str, &ObjectRef>>, ) -> Result<Option<Schema>> { if !p.has_attr(&DATACLASS_FIELDS) { return Ok(None); } let cattr = ClassAttr::parse(attr)?; let arg = types::Tuple::one(p)?; let fields = static_objects()?.fields.call(arg)?; let fields = types::Tuple::from(fields); let mut members = IndexMap::new(); for i in 0..fields.len() { let field = fields.getref(i)?; let name = field.get_attr(&ATTR_NAME)?; let ty = field.get_attr(&ATTR_TYPE)?; let metadata = field.get_attr(&ATTR_METADATA)?; let fattr = if metadata.is_none() { None } else { Some(metadata.as_ref()) }; let fattr = FieldAttr::parse(&fattr)?; let s = name.as_str()?; let name = if let Some(renamed) = &fattr.rename { renamed.to_owned() } else { convert_stringcase(s, cattr.rename_all) }; let mem = FieldSchema::new(AttrStr::new(s), i as usize, fattr, to_schema(ty.as_ref())?); members.insert(name, mem); } let name = p.name(); let class = types::Class::new(p.owned()); let flatten_members = collect_flatten_members(&members); if !flatten_members.is_empty() { println!("{:#?}", flatten_members); } Ok(Some(Schema::Class(Class::new( class, name.into(), cattr, members, flatten_members, )))) } fn maybe_enum(p: &ObjectRef, attr: &Option<HashMap<&str, &ObjectRef>>) -> Result<Option<Schema>> { if !p.is_instance(static_objects()?.enum_meta.as_ptr()) { return Ok(None); } let iter = p.get_iter()?; let variants: Result<_> = iter .map(|item| { let name = item.get_attr(&ATTR_NAME)?; let value = item.get_attr(&ATTR_VALUE)?; let name = name.as_str()?; Ok(( name.to_string(), VariantSchema::new(name.into(), VariantAttr::default(), value), )) }) .collect(); Ok(Some(Schema::Enum(Enum::new( EnumAttr::parse(&attr)?, variants?, )))) } fn maybe_option(args: TupleRef) -> Result<Schema> { let t1 = args.get(0)?; let t2 = args.get(1)?; let s = if t1.is_none_type() { let t = to_schema(t2)?; Schema::Optional(Optional::new(Box::new(t))) } else if t2.is_none_type() { let t = to_schema(t1)?; Schema::Optional(Optional::new(Box::new(t))) } else { Schema::Union(Union::new(vec![to_schema(t1)?, to_schema(t2)?])) }; Ok(s) } fn to_union(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let iter = args.iter(); if iter.len() == 2 { return maybe_option(args); } let variants: Result<Vec<_>> = iter.map(|arg| to_schema(arg)).collect(); Ok(Schema::Union(Union::new(variants?))) } fn to_tuple(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let iter = args.iter(); let args: Result<_> = iter.map(|arg| to_schema(arg)).collect(); Ok(Schema::Tuple(Tuple::new(args?))) } fn to_dict(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let key = to_schema(args.get(0)?)?; let value = to_schema(args.get(1)?)?; Ok(Schema::Dict(Dict::new(Box::new(key), Box::new(value)))) } fn to_list(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let value = to_schema(args.get(0)?)?; Ok(Schema::List(List::new(Box::new(value)))) } fn to_set(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let value = to_schema(args.get(1)?)?; Ok(Schema::Set(Set::new(Box::new(value)))) } fn to_frozen_set(p: &ObjectRef) -> Result<Schema> { let args = get_args(p)?; let args = args.as_ref(); let value = to_schema(args.get(1)?)?; Ok(Schema::FrozenSet(FrozenSet::new(Box::new(value)))) } fn get_args(p: &ObjectRef) -> Result<types::Tuple> { Ok(types::Tuple::from(p.get_attr(&ATTR_ARGS)?)) } fn maybe_generic(p: &ObjectRef) -> Result<Option<Schema>> { if !p.is_instance(static_objects()?.generic_alias.as_ptr()) { return Ok(None); } let origin = p.get_attr(&ATTR_ORIGIN)?; let s = if origin.is(static_objects()?.union.as_ptr()) { to_union(p)? } else if origin.is(static_objects()?.tuple.as_ptr()) { to_tuple(p)? } else if origin.is_dict() { to_dict(p)? } else if origin.is_set() { to_set(p)? } else if origin.is_list() { to_list(p)? } else if origin.is_fronzen_set() { to_frozen_set(p)? } else { return Ok(None); }; Ok(Some(s)) }