quadtree_rs 0.1.3

use {
    num::{cast::FromPrimitive, PrimInt},
    quadtree_rs::area::AreaBuilder,
    std::{collections::HashSet, default::Default, fmt::Debug, hash::Hash, iter::FromIterator},
};

// Inspired by google/googletest's UnorderedElementsAre().
// https://github.com/google/googletest/blob/master/googlemock/docs/CheatSheet.md#container-matchers
//
// This function only gets used in tests.
#[allow(dead_code)]
pub fn unordered_elements_are<T, X, Y>(x: X, y: Y) -> bool
where
    X: IntoIterator<Item = T>,
    X::Item: PartialEq + Eq + Hash,
    Y: IntoIterator<Item = T>,
    Y::Item: PartialEq + Eq + Hash,
{
    let hs1: HashSet<T> = HashSet::from_iter(x);
    let hs2: HashSet<T> = HashSet::from_iter(y);
    hs1 == hs2
}

#[allow(dead_code)]
pub fn print_quadtree<U, V>(qt: &quadtree_rs::Quadtree<U, V>)
where
    U: PrimInt + Default + FromPrimitive + Debug,
    V: Debug,
{
    print!("┌");
    for _i in 0..qt.width() {
        print!("─");
    }
    println!("┐");
    for i in 0..qt.width() {
        print!("│");
        for j in 0..qt.height() {
            match qt
                .query(
                    AreaBuilder::default()
                        .anchor((U::from_usize(i).unwrap(), U::from_usize(j).unwrap()).into())
                        .build()
                        .unwrap(),
                )
                .count()
            {
                0 => print!(" "),
                1 => print!("░"),
                2 => print!("▒"),
                3 => print!("▓"),
                _ => print!("█"),
            }
        }
        println!("|");
    }
    print!("└");
    for _i in 0..qt.width() {
        print!("─");
    }
    println!("┘");
}