Talk:Set right-adjacent bits: Difference between revisions

Content added Content deleted

Inline

Revision as of 12:04, 21 December 2021

More Interesting Way

Copy the input to result, then for bits to set right shift input 1 and or with result.--Nigel Galloway (talk) 17:06, 20 December 2021 (UTC)

That's essentially the first two Python solutions or-ing the input shifted zero to n times. --Paddy3118 (talk) 18:48, 20 December 2021 (UTC)

Thanks for the warning, I'd better try something more interesting. I wouldn't like F# resembling Python.--Nigel Galloway (talk) 12:04, 21 December 2021 (UTC)

Revision as of 18:49, 20 December 2021 (view source) rosettacode>Paddy3118 (→‎More Interesting Way: Aye.) ← Older edit		Revision as of 12:04, 21 December 2021 (view source) Nigel Galloway (talk \| contribs) (→‎More Interesting Way) Newer edit →
Line 3:		Line 3:

	:That's essentially the first two Python solutions or-ing the input shifted zero to n times. --[[User:Paddy3118\|Paddy3118]] ([[User talk:Paddy3118\|talk]]) 18:48, 20 December 2021 (UTC)		:That's essentially the first two Python solutions or-ing the input shifted zero to n times. --[[User:Paddy3118\|Paddy3118]] ([[User talk:Paddy3118\|talk]]) 18:48, 20 December 2021 (UTC)

			::Thanks for the warning, I'd better try something more interesting. I wouldn't like F# resembling Python.--[[User:Nigel Galloway\|Nigel Galloway]] ([[User talk:Nigel Galloway\|talk]]) 12:04, 21 December 2021 (UTC)