Subject:
|
Re: Still JAVA and LNP....
|
Newsgroups:
|
lugnet.robotics.rcx.legos
|
Date:
|
Fri, 3 Nov 2000 01:38:07 GMT
|
Viewed:
|
1252 times
|
| |
|
|
Umm in response to my own message, would someone be so kind as to explain
the following <g> :
// return (short)(a + (b << 8));
return (short)(a % 256);
If I use the bottom line, discounting variable b, then my checksum is
correct...otherwise it wonnt work..... whats going on ?
What is the point of tracking b, is this a faster method than taking the
modulo, if so can anyone explain the math behind it.....
I guess by email would probably be more popular and less off topic! :)
- ciaran
|
|
Message is in Reply To:
 | | Still JAVA and LNP....
|
| hey all :) Sorry to bother again, but after limited uccess with getting JAVA to cope with LNP, I've run into some (hopefully) simple problems, I'm having major problems with the checksum routine, this routine give me huge integer nnumbers rather (...) (24 years ago, 3-Nov-00, to lugnet.robotics.rcx.legos)
|
3 Messages in This Thread:
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
