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"
28 # pylint: disable=invalid-name,missing-function-docstring
29 """Area Class to represent an area to be updated. Currently not used."""
31 def __init__(self, x1: int = 0, y1: int = 0, x2: int = 0, y2: int = 0):
39 return f"Area TL({self.x1},{self.y1}) BR({self.x2},{self.y2})"
41 def _copy_into(self, dst) -> None:
47 def _scale(self, scale: int) -> None:
53 def _shift(self, dx: int, dy: int) -> None:
59 def _compute_overlap(self, other, overlap) -> bool:
61 overlap.x1 = max(a.x1, other.x1)
62 overlap.x2 = min(a.x2, other.x2)
64 if overlap.x1 >= overlap.x2:
67 overlap.y1 = max(a.y1, other.y1)
68 overlap.y2 = min(a.y2, other.y2)
70 return overlap.y1 < overlap.y2
73 return (self.x1 == self.x2) or (self.y1 == self.y2)
77 self.x1, self.x2 = self.x2, self.x1
79 self.y1, self.y2 = self.y2, self.y1
81 def _union(self, other, union):
82 # pylint: disable=protected-access
84 self._copy_into(union)
87 other._copy_into(union)
90 union.x1 = min(self.x1, other.x1)
91 union.y1 = min(self.y1, other.y1)
92 union.x2 = max(self.x2, other.x2)
93 union.y2 = max(self.y2, other.y2)
95 def width(self) -> int:
96 return self.x2 - self.x1
98 def height(self) -> int:
99 return self.y2 - self.y1
101 def size(self) -> int:
102 return self.width() * self.height()
104 def __eq__(self, other):
105 if not isinstance(other, Area):
110 and self.y1 == other.y1
111 and self.x2 == other.x2
112 and self.y2 == other.y2
116 def _transform_within(
124 # pylint: disable=too-many-arguments
125 # Original and whole must be in the same coordinate space.
127 transformed.x1 = whole.x1 + (whole.x2 - original.x2)
128 transformed.x2 = whole.x2 - (original.x1 - whole.x1)
130 transformed.x1 = original.x1
131 transformed.x2 = original.x2
134 transformed.y1 = whole.y1 + (whole.y2 - original.y2)
135 transformed.y2 = whole.y2 - (original.y1 - whole.y1)
137 transformed.y1 = original.y1
138 transformed.y2 = original.y2
143 transformed.y1 = whole.y1 + (transformed.x1 - whole.x1)
144 transformed.y2 = whole.y1 + (transformed.x2 - whole.x1)
145 transformed.x1 = whole.x1 + (y1 - whole.y1)
146 transformed.x2 = whole.x1 + (y2 - whole.y1)