So, im doing a research project now (fuck routers forever) on OLED screens. The gist of what I'm wondering is as follows.
Each pixel is controlled with a 16 bit uinteger: 5 bits for red (32 settings, off up to 31), 5 bits for blue (32 settings, off up to 31) and 6 bits for green (64 settings, off up to 63). Im going to be hashing these values pixel by pixel frame after frame (resulting with 3-7 billion values to be hashed :sigh: ). Paring down each operation would be helpful, as despite having a massively powerful machine at my disposal, fuck this srsly.
So what I need is this. Currently, the way i have to hash this out is that when i get the uint, i check the first 5 ints to see if its > than a certain value. that is easy. For green and blue however, I have to check if the middle bits (for blue) are within a certain range, and that consists of checking if its within a certain range for no red bits, for red set to 1, for red set to 2, etc all the way up to red=31. That is 64 comparisons im doing for each freaking green value. Is there a way i can just operate on the binary values like i would on hex? Just to extract them even?
I so do not envy you.