From 5a6275bf5e0ba033fc97ff95268be12f6294152f Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Fri, 31 May 2024 13:05:26 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 bit_manipulation/multibit_manipulation.py | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/bit_manipulation/multibit_manipulation.py b/bit_manipulation/multibit_manipulation.py
index bac74722a..4a943e3eb 100644
--- a/bit_manipulation/multibit_manipulation.py
+++ b/bit_manipulation/multibit_manipulation.py
@@ -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
 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
-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.
 
 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__":
-
     import doctest
 
     doctest.testmod()