mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-14 13:28:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-05-31 13:05:26 +00:00
parent 6e81a51620
commit 5a6275bf5e
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
bit_manipulation/multibit_manipulation.py
View File

@ -57,7 +57,7 @@ rather the position to the right of the bit index.
It's not so bad once you get the hang of it, although it can still be a It's not so bad once you get the hang of it, although it can still be a
bear to debug. In the insert example above, the result of inserting 0b11 bear to debug. In the insert example above, the result of inserting 0b11
in the center ( index=3 ) or to the right ( index=2 ) produces the same in the center ( index=3 ) or to the right ( index=2 ) produces the same
correct result despite the misspecification. These algorithms are very correct result despite the misspecification. These algorithms are very
fast but can be touchy at times. fast but can be touchy at times.
Various bit insert/remove solutions exist using bin() string functions Various bit insert/remove solutions exist using bin() string functions
@ -247,7 +247,6 @@ 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()