feat: multiple pattern kmp

AgungLucker · AgungLucker · commit c494cfdd4d9a · 2025-06-14T22:43:52.000+07:00
diff --git a/src/KMP.py b/src/KMP.py
@@ -1,47 +1,81 @@
 class KMPMatcher:
     def __init__(self, pattern):
-        self.pattern = pattern
-        self.lps = self.compute_lps(pattern)
+        pass
 
     # Buat longest prefix Suffix (LPS) array
     def compute_lps(self, pattern):
+
         lps = [0] * len(pattern)
         length = 0
 
         i = 1
         while i < len(pattern):
+
+            # prefix suffix cocok
             if pattern[i] == pattern[length]:
                 length += 1
                 lps[i] = length
                 i += 1
             else:
                 if length != 0:
+                    # panjang prefix balik ke lps[length - 1]
                     length = lps[length - 1]
                 else:
                     lps[i] = 0
                     i += 1
         return lps
     
     # cari semua posisi yang cocok, kalau tidak ada return array kosong
-    def search(self, text):
+    def search_pattern(self, text, pattern, case_sensitive=False):
         matches = []
-        patternLen = len(self.pattern)
+        patternLen = len(pattern)
         textLen = len(text)
 
+        if not case_sensitive:
+            text = text.lower()
+            pattern = pattern.lower()
+
+        lps = self.compute_lps(pattern)
+
         i = 0
         j = 0
 
         while i < textLen:
-            if self.pattern[j] == text[i]:
+            if pattern[j] == text[i]:
                 i += 1
                 j += 1
             
+            # pattern cocok ditemukan
             if j == patternLen:
                 matches.append(i-j)
-                j = self.lps[j-1]
-            elif i < textLen and self.pattern[j] != text[i]:
+                # posisi pattern dimulai dari index lps[j-1]
+                j = lps[j-1]
+            elif i < textLen and pattern[j] != text[i]:
                 if j != 0:
-                    j = self.lps[j-1]
+                    j = lps[j-1]
                 else:
                     i += 1
         return matches 
+    
+    def search_multiple_pattern(self, text, patterns, case_sensitive=False):
+        results = {}
+
+        if not text:
+            return results
+        
+
+        if isinstance(patterns, str):
+            patterns = [patterns]
+        elif not isinstance(patterns, list):
+            raise ValueError("Patterns must be a string or a list of strings.")
+        
+        for pattern in patterns:
+            if not isinstance(pattern, str):
+                continue
+
+            pattern = pattern.strip()
+            if pattern:
+                matches = self.search_pattern(text, pattern, case_sensitive)
+                results[pattern] = matches
+            
+        return results
