1 # SPDX-FileCopyrightText: 2021 Melissa LeBlanc-Williams for Adafruit Industries
2 # SPDX-FileCopyrightText: 2021 James Carr
4 # SPDX-License-Identifier: MIT
8 ================================================================================
10 Area for Blinka Displayio
12 **Software and Dependencies:**
15 https://github.com/adafruit/Adafruit_Blinka/releases
17 * Author(s): James Carr, Melissa LeBlanc-Williams
21 from __future__ import annotations
23 __version__ = "0.0.0-auto.0"
24 __repo__ = "https://github.com/adafruit/Adafruit_Blinka_Displayio.git"
27 # pylint: disable=invalid-name,missing-function-docstring
28 def __init__(self, x1: int = 0, y1: int = 0, x2: int = 0, y2: int = 0):
36 return f"Area TL({self.x1},{self.y1}) BR({self.x2},{self.y2})"
38 def _copy_into(self, dst) -> None:
44 def _scale(self, scale: int) -> None:
50 def _shift(self, dx: int, dy: int) -> None:
56 def _compute_overlap(self, other, overlap) -> bool:
58 overlap.x1 = max(a.x1, other.x1)
59 overlap.x2 = min(a.x2, other.x2)
61 if overlap.x1 >= overlap.x2:
64 overlap.y1 = max(a.y1, other.y1)
65 overlap.y2 = min(a.y2, other.y2)
67 return overlap.y1 < overlap.y2
70 return (self.x1 == self.x2) or (self.y1 == self.y2)
74 self.x1, self.x2 = self.x2, self.x1
76 self.y1, self.y2 = self.y2, self.y1
78 def _union(self, other, union):
79 # pylint: disable=protected-access
81 self._copy_into(union)
84 other._copy_into(union)
87 union.x1 = min(self.x1, other.x1)
88 union.y1 = min(self.y1, other.y1)
89 union.x2 = max(self.x2, other.x2)
90 union.y2 = max(self.y2, other.y2)
92 def width(self) -> int:
93 return self.x2 - self.x1
95 def height(self) -> int:
96 return self.y2 - self.y1
98 def size(self) -> int:
99 return self.width() * self.height()
101 def __eq__(self, other):
102 if not isinstance(other, Area):
107 and self.y1 == other.y1
108 and self.x2 == other.x2
109 and self.y2 == other.y2
113 def _transform_within(
121 # pylint: disable=too-many-arguments
122 # Original and whole must be in the same coordinate space.
124 transformed.x1 = whole.x1 + (whole.x2 - original.x2)
125 transformed.x2 = whole.x2 - (original.x1 - whole.x1)
127 transformed.x1 = original.x1
128 transformed.x2 = original.x2
131 transformed.y1 = whole.y1 + (whole.y2 - original.y2)
132 transformed.y2 = whole.y2 - (original.y1 - whole.y1)
134 transformed.y1 = original.y1
135 transformed.y2 = original.y2
140 transformed.y1 = whole.y1 + (transformed.x1 - whole.x1)
141 transformed.y2 = whole.y1 + (transformed.x2 - whole.x1)
142 transformed.x1 = whole.x1 + (y1 - whole.y1)
143 transformed.x2 = whole.x1 + (y2 - whole.y1)