/*
Welcome to Dioxus's cooperative, priority-based scheduler.

I hope you enjoy your stay.

Some essential reading:
- https://github.com/facebook/react/blob/main/packages/scheduler/src/forks/Scheduler.js#L197-L200
- https://github.com/facebook/react/blob/main/packages/scheduler/src/forks/Scheduler.js#L440
- https://github.com/WICG/is-input-pending
- https://web.dev/rail/
- https://indepth.dev/posts/1008/inside-fiber-in-depth-overview-of-the-new-reconciliation-algorithm-in-react

# What's going on?

Dioxus is a framework for "user experience" - not just "user interfaces." Part of the "experience" is keeping the UI
snappy and "jank free" even under heavy work loads. Dioxus already has the "speed" part figured out - but there's no
point if being "fast" if you can't also be "responsive."

As such, Dioxus can manually decide on what work is most important at any given moment in time. With a properly tuned
priority system, Dioxus can ensure that user interaction is prioritized and committed as soon as possible (sub 100ms).
The controller responsible for this priority management is called the "scheduler" and is responsible for juggle many
different types of work simultaneously.

# How does it work?

Per the RAIL guide, we want to make sure that A) inputs are handled ASAP and B) animations are not blocked.
React-three-fiber is a testament to how amazing this can be - a ThreeJS scene is threaded in between work periods of
React, and the UI still stays snappy!

While it's straightforward to run code ASAP and be as "fast as possible", what's not  _not_ straightforward is how to do
this while not blocking the main thread. The current prevailing thought is to stop working periodically so the browser
has time to paint and run animations. When the browser is finished, we can step in and continue our work.

React-Fiber uses the "Fiber" concept to achieve a pause-resume functionality. This is worth reading up on, but not
necessary to understand what we're doing here. In Dioxus, our DiffMachine is guided by DiffInstructions - essentially
"commands" that guide the Diffing algorithm through the tree. Our "diff_scope" method is async - we can literally pause
our DiffMachine "mid-sentence" (so to speak) by just stopping the poll on the future. The DiffMachine periodically yields
so Rust's async machinery can take over, allowing us to customize when exactly to pause it.

React's "should_yield" method is more complex than ours, and I assume we'll move in that direction as Dioxus matures. For
now, Dioxus just assumes a TimeoutFuture, and selects! on both the Diff algorithm and timeout. If the DiffMachine finishes
before the timeout, then Dioxus will work on any pending work in the interim. If there is no pending work, then the changes
are committed, and coroutines are polled during the idle period. However, if the timeout expires, then the DiffMachine
future is paused and saved (self-referentially).

# Priorty System

So far, we've been able to thread our Dioxus work between animation frames - the main thread is not blocked! But that
doesn't help us _under load_. How do we still stay snappy... even if we're doing a lot of work? Well, that's where
priorities come into play. The goal with priorities is to schedule shorter work as a "high" priority and longer work as
a "lower" priority. That way, we can interrupt long-running low-prioty work with short-running high-priority work.

React's priority system is quite complex.

There are 5 levels of priority and 2 distinctions between UI events (discrete, continuous). I believe React really only
uses 3 priority levels and "idle" priority isn't used... Regardless, there's some batching going on.

For Dioxus, we're going with a 4 tier priorty system:
- Sync: Things that need to be done by the next frame, like TextInput on controlled elements
- High: for events that block all others - clicks, keyboard, and hovers
- Medium: for UI events caused by the user but not directly - scrolls/forms/focus (all other events)
- Low: set_state called asynchronously, and anything generated by suspense

In "Sync" state, we abort our "idle wait" future, and resolve the sync queue immediately and escape. Because we completed
work before the next rAF, any edits can be immediately processed before the frame ends. Generally though, we want to leave
as much time to rAF as possible. "Sync" is currently only used by onInput - we'll leave some docs telling people not to
do anything too arduous from onInput.

For the rest, we defer to the rIC period and work down each queue from high to low.
*/
use std::cell::{Cell, RefCell, RefMut};
use std::fmt::Display;
use std::intrinsics::transmute;
use std::{cell::UnsafeCell, rc::Rc};

