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
92
|
/*
VeroRoute - Qt based Veroboard/Perfboard/PCB layout & routing application.
Copyright (C) 2017 Alex Lawrow ( dralx@users.sourceforge.net )
This program 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.
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma once
#include "Persist.h"
class Rect : public Persist, public Merge
{
public:
Rect() {}
Rect(int rowMin, int rowMax, int colMin, int colMax) : m_rowMin(rowMin), m_rowMax(rowMax), m_colMin(colMin), m_colMax(colMax) {}
virtual ~Rect() {}
Rect(const Rect& o) { *this = o; }
Rect& operator=(const Rect& o) { m_rowMin = o.m_rowMin; m_rowMax = o.m_rowMax; m_colMin = o.m_colMin; m_colMax = o.m_colMax; return *this; }
bool operator==(const Rect& o) const { return m_rowMin == o.m_rowMin && m_rowMax == o.m_rowMax && m_colMin == o.m_colMin && m_colMax == o.m_colMax; }
bool operator!=(const Rect& o) const { return !(*this == o); }
bool operator<(const Rect& o) const { return GetArea() > o.GetArea(); } // Bigger area is prefered
Rect& operator|=(const Rect& o)
{
if ( !o.GetIsValid() ) return *this;
m_colMin = std::min(m_colMin, o.m_colMin);
m_colMax = std::max(m_colMax, o.m_colMax);
m_rowMin = std::min(m_rowMin, o.m_rowMin);
m_rowMax = std::max(m_rowMax, o.m_rowMax);
return *this;
}
Rect operator|(const Rect& o)
{
Rect out(*this);
out |= o;
return out;
}
void SetInvalid() { m_rowMin = m_colMin = INT_MAX; m_rowMax = m_colMax = INT_MIN; }
bool GetIsValid() const { return m_rowMin <= m_rowMax && m_colMin <= m_colMax ; }
int GetRows() const { return GetIsValid() ? 1 + m_rowMax - m_rowMin : 0; }
int GetCols() const { return GetIsValid() ? 1 + m_colMax - m_colMin : 0; }
int GetArea() const { return GetRows() * GetCols(); }
bool ContainsPoint(int row, int col) const { return GetIsValid() ? row >= m_rowMin && row <= m_rowMax && col >= m_colMin && col <= m_colMax : false; }
bool Overlaps(const Rect& o) const
{
if ( m_rowMin > o.m_rowMax ) return false;
if ( m_rowMax < o.m_rowMin ) return false;
if ( m_colMin > o.m_colMax ) return false;
if ( m_colMax < o.m_colMin ) return false;
return true;
}
void Move(int iDown, int iRight) { if ( !GetIsValid() ) return; m_rowMin += iDown; m_rowMax += iDown; m_colMin += iRight; m_colMax += iRight; }
// Merge interface functions
virtual void UpdateMergeOffsets(MergeOffsets& o) override
{
o.deltaRow = std::max(o.deltaRow, m_rowMax + 1);
//o.deltaCol = std::max(o.deltaCol, m_colMax + 1);
}
virtual void ApplyMergeOffsets(const MergeOffsets& o) override
{
m_rowMin += o.deltaRow; m_rowMax += o.deltaRow;
m_colMin += o.deltaCol; m_colMax += o.deltaCol;
}
// Persist interface functions
virtual void Load(DataStream& inStream) override
{
inStream.Load(m_rowMin);
inStream.Load(m_rowMax);
inStream.Load(m_colMin);
inStream.Load(m_colMax);
}
virtual void Save(DataStream& outStream) override
{
outStream.Save(m_rowMin);
outStream.Save(m_rowMax);
outStream.Save(m_colMin);
outStream.Save(m_colMax);
}
int m_rowMin = INT_MAX, m_rowMax = INT_MIN, m_colMin = INT_MAX, m_colMax = INT_MIN;
};
|
