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 289 290 291 292
//! Derived and computed data.
use std::cell::Cell;
use crate::*;
/// Creates a memoized computation from some signals.
/// The output is derived from all the signals that are used within the memo closure.
/// If any of the tracked signals are updated, the memo is also updated.
///
/// # Difference from derived signals
///
/// Derived signals (functions referencing signals) are lazy and do not keep track of the result
/// of the computation. This means that the computation will not be executed until needed.
/// This also means that calling the derived signal twice will result in the same computation
/// twice.
///
/// ```
/// # use sycamore_reactive::*;
/// # create_scope_immediate(|cx| {
/// let state = create_signal(cx, 0);
/// let double = || *state.get() * 2;
///
/// let _ = double();
/// // Here, the closure named double is called again.
/// // If the computation is expensive enough, this would be wasted work!
/// let _ = double();
/// # });
/// ```
///
/// Memos, on the other hand, are eagerly evaluated and will only run the computation when one
/// of its dependencies change.
///
/// Memos also incur a slightly higher performance penalty than simple derived signals.
///
/// # Example
/// ```
/// # use sycamore_reactive::*;
/// # create_scope_immediate(|cx| {
/// let state = create_signal(cx, 0);
/// let double = create_memo(cx, || *state.get() * 2);
///
/// assert_eq!(*double.get(), 0);
/// state.set(1);
/// assert_eq!(*double.get(), 2);
/// # });
/// ```
pub fn create_memo<'a, U: 'a>(cx: Scope<'a>, f: impl FnMut() -> U + 'a) -> &'a ReadSignal<U> {
create_selector_with(cx, f, |_, _| false)
}
/// Creates a memoized value from some signals.
/// Unlike [`create_memo`], this function will not notify dependents of a
/// change if the output is the same. That is why the output of the function must implement
/// [`PartialEq`].
///
/// To specify a custom comparison function, use
/// [`create_selector_with`].
///
/// # Example
/// ```
/// # use sycamore_reactive::*;
/// # create_scope_immediate(|cx| {
/// let state = create_signal(cx, 0);
/// let double = create_selector(cx, || *state.get() * 2);
///
/// assert_eq!(*double.get(), 0);
/// state.set(1);
/// assert_eq!(*double.get(), 2);
/// # });
/// ```
pub fn create_selector<'a, U: PartialEq + 'a>(
cx: Scope<'a>,
f: impl FnMut() -> U + 'a,
) -> &'a ReadSignal<U> {
create_selector_with(cx, f, PartialEq::eq)
}
/// Creates a memoized value from some signals.
/// Unlike [`create_memo`], this function will not notify dependents of a
/// change if the output is the same.
///
/// It takes a comparison function to compare the old and new value, which returns `true` if
/// they are the same and `false` otherwise.
///
/// To use the type's [`PartialEq`] implementation instead of a custom function, use
/// [`create_selector`].
pub fn create_selector_with<'a, U: 'a>(
cx: Scope<'a>,
mut f: impl FnMut() -> U + 'a,
eq_f: impl Fn(&U, &U) -> bool + 'a,
) -> &'a ReadSignal<U> {
let signal: &Cell<Option<&Signal<U>>> = create_ref(cx, Cell::new(None));
create_effect(cx, move || {
let new = f();
if let Some(signal) = signal.get() {
// Check if new value is different from old value.
if !eq_f(&new, &*signal.get_untracked()) {
signal.set(new)
}
} else {
signal.set(Some(create_signal(cx, new)))
}
});
signal.get().unwrap()
}
/// An alternative to [`create_signal`] that uses a reducer to get the next
/// value.
///
/// It uses a reducer function that takes the previous value and a message and returns the next
/// value.
///
/// Returns a [`ReadSignal`] and a dispatch function to send messages to the reducer.
///
/// # Params
/// * `initial` - The initial value of the state.
/// * `reducer` - A function that takes the previous value and a message and returns the next value.
///
/// # Example
/// ```
/// # use sycamore_reactive::*;
/// enum Msg {
/// Increment,
/// Decrement,
/// }
///
/// # create_scope_immediate(|cx| {
/// let (state, dispatch) = create_reducer(cx, 0, |state, msg: Msg| match msg {
/// Msg::Increment => *state + 1,
/// Msg::Decrement => *state - 1,
/// });
///
/// assert_eq!(*state.get(), 0);
/// dispatch(Msg::Increment);
/// assert_eq!(*state.get(), 1);
/// dispatch(Msg::Decrement);
/// assert_eq!(*state.get(), 0);
/// # });
/// ```
pub fn create_reducer<'a, U, Msg>(
cx: Scope<'a>,
initial: U,
reduce: impl Fn(&U, Msg) -> U + 'a,
) -> (&'a ReadSignal<U>, impl Fn(Msg) + 'a) {
let memo = create_signal(cx, initial);
let dispatcher = move |msg| {
memo.set(reduce(&memo.get_untracked(), msg));
};
(memo, dispatcher)
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn memo() {
create_scope_immediate(|cx| {
let state = create_signal(cx, 0);
let double = create_memo(cx, || *state.get() * 2);
assert_eq!(*double.get(), 0);
state.set(1);
assert_eq!(*double.get(), 2);
state.set(2);
assert_eq!(*double.get(), 4);
});
}
/// Make sure value is memoized rather than executed on demand.
#[test]
fn memo_only_run_once() {
create_scope_immediate(|cx| {
let state = create_signal(cx, 0);
let counter = create_signal(cx, 0);
let double = create_memo(cx, || {
counter.set(*counter.get_untracked() + 1);
*state.get() * 2
});
assert_eq!(*counter.get(), 1); // once for calculating initial derived state
state.set(2);
assert_eq!(*counter.get(), 2);
assert_eq!(*double.get(), 4);
assert_eq!(*counter.get(), 2); // should still be 2 after access
});
}
#[test]
fn dependency_on_memo() {
create_scope_immediate(|cx| {
let state = create_signal(cx, 0);
let double = create_memo(cx, || *state.get() * 2);
let quadruple = create_memo(cx, || *double.get() * 2);
assert_eq!(*quadruple.get(), 0);
state.set(1);
assert_eq!(*quadruple.get(), 4);
});
}
#[test]
fn untracked_memo() {
create_scope_immediate(|cx| {
let state = create_signal(cx, 1);
let double = create_memo(cx, || *state.get_untracked() * 2);
assert_eq!(*double.get(), 2);
state.set(2);
assert_eq!(*double.get(), 2); // double value should still be true because state.get()
// was
// inside untracked
});
}
#[test]
fn selector() {
create_scope_immediate(|cx| {
let state = create_signal(cx, 0);
let double = create_selector(cx, || *state.get() * 2);
let counter = create_signal(cx, 0);
create_effect(cx, || {
counter.set(*counter.get_untracked() + 1);
double.track();
});
assert_eq!(*double.get(), 0);
assert_eq!(*counter.get(), 1);
state.set(0);
assert_eq!(*double.get(), 0);
assert_eq!(*counter.get(), 1); // calling set_state should not trigger the effect
state.set(2);
assert_eq!(*double.get(), 4);
assert_eq!(*counter.get(), 2);
});
}
#[test]
fn reducer() {
create_scope_immediate(|cx| {
enum Msg {
Increment,
Decrement,
}
let (state, dispatch) = create_reducer(cx, 0, |state, msg: Msg| match msg {
Msg::Increment => *state + 1,
Msg::Decrement => *state - 1,
});
assert_eq!(*state.get(), 0);
dispatch(Msg::Increment);
assert_eq!(*state.get(), 1);
dispatch(Msg::Decrement);
assert_eq!(*state.get(), 0);
dispatch(Msg::Increment);
dispatch(Msg::Increment);
assert_eq!(*state.get(), 2);
});
}
#[test]
fn memo_reducer() {
create_scope_immediate(|cx| {
enum Msg {
Increment,
Decrement,
}
let (state, dispatch) = create_reducer(cx, 0, |state, msg: Msg| match msg {
Msg::Increment => *state + 1,
Msg::Decrement => *state - 1,
});
let doubled = create_memo(cx, || *state.get() * 2);
assert_eq!(*doubled.get(), 0);
dispatch(Msg::Increment);
assert_eq!(*doubled.get(), 2);
dispatch(Msg::Decrement);
assert_eq!(*doubled.get(), 0);
});
}
}