blob: 28667d34b9f79c5edc75e9d565192a18d69ebf8a (
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* 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/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#ifndef INCLUDED_BASEGFX_RANGE_BASICBOX_HXX
#define INCLUDED_BASEGFX_RANGE_BASICBOX_HXX
#include <basegfx/range/basicrange.hxx>
#include <basegfx/basegfxdllapi.h>
namespace basegfx
{
/** Explicitely different from BasicRange, handling the inside predicates
differently.
This is modelled after how polygon fill algorithms set pixel -
typically excluding rightmost and bottommost ones.
*/
class BasicBox : public BasicRange< sal_Int32, Int32Traits >
{
typedef BasicRange< sal_Int32, Int32Traits > Base;
public:
BasicBox() {}
explicit BasicBox( sal_Int32 nValue ) :
Base( nValue )
{
}
bool isEmpty() const
{
return mnMinimum >= mnMaximum;
}
double getCenter() const
{
if(isEmpty())
{
return 0.0;
}
else
{
return ((mnMaximum + mnMinimum - 1.0) / 2.0);
}
}
using Base::isInside;
bool isInside(sal_Int32 nValue) const
{
if(isEmpty())
{
return false;
}
else
{
return (nValue >= mnMinimum) && (nValue < mnMaximum);
}
}
using Base::overlaps;
bool overlaps(const BasicBox& rBox) const
{
if(isEmpty())
{
return false;
}
else
{
if(rBox.isEmpty())
{
return false;
}
else
{
return !((rBox.mnMaximum <= mnMinimum) || (rBox.mnMinimum >= mnMaximum));
}
}
}
void grow(sal_Int32 nValue)
{
if(!isEmpty())
{
bool bLessThanZero(nValue < 0);
if(nValue > 0 || bLessThanZero)
{
mnMinimum -= nValue;
mnMaximum += nValue;
if(bLessThanZero)
{
// test if range did collapse
if(mnMinimum > mnMaximum)
{
// if yes, collapse to center
mnMinimum = mnMaximum = ((mnMaximum + mnMinimum - 1) / 2);
}
}
}
}
}
};
} // end of namespace basegfx
#endif // INCLUDED_BASEGFX_RANGE_BASICBOX_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
