Talk:Bitwise IO: Difference between revisions

Add comment about the "naturalness" of big-endian order
(Add comment about the "naturalness" of big-endian order)
 
(One intermediate revision by one other user not shown)
Line 224:
 
::--[[User:ShinTakezou|ShinTakezou]] 18:10, 13 January 2009 (UTC)
 
::: As a small point: you said that most-to-least significant is the "natural" order, but I'd like to point out that that is only true in Western languages that are written left-to-right. In Arabic and Hebrew, decimal digits appear in the same order despite the surrounding text being read right-to-left, so the digits appear in least-to-most significant order. --[[User:Markjreed|Markjreed]] ([[User talk:Markjreed|talk]]) 13:12, 28 March 2024 (UTC)
 
 
== PL/I bitstring longer than REXX'... ==
Line 229 ⟶ 232:
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.
 
 
1,480

edits