mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-15 05:48:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix tabs instead of spaces in comments

Browse Source 
Fixing tabs instead of spaces in comments
This commit is contained in:
Bill Breitmayer 2024-05-29 11:56:38 -04:00
parent 0ef3e6b302
commit 29b6e8ff7d
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
bit_manipulation/multibit_manipulation.py
View File

@ -14,17 +14,18 @@ All parameters must be must be int >= 0, referred to as a 'bit integer'.
index:int index:int
The offset into the bit position from right, The offset into the bit position from right,
0b010111 -> list [1,1,1,0,1,0]. big-endian -> little-endian 0b010111 -> list [1,1,1,0,1,0]. big-endian -> little-endian
For inserts, index is the position to the right of index, For inserts, index is the position to the right of index,
index 0 -> right of rightmost bit. index 0 -> right of rightmost bit.
For gets, sets and removes, it is the position of the bit itself. For gets, sets and removes, it is the position of the bit itself.
value:int value:int
Either [0,1] for single bit, or bit mask, bit_length(value) <= bitlen. Either [0,1] for single bit, or int value for multibit,
bit_length(value) <= bitlen.
bitlen:int bitlen:int
The effective mask length, spec. leading zeros The effective mask length, spec. leading zeros
( bitlen 4 value 1 -> 0001 ) ( bitlen 4 value 1 -> 0001 )
The bitwise expressions may look convoluted, but basically, there are The bitwise expressions may look convoluted, but basically, there are
just three parts: left-hand side, value, right-hand side. just three parts: left-hand side, value, right-hand side.
@ -230,6 +231,7 @@ def multibit_remove(bint: int, index: int, bit_len: int) -> int:
if __name__ == "__main__": if __name__ == "__main__":
import doctest import doctest
doctest.testmod() doctest.testmod()