deactivate bitparallel LCS

The algorithm to find the longest common subsequence after calculating it in bitparall
appears to have a bug. Deactivate it until this bug is fixed

Author: maxbachmann

VERSION

@@ -1 +1 @@
-1.0.1
+1.0.2

src/rapidfuzz-cpp

@@ -3,6 +3,6 @@
 """
 __author__ = "Max Bachmann"
 __license__ = "MIT"
-__version__ = "1.0.1"
+__version__ = "1.0.2"
 
 from rapidfuzz import process, fuzz, utils, levenshtein, string_metric

src/rapidfuzz/__init__.py

@@ -77,6 +77,10 @@ def testWRatioUnicode(self):
     def testQRatioUnicode(self):
         self.assertEqual(fuzz.WRatio(self.s1, self.s1a), 100)
 
+    def testIssue76(self):
+        self.assertAlmostEqual(fuzz.partial_ratio("physics 2 vid", "study physics physics 2"), 81.81818, places=4)
+        self.assertEqual(fuzz.partial_ratio("physics 2 vid", "study physics physics 2 video"), 100)
+
 
 @pytest.mark.parametrize("scorer", scorers)
 def test_empty_string(scorer):