use std::{ mem::MaybeUninit, ops::{Deref, Index}, }; /// A trait for states that can be read from like [`crate::Signal`], [`crate::GlobalSignal`], or [`crate::ReadOnlySignal`]. You may choose to accept this trait as a parameter instead of the concrete type to allow for more flexibility in your API. For example, instead of creating two functions, one that accepts a [`crate::Signal`] and one that accepts a [`crate::GlobalSignal`], you can create one function that accepts a [`Readable`] type. pub trait Readable { /// The target type of the reference. type Target: ?Sized + 'static; /// The type of the reference. type Ref: Deref; /// Map the reference to a new type. fn map_ref &U>(ref_: Self::Ref, f: F) -> Self::Ref; /// Try to map the reference to a new type. fn try_map_ref Option<&U>>( ref_: Self::Ref, f: F, ) -> Option>; /// Try to get the current value of the state. If this is a signal, this will subscribe the current scope to the signal. If the value has been dropped, this will panic. fn try_read(&self) -> Result, generational_box::BorrowError>; /// Get the current value of the state. If this is a signal, this will subscribe the current scope to the signal. If the value has been dropped, this will panic. #[track_caller] fn read(&self) -> Self::Ref { self.try_read().unwrap() } /// Get the current value of the state without subscribing to updates. If the value has been dropped, this will panic. fn peek(&self) -> Self::Ref; /// Clone the inner value and return it. If the value has been dropped, this will panic. #[track_caller] fn cloned(&self) -> Self::Target where Self::Target: Clone, { self.read().clone() } /// Run a function with a reference to the value. If the value has been dropped, this will panic. #[track_caller] fn with(&self, f: impl FnOnce(&Self::Target) -> O) -> O { f(&*self.read()) } /// Run a function with a reference to the value. If the value has been dropped, this will panic. #[track_caller] fn with_peek(&self, f: impl FnOnce(&Self::Target) -> O) -> O { f(&*self.peek()) } /// Index into the inner value and return a reference to the result. If the value has been dropped or the index is invalid, this will panic. #[track_caller] fn index(&self, index: I) -> Self::Ref<>::Output> where Self::Target: std::ops::Index, { Self::map_ref(self.read(), |v| v.index(index)) } #[doc(hidden)] fn deref_impl<'a>(&self) -> &'a dyn Fn() -> Self::Target where Self: Sized + 'a, Self::Target: Clone, { // https://github.com/dtolnay/case-studies/tree/master/callable-types // First we create a closure that captures something with the Same in memory layout as Self (MaybeUninit). let uninit_callable = MaybeUninit::::uninit(); // Then move that value into the closure. We assume that the closure now has a in memory layout of Self. let uninit_closure = move || Self::read(unsafe { &*uninit_callable.as_ptr() }).clone(); // Check that the size of the closure is the same as the size of Self in case the compiler changed the layout of the closure. let size_of_closure = std::mem::size_of_val(&uninit_closure); assert_eq!(size_of_closure, std::mem::size_of::()); // Then cast the lifetime of the closure to the lifetime of &self. fn cast_lifetime<'a, T>(_a: &T, b: &'a T) -> &'a T { b } let reference_to_closure = cast_lifetime( { // The real closure that we will never use. &uninit_closure }, // We transmute self into a reference to the closure. This is safe because we know that the closure has the same memory layout as Self so &Closure == &Self. unsafe { std::mem::transmute(self) }, ); // Cast the closure to a trait object. reference_to_closure as &_ } } /// An extension trait for Readable> that provides some convenience methods. pub trait ReadableVecExt: Readable> { /// Returns the length of the inner vector. #[track_caller] fn len(&self) -> usize { self.with(|v| v.len()) } /// Returns true if the inner vector is empty. #[track_caller] fn is_empty(&self) -> bool { self.with(|v| v.is_empty()) } /// Get the first element of the inner vector. #[track_caller] fn first(&self) -> Option> { Self::try_map_ref(self.read(), |v| v.first()) } /// Get the last element of the inner vector. #[track_caller] fn last(&self) -> Option> { Self::try_map_ref(self.read(), |v| v.last()) } /// Get the element at the given index of the inner vector. #[track_caller] fn get(&self, index: usize) -> Option> { Self::try_map_ref(self.read(), |v| v.get(index)) } /// Get an iterator over the values of the inner vector. #[track_caller] fn iter(&self) -> ReadableValueIterator<'_, T, Self> where Self: Sized, { ReadableValueIterator { index: 0, value: self, phantom: std::marker::PhantomData, } } } /// An iterator over the values of a `Readable>`. pub struct ReadableValueIterator<'a, T, R> { index: usize, value: &'a R, phantom: std::marker::PhantomData, } impl<'a, T: 'static, R: Readable>> Iterator for ReadableValueIterator<'a, T, R> { type Item = R::Ref; fn next(&mut self) -> Option { let index = self.index; self.index += 1; self.value.get(index) } } impl ReadableVecExt for R where T: 'static, R: Readable>, { } /// An extension trait for Readable> that provides some convenience methods. pub trait ReadableOptionExt: Readable> { /// Unwraps the inner value and clones it. #[track_caller] fn unwrap(&self) -> T where T: Clone, { self.as_ref().unwrap().clone() } /// Attempts to read the inner value of the Option. #[track_caller] fn as_ref(&self) -> Option> { Self::try_map_ref(self.read(), |v| v.as_ref()) } } impl ReadableOptionExt for R where T: 'static, R: Readable>, { }