use super::Entry;
use crate::accessibility::{AccessNode, AccessRole, Geometry, Slot, NO_PARENT};
use crate::Id;
use std::collections::HashMap;
pub(super) struct Selection {
pub entries: Vec<Entry>,
pub top: Vec<usize>,
}
pub(super) struct Layers<F> {
pub modal: Option<usize>,
pub rank: F,
}
pub(super) fn published(
nodes: &[AccessNode],
slots: &[Slot],
layers: Layers<impl Fn(Id) -> usize>,
) -> Selection {
debug_assert_eq!(nodes.len(), slots.len());
let mut ranks: HashMap<Id, usize> = HashMap::new();
let mut entries = vec![Entry::default(); nodes.len()];
let mut top = Vec::new();
for (i, (node, slot)) in nodes.iter().zip(slots).enumerate() {
let alive = !slot.removed
&& slot.geometry != Geometry::Pending
&& match slot.parent {
NO_PARENT => {
let layer = node.layer;
let rank = *ranks.entry(layer).or_insert_with(|| (layers.rank)(layer));
top.push((rank, i));
layers.modal.is_none_or(|modal| rank >= modal) || escapes_modal(node.role)
}
parent => entries[parent as usize].alive,
};
entries[i].alive = alive;
entries[i].parent = slot.parent;
if slot.parent != NO_PARENT {
let parent = slot.parent as usize;
let scrolls = nodes[parent]
.more
.as_ref()
.is_some_and(|more| more.scroll.is_some());
entries[i].scrolled = entries[parent].scrolled || scrolls;
}
}
top.retain(|(_, i)| entries[*i].alive);
top.sort();
Selection {
entries,
top: top.into_iter().map(|(_, i)| i).collect(),
}
}
fn escapes_modal(role: AccessRole) -> bool {
matches!(
role,
AccessRole::Status | AccessRole::Alert | AccessRole::Tooltip
)
}