pub struct Memo<T, S = SyncStorage>where
S: Storage<T>,{ /* private fields */ }Expand description
A memo is an efficient derived reactive value based on other reactive values.
Unlike a “derived signal,” a memo comes with two guarantees:
- The memo will only run once per change, no matter how many times you access its value.
- The memo will only notify its dependents if the value of the computation changes.
This makes a memo the perfect tool for expensive computations.
Memos have a certain overhead compared to derived signals. In most cases, you should create a derived signal. But if the derivation calculation is expensive, you should create a memo.
Memos are lazy: they do not run at all until they are read for the first time, and they will not re-run the calculation when a source signal changes until they are read again.
This is an arena-allocated type, which is Copy and is disposed when its reactive
Owner cleans up. For a reference-counted signal that lives as
as long as a reference to it is alive, see ArcMemo.
let (value, set_value) = signal(0);
// 🆗 we could create a derived signal with a simple function
let double_value = move || value.get() * 2;
set_value.set(2);
assert_eq!(double_value(), 4);
// but imagine the computation is really expensive
let expensive = move || really_expensive_computation(value.get()); // lazy: doesn't run until called
Effect::new(move |_| {
// 🆗 run #1: calls `really_expensive_computation` the first time
println!("expensive = {}", expensive());
});
Effect::new(move |_| {
// ❌ run #2: this calls `really_expensive_computation` a second time!
let value = expensive();
// do something else...
});
// instead, we create a memo
// 🆗 run #1: the calculation runs once immediately
let memoized = Memo::new(move |_| really_expensive_computation(value.get()));
Effect::new(move |_| {
// 🆗 reads the current value of the memo
// can be `memoized()` on nightly
println!("memoized = {}", memoized.get());
});
Effect::new(move |_| {
// ✅ reads the current value **without re-running the calculation**
let value = memoized.get();
// do something else...
});§Core Trait Implementations
.get()clones the current value of the memo. If you call it within an effect, it will cause that effect to subscribe to the memo, and to re-run whenever the value of the memo changes..get_untracked()clones the value of the memo without reactively tracking it.
.read()returns a guard that allows accessing the value of the memo by reference. If you call it within an effect, it will cause that effect to subscribe to the memo, and to re-run whenever the value of the memo changes..read_untracked()gives access to the current value of the memo without reactively tracking it.
.with()allows you to reactively access the memo’s value without cloning by applying a callback function..with_untracked()allows you to access the memo’s value by applying a callback function without reactively tracking it.
.to_stream()converts the memo to anasyncstream of values.::from_stream()converts anasyncstream of values into a memo containing the latest value.
Implementations§
Source§impl<T> Memo<T>
impl<T> Memo<T>
Sourcepub fn new(fun: impl Fn(Option<&T>) -> T + Send + Sync + 'static) -> Selfwhere
T: PartialEq,
pub fn new(fun: impl Fn(Option<&T>) -> T + Send + Sync + 'static) -> Selfwhere
T: PartialEq,
Creates a new memoized, computed reactive value.
As with an Effect, the argument to the memo function is the previous value,
i.e., the current value of the memo, which will be None for the initial calculation.
let (value, set_value) = signal(0);
// the memo will reactively update whenever `value` changes
let memoized =
Memo::new(move |_| really_expensive_computation(value.get()));Sourcepub fn new_with_compare(
fun: impl Fn(Option<&T>) -> T + Send + Sync + 'static,
changed: fn(Option<&T>, Option<&T>) -> bool,
) -> Self
pub fn new_with_compare( fun: impl Fn(Option<&T>) -> T + Send + Sync + 'static, changed: fn(Option<&T>, Option<&T>) -> bool, ) -> Self
Creates a new memo with a custom comparison function. By default, memos simply use
PartialEq to compare the previous value to the new value. Passing a custom comparator
allows you to compare the old and new values using any criteria.
changed should be a function that returns true if the new value is different from the
old value.
Sourcepub fn new_owning(
fun: impl Fn(Option<T>) -> (T, bool) + Send + Sync + 'static,
) -> Self
pub fn new_owning( fun: impl Fn(Option<T>) -> (T, bool) + Send + Sync + 'static, ) -> Self
Creates a new memo by passing a function that computes the value.
Unlike Memo::new, this receives ownership of the previous value. As a result, it
must return both the new value and a bool that is true if the value has changed.
This is lazy: the function will not be called until the memo’s value is read for the first time.
Trait Implementations§
Source§impl<T, S> DefinedAt for Memo<T, S>where
S: Storage<T>,
impl<T, S> DefinedAt for Memo<T, S>where
S: Storage<T>,
Source§fn defined_at(&self) -> Option<&'static Location<'static>>
fn defined_at(&self) -> Option<&'static Location<'static>>
None in
release mode.Source§impl<T> From<ArcMemo<T>> for Memo<T>
impl<T> From<ArcMemo<T>> for Memo<T>
Source§fn from(value: ArcMemo<T, SyncStorage>) -> Self
fn from(value: ArcMemo<T, SyncStorage>) -> Self
Source§impl<T> From<ArcReadSignal<T>> for Memo<T>
impl<T> From<ArcReadSignal<T>> for Memo<T>
Source§fn from(value: ArcReadSignal<T>) -> Self
fn from(value: ArcReadSignal<T>) -> Self
Source§impl<T> From<Memo<Option<T>, LocalStorage>> for MaybeProp<T, LocalStorage>
impl<T> From<Memo<Option<T>, LocalStorage>> for MaybeProp<T, LocalStorage>
Source§impl<T> From<Memo<T>> for MaybeSignal<T>
impl<T> From<Memo<T>> for MaybeSignal<T>
Source§impl<T> From<Memo<T, LocalStorage>> for MaybeProp<T, LocalStorage>
impl<T> From<Memo<T, LocalStorage>> for MaybeProp<T, LocalStorage>
Source§fn from(value: Memo<T, LocalStorage>) -> Self
fn from(value: Memo<T, LocalStorage>) -> Self
Source§impl<T> From<Memo<T, LocalStorage>> for MaybeSignal<T, LocalStorage>
impl<T> From<Memo<T, LocalStorage>> for MaybeSignal<T, LocalStorage>
Source§fn from(value: Memo<T, LocalStorage>) -> Self
fn from(value: Memo<T, LocalStorage>) -> Self
Source§impl<T> From<Memo<T, LocalStorage>> for Signal<T, LocalStorage>where
T: 'static,
impl<T> From<Memo<T, LocalStorage>> for Signal<T, LocalStorage>where
T: 'static,
Source§fn from(value: Memo<T, LocalStorage>) -> Self
fn from(value: Memo<T, LocalStorage>) -> Self
Source§impl<T> FromLocal<ArcMemo<T, LocalStorage>> for Memo<T, LocalStorage>where
T: 'static,
impl<T> FromLocal<ArcMemo<T, LocalStorage>> for Memo<T, LocalStorage>where
T: 'static,
Source§fn from_local(value: ArcMemo<T, LocalStorage>) -> Self
fn from_local(value: ArcMemo<T, LocalStorage>) -> Self
Source§impl<T, S> ReadUntracked for Memo<T, S>
impl<T, S> ReadUntracked for Memo<T, S>
Source§type Value = ReadGuard<T, Mapped<Plain<Option<<S as Storage<T>>::Wrapped>>, T>>
type Value = ReadGuard<T, Mapped<Plain<Option<<S as Storage<T>>::Wrapped>>, T>>
Source§fn try_read_untracked(&self) -> Option<Self::Value>
fn try_read_untracked(&self) -> Option<Self::Value>
None if the signal has already been disposed.Source§fn read_untracked(&self) -> Self::Value
fn read_untracked(&self) -> Self::Value
Source§fn custom_try_read(&self) -> Option<Option<Self::Value>>
fn custom_try_read(&self) -> Option<Option<Self::Value>>
Read::try_read implementation despite it being auto implemented. Read moreimpl<T, S> Copy for Memo<T, S>where
S: Storage<T>,
impl<T, S> Eq for Memo<T, S>where
S: Storage<T>,
Auto Trait Implementations§
impl<T, S> Freeze for Memo<T, S>
impl<T, S> RefUnwindSafe for Memo<T, S>
impl<T, S> Send for Memo<T, S>
impl<T, S> Sync for Memo<T, S>
impl<T, S> Unpin for Memo<T, S>
impl<T, S> UnwindSafe for Memo<T, S>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.Source§impl<S, T> FromStream<T> for S
impl<S, T> FromStream<T> for S
Source§fn from_stream(stream: impl Stream<Item = T> + Send + 'static) -> S
fn from_stream(stream: impl Stream<Item = T> + Send + 'static) -> S
Source§fn from_stream_unsync(stream: impl Stream<Item = T> + 'static) -> S
fn from_stream_unsync(stream: impl Stream<Item = T> + 'static) -> S
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> Read for Twhere
T: Track + ReadUntracked,
impl<T> Read for Twhere
T: Track + ReadUntracked,
Source§impl<T> StorageAccess<T> for T
impl<T> StorageAccess<T> for T
Source§fn as_borrowed(&self) -> &T
fn as_borrowed(&self) -> &T
Source§fn into_taken(self) -> T
fn into_taken(self) -> T
Source§impl<T> With for Twhere
T: Read,
impl<T> With for Twhere
T: Read,
Source§type Value = <<T as Read>::Value as Deref>::Target
type Value = <<T as Read>::Value as Deref>::Target
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
Source§impl<T> WithUntracked for Twhere
T: DefinedAt + ReadUntracked,
impl<T> WithUntracked for Twhere
T: DefinedAt + ReadUntracked,
Source§type Value = <<T as ReadUntracked>::Value as Deref>::Target
type Value = <<T as ReadUntracked>::Value as Deref>::Target
Source§fn try_with_untracked<U>(
&self,
fun: impl FnOnce(&<T as WithUntracked>::Value) -> U,
) -> Option<U>
fn try_with_untracked<U>( &self, fun: impl FnOnce(&<T as WithUntracked>::Value) -> U, ) -> Option<U>
None if the signal has already been disposed.