| ??? 02/07/06 21:35 Read: times |
#109458 - bang on Responding to: ???'s previous message |
Sorry for not being more explicit.
Thanks for the response I could do the lookup table but that uses as much code space as my examples above, speed is not an issue. I am not overly concerned about the size it just seemed extraordinarily difficult to achieve when you consider you can simply shift in 0's with a bit shift. I thought that I may have missed something blindingly obvious. Marshall |
| Topic | Author | Date |
| Right Filling n x Rightmost Bits with 1' | 01/01/70 00:00 | |
| wrong approach | 01/01/70 00:00 | |
| Wrong Approach ? | 01/01/70 00:00 | |
| why not just |= bits_to_be_added | 01/01/70 00:00 | |
| |= bits_to_be_added | 01/01/70 00:00 | |
| ah | 01/01/70 00:00 | |
| bang on | 01/01/70 00:00 | |
| Try an Array | 01/01/70 00:00 | |
| |= 2^RightMostBits -1; // sure? | 01/01/70 00:00 | |
| You are correct about ^ != pow() | 01/01/70 00:00 | |
| If only | 01/01/70 00:00 | |
| About 25 bytes with SDCC | 01/01/70 00:00 | |
| Thankyou | 01/01/70 00:00 | |
| Why not use a table? | 01/01/70 00:00 | |
| codesize | 01/01/70 00:00 | |
Yes, But.. | 01/01/70 00:00 |