use crate::heuristics::*;
use crate::innerlude::*;
use futures_channel::mpsc::{UnboundedReceiver, UnboundedSender};
use futures_util::stream::FuturesUnordered;
use fxhash::{FxHashMap, FxHashSet};
use indexmap::IndexSet;
use slab::Slab;
use smallvec::SmallVec;

use std::any::Any;

use std::any::TypeId;
use std::cell::Ref;
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
use std::pin::Pin;

use futures_util::future::FusedFuture;
use futures_util::pin_mut;
use futures_util::Future;
use futures_util::FutureExt;
use futures_util::StreamExt;

#[derive(Clone)]
pub struct EventChannel {
    pub task_counter: Rc<Cell<u64>>,
    pub sender: UnboundedSender<SchedulerMsg>,
    pub schedule_any_immediate: Rc<dyn Fn(ScopeId)>,
    pub submit_task: Rc<dyn Fn(FiberTask) -> TaskHandle>,
    pub get_shared_context: Rc<dyn Fn(ScopeId, TypeId) -> Option<Rc<dyn Any>>>,
}

pub enum SchedulerMsg {
    Immediate(ScopeId),
    UiEvent(EventTrigger),
    SubmitTask(FiberTask, u64),
    ToggleTask(u64),
    PauseTask(u64),
    ResumeTask(u64),
    DropTask(u64),
}

/// The scheduler holds basically everything around "working"
///
/// Each scope has the ability to lightly interact with the scheduler (IE, schedule an update) but ultimately the scheduler calls the components.
///
/// In Dioxus, the scheduler provides 3 priority levels - each with their own "DiffMachine". The DiffMachine state can be saved if the deadline runs
/// out.
///
/// Saved DiffMachine state can be self-referential, so we need to be careful about how we save it. All self-referential data is a link between
/// pending DiffInstructions, Mutations, and their underlying Scope. It's okay for us to be self-referential with this data, provided we don't priority
/// task shift to a higher priority task that needs mutable access to the same scopes.
///
/// We can prevent this safety issue from occurring if we track which scopes are invalidated when starting a new task.
///
///
pub struct Scheduler {
    /*
    This *has* to be an UnsafeCell.

    Each BumpFrame and Scope is located in this Slab - and we'll need mutable access to a scope while holding on to
    its bumpframe conents immutably.

    However, all of the interaction with this Slab is done in this module and the Diff module, so it should be fairly
    simple to audit.

    Wrapped in Rc so the "get_shared_context" closure can walk the tree (immutably!)
    */
    pub components: Rc<UnsafeCell<Slab<Scope>>>,

    /*
    Yes, a slab of "nil". We use this for properly ordering ElementIDs - all we care about is the allocation strategy
    that slab uses. The slab essentially just provides keys for ElementIDs that we can re-use in a Vec on the client.

    This just happened to be the simplest and most efficient way to implement a deterministic keyed map with slot reuse.

    In the future, we could actually store a pointer to the VNode instead of nil to provide O(1) lookup for VNodes...
    */
    pub raw_elements: Slab<()>,

    pub heuristics: HeuristicsEngine,

    pub channel: EventChannel,

    pub receiver: UnboundedReceiver<SchedulerMsg>,

    // Garbage stored
    pub pending_garbage: FxHashSet<ScopeId>,

    // In-flight futures
    pub async_tasks: FuturesUnordered<FiberTask>,

    // scheduler stuff
    pub current_priority: EventPriority,

    pub ui_events: VecDeque<EventTrigger>,

    pub pending_immediates: VecDeque<ScopeId>,

    pub pending_tasks: VecDeque<EventTrigger>,

    pub garbage_scopes: HashSet<ScopeId>,

    pub lanes: [PriortySystem; 4],
}

