dioxus/packages/core/src/arena.rs

144 lines
4.3 KiB
Rust
Raw Normal View History

2022-11-29 21:31:04 +00:00
use crate::{
factory::RenderReturn, nodes::VNode, virtual_dom::VirtualDom, AttributeValue, DynamicNode,
ScopeId, VFragment,
};
use bumpalo::boxed::Box as BumpBox;
2022-11-02 01:42:29 +00:00
2022-11-16 00:05:22 +00:00
#[cfg_attr(feature = "serialize", derive(serde::Serialize, serde::Deserialize))]
#[derive(Clone, Copy, Debug, PartialEq, Eq, PartialOrd, Ord, Hash, Default)]
pub struct ElementId(pub usize);
2022-11-29 21:31:04 +00:00
pub(crate) struct ElementRef {
2022-11-18 04:00:39 +00:00
// the pathway of the real element inside the template
2022-11-27 14:38:40 +00:00
pub path: ElementPath,
2022-11-18 04:00:39 +00:00
// The actual template
2022-11-02 01:42:29 +00:00
pub template: *mut VNode<'static>,
}
2022-11-27 14:38:40 +00:00
#[derive(Clone, Copy)]
pub enum ElementPath {
Deep(&'static [u8]),
Root(usize),
}
2022-11-18 04:00:39 +00:00
impl ElementRef {
2022-11-29 21:31:04 +00:00
pub(crate) fn null() -> Self {
2022-11-12 02:29:27 +00:00
Self {
template: std::ptr::null_mut(),
2022-11-27 14:38:40 +00:00
path: ElementPath::Root(0),
2022-11-12 02:29:27 +00:00
}
}
}
2022-11-27 05:22:39 +00:00
impl<'b> VirtualDom {
2022-11-29 21:31:04 +00:00
pub(crate) fn next_element(&mut self, template: &VNode, path: &'static [u8]) -> ElementId {
2022-11-02 01:42:29 +00:00
let entry = self.elements.vacant_entry();
let id = entry.key();
2022-11-18 04:00:39 +00:00
entry.insert(ElementRef {
2022-11-02 01:42:29 +00:00
template: template as *const _ as *mut _,
2022-11-27 14:38:40 +00:00
path: ElementPath::Deep(path),
});
ElementId(id)
}
2022-11-29 21:31:04 +00:00
pub(crate) fn next_root(&mut self, template: &VNode, path: usize) -> ElementId {
2022-11-27 14:38:40 +00:00
let entry = self.elements.vacant_entry();
let id = entry.key();
entry.insert(ElementRef {
template: template as *const _ as *mut _,
path: ElementPath::Root(path),
2022-11-02 01:42:29 +00:00
});
ElementId(id)
}
2022-11-29 21:31:04 +00:00
pub(crate) fn reclaim(&mut self, el: ElementId) {
self.try_reclaim(el)
.unwrap_or_else(|| panic!("cannot reclaim {:?}", el));
}
2022-11-18 04:00:39 +00:00
2022-11-29 21:31:04 +00:00
pub(crate) fn try_reclaim(&mut self, el: ElementId) -> Option<ElementRef> {
assert_ne!(el, ElementId(0));
self.elements.try_remove(el.0)
}
2022-11-27 05:22:39 +00:00
2022-11-29 21:31:04 +00:00
// Drop a scope and all its children
pub(crate) fn drop_scope(&mut self, id: ScopeId) {
let scope = self.scopes.get(id.0).unwrap();
2022-11-27 05:22:39 +00:00
2022-11-29 21:31:04 +00:00
if let Some(root) = scope.as_ref().try_root_node() {
let root = unsafe { root.extend_lifetime_ref() };
match root {
RenderReturn::Sync(Ok(node)) => self.drop_scope_inner(node),
_ => {}
}
}
2022-11-27 05:22:39 +00:00
2022-11-29 21:31:04 +00:00
let scope = self.scopes.get(id.0).unwrap();
if let Some(root) = unsafe { scope.as_ref().previous_frame().try_load_node() } {
let root = unsafe { root.extend_lifetime_ref() };
match root {
RenderReturn::Sync(Ok(node)) => self.drop_scope_inner(node),
_ => {}
}
}
let scope = self.scopes.get(id.0).unwrap().as_ref();
// Drop all the hooks once the children are dropped
// this means we'll drop hooks bottom-up
for hook in scope.hook_list.borrow_mut().drain(..) {
drop(unsafe { BumpBox::from_raw(hook) });
}
2022-11-27 05:22:39 +00:00
}
2022-11-29 21:31:04 +00:00
fn drop_scope_inner(&mut self, node: &VNode) {
for attr in node.dynamic_attrs {
if let AttributeValue::Listener(l) = &attr.value {
l.borrow_mut().take();
}
}
for (idx, _) in node.template.roots.iter().enumerate() {
match node.dynamic_root(idx) {
Some(DynamicNode::Component(c)) => self.drop_scope(c.scope.get().unwrap()),
Some(DynamicNode::Fragment(VFragment::NonEmpty(nodes))) => {
for node in *nodes {
self.drop_scope_inner(node);
}
}
_ => {}
}
}
2022-11-27 05:22:39 +00:00
}
}
2022-11-29 21:31:04 +00:00
2022-11-27 14:38:40 +00:00
impl ElementPath {
pub(crate) fn is_ascendant(&self, big: &&[u8]) -> bool {
match *self {
ElementPath::Deep(small) => small.len() <= big.len() && small == &big[..small.len()],
ElementPath::Root(r) => big.len() == 1 && big[0] == r as u8,
}
}
}
#[test]
fn path_ascendant() {
// assert!(&ElementPath::Deep(&[]).is_ascendant(&&[0_u8]));
// assert!(&ElementPath::Deep(&[1, 2]), &[1, 2, 3]);
// assert!(!is_path_ascendant(
// &ElementPath::Deep(&[1, 2, 3, 4]),
// &[1, 2, 3]
// ));
}
impl PartialEq<&[u8]> for ElementPath {
fn eq(&self, other: &&[u8]) -> bool {
match *self {
ElementPath::Deep(deep) => deep.eq(*other),
ElementPath::Root(r) => other.len() == 1 && other[0] == r as u8,
}
}
}