#include <abby.hpp>
  #include <iterator> // back_inserter
  #include <vector>   // vector
  #include <iostream> // clog

  void foo()
  {
    // Constructs an AABB tree that uses integers as identifiers and AABBs with double precision
    abby::tree<int, double> tree;

    // Inserts a few AABBs, takes a lower and upper bound
    tree.insert(1, {150.0, 165.0}, {50.0, 50.0});
    tree.insert(2, {88.0, 63.0}, {150.0, 343.0});
    tree.insert(3, {412.0, 132.0}, {566.0, 291.0});

    // Could also use a stack buffer
    std::vector<int> candidates;  

    // Find collision candidates
    tree.query(1, std::back_inserter(candidates));  
    for (const auto candidate : candidates) {
      // Obtains an AABB
      const auto& aabb = tree.get_aabb(candidate);
    }
  
    // Prints the tree using a stream
    tree.print(std::clog);

    // Updates an existing AABB
    tree.update(2, {33.0, 76.0}, {123.0, 155.0});

    // Sets the position of an AABB
    tree.relocate(2, {12.0, 34.0});

    // Removes an AABB from the tree
    tree.erase(2);

    // Rebuild as optimal tree
    tree.rebuild();

    // Clear the tree of all entries
    tree.clear();
  }