 | | Re: command framing as seen from kernel/program.lrkey_handler —Pat LaVarre
| | | | (...) Mmmmm. I am curious, if that's ok. To get log2(xx) in O(1) time we could fetch (p[xx & -xx]) i.e. fetch our choice of the bytes at offset x 0 1 2 4 8 10 20 40 80 from some p we like. Merely standard C can't easily express that old idea without (...) (22 years ago, 1-Feb-03, to lugnet.robotics.rcx.legos)
| | | | | | | | | | Re: command framing as seen from kernel/program.lrkey_handler —Mark Riley
| | | | | "Pat LaVarre" <ppaatt@aol.com> wrote in message news:H9n64q.B2p@lugnet.com... (...) I dunno, haven't found one yet, though. (...) choice (...) Touché. Yes, tables, overlooked that. (...) the (...) expensive (...) I think that smaller code size is (...) (22 years ago, 1-Feb-03, to lugnet.robotics.rcx.legos)
| | | | | | | | | | | | Re: command framing as seen from kernel/program.lrkey_handler —Pat LaVarre
| | | | | (...) Just to be more certain we're understanding each other, if that's ok, I'll mention that ... 1) Newbie that I am, I have no clue how frequently brickos switches on bit masks. I wonder if only to decode xD2 RemoteCommand. 2) Using log2(xx & -xx) (...) (22 years ago, 2-Feb-03, to lugnet.robotics.rcx.legos)
| | | | | | |
