use std::collections::BTreeMap;
#[derive(Debug, Default)]
pub struct Backtrace {
instrs: BTreeMap<usize, Vec<u8>>,
}
impl Backtrace {
pub fn push(&mut self, bytes: impl AsRef<[u8]>) {
self.instrs.insert(self.instrs.len(), bytes.as_ref().into());
}
pub fn pop(&mut self) -> Vec<u8> {
self.instrs.pop_last().unwrap_or_default().1
}
pub fn last(&self) -> Option<Vec<u8>> {
self.instrs.last_key_value().map(|(_, op)| op.clone())
}
pub fn popn(&mut self, n: usize) -> Vec<Vec<u8>> {
let mut r: Vec<Vec<u8>> = Default::default();
while r.len() < n {
r.push(self.pop())
}
r
}
}