impl Scheduler {
    pub fn new() -> Self {
        /*
        Preallocate 2000 elements and 100 scopes to avoid dynamic allocation.
        Perhaps this should be configurable?
        */
        let components = Rc::new(UnsafeCell::new(Slab::with_capacity(100)));
        let raw_elements = Slab::with_capacity(2000);

        let heuristics = HeuristicsEngine::new();

        let (sender, receiver) = futures_channel::mpsc::unbounded::<SchedulerMsg>();
        let task_counter = Rc::new(Cell::new(0));

        let channel = EventChannel {
            task_counter: task_counter.clone(),
            sender: sender.clone(),
            schedule_any_immediate: {
                let sender = sender.clone();
                Rc::new(move |id| sender.unbounded_send(SchedulerMsg::Immediate(id)).unwrap())
            },
            submit_task: {
                let sender = sender.clone();
                Rc::new(move |fiber_task| {
                    let task_id = task_counter.get();
                    task_counter.set(task_id + 1);
                    sender
                        .unbounded_send(SchedulerMsg::SubmitTask(fiber_task, task_id))
                        .unwrap();
                    TaskHandle {
                        our_id: task_id,
                        sender: sender.clone(),
                    }
                })
            },
            get_shared_context: {
                let components = components.clone();
                Rc::new(move |id, ty| {
                    let components = unsafe { &*components.get() };
                    let mut search: Option<&Scope> = components.get(id.0);
                    while let Some(inner) = search.take() {
                        if let Some(shared) = inner.shared_contexts.borrow().get(&ty) {
                            return Some(shared.clone());
                        } else {
                            search = inner.parent_idx.map(|id| components.get(id.0)).flatten();
                        }
                    }
                    None
                })
            },
        };

        Self {
            channel,
            receiver,

            components,
            async_tasks: FuturesUnordered::new(),

            pending_garbage: FxHashSet::default(),

            heuristics,
            raw_elements,

            // a storage for our receiver to dump into
            ui_events: VecDeque::new(),

            pending_immediates: VecDeque::new(),

            pending_tasks: VecDeque::new(),

            garbage_scopes: HashSet::new(),

            current_priority: EventPriority::Low,

            // a dedicated fiber for each priority
            lanes: [
                PriortySystem::new(),
                PriortySystem::new(),
                PriortySystem::new(),
                PriortySystem::new(),
            ],
        }
    }

    /// this is unsafe because the caller needs to track which other scopes it's already using
    pub fn get_scope(&self, idx: ScopeId) -> Option<&Scope> {
        let inner = unsafe { &*self.components.get() };
        inner.get(idx.0)
    }

    /// this is unsafe because the caller needs to track which other scopes it's already using
    pub fn get_scope_mut(&self, idx: ScopeId) -> Option<&mut Scope> {
        let inner = unsafe { &mut *self.components.get() };
        inner.get_mut(idx.0)
    }

