File: cubeiterator.py

package info (click to toggle)
displaycal-py3 3.9.16-1
  • links: PTS
  • area: main
  • in suites: forky, sid, trixie
  • size: 29,120 kB
  • sloc: python: 115,777; javascript: 11,540; xml: 598; sh: 257; makefile: 173
file content (111 lines) | stat: -rw-r--r-- 3,272 bytes parent folder | download
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
# -*- coding: utf-8 -*-


class Cube3D:
    def __init__(self, size=65, start=0, end=None):
        orange = start, end
        numentries = size**3
        if end is None:
            end = numentries
        for name in ("start", "end"):
            v = locals()[name]
            if not isinstance(v, int):
                raise TypeError(
                    f"integer {name} argument expected, got {v.__class__.__name__}"
                )
        start = self._clamp(start, 0, numentries, -1)
        end = self._clamp(end, 0, numentries, -1)
        for i, name in enumerate(("start", "end")):
            v = locals()[name]
            if v == -1:
                raise ValueError(f"{name} argument {orange[i]:.0f} out of range")
        self._size = size
        self._start = start
        self._len = end - start

    def get(self, i, default=None):
        if i < 0:
            i = self._len + i
        if i < 0 or i > self._len - 1:
            return default
        return self[i]

    def index(self, xxx_todo_changeme):
        (c0, c1, c2) = xxx_todo_changeme
        if (c0, c1, c2) not in self:
            raise ValueError("%r not in %r" % ((c0, c1, c2), self))
        i = c0 * self._size**2 + c1 * self._size + c2
        return int(i) - self._start

    def _clamp(self, v, lower=0, upper=None, fallback=None):
        if not upper:
            upper = self._len
        if v < lower:
            if v < -upper:
                v = fallback or lower
            else:
                v = upper + v
        elif v > upper:
            v = fallback or upper
        return v

    def __contains__(self, xxx_todo_changeme1):
        (c0, c1, c2) = xxx_todo_changeme1
        return (
            c0 == int(c0)
            and c1 == int(c1)
            and c2 == int(c2)
            and max(c0, c1, c2) < self._size
            and self._start
            <= c0 * self._size**2 + c1 * self._size + c2
            < self._len + self._start
        )

    def __getitem__(self, i):
        oi = i
        if i < 0:
            i = self._len + i
        if i < 0 or i > self._len - 1:
            raise IndexError("index %i out of range" % oi)
        i += self._start
        return (
            i // self._size // self._size,
            i // self._size % self._size,
            i % self._size,
        )

    def __getslice__(self, i, j):
        i = self._clamp(i)
        j = self._clamp(j)
        return self.__class__(self._size, self._start + i, self._start + j)

    def __len__(self):
        return self._len

    def __repr__(self):
        return "{}(size={:.0f}, start={:.0f}, end={:.0f})".format(
            self.__class__.__name__,
            self._size,
            self._start,
            self._start + self._len,
        )


class Cube3DIterator(Cube3D):
    # This iterator is actually slightly slower especially with large cubes
    # than using iter(<Cube3D instance>)

    def __init__(self, *args, **kwargs):
        Cube3D.__init__(self, *args, **kwargs)
        self._next = 0

    def __iter__(self):
        return self

    def __next__(self):
        if self._next == self._len:
            raise StopIteration
        else:
            result = self[self._next]
            self._next += 1
            return result