Rosetta Code

Talk:Bitwise IO: Difference between revisions

Page Discussion

Talk:Bitwise IO (view source)

Revision as of 02:46, 4 September 2020

517 bytes removed ,  3 years ago
→‎PL/I bitstring longer than REXX'...
Line 229:
because the input seems to be STRINGS followed by '0D0A00'x
[[User:Walterpachl|Walterpachl]] 20:22, 2 November 2012 (UTC)
 
 
What does this mean:
'(((128 >> shift) & *buf) >> (7 - shift))'
 
to this"
 
accu & (1 << (bits - 1))) *buf |= mask;
//n^n+1 approaches limit when even powers are expressed meaning the odds become the evens of the base n^n+1=n thus the reciprocal[operator] expression n+1^n = n+1 when the integral base forms such that each nibble is a reflection or whatever except in (1^(1+1))+1). Now how to implement all three operational bases(+,*,^) into an integral algebra equation such that 3:2 forms in the expression.
 
 
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/94183"