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
|
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_COMMON_GFX_INSETS_H__
#define CHROME_COMMON_GFX_INSETS_H__
namespace gfx {
//
// An insets represents the borders of a container (the space the container must
// leave at each of its edges).
//
class Insets {
public:
Insets() : top_(0), left_(0), bottom_(0), right_(0) {}
Insets(int top, int left, int bottom, int right)
: top_(top), left_(left), bottom_(bottom), right_(right) { }
~Insets() {}
int top() const { return top_; }
int left() const { return left_; }
int bottom() const { return bottom_; }
int right() const { return right_; }
// Returns the total width taken up by the insets, which is the sum of the
// left and right insets.
int width() const { return left_ + right_; }
// Returns the total height taken up by the insets, which is the sum of the
// top and bottom insets.
int height() const { return top_ + bottom_; }
void Set(int top, int left, int bottom, int right) {
top_ = top;
left_ = left;
bottom_ = bottom;
right_ = right;
}
bool operator==(const Insets& insets) const {
return top_ == insets.top_ && left_ == insets.left_ &&
bottom_ == insets.bottom_ && right_ == insets.right_;
}
bool operator!=(const Insets& insets) const {
return !(*this == insets);
}
Insets& operator+=(const Insets& insets) {
top_ += insets.top_;
left_ += insets.left_;
bottom_ += insets.bottom_;
right_ += insets.right_;
return *this;
}
private:
int top_;
int left_;
int bottom_;
int right_;
};
} // namespace
#endif // CHROME_COMMON_GFX_INSETS_H__
|
