It seems like it would make sense to sort the thick branches with an LRU mechanism rather lexically, and then lexically sort the bin contents for improved searchability?
for(int i = 0; i < 1<<addrlines; i++) {
digitalWrite(addr0,(i&0x01)?HIGH:LOW);
digitalWrite(addr1,(i&0x02)?HIGH:LOW);
digitalWrite(addr2,(i&0x04)?HIGH:LOW);
digitalWrite(addr3,(i&0x08)?HIGH:LOW);
delayMicroseconds(10);
int linestate = (0x0F) ^ (digitalRead(d0)<<3 | digitalRead(d1)<<2 | digitalRead(d2)<<1 | digitalRead(d3));
if (i&0x01 == 0) {
linestates[1+(i>>1)] = (linestate<<4);
} else {
linestates[1+(i>>1)] |= linestate;
}
}
Advertisement
Advertisement