int main()
{
test_basic();
test_capacity();
test_comparison();
test_composite_key();
test_conv_iterators();
test_copy_assignment();
test_hash_ops();
test_iterators();
test_key_extractors();
test_list_ops();
test_modifiers();
test_mpl_ops();
test_observers();
test_projection();
test_range();
test_rank_ops();
test_rearrange();
test_safe_mode();
test_serialization();
test_set_ops();
test_special_set_ops();
test_update();
return boost::report_errors();
}
bool ConvexPolygon::overlaps(const ConvexPolygon &polygon) const
{
// First a simple bound check
if(!bounds().overlaps(polygon.bounds()))
return false;
// Overlap check using separating axis theorem
for(const glm::vec2 &normal : m_normals) {
if(!test_projection(*this, polygon, normal))
return false;
}
return true;
}
int main()
{
test_projection();
return boost::report_errors();
}
int test_main(int,char *[])
{
test_projection();
return 0;
}