Set right-adjacent bits: Difference between revisions

 

Given a left-to-right ordered collection of <code>e</code> bits, <code>b</code>, where <code>1 <= e <= 10000</code>,

* Use it to show, here, the results for the input examples above.

* Print the output aligned in a way that allows easy checking by eye of the binary input vs output.

 

=={{header|Python}}==

The <code>set_right_adjacent_bits</code> function does all the real work.

 

from functools import reduce

 

result = set_right_adjacent_bits(n, b)

print(f" Input b: {b:0{e}b}")

 

{{out}}

The <code>set_right_adjacent_bits_list</code> function does all the real work.

 

 

 

def _list2bin(b: List[int]) -> str:

"List of 0/1 ints to bool string."

 

def _to_list(bits: str) -> List[int]:

 

if __name__ == "__main__":

result = set_right_adjacent_bits_list(n, b)

print(f" Input b: {_list2bin(b)}")

 

{{out}}

Input b: 010000000000100000000010000000010000000100000010000010000100010010

Result: 011110000000111100000011110000011110000111100011110011110111111111</pre>

 

=={{header|Raku}}==

A left-to-right ordered collection of bits is more commonly referred to as an Integer in Raku.

 

}

 

}

 

 

for 8,4, 18455760086304825618,5, 5444684034376312377319904082902529876242,15 -> $integer, $bits {

 

.say for ^$bits .map: -> $b { $integer.&lab($b).fmt("%{0~$bits+$integer.msb}b") };

 

{{out}}

1000

1100

011111111111111011111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111110</pre>

 

=={{header|Wren}}==

Using a list of 0's and 1's so we don't have to resort to BigInt.

if (e == 0 || n <= 0) return bits

var bits2 = bits.toList

var c = bits[i]

if (c == 1) {

}

}

}

return bits2

bits = setRightBits.call(bits, e, n)

System.print(" Result: %(bits.join())\n")

 

{{out}}