|
@@ -1,9 +1,8 @@
|
|
|
#![allow(missing_docs)]
|
|
|
use dioxus_core::{ScopeState, Task};
|
|
|
+use dioxus_signals::{use_effect, use_signal, Signal};
|
|
|
use std::{any::Any, cell::Cell, future::Future, rc::Rc, sync::Arc};
|
|
|
|
|
|
-use crate::{use_state, UseState};
|
|
|
-
|
|
|
/// A future that resolves to a value.
|
|
|
///
|
|
|
/// This runs the future only once - though the future may be regenerated
|
|
@@ -17,70 +16,29 @@ use crate::{use_state, UseState};
|
|
|
/// will be canceled before the new one is started.
|
|
|
///
|
|
|
/// - dependencies: a tuple of references to values that are PartialEq + Clone
|
|
|
-pub fn use_future<T, F, D>
|
|
|
- dependencies: D,
|
|
|
- future: impl FnOnce(D::Out) -> F,
|
|
|
-) -> &UseFuture<T>
|
|
|
+pub fn use_future<T, F>(future: impl FnMut() -> F) -> UseFuture<T>
|
|
|
where
|
|
|
T: 'static,
|
|
|
F: Future<Output = T> + 'static,
|
|
|
- D: UseFutureDep,
|
|
|
{
|
|
|
- let val = use_signal(|| None);
|
|
|
+ let task = use_signal(|| None);
|
|
|
|
|
|
- let state = cx.use_hook(move || UseFuture {
|
|
|
- update: cx.schedule_update(),
|
|
|
- needs_regen: Rc::new(Cell::new(true)),
|
|
|
- state: val.clone(),
|
|
|
- task: Default::default(),
|
|
|
+ use_effect(|| {
|
|
|
+ // task.set();
|
|
|
});
|
|
|
+ //
|
|
|
|
|
|
- let state_dependencies = cx.use_hook(Vec::new);
|
|
|
-
|
|
|
- if dependencies.clone().apply(state_dependencies) || state.needs_regen.get() {
|
|
|
- // kill the old one, if it exists
|
|
|
- if let Some(task) = state.task.take() {
|
|
|
- cx.remove_future(task);
|
|
|
- }
|
|
|
-
|
|
|
- // Create the new future
|
|
|
- let fut = future(dependencies.out());
|
|
|
- let val = val.clone();
|
|
|
- let task = state.task.clone();
|
|
|
-
|
|
|
- state.task.set(Some(cx.push_future(async move {
|
|
|
- val.set(Some(fut.await));
|
|
|
- task.take();
|
|
|
- })));
|
|
|
-
|
|
|
- // Mark that we don't need to regenerate
|
|
|
- state.needs_regen.set(false);
|
|
|
+ UseFuture {
|
|
|
+ value: todo!(),
|
|
|
+ task,
|
|
|
+ state: todo!(),
|
|
|
}
|
|
|
-
|
|
|
- // update the current value
|
|
|
- state.state.current_val = val.current_val.clone();
|
|
|
-
|
|
|
- state
|
|
|
}
|
|
|
|
|
|
-pub enum FutureState<'a, T> {
|
|
|
- Pending,
|
|
|
- Complete(&'a T),
|
|
|
- Regenerating(&'a T), // the old value
|
|
|
-}
|
|
|
-
|
|
|
-#[derive(Clone)]
|
|
|
pub struct UseFuture<T: 'static> {
|
|
|
- update: Arc<dyn Fn()>,
|
|
|
- needs_regen: Rc<Cell<bool>>,
|
|
|
- task: Rc<Cell<Option<Task>>>,
|
|
|
- state: UseState<Option<T>>,
|
|
|
-}
|
|
|
-
|
|
|
-pub enum UseFutureState<'a, T> {
|
|
|
- Pending,
|
|
|
- Complete(&'a T),
|
|
|
- Reloading(&'a T),
|
|
|
+ value: Signal<T>,
|
|
|
+ task: Signal<Option<Task>>,
|
|
|
+ state: Signal<UseFutureState<T>>,
|
|
|
}
|
|
|
|
|
|
impl<T> UseFuture<T> {
|
|
@@ -89,198 +47,57 @@ impl<T> UseFuture<T> {
|
|
|
/// Will not cancel the previous future, but will ignore any values that it
|
|
|
/// generates.
|
|
|
pub fn restart(&self) {
|
|
|
- self.needs_regen.set(true);
|
|
|
- (self.update)();
|
|
|
+ // self.needs_regen.set(true);
|
|
|
+ // (self.update)();
|
|
|
}
|
|
|
|
|
|
/// Forcefully cancel a future
|
|
|
- pub fn cancel(&self, ) {
|
|
|
- if let Some(task) = self.task.take() {
|
|
|
- cx.remove_future(task);
|
|
|
- }
|
|
|
+ pub fn cancel(&self) {
|
|
|
+ // if let Some(task) = self.task.take() {
|
|
|
+ // cx.remove_future(task);
|
|
|
+ // }
|
|
|
}
|
|
|
|
|
|
// Manually set the value in the future slot without starting the future over
|
|
|
pub fn set(&self, new_value: T) {
|
|
|
- self.state.set(Some(new_value));
|
|
|
+ // self.state.set(Some(new_value));
|
|
|
}
|
|
|
|
|
|
/// Return any value, even old values if the future has not yet resolved.
|
|
|
///
|
|
|
/// If the future has never completed, the returned value will be `None`.
|
|
|
- pub fn value(&self) -> Option<&T> {
|
|
|
- self.state.current_val.as_ref().as_ref()
|
|
|
+ pub fn value(&self) -> Signal<Option<T>> {
|
|
|
+ todo!()
|
|
|
+ // self.state.current_val.as_ref().as_ref()
|
|
|
}
|
|
|
|
|
|
/// Get the ID of the future in Dioxus' internal scheduler
|
|
|
pub fn task(&self) -> Option<Task> {
|
|
|
- self.task.get()
|
|
|
+ todo!()
|
|
|
+ // self.task.get()
|
|
|
}
|
|
|
|
|
|
/// Get the current state of the future.
|
|
|
pub fn state(&self) -> UseFutureState<T> {
|
|
|
- match (&self.task.get(), &self.value()) {
|
|
|
- // If we have a task and an existing value, we're reloading
|
|
|
- (Some(_), Some(val)) => UseFutureState::Reloading(val),
|
|
|
+ todo!()
|
|
|
+ // match (&self.task.get(), &self.value()) {
|
|
|
+ // // If we have a task and an existing value, we're reloading
|
|
|
+ // (Some(_), Some(val)) => UseFutureState::Reloading(val),
|
|
|
|
|
|
- // no task, but value - we're done
|
|
|
- (None, Some(val)) => UseFutureState::Complete(val),
|
|
|
+ // // no task, but value - we're done
|
|
|
+ // (None, Some(val)) => UseFutureState::Complete(val),
|
|
|
|
|
|
- // no task, no value - something's wrong? return pending
|
|
|
- (None, None) => UseFutureState::Pending,
|
|
|
+ // // no task, no value - something's wrong? return pending
|
|
|
+ // (None, None) => UseFutureState::Pending,
|
|
|
|
|
|
- // Task, no value - we're still pending
|
|
|
- (Some(_), None) => UseFutureState::Pending,
|
|
|
- }
|
|
|
+ // // Task, no value - we're still pending
|
|
|
+ // (Some(_), None) => UseFutureState::Pending,
|
|
|
+ // }
|
|
|
}
|
|
|
}
|
|
|
|
|
|
-pub trait UseFutureDep: Sized + Clone {
|
|
|
- type Out;
|
|
|
- fn out(&self) -> Self::Out;
|
|
|
- fn apply(self, state: &mut Vec<Box<dyn Any>>) -> bool;
|
|
|
-}
|
|
|
-
|
|
|
-impl UseFutureDep for () {
|
|
|
- type Out = ();
|
|
|
- fn out(&self) -> Self::Out {}
|
|
|
- fn apply(self, _state: &mut Vec<Box<dyn Any>>) -> bool {
|
|
|
- false
|
|
|
- }
|
|
|
-}
|
|
|
-
|
|
|
-pub trait Dep: 'static + PartialEq + Clone {}
|
|
|
-impl<T> Dep for T where T: 'static + PartialEq + Clone {}
|
|
|
-
|
|
|
-impl<A: Dep> UseFutureDep for &A {
|
|
|
- type Out = A;
|
|
|
- fn out(&self) -> Self::Out {
|
|
|
- (*self).clone()
|
|
|
- }
|
|
|
- fn apply(self, state: &mut Vec<Box<dyn Any>>) -> bool {
|
|
|
- match state.get_mut(0).and_then(|f| f.downcast_mut::<A>()) {
|
|
|
- Some(val) => {
|
|
|
- if *val != *self {
|
|
|
- *val = self.clone();
|
|
|
- return true;
|
|
|
- }
|
|
|
- }
|
|
|
- None => {
|
|
|
- state.push(Box::new(self.clone()));
|
|
|
- return true;
|
|
|
- }
|
|
|
- }
|
|
|
- false
|
|
|
- }
|
|
|
-}
|
|
|
-
|
|
|
-macro_rules! impl_dep {
|
|
|
- (
|
|
|
- $($el:ident=$name:ident,)*
|
|
|
- ) => {
|
|
|
- impl< $($el),* > UseFutureDep for ($(&$el,)*)
|
|
|
- where
|
|
|
- $(
|
|
|
- $el: Dep
|
|
|
- ),*
|
|
|
- {
|
|
|
- type Out = ($($el,)*);
|
|
|
-
|
|
|
- fn out(&self) -> Self::Out {
|
|
|
- let ($($name,)*) = self;
|
|
|
- ($((*$name).clone(),)*)
|
|
|
- }
|
|
|
-
|
|
|
- #[allow(unused)]
|
|
|
- fn apply(self, state: &mut Vec<Box<dyn Any>>) -> bool {
|
|
|
- let ($($name,)*) = self;
|
|
|
- let mut idx = 0;
|
|
|
- let mut needs_regen = false;
|
|
|
-
|
|
|
- $(
|
|
|
- match state.get_mut(idx).map(|f| f.downcast_mut::<$el>()).flatten() {
|
|
|
- Some(val) => {
|
|
|
- if *val != *$name {
|
|
|
- *val = $name.clone();
|
|
|
- needs_regen = true;
|
|
|
- }
|
|
|
- }
|
|
|
- None => {
|
|
|
- state.push(Box::new($name.clone()));
|
|
|
- needs_regen = true;
|
|
|
- }
|
|
|
- }
|
|
|
- idx += 1;
|
|
|
- )*
|
|
|
-
|
|
|
- needs_regen
|
|
|
- }
|
|
|
- }
|
|
|
- };
|
|
|
-}
|
|
|
-
|
|
|
-impl_dep!(A = a,);
|
|
|
-impl_dep!(A = a, B = b,);
|
|
|
-impl_dep!(A = a, B = b, C = c,);
|
|
|
-impl_dep!(A = a, B = b, C = c, D = d,);
|
|
|
-impl_dep!(A = a, B = b, C = c, D = d, E = e,);
|
|
|
-impl_dep!(A = a, B = b, C = c, D = d, E = e, F = f,);
|
|
|
-impl_dep!(A = a, B = b, C = c, D = d, E = e, F = f, G = g,);
|
|
|
-impl_dep!(A = a, B = b, C = c, D = d, E = e, F = f, G = g, H = h,);
|
|
|
-
|
|
|
-/// A helper macro that merges uses the closure syntax to elaborate the dependency array
|
|
|
-#[macro_export]
|
|
|
-macro_rules! use_future {
|
|
|
- ($cx:ident, || $($rest:tt)*) => { use_future( $cx, (), |_| $($rest)* ) };
|
|
|
- ($cx:ident, | $($args:tt),* | $($rest:tt)*) => {
|
|
|
- use_future(
|
|
|
- $cx,
|
|
|
- ($($args),*),
|
|
|
- |($($args),*)| $($rest)*
|
|
|
- )
|
|
|
- };
|
|
|
-}
|
|
|
-
|
|
|
-#[cfg(test)]
|
|
|
-mod tests {
|
|
|
- use super::*;
|
|
|
-
|
|
|
- #[allow(unused)]
|
|
|
- #[test]
|
|
|
- fn test_use_future() {
|
|
|
- use dioxus_core::prelude::*;
|
|
|
-
|
|
|
- struct MyProps {
|
|
|
- a: String,
|
|
|
- b: i32,
|
|
|
- c: i32,
|
|
|
- d: i32,
|
|
|
- e: i32,
|
|
|
- }
|
|
|
-
|
|
|
- async fn app(cx: Scope<'_, MyProps>) -> Element {
|
|
|
- // should only ever run once
|
|
|
- let fut = use_future(|_| async move {});
|
|
|
-
|
|
|
- // runs when a is changed
|
|
|
- let fut = use_future((&cx.props.a,), |(a,)| async move {});
|
|
|
-
|
|
|
- // runs when a or b is changed
|
|
|
- let fut = use_future((&cx.props.a, &cx.props.b), |(a, b)| async move { 123 });
|
|
|
-
|
|
|
- let a = use_future(|| async move {
|
|
|
- // do the thing!
|
|
|
- });
|
|
|
-
|
|
|
- let b = &123;
|
|
|
- let c = &123;
|
|
|
-
|
|
|
- let a = use_future(|b, c| async move {
|
|
|
- let a = b + c;
|
|
|
- let blah = "asd";
|
|
|
- });
|
|
|
-
|
|
|
- todo!()
|
|
|
- }
|
|
|
- }
|
|
|
+pub enum UseFutureState<T: 'static> {
|
|
|
+ Pending,
|
|
|
+ Complete(Signal<T>),
|
|
|
+ Regenerating(Signal<T>), // the old value
|
|
|
}
|