|
|
|
@ -72,7 +72,7 @@ int main(int argc, char * argv[]) {
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void findWords(signature* sigs, uint32_t len) {
|
|
|
|
|
void findWords(signature* restrict sigs, const uint32_t len) {
|
|
|
|
|
START_TIME("finding starts")
|
|
|
|
|
// for each index, locate the first index of
|
|
|
|
|
// a word that shares no letters with it, and
|
|
|
|
@ -94,29 +94,27 @@ void findWords(signature* sigs, uint32_t len) {
|
|
|
|
|
START_TIME("finding words")
|
|
|
|
|
// the big loop.
|
|
|
|
|
for (uint32_t i1 = 0; i1 < endindex; i1++) {
|
|
|
|
|
uint32_t a = sigs[i1].sign;
|
|
|
|
|
const uint32_t a = sigs[i1].sign;
|
|
|
|
|
|
|
|
|
|
for (uint32_t i2 = START(i1); i2 < endindex; i2++) {
|
|
|
|
|
uint32_t b = sigs[i2].sign;
|
|
|
|
|
if (a & b) { continue; }
|
|
|
|
|
uint32_t ab = a | b;
|
|
|
|
|
do { i2++; } while (a & sigs[i2].sign);
|
|
|
|
|
const uint32_t ab = a | sigs[i2].sign;
|
|
|
|
|
PRINT2
|
|
|
|
|
|
|
|
|
|
for (uint32_t i3 = START(i2); i3 < endindex; i3++) {
|
|
|
|
|
uint32_t c = sigs[i3].sign;
|
|
|
|
|
if (ab & c) { continue; }
|
|
|
|
|
uint32_t abc = ab | c;
|
|
|
|
|
do { i3++; } while (ab & sigs[i3].sign);
|
|
|
|
|
const uint32_t abc = ab | sigs[i3].sign;
|
|
|
|
|
PRINT3
|
|
|
|
|
|
|
|
|
|
for (uint32_t i4 = START(i3); i4 < endindex; i4++) {
|
|
|
|
|
uint32_t d = sigs[i4].sign;
|
|
|
|
|
const uint32_t d = sigs[i4].sign;
|
|
|
|
|
if (abc & d) { continue; }
|
|
|
|
|
uint32_t abcd = abc | d;
|
|
|
|
|
const uint32_t abcd = abc | d;
|
|
|
|
|
PRINT4
|
|
|
|
|
|
|
|
|
|
uint32_t i5start = START(i4);
|
|
|
|
|
const uint32_t i5start = START(i4);
|
|
|
|
|
for (uint32_t i5 = MAX(endindex, i5start); i5 < len; i5++) {
|
|
|
|
|
uint32_t e = sigs[i5].sign;
|
|
|
|
|
const uint32_t e = sigs[i5].sign;
|
|
|
|
|
if (abcd & e) { continue; }
|
|
|
|
|
#if FANCYPRINT
|
|
|
|
|
printsigs(sigs, 5, i1, i2, i3, i4, i5);
|
|
|
|
|