daves idea compiles to be 200 words shorter . I like that
but I still can't get it going
daves idea compiles to be 200 words shorter . I like that
but I still can't get it going
Last edited by richard; - 18th January 2018 at 01:11. Reason: still trying
Warning I'm not a teacher
to make I work
the input array needs its bit order endianness reversed then the result needs the same treatment
which defeats any gain
Code:for d=0 to 14 inbuff[d]= inbuff[d] rev 8 next outpointer = 0 while outpointer < 10 inpointer = outpointer*12 d=0 while d<12 dataword.0((outpointer * 16) + d) = inbuff.0(d + inpointer) d=d+1 wend dataword[outpointer]=dataword[outpointer] rev 12 outpointer= outpointer + 1 wend
Warning I'm not a teacher
Thanks to all your help.
I ended up using this bit but it's still boggling my mind a bit as to how it actually works.
Code:for d=0 to 4 dataword[d*2]=inbuff[d*3]*16+inbuff[d*3+1]>>4 dataword[d*2+1]=inbuff[d*3+2]+(inbuff[d*3+1]&$f)*256 next
Bookmarks