/
bitstates.py
184 lines (171 loc) · 5.85 KB
/
bitstates.py
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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
from enum import IntFlag
from itertools import combinations
from collections import Sequence
from functools import reduce
class Bitstates(Sequence):
"""
A class to represent an enumeration of categorical states, each
stored as a bit using Python's enum.IntFlag.
"""
def __init__(self, name, bitnames, data='simple', null=False, sep='',
maxbits=None, offset=0):
self.name = name
self.bitnames = bitnames
self.null = null
self.sep = sep
self.offset = offset
self.maxbits = maxbits
if data == 'simple':
states, nbits = Bitstates.generate_simple(
name, bitnames, null, offset)
elif data == 'compound':
states, nbits = Bitstates.generate_compound(
name, bitnames, null, sep, maxbits, offset)
else: # data = (states, nbits)
states, nbits = data
self.states = states
self.nbits = nbits
self.list = list(states)
self.size = len(self.states)
self.names = tuple([ x.name for x in self.states ])
self.values = tuple([ x.value for x in self.states ])
self.idx = {}
for i, x in enumerate(self.states):
self.idx[x.name] = i
self.idx[x.value] = i
self.bitvalues = tuple([ states[x] for x in bitnames ])
self.bitmask = 0
for b in self.bitvalues:
self.bitmask |= b
def decompose(self, value):
for v in self.bitvalues:
if value & v:
yield v
def nset(self, value):
i = 0
for v in self.decompose(value):
i += 1
return i
## def shift(self, offset):
## self.offset += offset
## if offset > 0:
## self.values = [ x << offset for x in self.values ]
## else:
## self.values = [ x >> -offset for x in self.values ]
## self.states = IntFlag(self.name, zip(self.names, self.values))
## self.list = list(self.states)
## for k in list(self.nbits):
## if isinstance(k, int):
## nb = self.nbits[k]
## i = self.idx[k]
## del self.nbits[k]
## del self.idx[k]
## if offset > 0:
## self.nbits[k << offset] = nb
## self.idx[k << offset] = i
## else:
## self.nbits[k >> -offset] = nb
## self.idx[k >> -offset] = i
@staticmethod
def generate_simple(name, bitnames, null=False, offset=0):
flags = []
if null:
flags.append(('null', 0))
for i, s in enumerate(bitnames):
i += offset
flags.append((s, 1 << i))
states = IntFlag(name, flags)
nbits = {}
for state in states:
nbits[state.name] = 1
nbits[state.value] = 1
return states, nbits
@staticmethod
def generate_compound(name, bitnames, null=False, sep='', maxbits=None,
offset=0):
for s in bitnames:
if len(s) > 1:
sep = '+'
break
nbits = {}
s2i = dict([ (s, i+offset) for i, s in enumerate(bitnames) ])
d = []
if null:
d.append(('null', 0))
nbits['null'] = 0
nbits[0] = 0
for s in bitnames:
v = 1 << s2i[s]
d.append((s, v))
nbits[s] = 1
nbits[v] = 1
for i in range(2, len(bitnames)+1):
if maxbits and i > maxbits:
continue
for c in combinations(bitnames, i):
s = sep.join(c)
j = 0
for x in c:
j |= 1 << s2i[x]
d.append((s, j))
nbits[s] = i
nbits[j] = i
states = IntFlag(name, d)
return states, nbits
@staticmethod
def generate_from_graph(name, bitnames, g, null=True, sep='',
maxbits=None):
'''
calculate the set of "contiguous" compound states with maximum
size `maxbits` from the given graph of simple states
'''
# http://stackoverflow.com/questions
# /15658245/efficiently-find-all-connected-subgraphs
for s in bitnames:
if len(s) > 1:
sep = '+'
break
nbits = {}
results = []
if null:
results.append(('null', 0))
nbits['null'] = 0
nbits[0] = 0
for i,s in enumerate(bitnames):
j = 1 << i
results.append((s, j))
nbits[s] = 1
nbits[j] = 1
def gsg(nodes, subset, neighbors):
if not subset:
candidates = nodes
else:
candidates = nodes.intersection(neighbors)
if not candidates:
nb = len(subset)
if 2 <= nb <= maxbits:
s = sep.join([ bitnames[x.index] for x in
sorted(subset, key=lambda e:e.index) ])
j = 0
for x in subset:
j |= 1 << x.index
results.append((s, j))
nbits[s] = nb
nbits[j] = nb
else:
n = next(iter(candidates))
sn = set([n])
nmsn = nodes - sn
gsg(nmsn, subset, neighbors)
gsg(nmsn, subset.union(sn), neighbors.union(n.neighbors()))
gsg(set(g.vs()), set(), set())
states = IntFlag(name, results)
return states, nbits
def __getitem__(self, i):
return self.list[i]
def __iter__(self):
return iter(self.states)
def __len__(self):
return self.size
def __call__(self, x):
return self.states(x)