Welcome to mirror list, hosted at ThFree Co, Russian Federation.

bitarray.py « archipack - git.blender.org/blender-addons.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: cf71261073ee6462182cbde2203828f9622ecce4 (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

import array

# -*- coding:utf-8 -*-

# ##### BEGIN GPL LICENSE BLOCK #####
#
#  This program is free software; you can redistribute it and/or
#  modify it under the terms of the GNU General Public License
#  as published by the Free Software Foundation; either version 2
#  of the License, or (at your option) any later version.
#
#  This program is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#
#  You should have received a copy of the GNU General Public License
#  along with this program; if not, write to the Free Software Foundation,
#  Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110- 1301, USA.
#
# ##### END GPL LICENSE BLOCK #####

# <pep8 compliant>

# ----------------------------------------------------------
# Author: Stephen Leger (s-leger)
#
# ----------------------------------------------------------


class BitArray():

    def __init__(self, bitSize, fill=0):
        self.size = bitSize
        intSize = bitSize >> 5
        if (bitSize & 31):
            intSize += 1
        if fill == 1:
            fill = 4294967295
        else:
            fill = 0
        self.bitArray = array.array('I')
        self.bitArray.extend((fill,) * intSize)

    def __str__(self):
        return str(self.list)

    def bit_location(self, bit_num):
        return bit_num >> 5, bit_num & 31

    def test(self, bit_num):
        record, offset = self.bit_location(bit_num)
        mask = 1 << offset
        return(self.bitArray[record] & mask)

    def set(self, bit_num):
        record, offset = self.bit_location(bit_num)
        mask = 1 << offset
        self.bitArray[record] |= mask

    def clear(self, bit_num):
        record, offset = self.bit_location(bit_num)
        mask = ~(1 << offset)
        self.bitArray[record] &= mask

    def toggle(self, bit_num):
        record, offset = self.bit_location(bit_num)
        mask = 1 << offset
        self.bitArray[record] ^= mask

    @property
    def len(self):
        return len(self.bitArray)

    @property
    def copy(self):
        copy = BitArray(self.size)
        for i in range(self.len):
            copy.bitArray[i] = self.bitArray[i]
        return copy

    @property
    def list(self):
        return [x for x in range(self.size) if self.test(x) > 0]

    def none(self):
        for i in range(self.len):
            self.bitArray[i] = 0

    def reverse(self):
        for i in range(self.len):
            self.bitArray[i] = 4294967295 ^ self.bitArray[i]

    def all(self):
        for i in range(self.len):
            self.bitArray[i] = 4294967295