-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsk_bitfields.cpp
More file actions
198 lines (184 loc) · 4.79 KB
/
Copy pathsk_bitfields.cpp
File metadata and controls
198 lines (184 loc) · 4.79 KB
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#include "sk_t.h"
USHORT BF16::CountEtString(char *s) {
USHORT n = 0;
for (int i = 0; i < 9; i++) {
if (On(i))
s[n++] = (char)(i + '1');
}
s[n] = 0;
return n;
}
char * BF16::String(char * ws, int lettre ) {
int n = 0;
for (int i = 0; i < 9; i++) {
if (On(i))
ws[n++] = (char)(lettre ? i + 'A' : i + '1');
}
ws[n] = 0;
return ws;
}
int BF32::Table(int * r) {
if (!f) return 0;
int n = 0;
BitsInTable32(r, n, f, 0);
return n;
}
int BF64::SolRow(int col) {
uint64_t wcol = (uint64_t)Zhoucol64 << col,
w=bf.u64&wcol;
if(_popcnt64(w)!=1 )return 0;
uint32_t res;
bitscanforward64(res, w);
return From_128_To_81[res]/9;
}
void BF128::ClearDiag(int band, int stack) {
// stack appears here as a band
int tp[32], ntp=0;
BitsInTable32(tp, ntp, band);
for (int i = 0; i < ntp; i++) {
int cell=tp[i], celld = C_transpose_d[cell + 27 * stack];
Clear_c(celld);
}
}
void BF128::ClearRow(int clear, int row) {
for (int i = 0,bit=1; i < 9; i++,bit<<=1) {
if(bit&clear)Clear_c(9 * row + i);
}
}
void BF128::ClearCol(int clear, int col) {
for (int i = 0, bit = 1; i < 9; i++, bit <<= 1) {
if (bit&clear)Clear_c(9 * i + col);
}
}
void BF128::Diag3x27(BF128 & r){
bf.u64[0] = bf.u64[1] = 0;
if (r.isEmpty()) return;
for (int iband = 0; iband < 3; iband++){// build diagonal sym
int tc[27], ntc=0;
BitsInTable32(tc, ntc, r.bf.u32[iband], 27 * iband);
for (int i = 0; i < ntc; i++) {
int celld = C_transpose_d[tc[i]];
Set_c(celld);
}
}
}
int BF128::Table3X27(int * r) {
int n = 0;
BitsInTable32(r, n, bf.u32[0]);
BitsInTable32(r, n, bf.u32[1],27);
BitsInTable32(r, n, bf.u32[2], 54);
return n;
}
int BF128::Table128(int * r) {
int n = 0;
BitsInTable64(r, n, bf.u64[0]);
BitsInTable64(r, n, bf.u64[1], 64);
return n;
}
int BF128::Table64_0(int * r) {
int n = 0;
BitsInTable64(r, n, bf.u64[0]);
return n;
}
int BF128::Table64_1(int * r) {
int n = 0;
BitsInTable64(r, n, bf.u64[1], 64);
return n;
}
char * BF128::String3X_Rev(char * ws){
strcpy(ws, empty_puzzle);
uint32_t *bfw = bf.u32;
unsigned int w = bfw[0];
for (int j = 26; j >= 0; j--) if (w & (1 << j))
ws[j] = '1';
w = bfw[1];
for (int j = 26; j >= 0; j--) if (w & (1 << j))
ws[j + 27] = '1';
w = bfw[2];
for (int j = 26; j >= 0; j--) if (w & (1 << j))
ws[j + 54] = '1';
return ws;
}
char * BF128::String3X(char * ws){
strcpy(ws, empty_puzzle);
for (int j = 0; j<81; j++) if (On(C_To128[j]))
ws[j] = '1';
return ws;
}
char * BF128::String128(char * ws){
ws[128] = 0;
for (int j = 0; j<128; j++)
if (On(j)) ws[j] = '1'; else ws[j] = '.';
return ws;
}
void BF128::PrintCells() {// assumed not empty checked by caller
for (int ib = 0; ib < 3; ib++) {// three bands
uint32_t v = bf.u32[ib];
if (!v) continue;
for (int irr = 0; irr < 3; irr++, v >>= 9) {
int row = v & 0x1ff;
if (!row)continue;
cout << " R" << 3 * ib + irr + 1 << "C";
for (int ic = 0, bit = 1; ic < 9; ic++, bit <<= 1)
if (row&bit) cout << ic + 1;
}
}
cout << endl;
}
void PM3X::operator &= (const PM3X &z2){
for (register int i = 0; i < 9; i++) pmdig[i] &= z2.pmdig[i];
}
void PM3X::operator |= (const PM3X &z2){
for (register int i = 0; i < 9; i++) pmdig[i] |= z2.pmdig[i];
}
void PM3X::operator -= (const PM3X &z2){
for (register int i = 0; i < 9; i++) pmdig[i] -= z2.pmdig[i];
}
int PM3X::operator == (const PM3X &z2)const {
for (register int i = 0; i < 9; i++)
if (pmdig[i] != z2.pmdig[i]) return 0;
return 1;
}
int PM3X::operator != (const PM3X &z2) const {
for (register int i = 0; i < 9; i++)
if (pmdig[i] != z2.pmdig[i]) return 1;
return 0;
}
void PM3X::Diag3x27(PM3X & r) {
for (int i = 0; i < 9; i++)pmdig[i].Diag3x27(r.pmdig[i]);
}
int PM3X::IsEmpty(){
for (register int i = 0; i<9; i++)
if (pmdig[i].isNotEmpty()) return 0;
return 1;
}
int PM3X::Count(){
register uint64_t *w = pmdig[0].bf.u64,
n=0;
for (register int i = 0; i < 18; i++) n += _popcnt64(w[i]);
return (int)n;
}
void PM3X::Print(const char * lib){
cout << "pm3x status for " << lib << endl;
for (int i = 0; i < 3;i++) cout << ".........+++++++++---------";
cout << endl;
char ws[82];
for (int i = 0; i < 9; i++)if (pmdig[i].isNotEmpty())
cout << pmdig[i].String3X(ws) << " " << i + 1<<endl;
for (int i = 0; i < 3; i++) cout << ".........+++++++++---------";
cout << endl << endl;
}
void PM3X::PrintCells() {
for (int i = 0; i < 9; i++)if (pmdig[i].isNotEmpty()) {
cout << i + 1 << ":";
pmdig[i].PrintCells();
}
}
void HID_BIV::Debug(const char * lib) {
cout << "36x27 bits file debugging " << lib << endl;
for (int i = 0; i < 36; i++) {
if(sets_biv[i])
cout << Char27out(sets_biv[i]) << " for 0"
<< oct << floors_2d[i] << dec << endl;
}
}