summaryrefslogtreecommitdiff
path: root/common/Rectangle.hpp
blob: 05099312a46f790840e12f833b33aec963755d32 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
/*
 * This file is part of the LibreOffice project.
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
 */

#pragma once

#include <algorithm> // std::min, std::max
#include <limits>

namespace Util
{

/// Holds the position and size of a rectangle.
struct Rectangle
{
private:
    int _x1;
    int _y1;
    int _x2;
    int _y2;

public:
    Rectangle()
        : _x1(std::numeric_limits<int>::max())
        , _y1(std::numeric_limits<int>::max())
        , _x2(std::numeric_limits<int>::min())
        , _y2(std::numeric_limits<int>::min())
    {}

    Rectangle(int x, int y, int width, int height)
        : _x1(x)
        , _y1(y)
        , _x2(x + width)
        , _y2(y + height)
    {}

    void extend(Rectangle& rectangle)
    {
        if (rectangle._x1 < _x1)
            _x1 = rectangle._x1;
        if (rectangle._x2 > _x2)
            _x2 = rectangle._x2;
        if (rectangle._y1 < _y1)
            _y1 = rectangle._y1;
        if (rectangle._y2 > _y2)
            _y2 = rectangle._y2;
    }

    void setLeft(int x1) { _x1 = x1; }

    int getLeft() const { return _x1; }

    void setRight(int x2) { _x2 = x2; }

    int getRight() const { return _x2; }

    void setTop(int y1) { _y1 = y1; }

    int getTop() const { return _y1; }

    void setBottom(int y2) { _y2 = y2; }

    int getBottom() const { return _y2; }

    int getWidth() const { return _x2 - _x1; }

    int getHeight() const { return _y2 - _y1; }

    bool isValid() const { return _x1 <= _x2 && _y1 <= _y2; }

    bool hasSurface() const { return _x1 < _x2 && _y1 < _y2; }

    bool intersects(const Rectangle& rOther)
    {
        Util::Rectangle intersection;
        intersection._x1 = std::max(_x1, rOther._x1);
        intersection._y1 = std::max(_y1, rOther._y1);
        intersection._x2 = std::min(_x2, rOther._x2);
        intersection._y2 = std::min(_y2, rOther._y2);
        return intersection.isValid();
    }
};

}

/* vim:set shiftwidth=4 softtabstop=4 expandtab: */