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 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047
//! moxie aims to empower everyone to build reliable and efficient human
//! interfaces.
//!
//! moxie supports incremental "declarative" Rust code for interactive systems.
//! It comes with a lightweight event loop runtime that supports granular
//! reuse of arbitrary work, state change notifications, and async loaders.
//!
//! Most users of this crate will do so through a "moxie embedding" like
//! [moxie-dom] which is responsible for integrating moxie with a broader
//! environment. The functions in this module are applicable to any moxie
//! embedding but end users should not expect to set up their own embedding (see
//! the [`runtime`] module for information on embeddings).
//!
//! ## Revisions
//!
//! The [`runtime::Revision`] is a core concept for a moxie
//! [`runtime::Runtime`]: it's the notion of time passing. In typical
//! embeddings, every frame results in a new revision.
//!
//! ## Topologically nested functions
//!
//! The functions in this module are intended to be called repeatedly, possibly
//! on every revision. The results returned must be **stable across revisions**,
//! so we use the [topo] crate to provide stable cache keys for each invocation.
//! Each function in the root module is annotated with `#[topo::nested]` and
//! will inherit the [`topo::CallId`] within which it's called.
//!
//! ## Caching
//!
//! Nearly all UIs benefit from reusing results between frames, in moxie this is
//! supported by the [`cache`], [`cache_with`], [`once`], and [`once_with`]
//! functions. Values returned from cached closures are available in subsequent
//! [`runtime::Revision`]s at the same callsite and are dropped from the cache
//! at the end of the first revision where they were not used.
//!
//! ## State
//!
//! State variables are stored in the cache and can be mutated in between
//! revisions. They are declared with the [`cache_state`] and [`state`]
//! functions which return a [`Commit`] for reading the current value and a
//! [`Key`] for updating it. Updates to state variables wake the runtime,
//! initiating a new revision.
//!
//! ## Loading Futures
//!
//! Futures can be "loaded" by the runtime using the [`load`], [`load_with`],
//! [`load_once`], and [`load_once_with`] functions. These functions ensure the
//! future is spawned to an async executor and return its status on every
//! revision. When the future has completed, `Poll::Ready` is returned on
//! each revision. If a revision occurs without referencing the pending future,
//! the task is cancelled.
//!
//! [moxie-dom]: https://docs.rs/moxie-dom
//! [topo]: https://docs.rs/topo/
#![forbid(unsafe_code)]
#![deny(clippy::all, missing_docs)]
pub mod runtime;
pub mod testing;
use crate::runtime::{Context, Var};
use parking_lot::Mutex;
use std::{
borrow::Borrow,
fmt::{Debug, Display, Formatter, Result as FmtResult},
future::Future,
hash::{Hash, Hasher},
ops::Deref,
sync::Arc,
task::Poll,
};
use topo::CallId;
/// Cache the return of the `init` function.
///
/// If the cache has a stored `(Input, Output)` for the current [`topo::CallId`]
/// and if `arg` is equal to the stored `Input`, marks the value as alive in the
/// cache and returns the result of calling `with` on the stored `Output`.
///
/// Otherwise, calls `arg.to_owned()` to get an `Input` and calls `init` to get
/// an `Output`. It calls `with` on the `Output` to get a `Ret` value, stores
/// the `(Input, Output)` in the cache, and returns `Ret`.
///
/// # Example
///
/// ```
/// use moxie::{cache_with, runtime::RunLoop, testing::CountsClones};
/// use std::sync::atomic::{AtomicU64, Ordering};
///
/// let epoch = AtomicU64::new(0);
/// let num_created = AtomicU64::new(0);
///
/// // this runtime holds a single state variable
/// // which is reinitialized whenever we change `epoch` above
/// let mut rt = RunLoop::new(|| {
/// let cached = cache_with(
/// &epoch.load(Ordering::Relaxed),
/// |_| {
/// num_created.fetch_add(1, Ordering::Relaxed);
/// CountsClones::default()
/// },
/// // this makes it equivalent to calling moxie::once(...)
/// CountsClones::clone,
/// );
///
/// (num_created.load(Ordering::Relaxed), cached.clone_count())
/// });
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 1, "the first value is always cached");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
///
/// epoch.store(1, Ordering::Relaxed); // invalidates the cache
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 2, "reinitialized once after epoch changed");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn cache_with<Arg, Input, Output, Ret>(
arg: &Arg,
init: impl FnOnce(&Input) -> Output,
with: impl FnOnce(&Output) -> Ret,
) -> Ret
where
Arg: PartialEq<Input> + ToOwned<Owned = Input> + ?Sized,
Input: Borrow<Arg> + 'static,
Output: 'static,
Ret: 'static,
{
rt.cache.cache_with(&CallId::current(), arg, init, with)
}
/// Caches `init` once in the current [`topo::CallId`]. Runs `with` on every
/// [`runtime::Revision`].
///
/// # Example
///
/// ```
/// use moxie::{once_with, runtime::RunLoop, testing::CountsClones};
/// use std::sync::atomic::{AtomicU64, Ordering};
///
/// let num_created = AtomicU64::new(0);
/// let mut rt = RunLoop::new(|| {
/// let cached = once_with(
/// || {
/// num_created.fetch_add(1, Ordering::Relaxed);
/// CountsClones::default()
/// },
/// // this makes it equivalent to calling moxie::once(...)
/// CountsClones::clone,
/// );
/// (num_created.load(Ordering::Relaxed), cached.clone_count())
/// });
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 1, "the first value is always cached");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn once_with<Output, Ret>(
init: impl FnOnce() -> Output,
with: impl FnOnce(&Output) -> Ret,
) -> Ret
where
Output: 'static,
Ret: 'static,
{
rt.cache.cache_with(&CallId::current(), &(), |&()| init(), with)
}
/// Memoizes `init` at this callsite, cloning a cached `Output` if it exists and
/// `Input` is the same as when the stored value was created.
///
/// `init` takes a reference to `Input` so that the cache can
/// compare future calls' arguments against the one used to produce the stored
/// value.
///
/// # Example
///
/// ```
/// use moxie::{cache, runtime::RunLoop, testing::CountsClones};
/// use std::sync::atomic::{AtomicU64, Ordering};
///
/// let epoch = AtomicU64::new(0);
/// let num_created = AtomicU64::new(0);
///
/// // this runtime holds a single state variable
/// // which is reinitialized whenever we change `epoch` above
/// let mut rt = RunLoop::new(|| {
/// let cached = cache(&epoch.load(Ordering::Relaxed), |_| {
/// num_created.fetch_add(1, Ordering::Relaxed);
/// CountsClones::default()
/// });
///
/// (num_created.load(Ordering::Relaxed), cached.clone_count())
/// });
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 1, "the first value is always cached");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
///
/// epoch.store(1, Ordering::Relaxed);
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 2, "reinitialized once after epoch changed");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn cache<Arg, Input, Output>(arg: &Arg, init: impl FnOnce(&Input) -> Output) -> Output
where
Arg: PartialEq<Input> + ToOwned<Owned = Input> + ?Sized,
Input: Borrow<Arg> + 'static,
Output: Clone + 'static,
{
rt.cache.cache(&CallId::current(), arg, init)
}
/// Runs `init` once per [`topo::CallId`]. The provided value
/// will always be cloned on subsequent calls unless first dropped from storage
/// before being re-initialized.
///
/// # Example
///
/// ```
/// use moxie::{once, runtime::RunLoop, testing::CountsClones};
/// use std::sync::atomic::{AtomicU64, Ordering};
///
/// let num_created = AtomicU64::new(0);
/// let mut rt = RunLoop::new(|| {
/// let cached = once(|| {
/// num_created.fetch_add(1, Ordering::Relaxed);
/// CountsClones::default()
/// });
/// (num_created.load(Ordering::Relaxed), cached.clone_count())
/// });
///
/// for i in 1..1_000 {
/// let (num_created, num_clones) = rt.run_once();
/// assert_eq!(num_created, 1, "the first value is always cached");
/// assert_eq!(num_clones, i, "cloned once per revision");
/// }
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn once<Output>(init: impl FnOnce() -> Output) -> Output
where
Output: Clone + 'static,
{
rt.cache.cache(&CallId::current(), &(), |()| init())
}
/// Root a state variable at this callsite, returning a [`Key`] to the state
/// variable.
///
/// # Example
///
/// ```
/// use futures::task::waker;
/// use moxie::{runtime::RunLoop, state, testing::BoolWaker};
///
/// // this runtime holds a single state variable
/// let mut rt = RunLoop::new(|| state(|| 0u64));
///
/// let track_wakes = BoolWaker::new();
/// rt.set_state_change_waker(waker(track_wakes.clone()));
///
/// let (first_commit, first_key) = rt.run_once();
/// assert_eq!(*first_commit, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.set(0); // this is a no-op
/// assert_eq!(*first_key, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.set(1);
/// assert_eq!(*first_key, 0, "update only enqueued, not yet committed");
/// assert!(track_wakes.is_woken());
///
/// let (second_commit, second_key) = rt.run_once(); // this commits the pending update
/// assert_eq!(*second_key, 1);
/// assert_eq!(*second_commit, 1);
/// assert_eq!(*first_commit, 0, "previous value still held by previous pointer");
/// assert!(!track_wakes.is_woken(), "wakes only come from updating state vars");
/// assert_eq!(first_key, second_key, "same state variable");
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn state<Output>(init: impl FnOnce() -> Output) -> (Commit<Output>, Key<Output>)
where
Output: 'static,
{
rt.cache_state(&CallId::current(), &(), |_| init())
}
/// Root a state variable at this callsite, returning a [`Key`] to the state
/// variable. Re-initializes the state variable if the capture `arg` changes.
///
/// # Example
///
/// ```
/// use moxie::{cache_state, runtime::RunLoop, testing::BoolWaker};
/// use std::sync::atomic::{AtomicU64, Ordering};
///
/// let epoch = AtomicU64::new(0);
///
/// // this runtime holds a single state variable
/// // which is reinitialized whenever we change `epoch` above
/// let mut rt = RunLoop::new(|| cache_state(&epoch.load(Ordering::Relaxed), |e| *e));
///
/// let track_wakes = BoolWaker::new();
/// rt.set_state_change_waker(futures::task::waker(track_wakes.clone()));
///
/// let (first_commit, first_key) = rt.run_once();
/// assert_eq!(*first_commit, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.set(0); // this is a no-op
/// assert_eq!(*first_key, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.set(1);
/// assert_eq!(*first_key, 0, "update only enqueued, not yet committed");
/// assert!(track_wakes.is_woken());
///
/// let (second_commit, second_key) = rt.run_once(); // this commits the pending update
/// assert_eq!(*second_key, 1);
/// assert_eq!(*second_commit, 1);
/// assert_eq!(*first_commit, 0, "previous value still held by previous pointer");
/// assert!(!track_wakes.is_woken(), "wakes only come from updating state vars");
/// assert_eq!(first_key, second_key, "same state variable");
///
/// // start the whole thing over again
/// epoch.store(2, Ordering::Relaxed);
///
/// let (third_commit, third_key) = rt.run_once();
/// assert_ne!(third_key, second_key, "different state variable");
///
/// // the rest is repeated from above with slight modifications
/// assert_eq!(*third_commit, 2);
/// assert!(!track_wakes.is_woken());
///
/// third_key.set(2);
/// assert_eq!(*third_key, 2);
/// assert!(!track_wakes.is_woken());
///
/// third_key.set(3);
/// assert_eq!(*third_key, 2);
/// assert!(track_wakes.is_woken());
///
/// let (fourth_commit, fourth_key) = rt.run_once();
/// assert_eq!(*fourth_key, 3);
/// assert_eq!(*fourth_commit, 3);
/// assert_eq!(*third_commit, 2);
/// assert!(!track_wakes.is_woken());
/// assert_eq!(third_key, fourth_key);
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn cache_state<Arg, Input, Output>(
arg: &Arg,
init: impl FnOnce(&Input) -> Output,
) -> (Commit<Output>, Key<Output>)
where
Arg: PartialEq<Input> + ToOwned<Owned = Input> + ?Sized,
Input: Borrow<Arg> + 'static,
Output: 'static,
{
rt.cache_state(&CallId::current(), arg, init)
}
/// Load a value from the future returned by `init` whenever `capture` changes,
/// returning the result of calling `with` with the loaded value. Cancels the
/// running future after any revision during which this call was not made.
///
/// # Example
///
/// ```
/// use futures::{channel::oneshot, executor::LocalPool};
/// use moxie::{load_with, runtime::RunLoop};
/// use std::{
/// sync::{
/// atomic::{AtomicU64, Ordering},
/// mpsc::channel,
/// },
/// task::Poll,
/// };
///
/// let epoch = AtomicU64::new(0);
/// let (send_futs, recv_futs) = channel();
///
/// let mut rt = RunLoop::new(|| {
/// // loads a new future when epoch changes
/// load_with(
/// &epoch.load(Ordering::Relaxed),
/// |_| {
/// let (sender, receiver) = oneshot::channel();
/// send_futs.send(sender).unwrap();
/// receiver
/// },
/// // makes this equivalent to load(...)
/// |res| res.clone(),
/// )
/// });
///
/// let mut exec = LocalPool::new();
/// rt.set_task_executor(exec.spawner());
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run_until_stalled();
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// // resolve the future
/// let sender = recv_futs.recv().unwrap();
/// assert!(recv_futs.try_recv().is_err(), "only one channel is created per epoch");
///
/// sender.send(()).unwrap();
///
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
///
/// // force the future to be reinitialized
/// epoch.store(1, Ordering::Relaxed);
///
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// // resolve the future
/// let sender = recv_futs.recv().unwrap();
/// assert!(recv_futs.try_recv().is_err(), "only one channel is created per epoch");
///
/// sender.send(()).unwrap();
///
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn load_with<Arg, Input, Fut, Output, Ret>(
arg: &Arg,
init: impl FnOnce(&Input) -> Fut,
with: impl FnOnce(&Output) -> Ret,
) -> Poll<Ret>
where
Arg: PartialEq<Input> + ToOwned<Owned = Input> + ?Sized,
Input: Borrow<Arg> + 'static,
Fut: Future<Output = Output> + 'static,
Output: 'static,
Ret: 'static,
{
rt.load_with(&CallId::current(), arg, init, with)
}
/// Calls [`load_with`] but never re-initializes the loading future.
///
/// # Example
///
/// ```
/// use futures::{channel::oneshot, executor::LocalPool};
/// use moxie::{load_once_with, runtime::RunLoop};
/// use std::task::Poll;
///
/// let (sender, receiver) = oneshot::channel();
/// let mut receiver = Some(receiver);
/// let mut rt = RunLoop::new(|| load_once_with(|| receiver.take().unwrap(), |res| res.clone()));
///
/// let mut exec = LocalPool::new();
/// rt.set_task_executor(exec.spawner());
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run_until_stalled();
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// sender.send(()).unwrap();
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn load_once_with<Fut, Output, Ret>(
init: impl FnOnce() -> Fut,
with: impl FnOnce(&Output) -> Ret,
) -> Poll<Ret>
where
Fut: Future<Output = Output> + 'static,
Output: 'static,
Ret: 'static,
{
rt.load_with(&CallId::current(), &(), |()| init(), with)
}
/// Calls [`load_with`], never re-initializes the loading future, and clones the
/// returned value on each revision once the future has completed and returned.
///
/// # Example
///
/// ```
/// use futures::{channel::oneshot, executor::LocalPool};
/// use moxie::{load_once, runtime::RunLoop};
/// use std::task::Poll;
///
/// let (sender, receiver) = oneshot::channel();
/// let mut receiver = Some(receiver);
/// let mut rt = RunLoop::new(|| load_once(|| receiver.take().unwrap()));
///
/// let mut exec = LocalPool::new();
/// rt.set_task_executor(exec.spawner());
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run_until_stalled();
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// sender.send(()).unwrap();
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn load_once<Fut, Output>(init: impl FnOnce() -> Fut) -> Poll<Output>
where
Fut: Future<Output = Output> + 'static,
Output: Clone + 'static,
{
rt.load_with(&CallId::current(), &(), |()| init(), Clone::clone)
}
/// Load a value from a future, cloning it on subsequent revisions after it is
/// first returned. Re-initializes the loading future if the capture argument
/// changes from previous revisions.
///
/// # Example
///
/// ```
/// use futures::{channel::oneshot, executor::LocalPool};
/// use moxie::{load, runtime::RunLoop};
/// use std::{
/// sync::{
/// atomic::{AtomicU64, Ordering},
/// mpsc::channel,
/// },
/// task::Poll,
/// };
///
/// let epoch = AtomicU64::new(0);
/// let (send_futs, recv_futs) = channel();
///
/// let mut rt = RunLoop::new(|| {
/// // loads a new future when epoch changes
/// load(&epoch.load(Ordering::Relaxed), |e| {
/// let (sender, receiver) = oneshot::channel();
/// send_futs.send((*e, sender)).unwrap();
/// receiver
/// })
/// });
///
/// let mut exec = LocalPool::new();
/// rt.set_task_executor(exec.spawner());
///
/// assert_eq!(rt.run_once(), Poll::Pending);
/// exec.run_until_stalled();
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// // resolve the future
/// let (created_in_epoch, sender) = recv_futs.recv().unwrap();
/// assert!(recv_futs.try_recv().is_err(), "only one channel is created per epoch");
/// assert_eq!(created_in_epoch, 0);
///
/// sender.send(()).unwrap();
///
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
///
/// // force the future to be reinitialized
/// epoch.store(1, Ordering::Relaxed);
///
/// assert_eq!(rt.run_once(), Poll::Pending);
///
/// // resolve the future
/// let (created_in_epoch, sender) = recv_futs.recv().unwrap();
/// assert!(recv_futs.try_recv().is_err(), "only one channel is created per epoch");
/// assert_eq!(created_in_epoch, 1);
///
/// sender.send(()).unwrap();
///
/// exec.run();
/// assert_eq!(rt.run_once(), Poll::Ready(Ok(())));
/// ```
#[topo::nested]
#[illicit::from_env(rt: &Context)]
pub fn load<Arg, Input, Fut, Output>(
capture: &Arg,
init: impl FnOnce(&Input) -> Fut,
) -> Poll<Output>
where
Arg: PartialEq<Input> + ToOwned<Owned = Input> + ?Sized,
Input: Borrow<Arg> + 'static,
Fut: Future<Output = Output> + 'static,
Output: Clone + 'static,
{
rt.load_with(&CallId::current(), capture, init, Clone::clone)
}
/// A read-only pointer to the value of a state variable *at a particular
/// revision*.
///
/// Reads through a commit are not guaranteed to be the latest value visible to
/// the runtime. Commits should be shared and used within the context of a
/// single [`crate::runtime::Revision`], being re-loaded from the state variable
/// each time.
///
/// See [`state`] and [`cache_state`] for examples.
#[derive(Eq, Hash, PartialEq)]
pub struct Commit<State> {
id: CallId,
inner: Arc<State>,
}
impl<State> Clone for Commit<State> {
fn clone(&self) -> Self {
Self { id: self.id, inner: Arc::clone(&self.inner) }
}
}
impl<State> Debug for Commit<State>
where
State: Debug,
{
fn fmt(&self, f: &mut Formatter) -> FmtResult {
self.inner.fmt(f)
}
}
impl<State> Deref for Commit<State> {
type Target = State;
fn deref(&self) -> &Self::Target {
self.inner.deref()
}
}
impl<State> Display for Commit<State>
where
State: Display,
{
fn fmt(&self, f: &mut Formatter) -> FmtResult {
f.write_fmt(format_args!("{}", self.inner))
}
}
/// A `Key` offers access to a state variable. The key allows reads of the state
/// variable through a snapshot taken when the `Key` was created. Writes are
/// supported with [`Key::update`] and [`Key::set`].
///
/// They are created with the [`cache_state`] and [`state`] functions.
///
/// See [`state`] and [`cache_state`] for examples.
pub struct Key<State> {
id: CallId,
commit_at_root: Commit<State>,
var: Arc<Mutex<Var<State>>>,
}
impl<State> Key<State> {
/// Returns the `topo::CallId` at which the state variable is bound.
pub fn id(&self) -> CallId {
self.id
}
/// Runs `updater` with a reference to the state variable's latest value,
/// and enqueues a commit to the variable if `updater` returns `Some`.
/// Returns the `Revision` at which the state variable was last rooted
/// if the variable is live, otherwise returns `None`.
///
/// Enqueuing the commit invokes the state change waker registered with the
/// [Runtime] (if any) to ensure that the code embedding the runtime
/// schedules another call of [run_once].
///
/// This should be called during event handlers or other code which executes
/// outside of a `Revision`'s execution, otherwise unpredictable waker
/// behavior may be obtained.
///
/// [Runtime]: crate::runtime::Runtime
/// [run_once]: crate::runtime::Runtime::run_once
///
/// # Example
///
/// ```
/// use futures::task::waker;
/// use moxie::{runtime::RunLoop, state, testing::BoolWaker};
///
/// // this runtime holds a single state variable
/// let mut rt = RunLoop::new(|| state(|| 0u64));
///
/// let track_wakes = BoolWaker::new();
/// rt.set_state_change_waker(waker(track_wakes.clone()));
///
/// let (first_commit, first_key) = rt.run_once();
/// assert_eq!(*first_commit, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.update(|_| None); // this is a no-op
/// assert_eq!(*first_key, 0, "no updates yet");
/// assert!(!track_wakes.is_woken(), "no updates yet");
///
/// first_key.update(|prev| Some(prev + 1));
/// assert_eq!(*first_key, 0, "update only enqueued, not yet committed");
/// assert!(track_wakes.is_woken());
///
/// let (second_commit, second_key) = rt.run_once(); // this commits the pending update
/// assert_eq!(*second_key, 1);
/// assert_eq!(*second_commit, 1);
/// assert_eq!(*first_commit, 0, "previous value still held by previous pointer");
/// assert!(!track_wakes.is_woken(), "wakes only come from updating state vars");
/// assert_eq!(first_key, second_key, "same state variable");
/// ```
pub fn update(&self, updater: impl FnOnce(&State) -> Option<State>) {
let mut var = self.var.lock();
if let Some(new) = updater(var.latest()) {
var.enqueue_commit(new);
}
}
/// Set a new value for the state variable, immediately taking effect.
fn force(&self, new: State) {
self.var.lock().enqueue_commit(new);
}
// TODO(#197) delete this and remove the Deref impl
fn refresh(&mut self) {
self.commit_at_root = runtime::Var::root(self.var.clone()).0;
}
}
impl<State> Key<State>
where
State: PartialEq,
{
/// Commits a new state value if it is unequal to the current value and the
/// state variable is still live. Has the same properties as
/// [update](Key::update) regarding waking the runtime.
///
/// See [`state`] and [`cache_state`] for examples.
pub fn set(&self, new: State) {
self.update(|prev| if prev == &new { None } else { Some(new) });
}
}
impl<State> Key<State>
where
State: Clone + PartialEq,
{
/// Mutates a copy of the current state, committing the update if it results
/// in a change. Has the same properties as [update](Key::update)
/// See [`state`] and [`cache_state`] for examples.
pub fn mutate(&self, op: impl FnOnce(&mut State)) {
self.update(|prev| {
let mut new = prev.clone();
op(&mut new);
if prev == &new {
None
} else {
Some(new)
}
});
}
}
impl<State> Clone for Key<State> {
fn clone(&self) -> Self {
Self { id: self.id, commit_at_root: self.commit_at_root.clone(), var: self.var.clone() }
}
}
impl<State> Deref for Key<State> {
type Target = State;
fn deref(&self) -> &Self::Target {
self.commit_at_root.deref()
}
}
impl<State> Debug for Key<State>
where
State: Debug,
{
fn fmt(&self, f: &mut Formatter) -> FmtResult {
self.commit_at_root.fmt(f)
}
}
impl<State> Display for Key<State>
where
State: Display,
{
fn fmt(&self, f: &mut Formatter) -> FmtResult {
self.commit_at_root.fmt(f)
}
}
impl<State> PartialEq for Key<State> {
/// Keys are considered equal if they point to the same state variable.
/// Importantly, they will compare as equal even if they contain
/// different snapshots of the state variable due to having been
/// initialized in different revisions.
fn eq(&self, other: &Self) -> bool {
Arc::ptr_eq(&self.var, &other.var)
}
}
impl<State> Eq for Key<State> {}
impl<State> Hash for Key<State> {
fn hash<H: Hasher>(&self, hasher: &mut H) {
self.id.hash(hasher);
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::runtime::{Revision, RunLoop};
use std::{cell::Cell, collections::HashSet, rc::Rc};
fn with_test_logs(test: impl FnOnce()) {
tracing::subscriber::with_default(
tracing_subscriber::FmtSubscriber::builder()
.with_env_filter(tracing_subscriber::filter::EnvFilter::new("warn"))
.finish(),
|| {
tracing::debug!("logging init'd");
test();
},
);
}
#[test]
fn basic_cache() {
with_test_logs(|| {
let mut call_count = 0u32;
let mut prev_revision = None;
let mut comp_skipped_count = 0;
let mut rt = RunLoop::new(|| {
let revision = Revision::current();
if let Some(pr) = prev_revision {
assert!(revision.0 > pr);
} else {
comp_skipped_count += 1;
}
prev_revision = Some(revision.0);
assert!(comp_skipped_count <= 1);
assert!(revision.0 <= 5);
let current_call_count = once(|| {
call_count += 1;
call_count
});
assert_eq!(current_call_count, 1);
assert_eq!(call_count, 1);
});
for i in 0..5 {
assert_eq!(rt.revision().0, i);
rt.run_once();
assert_eq!(rt.revision().0, i + 1);
}
assert_eq!(call_count, 1);
})
}
#[test]
fn id_in_loop() {
topo::call(|| {
let mut ids = HashSet::new();
for _ in 0..10 {
topo::call(|| ids.insert(CallId::current()));
}
assert_eq!(ids.len(), 10);
let mut rt = RunLoop::new(|| {
let mut ids = HashSet::new();
for i in 0..10 {
cache(&i, |_| ids.insert(CallId::current()));
}
assert_eq!(ids.len(), 10);
});
rt.run_once();
});
}
#[test]
fn cache_in_a_loop() {
with_test_logs(|| {
let num_iters = 10;
let mut rt = RunLoop::new(|| {
let mut counts = vec![];
for i in 0..num_iters {
topo::call(|| once(|| counts.push(i)));
}
counts
});
let first_counts = rt.run_once();
assert_eq!(first_counts.len(), num_iters, "each mutation must be called exactly once");
let second_counts = rt.run_once();
assert_eq!(
second_counts.len(),
0,
"each mutation was already called in the previous revision"
);
})
}
#[test]
fn invalidation() {
with_test_logs(|| {
let loop_ct = Cell::new(0);
let raw_exec = Cell::new(0);
let cache_exec = Cell::new(0);
let mut rt = RunLoop::new(|| {
raw_exec.set(raw_exec.get() + 1);
cache(&loop_ct.get(), |_| {
cache_exec.set(cache_exec.get() + 1);
});
});
for i in 0..10 {
loop_ct.set(i);
assert_eq!(
cache_exec.get(),
i,
"cache block should execute exactly once per loop_ct value"
);
assert_eq!(
raw_exec.get(),
i * 2,
"runtime's root block should run exactly twice per loop_ct value"
);
rt.run_once();
rt.run_once();
}
})
}
#[test]
fn basic_loading_phases() {
let mut pool = futures::executor::LocalPool::new();
let (send, recv) = futures::channel::oneshot::channel();
// this is uh weird, but we know up front how much we'll poll this
let recv = Rc::new(futures::lock::Mutex::new(Some(recv)));
let mut rt = RunLoop::new(move || -> Poll<u8> {
let recv = recv.clone();
load_once(|| async move {
recv.lock()
.await
.take()
.expect("load_once should only allow us to take from the option once")
.await
.expect("we control the channel and won't drop it")
})
});
rt.set_task_executor(pool.spawner());
assert_eq!(rt.run_once(), Poll::Pending, "no values received when nothing sent");
assert_eq!(rt.run_once(), Poll::Pending, "no values received, and we aren't blocking");
send.send(5u8).unwrap();
pool.run_until_stalled();
assert_eq!(rt.run_once(), Poll::Ready(5), "we need to receive the value we sent");
assert_eq!(
rt.run_once(),
Poll::Ready(5),
"the value we sent must be cached because its from a oneshot channel"
);
}
#[test]
fn interest_loss_cancels_task() {
let mut pool = futures::executor::LocalPool::new();
let (send, recv) = futures::channel::oneshot::channel();
let recv = Rc::new(futures::lock::Mutex::new(Some(recv)));
let mut rt = RunLoop::new(move || -> Option<Poll<u8>> {
if Revision::current().0 < 3 {
let recv = recv.clone();
Some(load_once(|| async move {
recv.lock()
.await
.take()
.expect("load_once should only allow us to take from the option once")
.await
.expect("we control the channel and won't drop it")
}))
} else {
None
}
});
rt.set_task_executor(pool.spawner());
pool.run_until_stalled();
assert_eq!(rt.run_once(), Some(Poll::Pending));
assert!(!send.is_canceled(), "interest expressed, receiver must be live");
pool.run_until_stalled();
assert_eq!(rt.run_once(), Some(Poll::Pending));
assert!(!send.is_canceled(), "interest still expressed, receiver must be live");
pool.run_until_stalled();
assert_eq!(rt.run_once(), None);
assert!(!send.is_canceled(), "interest dropped, task live for another revision");
pool.run_until_stalled();
assert_eq!(rt.run_once(), None);
assert!(send.is_canceled(), "interest dropped, task dropped");
assert!(
send.send(4u8).is_err(),
"must be no task holding the channel and able to receive a message"
);
}
}