    pub fn with_scope<'b, O: 'static>(
        &'b self,
        _id: ScopeId,
        _f: impl FnOnce(&'b mut Scope) -> O,
    ) -> Result<O> {
        todo!()
    }

    // return a bumpframe with a lifetime attached to the arena borrow
    // this is useful for merging lifetimes
    pub fn with_scope_vnode<'b>(
        &self,
        _id: ScopeId,
        _f: impl FnOnce(&mut Scope) -> &VNode<'b>,
    ) -> Result<&VNode<'b>> {
        todo!()
    }

    pub fn try_remove(&self, id: ScopeId) -> Result<Scope> {
        let inner = unsafe { &mut *self.components.get() };
        Ok(inner.remove(id.0))
        // .try_remove(id.0)
        // .ok_or_else(|| Error::FatalInternal("Scope not found"))
    }

    pub fn reserve_node(&self) -> ElementId {
        todo!("reserving wip until it's fast enough again")
        // ElementId(self.raw_elements.insert(()))
    }

    /// return the id, freeing the space of the original node
    pub fn collect_garbage(&self, id: ElementId) {
        todo!("garabge collection currently WIP")
        // self.raw_elements.remove(id.0);
    }

    pub fn insert_scope_with_key(&self, f: impl FnOnce(ScopeId) -> Scope) -> ScopeId {
        let g = unsafe { &mut *self.components.get() };
        let entry = g.vacant_entry();
        let id = ScopeId(entry.key());
        entry.insert(f(id));
        id
    }

    pub fn clean_up_garbage(&mut self) {
        // let mut scopes_to_kill = Vec::new();
        // let mut garbage_list = Vec::new();

        todo!("garbage collection is currently immediate")
        // for scope in self.garbage_scopes.drain() {
        //     let scope = self.get_scope_mut(scope).unwrap();
        //     for node in scope.consume_garbage() {
        //         garbage_list.push(node);
        //     }

        //     while let Some(node) = garbage_list.pop() {
        //         match &node {
        //             VNode::Text(_) => {
        //                 self.collect_garbage(node.direct_id());
        //             }
        //             VNode::Anchor(_) => {
        //                 self.collect_garbage(node.direct_id());
        //             }
        //             VNode::Suspended(_) => {
        //                 self.collect_garbage(node.direct_id());
        //             }

        //             VNode::Element(el) => {
        //                 self.collect_garbage(node.direct_id());
        //                 for child in el.children {
        //                     garbage_list.push(child);
        //                 }
        //             }

        //             VNode::Fragment(frag) => {
        //                 for child in frag.children {
        //                     garbage_list.push(child);
        //                 }
        //             }

        //             VNode::Component(comp) => {
        //                 // TODO: run the hook destructors and then even delete the scope

        //                 let scope_id = comp.ass_scope.get().unwrap();
        //                 let scope = self.get_scope(scope_id).unwrap();
        //                 let root = scope.root();
        //                 garbage_list.push(root);
        //                 scopes_to_kill.push(scope_id);
        //             }
        //         }
        //     }
        // }

        // for scope in scopes_to_kill.drain(..) {
        //     //
        //     // kill em
        // }
    }

    pub fn manually_poll_events(&mut self) {
        while let Ok(Some(msg)) = self.receiver.try_next() {
            self.handle_channel_msg(msg);
        }
    }

    // Converts UI events into dirty scopes with various priorities
    pub fn consume_pending_events(&mut self) -> Result<()> {
        // while let Some(trigger) = self.ui_events.pop_back() {
        //     match &trigger.event {
        //         SyntheticEvent::ClipboardEvent(_)
        //         | SyntheticEvent::CompositionEvent(_)
        //         | SyntheticEvent::KeyboardEvent(_)
        //         | SyntheticEvent::FocusEvent(_)
        //         | SyntheticEvent::FormEvent(_)
        //         | SyntheticEvent::SelectionEvent(_)
        //         | SyntheticEvent::TouchEvent(_)
        //         | SyntheticEvent::UIEvent(_)
        //         | SyntheticEvent::WheelEvent(_)
        //         | SyntheticEvent::MediaEvent(_)
        //         | SyntheticEvent::AnimationEvent(_)
        //         | SyntheticEvent::TransitionEvent(_)
        //         | SyntheticEvent::ToggleEvent(_)
        //         | SyntheticEvent::MouseEvent(_)
        //         | SyntheticEvent::PointerEvent(_) => {
        //             if let Some(scope) = self.get_scope_mut(trigger.scope) {
        //                 if let Some(element) = trigger.mounted_dom_id {
        //                     scope.call_listener(trigger.event, element)?;

        //                     // let receiver = self.immediate_receiver.clone();
        //                     // let mut receiver = receiver.borrow_mut();

        //                     // // Drain the immediates into the dirty scopes, setting the appropiate priorities
        //                     // while let Ok(Some(dirty_scope)) = receiver.try_next() {
        //                     //     self.add_dirty_scope(dirty_scope, trigger.priority)
        //                     // }
        //                 }
        //             }
        //         }
        //     }
        // }

        Ok(())
    }

    // nothing to do, no events on channels, no work
    pub fn has_any_work(&self) -> bool {
        self.has_work() || self.has_pending_events() || self.has_pending_garbage()
    }

    pub fn has_pending_events(&self) -> bool {
        self.ui_events.len() > 0
    }

    pub fn has_work(&self) -> bool {
        todo!()
        // self.high_priorty.has_work()
        //     || self.medium_priority.has_work()
        //     || self.low_priority.has_work()
    }

    pub fn has_pending_garbage(&self) -> bool {
        !self.garbage_scopes.is_empty()
    }

    fn get_current_fiber<'a>(&'a mut self) -> &mut DiffMachine<'a> {
        todo!()
        // let fib = match self.current_priority {
        //     EventPriority::High => &mut self.high_priorty,
        //     EventPriority::Medium => &mut self.medium_priority,
        //     EventPriority::Low => &mut self.low_priority,
        // };
        // unsafe { std::mem::transmute(fib) }
    }

    /// The primary workhorse of the VirtualDOM.
    ///
    /// Uses some fairly complex logic to schedule what work should be produced.
    ///
    /// Returns a list of successful mutations.
    ///
    ///
    pub async fn work_with_deadline<'a>(
        &'a mut self,
        mut deadline: Pin<Box<impl FusedFuture<Output = ()>>>,
    ) -> Vec<Mutations<'a>> {
        /*
        Strategy:
        - When called, check for any UI events that might've been received since the last frame.
        - Dump all UI events into a "pending discrete" queue and a "pending continuous" queue.

        - If there are any pending discrete events, then elevate our priorty level. If our priority level is already "high,"
            then we need to finish the high priority work first. If the current work is "low" then analyze what scopes
            will be invalidated by this new work. If this interferes with any in-flight medium or low work, then we need
            to bump the other work out of the way, or choose to process it so we don't have any conflicts.
            'static components have a leg up here since their work can be re-used among multiple scopes.
            "High priority" is only for blocking! Should only be used on "clicks"

        - If there are no pending discrete events, then check for continuous events. These can be completely batched


        Open questions:
        - what if we get two clicks from the component during the same slice?
            - should we batch?
            - react says no - they are continuous
            - but if we received both - then we don't need to diff, do we? run as many as we can and then finally diff?
        */
        let mut committed_mutations = Vec::<Mutations<'static>>::new();

        // TODO:
        // the scheduler uses a bunch of different receivers to mimic a "topic" queue system. The futures-channel implementation
        // doesn't really have a concept of a "topic" queue, so there's a lot of noise in the hand-rolled scheduler. We should
        // explore abstracting the scheduler into a topic-queue channel system - similar to Kafka or something similar.
        loop {
            // Internalize any pending work since the last time we ran
            self.manually_poll_events();

            // Wait for any new events if we have nothing to do
            if !self.has_any_work() {
                self.clean_up_garbage();
                let deadline_expired = self.wait_for_any_trigger(&mut deadline).await;

                if deadline_expired {
                    return committed_mutations;
                }
            }

            // Create work from the pending event queue
            self.consume_pending_events().unwrap();

            // Work through the current subtree, and commit the results when it finishes
            // When the deadline expires, give back the work
            self.current_priority = match (
                self.lanes[0].has_work(),
                self.lanes[1].has_work(),
                self.lanes[2].has_work(),
                self.lanes[3].has_work(),
            ) {
                (true, _, _, _) => EventPriority::Immediate,
                (false, true, _, _) => EventPriority::High,
                (false, false, true, _) => EventPriority::Medium,
                (false, false, false, _) => EventPriority::Low,
            };

            let current_lane = match self.current_priority {
                EventPriority::Immediate => &mut self.lanes[0],
                EventPriority::High => &mut self.lanes[1],
                EventPriority::Medium => &mut self.lanes[2],
                EventPriority::Low => &mut self.lanes[3],
            };

            if self.current_priority == EventPriority::Immediate {
                // IDGAF - get this out the door right now. loop poll if we need to
            }

            use futures_util::future::{select, Either};

            // if let Some(state) = current_lane.saved_state.take() {
            //     let mut machine = unsafe { state.promote(&self) };
            //     machine.work().await;
            // } else {
            if let Some(scope) = current_lane.dirty_scopes.pop() {
                let (mut saved_work, work_complete): (SavedDiffWork<'static>, bool) = {
                    let shared = SharedVdom {
                        channel: self.channel.clone(),
                        components: unsafe { &mut *self.components.get() },
                        elements: &mut self.raw_elements,
                    };
                    let mut machine = DiffMachine::new(Mutations::new(), shared);

                    let work_complete = {
                        let fut = machine.diff_scope(scope);
                        pin_mut!(fut);
                        match select(fut, &mut deadline).await {
                            Either::Left((work, _other)) => {
                                //
                                true
                            }
                            Either::Right((deadline, _other)) => {
                                //
                                false
                            }
                        }
                    };

                    let saved = machine.save();
                    let extended: SavedDiffWork<'static> = unsafe { transmute(saved) };
                    (extended, work_complete)
                };

                // release the stack borrow of ourself

                if work_complete {
                    for scope in saved_work.seen_scopes.drain() {
                        current_lane.dirty_scopes.remove(&scope);
                    }
                } else {
                }
                // }
            };

            // let mut new_mutations = Mutations::new();
            // match self.work_with_deadline(&mut deadline).await {
            //     Some(mutations) => {
            //         // safety: the scheduler will never let us mutate
            //         let extended: Mutations<'static> = unsafe { std::mem::transmute(mutations) };
            //         committed_mutations.push(extended)
            //     }
            //     None => return committed_mutations,
            // }
        }
        // // check if we need to elevate priority

        // // let mut machine = DiffMachine::new(mutations, ScopeId(0), &self);

        // let dirty_root = {
        //     let dirty_roots = match self.current_priority {
        //         EventPriority::High => &self.high_priorty.dirty_scopes,
        //         EventPriority::Medium => &self.medium_priority.dirty_scopes,
        //         EventPriority::Low => &self.low_priority.dirty_scopes,
        //     };
        //     let mut height = 0;
        //     let mut dirty_root = {
        //         let root = dirty_roots.iter().next();
        //         if root.is_none() {
        //             return true;
        //         }
        //         root.unwrap()
        //     };

        //     for root in dirty_roots {
        //         if let Some(scope) = self.get_scope(*root) {
        //             if scope.height < height {
        //                 height = scope.height;
        //                 dirty_root = root;
        //             }
        //         }
        //     }
        //     dirty_root
        // };

        // let fut = machine.diff_scope(*dirty_root).fuse();
        // pin_mut!(fut);

        // match futures_util::future::select(deadline, fut).await {
        //     futures_util::future::Either::Left((deadline, work_fut)) => true,
        //     futures_util::future::Either::Right((_, deadline_fut)) => false,
        // }
    }

    // waits for a trigger, canceling early if the deadline is reached
    // returns true if the deadline was reached
    // does not return the trigger, but caches it in the scheduler
    pub async fn wait_for_any_trigger(
        &mut self,
        deadline: &mut Pin<Box<impl FusedFuture<Output = ()>>>,
    ) -> bool {
        use futures_util::future::{select, Either};

        let event_fut = async {
            match select(self.receiver.next(), self.async_tasks.next()).await {
                Either::Left((msg, _other)) => {
                    self.handle_channel_msg(msg.unwrap());
                }
                Either::Right((task, _other)) => {
                    // do nothing, async task will likely generate a set of scheduler messages
                }
            }
        };

        pin_mut!(event_fut);

        match select(event_fut, deadline).await {
            Either::Left((msg, _other)) => false,
            Either::Right((deadline, _)) => true,
        }
    }

    pub fn handle_channel_msg(&mut self, msg: SchedulerMsg) {
        match msg {
            SchedulerMsg::Immediate(_) => todo!(),
            SchedulerMsg::UiEvent(_) => todo!(),

            //
            SchedulerMsg::SubmitTask(_, _) => todo!(),
            SchedulerMsg::ToggleTask(_) => todo!(),
            SchedulerMsg::PauseTask(_) => todo!(),
            SchedulerMsg::ResumeTask(_) => todo!(),
            SchedulerMsg::DropTask(_) => todo!(),
        }
    }

    pub fn add_dirty_scope(&mut self, scope: ScopeId, priority: EventPriority) {
        todo!()
        // match priority {
        //     EventPriority::High => self.high_priorty.dirty_scopes.insert(scope),
        //     EventPriority::Medium => self.medium_priority.dirty_scopes.insert(scope),
        //     EventPriority::Low => self.low_priority.dirty_scopes.insert(scope),
        // };
    }
}

