use std::collections::HashSet;
use std::cmp::Ordering;
use bindgen::ir::{ItemContainer, Path};
pub struct Dependencies {
pub order: Vec<ItemContainer>,
pub items: HashSet<Path>,
}
impl Dependencies {
pub fn new() -> Dependencies {
Dependencies {
order: Vec::new(),
items: HashSet::new(),
}
}
pub fn sort(&mut self) {
let ordering = |a: &ItemContainer, b: &ItemContainer| {
match (a, b) {
(&ItemContainer::Enum(ref x), &ItemContainer::Enum(ref y)) => x.name.cmp(&y.name),
(&ItemContainer::Enum(_), _) => Ordering::Less,
(_, &ItemContainer::Enum(_)) => Ordering::Greater,
(&ItemContainer::OpaqueItem(ref x), &ItemContainer::OpaqueItem(ref y)) => x.name.cmp(&y.name),
(&ItemContainer::OpaqueItem(_), _) => Ordering::Less,
(_, &ItemContainer::OpaqueItem(_)) => Ordering::Greater,
_ => Ordering::Equal,
}
};
self.order.sort_by(ordering);
}
}