dymokomi/luce-browser-engine
Source of release 0.6.0
0.6.0 / src / web / dom / anchor_name_map.lucb
#==============================================================================================
#
# anchor_name_map - DOM::AnchorNameMap: the anchor-name → elements index (CSS anchor positioning)
#
# DESCRIPTION:
# Port of LibWeb/DOM/AnchorNameMap.cpp (lines 1-46) and the inline functions of
# AnchorNameMap.h. Each name keeps its elements in tree order, so the last one is the
# last element in tree order.
#
#==============================================================================================
## The captures of register_name's find_first_index_if predicate.
struct DomAnchorNameMapRegisterNameIsBefore:
var element: DomElement*
## register_name's predicate: `element->is_before(existing)`.
func dom_anchor_name_map_register_name_is_before(context: void*?, existing: const (DomElement*)*) -> bool:
let captures = (DomAnchorNameMapRegisterNameIsBefore*)(context else trap("no captures"))
return tree_node_is_before(captures.element.dom_node(), (*existing).dom_node())
## Ported from AnchorNameMap.cpp:12 Web::DOM::AnchorNameMap::register_name.
pub func dom_anchor_name_map_register_name(this: DomAnchorNameMap*, name: ak.FlyString, element: DomElement*):
let elements = ak.hash_map_ensure(&this.m_map, name)
if ak.vector_find_first_index(elements, element) != none:
return
# Insert in tree order so that .last() is always the last element in tree order.
var captures = DomAnchorNameMapRegisterNameIsBefore(element = element)
let predicate = ak.Function1[const (DomElement*)*, bool](call = dom_anchor_name_map_register_name_is_before, context = &captures)
if let index = ak.vector_find_first_index_if(elements, predicate):
ak.vector_insert(elements, index, element)
else:
ak.vector_append_t(elements, element)
## unregister_name's remove_first_matching predicate: `e == element`.
func dom_anchor_name_map_unregister_name_matches(context: void*?, e: const (DomElement*)*) -> bool:
let element = (DomElement*)(context else trap("no element"))
return *e == element
## Ported from AnchorNameMap.cpp:28 Web::DOM::AnchorNameMap::unregister_name.
pub func dom_anchor_name_map_unregister_name(this: DomAnchorNameMap*, name: ak.FlyString, element: DomElement*):
let it = ak.hash_map_find_k(&this.m_map, name)
let bucket = it.m_bucket else return
let predicate = ak.Function1[const (DomElement*)*, bool](call = dom_anchor_name_map_unregister_name_matches, context = element)
_ = ak.vector_remove_first_matching(&bucket.storage.value, predicate)
if ak.vector_is_empty(&bucket.storage.value):
ak.hash_map_remove_opaque(&this.m_map, it)
## Ported from AnchorNameMap.cpp:38 Web::DOM::AnchorNameMap::element_by_name.
pub func dom_anchor_name_map_element_by_name(this: const DomAnchorNameMap*, name: ak.FlyString) -> DomElement*?:
let elements = ak.hash_map_get_k_const(&this.m_map, name) else return none
if ak.vector_is_empty(elements):
return none
return *ak.vector_last_const(elements)
## Ported from AnchorNameMap.h:24 Web::DOM::AnchorNameMap::visit_edges.
pub func dom_anchor_name_map_visit_edges(this: DomAnchorNameMap*, visitor: gc.CellVisitor*):
# visitor.visit(m_map): HashMap<FlyString, Vector<GC::Ref<Element>>> visits every element of every vector.
for entry in ak.hash_map_begin(&this.m_map):
gc.cell_visitor_visit_vector(visitor, &entry.value)