pub struct PriortySystem {
    pub dirty_scopes: IndexSet<ScopeId>,
    pub saved_state: Option<SavedDiffWork<'static>>,
}

impl PriortySystem {
    pub fn new() -> Self {
        Self {
            saved_state: None,
            dirty_scopes: Default::default(),
        }
    }

    fn has_work(&self) -> bool {
        todo!()
    }

    fn work(&mut self) {
        let scope = self.dirty_scopes.pop();
    }
}

pub struct TaskHandle {
    pub sender: UnboundedSender<SchedulerMsg>,
    pub our_id: u64,
}

impl TaskHandle {
    /// Toggles this coroutine off/on.
    ///
    /// This method is not synchronous - your task will not stop immediately.
    pub fn toggle(&self) {}

    /// This method is not synchronous - your task will not stop immediately.
    pub fn start(&self) {}

    /// This method is not synchronous - your task will not stop immediately.
    pub fn stop(&self) {}

    /// This method is not synchronous - your task will not stop immediately.
    pub fn restart(&self) {}
}

#[derive(serde::Serialize, serde::Deserialize, Copy, Clone, PartialEq, Eq, Hash, Debug)]
pub struct ScopeId(pub usize);

#[derive(Copy, Clone, PartialEq, Eq, Hash, Debug)]
pub struct ElementId(pub usize);
impl Display for ElementId {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl ElementId {
    pub fn as_u64(self) -> u64 {
        self.0 as u64
    }
}

/// Priority of Event Triggers.
///
/// Internally, Dioxus will abort work that's taking too long if new, more important, work arrives. Unlike React, Dioxus
/// won't be afraid to pause work or flush changes to the RealDOM. This is called "cooperative scheduling". Some Renderers
/// implement this form of scheduling internally, however Dioxus will perform its own scheduling as well.
///
/// The ultimate goal of the scheduler is to manage latency of changes, prioritizing "flashier" changes over "subtler" changes.
///
/// React has a 5-tier priority system. However, they break things into "Continuous" and "Discrete" priority. For now,
/// we keep it simple, and just use a 3-tier priority system.
///
/// - NoPriority = 0
/// - LowPriority = 1
/// - NormalPriority = 2
/// - UserBlocking = 3
/// - HighPriority = 4
/// - ImmediatePriority = 5
///
/// We still have a concept of discrete vs continuous though - discrete events won't be batched, but continuous events will.
/// This means that multiple "scroll" events will be processed in a single frame, but multiple "click" events will be
/// flushed before proceeding. Multiple discrete events is highly unlikely, though.
#[derive(Debug, PartialEq, Eq, Clone, Copy, Hash, PartialOrd, Ord)]
pub enum EventPriority {
    /// Work that must be completed during the EventHandler phase
    ///
    ///
    Immediate = 3,

    /// "High Priority" work will not interrupt other high priority work, but will interrupt medium and low priority work.
    ///
    /// This is typically reserved for things like user interaction.
    ///
    /// React calls these "discrete" events, but with an extra category of "user-blocking" (Immediate).
    High = 2,

    /// "Medium priority" work is generated by page events not triggered by the user. These types of events are less important
    /// than "High Priority" events and will take presedence over low priority events.
    ///
    /// This is typically reserved for VirtualEvents that are not related to keyboard or mouse input.
    ///
    /// React calls these "continuous" events (e.g. mouse move, mouse wheel, touch move, etc).
    Medium = 1,

    /// "Low Priority" work will always be pre-empted unless the work is significantly delayed, in which case it will be
    /// advanced to the front of the work queue until completed.
    ///
    /// The primary user of Low Priority work is the asynchronous work system (suspense).
    ///
    /// This is considered "idle" work or "background" work.
    Low = 0,
}