use crate::{ utility::NonGenericTypeInfoCell, DynamicInfo, Reflect, ReflectMut, ReflectRef, TypeInfo, Typed, }; use std::{ any::{Any, TypeId}, fmt::Debug, hash::{Hash, Hasher}, }; /// A static-sized array of [`Reflect`] items. /// /// This corresponds to types like `[T; N]` (arrays). /// /// Currently, this only supports arrays of up to 32 items. It can technically /// contain more than 32, but the blanket [`GetTypeRegistration`] is only /// implemented up to the 32 item limit due to a [limitation] on `Deserialize`. /// /// [`GetTypeRegistration`]: crate::GetTypeRegistration /// [limitation]: https://github.com/serde-rs/serde/issues/1937 pub trait Array: Reflect { /// Returns a reference to the element at `index`, or `None` if out of bounds. fn get(&self, index: usize) -> Option<&dyn Reflect>; /// Returns a mutable reference to the element at `index`, or `None` if out of bounds. fn get_mut(&mut self, index: usize) -> Option<&mut dyn Reflect>; /// Returns the number of elements in the collection. fn len(&self) -> usize; /// Returns `true` if the collection contains no elements. fn is_empty(&self) -> bool { self.len() == 0 } /// Returns an iterator over the collection. fn iter(&self) -> ArrayIter; /// Drain the elements of this array to get a vector of owned values. fn drain(self: Box) -> Vec>; fn clone_dynamic(&self) -> DynamicArray { DynamicArray { name: self.type_name().to_string(), values: self.iter().map(|value| value.clone_value()).collect(), } } } /// A container for compile-time array info. #[derive(Clone, Debug)] pub struct ArrayInfo { type_name: &'static str, type_id: TypeId, item_type_name: &'static str, item_type_id: TypeId, capacity: usize, } impl ArrayInfo { /// Create a new [`ArrayInfo`]. /// /// # Arguments /// /// * `capacity`: The maximum capacity of the underlying array. /// pub fn new(capacity: usize) -> Self { Self { type_name: std::any::type_name::(), type_id: TypeId::of::(), item_type_name: std::any::type_name::(), item_type_id: TypeId::of::(), capacity, } } /// The compile-time capacity of the array. pub fn capacity(&self) -> usize { self.capacity } /// The [type name] of the array. /// /// [type name]: std::any::type_name pub fn type_name(&self) -> &'static str { self.type_name } /// The [`TypeId`] of the array. pub fn type_id(&self) -> TypeId { self.type_id } /// Check if the given type matches the array type. pub fn is(&self) -> bool { TypeId::of::() == self.type_id } /// The [type name] of the array item. /// /// [type name]: std::any::type_name pub fn item_type_name(&self) -> &'static str { self.item_type_name } /// The [`TypeId`] of the array item. pub fn item_type_id(&self) -> TypeId { self.item_type_id } /// Check if the given type matches the array item type. pub fn item_is(&self) -> bool { TypeId::of::() == self.item_type_id } } /// A fixed-size list of reflected values. /// /// This differs from [`DynamicList`] in that the size of the [`DynamicArray`] /// is constant, whereas a [`DynamicList`] can have items added and removed. /// /// This isn't to say that a [`DynamicArray`] is immutable— its items /// can be mutated— just that the _number_ of items cannot change. /// /// [`DynamicList`]: crate::DynamicList #[derive(Debug)] pub struct DynamicArray { pub(crate) name: String, pub(crate) values: Box<[Box]>, } impl DynamicArray { #[inline] pub fn new(values: Box<[Box]>) -> Self { Self { name: String::default(), values, } } pub fn from_vec(values: Vec) -> Self { Self { name: String::default(), values: values .into_iter() .map(|field| Box::new(field) as Box) .collect::>() .into_boxed_slice(), } } #[inline] pub fn name(&self) -> &str { &self.name } #[inline] pub fn set_name(&mut self, name: String) { self.name = name; } } impl Reflect for DynamicArray { #[inline] fn type_name(&self) -> &str { self.name.as_str() } #[inline] fn get_type_info(&self) -> &'static TypeInfo { ::type_info() } #[inline] fn into_any(self: Box) -> Box { self } #[inline] fn as_any(&self) -> &dyn Any { self } #[inline] fn as_any_mut(&mut self) -> &mut dyn Any { self } #[inline] fn as_reflect(&self) -> &dyn Reflect { self } #[inline] fn as_reflect_mut(&mut self) -> &mut dyn Reflect { self } fn apply(&mut self, value: &dyn Reflect) { array_apply(self, value); } #[inline] fn set(&mut self, value: Box) -> Result<(), Box> { *self = value.take()?; Ok(()) } #[inline] fn reflect_ref(&self) -> ReflectRef { ReflectRef::Array(self) } #[inline] fn reflect_mut(&mut self) -> ReflectMut { ReflectMut::Array(self) } #[inline] fn clone_value(&self) -> Box { Box::new(self.clone_dynamic()) } #[inline] fn reflect_hash(&self) -> Option { array_hash(self) } fn reflect_partial_eq(&self, value: &dyn Reflect) -> Option { array_partial_eq(self, value) } } impl Array for DynamicArray { #[inline] fn get(&self, index: usize) -> Option<&dyn Reflect> { self.values.get(index).map(|value| &**value) } #[inline] fn get_mut(&mut self, index: usize) -> Option<&mut dyn Reflect> { self.values.get_mut(index).map(|value| &mut **value) } #[inline] fn len(&self) -> usize { self.values.len() } #[inline] fn iter(&self) -> ArrayIter { ArrayIter { array: self, index: 0, } } #[inline] fn drain(self: Box) -> Vec> { self.values.into_vec() } #[inline] fn clone_dynamic(&self) -> DynamicArray { DynamicArray { name: self.name.clone(), values: self .values .iter() .map(|value| value.clone_value()) .collect(), } } } impl Typed for DynamicArray { fn type_info() -> &'static TypeInfo { static CELL: NonGenericTypeInfoCell = NonGenericTypeInfoCell::new(); CELL.get_or_set(|| TypeInfo::Dynamic(DynamicInfo::new::())) } } /// An iterator over an [`Array`]. pub struct ArrayIter<'a> { pub(crate) array: &'a dyn Array, pub(crate) index: usize, } impl<'a> Iterator for ArrayIter<'a> { type Item = &'a dyn Reflect; #[inline] fn next(&mut self) -> Option { let value = self.array.get(self.index); self.index += 1; value } #[inline] fn size_hint(&self) -> (usize, Option) { let size = self.array.len(); (size, Some(size)) } } impl<'a> ExactSizeIterator for ArrayIter<'a> {} /// Returns the `u64` hash of the given [array](Array). #[inline] pub fn array_hash(array: &A) -> Option { let mut hasher = crate::ReflectHasher::default(); std::any::Any::type_id(array).hash(&mut hasher); array.len().hash(&mut hasher); for value in array.iter() { hasher.write_u64(value.reflect_hash()?); } Some(hasher.finish()) } /// Applies the reflected [array](Array) data to the given [array](Array). /// /// # Panics /// /// * Panics if the two arrays have differing lengths. /// * Panics if the reflected value is not a [valid array](ReflectRef::Array). /// #[inline] pub fn array_apply(array: &mut A, reflect: &dyn Reflect) { if let ReflectRef::Array(reflect_array) = reflect.reflect_ref() { if array.len() != reflect_array.len() { panic!("Attempted to apply different sized `Array` types."); } for (i, value) in reflect_array.iter().enumerate() { let v = array.get_mut(i).unwrap(); v.apply(value); } } else { panic!("Attempted to apply a non-`Array` type to an `Array` type."); } } /// Compares two [arrays](Array) (one concrete and one reflected) to see if they /// are equal. /// /// Returns [`None`] if the comparison couldn't even be performed. #[inline] pub fn array_partial_eq(array: &A, reflect: &dyn Reflect) -> Option { match reflect.reflect_ref() { ReflectRef::Array(reflect_array) if reflect_array.len() == array.len() => { for (a, b) in array.iter().zip(reflect_array.iter()) { let eq_result = a.reflect_partial_eq(b); if let failed @ (Some(false) | None) = eq_result { return failed; } } } _ => return Some(false), } Some(true) } /// The default debug formatter for [`Array`] types. /// /// # Example /// ``` /// use bevy_reflect::Reflect; /// /// let my_array: &dyn Reflect = &[1, 2, 3]; /// println!("{:#?}", my_array); /// /// // Output: /// /// // [ /// // 1, /// // 2, /// // 3, /// // ] /// ``` #[inline] pub fn array_debug(dyn_array: &dyn Array, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result { let mut debug = f.debug_list(); for item in dyn_array.iter() { debug.entry(&item as &dyn Debug); } debug.finish() }