/* * This file is part of libgim. * * libgim is free software: you can redistribute it and/or modify it under the * terms of the GNU General Public License as published by the Free Software * Foundation, either version 3 of the License, or (at your option) any later * version. * * libgim is distributed in the hope that it will be useful, but WITHOUT ANY * WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more * details. * * You should have received a copy of the GNU General Public License * along with libgim. If not, see . * * Copyright 2010 Danny Robson */ #include "region.hpp" #include "enable_if.hpp" #include "debug.hpp" #include using namespace util; /* * Rect */ template extent::extent (const T _width, const T _height): width (_width), height (_height) { ; } template T extent::area (void) const { return width * height; } template bool extent::empty (void) const { return almost_equal (area(), 0); } template bool extent::operator ==(const extent& rhs) const { return almost_equal (width, rhs.width) && almost_equal (height, rhs.height); } template void extent::sanity (void) const { check (width >= 0 && height >= 0); } namespace util { template <> void extent::sanity (void) const { return; } } template struct extent; template struct extent; /* * Region */ template region::region (T _x, T _y, T _width, T _height): x (_x), y (_y), width (_width), height (_height) { ; } template T region::area (void) const { return width * height; } template bool region::empty (void) const { return almost_equal (area (), 0); } template point region::centre (void) const { double cx = x + static_cast(width / 2.0), cy = y + static_cast(height / 2.0); return { cx, cy, 0.0 }; } template bool region::includes (const point &p) const { return p.x >= x && p.y >= y && p.x <= x + width && p.y <= y + height; } template bool region::contains (const point& p) const { return p.x > x && p.y > y && p.x < x + width && p.y < y + height; } template bool region::overlaps (const region &rhs) const { return x < rhs.x + rhs.width && x + width > rhs.x && y < rhs.y + rhs.height && y + height > rhs.y; } template bool region::operator ==(const region& rhs) const { return almost_equal (x, rhs.x) && almost_equal (y, rhs.y) && almost_equal (width, rhs.width) && almost_equal (height, rhs.height); } template void region::sanity (void) const { check (width >= 0 && height >= 0); } namespace util { template <> void region::sanity (void) const { return; } } template struct region; template struct region;