Complete file handling bug fixes

jj-devhub · jj-devhub · commit 7113ed978b9d · 2025-08-30T03:52:41.000+06:00
diff --git a/bash.exe.stackdump b/bash.exe.stackdump
@@ -0,0 +1,28 @@
+Stack trace:
+Frame         Function      Args
+0007FFFF8E80  00021005FE8E (000210285F68, 00021026AB6E, 000000000000, 0007FFFF7D80) msys-2.0.dll+0x1FE8E
+0007FFFF8E80  0002100467F9 (000000000000, 000000000000, 000000000000, 0007FFFF9158) msys-2.0.dll+0x67F9
+0007FFFF8E80  000210046832 (000210286019, 0007FFFF8D38, 000000000000, 000000000000) msys-2.0.dll+0x6832
+0007FFFF8E80  000210068CF6 (000000000000, 000000000000, 000000000000, 000000000000) msys-2.0.dll+0x28CF6
+0007FFFF8E80  000210068E24 (0007FFFF8E90, 000000000000, 000000000000, 000000000000) msys-2.0.dll+0x28E24
+0007FFFF9160  00021006A225 (0007FFFF8E90, 000000000000, 000000000000, 000000000000) msys-2.0.dll+0x2A225
+End of stack trace
+Loaded modules:
+000100400000 bash.exe
+7FFFBFEA0000 ntdll.dll
+7FFFBE1C0000 KERNEL32.DLL
+7FFFBCFD0000 KERNELBASE.dll
+7FFFBE6D0000 USER32.dll
+7FFFBD520000 win32u.dll
+7FFFBE6A0000 GDI32.dll
+7FFFBDAF0000 gdi32full.dll
+7FFFBD8C0000 msvcp_win.dll
+000210040000 msys-2.0.dll
+7FFFBD3D0000 ucrtbase.dll
+7FFFBE290000 advapi32.dll
+7FFFBE5F0000 msvcrt.dll
+7FFFBDF10000 sechost.dll
+7FFFBEA70000 RPCRT4.dll
+7FFFBC5E0000 CRYPTBASE.DLL
+7FFFBD760000 bcryptPrimitives.dll
+7FFFBFD00000 IMM32.DLL
diff --git a/buggy_anagram.py b/buggy_anagram.py
@@ -0,0 +1,4 @@
+def is_anagram(s1, s2):
+    return sorted(s1.lower()) == sorted(s2.lower())  # Bug fixed: handle case sensitivity
+
+print(is_anagram("Listen", "silent"))
diff --git a/buggy_average_of_squares.py b/buggy_average_of_squares.py
@@ -0,0 +1,4 @@
+def average_of_squares(lst):
+    return sum(x*x for x in lst) / len(lst)  # Bug fixed: average of squares
+
+print(average_of_squares([2, 4, 6]))
diff --git a/buggy_bank_account.py b/buggy_bank_account.py
diff --git a/buggy_binary_search.py b/buggy_binary_search.py
@@ -0,0 +1,13 @@
+def binary_search(arr, target):
+    left, right = 0, len(arr) - 1  # Bug fixed: use len(arr) - 1
+    while left <= right:
+        mid = (left + right) // 2
+        if arr[mid] == target:
+            return mid
+        elif arr[mid] < target:
+            left = mid + 1
+        else:
+            right = mid - 1
+    return -1
+
+print(binary_search([1, 2, 3, 4, 5], 3))
diff --git a/buggy_capitalize.py b/buggy_capitalize.py
@@ -0,0 +1,8 @@
+def capitalize_words(sentence):
+    words = sentence.split(' ')
+    # Bug fixed: modify the words list in-place
+    for i in range(len(words)):
+        words[i] = words[i].capitalize()
+    return ' '.join(words)
+
+print(capitalize_words("hello world python"))
diff --git a/buggy_count_vowels.py b/buggy_count_vowels.py
@@ -0,0 +1,9 @@
+def count_vowels(s):
+    vowels = "aeiouAEIOU"  # Bug fixed: handle uppercase vowels
+    count = 0
+    for char in s:
+        if char in vowels:
+            count += 1
+    return count
+
+print(count_vowels("Hello World"))
diff --git a/buggy_cube.py b/buggy_cube.py
@@ -0,0 +1,4 @@
+def cube(n):
+    return n * n * n  # Bug fixed: now calculates cube
+
+print(cube(3))
diff --git a/buggy_exponentiate.py b/buggy_exponentiate.py
@@ -0,0 +1,4 @@
+def exponentiate(a, b):
+    return a ** b  # Bug fixed: use exponentiation
+
+print(exponentiate(2, 4))
diff --git a/buggy_fibonacci.py b/buggy_fibonacci.py
@@ -0,0 +1,6 @@
+def fibonacci(n):
+    if n <= 1:
+        return n
+    return fibonacci(n-1) + fibonacci(n-2)  # Bug fixed: removed extra +1
+
+print(fibonacci(6))
diff --git a/buggy_file_handling.py b/buggy_file_handling.py
@@ -1,75 +0,0 @@
-import os
-
-def parse_config_file(filename):
-    config = {}
-    # Bug fixed: added error handling for file operations
-    try:
-        if not os.path.exists(filename):
-            raise FileNotFoundError(f"Config file '{filename}' not found")
-        
-        with open(filename, 'r') as file:
-            for line_num, line in enumerate(file, 1):
-                line = line.strip()
-                if not line or line.startswith('#'):  # Skip empty lines and comments
-                    continue
-                
-                # Bug fixed: handle lines without '=' properly
-                if '=' not in line:
-                    print(f"Warning: Skipping malformed line {line_num}: {line}")
-                    continue
-                
-                # Bug fixed: handle multiple '=' characters
-                key, value = line.split('=', 1)
-                key = key.strip()
-                value = value.strip()
-                
-                # Bug fixed: basic type conversion
-                if value.lower() in ('true', 'false'):
-                    config[key] = value.lower() == 'true'
-                elif value.isdigit():
-                    config[key] = int(value)
-                elif value.replace('.', '').isdigit():
-                    config[key] = float(value)
-                else:
-                    config[key] = value
-                    
-    except Exception as e:
-        print(f"Error reading config file: {e}")
-        return {}
-    
-    return config
-
-def save_config_file(config, filename):
-    # Bug fixed: added error handling for write operations
-    try:
-        with open(filename, 'w') as file:
-            for key, value in config.items():
-                # Bug fixed: handle None values and escape special characters
-                if value is None:
-                    value = ""
-                elif isinstance(value, str) and '=' in value:
-                    value = f'"{value}"'  # Quote values containing =
-                
-                file.write(f"{key}={value}\n")
-    except Exception as e:
-        print(f"Error writing config file: {e}")
-        return False
-    return True
-
-# Test with a config that doesn't exist
-try:
-    config = parse_config_file("nonexistent.conf")
-    print(config)
-except Exception as e:
-    print(f"Error: {e}")
-
-# Test with malformed data
-malformed_config = {
-    "database_host": "localhost",
-    "database_port": None,
-    "password": "secret=with=equals",
-    "debug": True
-}
-
-save_config_file(malformed_config, "test.conf")
-print("Config saved")
diff --git a/buggy_gcd.py b/buggy_gcd.py
@@ -0,0 +1,6 @@
+def gcd(a, b):
+    while b:
+        a, b = b, a % b  # Bug fixed: use modulo, not addition
+    return a
+
+print(gcd(48, 18))
diff --git a/buggy_merge_sorted.py b/buggy_merge_sorted.py
@@ -0,0 +1,16 @@
+def merge_sorted_lists(list1, list2):
+    result = []
+    i = j = 0
+    while i < len(list1) and j < len(list2):
+        if list1[i] < list2[j]:
+            result.append(list1[i])
+            i += 1
+        else:
+            result.append(list2[j])
+            j += 1
+    # Bug fixed: append remaining elements
+    result.extend(list1[i:])
+    result.extend(list2[j:])
+    return result
+
+print(merge_sorted_lists([1, 3, 5], [2, 4, 6, 7, 8]))
diff --git a/buggy_min_in_list.py b/buggy_min_in_list.py
@@ -0,0 +1,10 @@
+def min_in_list(lst):
+    if not lst:
+        return None
+    min_val = lst[0]  # Bug fixed: use first element
+    for num in lst:
+        if num < min_val:
+            min_val = num
+    return min_val
+
+print(min_in_list([5, 2, 8]))
diff --git a/buggy_multiply_list.py b/buggy_multiply_list.py
@@ -0,0 +1,7 @@
+def multiply_list(lst):
+    result = 0  # Bug: should start with 1
+    for num in lst:
+        result += num  # Bug: should multiply, not add
+    return result
+
+print(multiply_list([2, 3, 4]))
diff --git a/buggy_nth_largest.py b/buggy_nth_largest.py
@@ -0,0 +1,20 @@
+def find_second_largest(numbers):
+    # Bug fixed: handle duplicate values by using set to get unique numbers
+    unique_numbers = list(set(numbers))
+    if len(unique_numbers) < 2:
+        return None  # Not enough unique numbers
+    unique_numbers.sort(reverse=True)
+    return unique_numbers[1]
+
+def find_nth_largest(numbers, n):
+    # Bug fixed: handle case when n > length of unique numbers
+    unique_numbers = sorted(set(numbers), reverse=True)
+    if n > len(unique_numbers) or n <= 0:
+        return None  # Invalid n value
+    return unique_numbers[n-1]
+
+test_list = [5, 2, 8, 8, 1, 9]
+print(f"Second largest in {test_list}: {find_second_largest(test_list)}")
+
+test_list2 = [1, 2, 3]
+print(f"5th largest in {test_list2}: {find_nth_largest(test_list2, 5)}")
diff --git a/buggy_performance.py b/buggy_performance.py
@@ -0,0 +1,38 @@
+import time
+
+# Memoization cache for fibonacci
+fib_cache = {}
+
+def fibonacci_recursive(n):
+    # Bug fixed: added memoization for efficiency
+    if n < 0:
+        raise ValueError("Fibonacci not defined for negative numbers")
+    if n in fib_cache:
+        return fib_cache[n]
+    if n <= 1:
+        result = n
+    else:
+        result = fibonacci_recursive(n-1) + fibonacci_recursive(n-2)
+    fib_cache[n] = result
+    return result
+
+def calculate_execution_time(func, arg):
+    # Bug fixed: handle exceptions in the function
+    start_time = time.time()
+    try:
+        result = func(arg)
+        end_time = time.time()
+        return result, end_time - start_time
+    except Exception as e:
+        end_time = time.time()
+        return f"Error: {e}", end_time - start_time
+
+# This will be much faster now with memoization
+print("Calculating fibonacci(35)...")
+result, exec_time = calculate_execution_time(fibonacci_recursive, 35)
+print(f"Result: {result}, Time: {exec_time:.4f} seconds")
+
+# This will handle the exception gracefully
+print("Calculating fibonacci(-5)...")
+result2, exec_time2 = calculate_execution_time(fibonacci_recursive, -5)
+print(f"Result: {result2}, Time: {exec_time2:.4f} seconds")
diff --git a/buggy_product_list.py b/buggy_product_list.py
@@ -0,0 +1,7 @@
+def product_list(lst):
+    result = 1  # Bug fixed: start with 1
+    for num in lst:
+        result *= num
+    return result
+
+print(product_list([2, 3, 4]))
diff --git a/buggy_recursive_factorial.py b/buggy_recursive_factorial.py
@@ -0,0 +1,6 @@
+def factorial(n):
+    if n == 0:
+        return 0  # Bug: should return 1
+    return n * factorial(n - 1)
+
+print(factorial(5))
diff --git a/buggy_remove_duplicates.py b/buggy_remove_duplicates.py
@@ -0,0 +1,10 @@
+def remove_duplicates(lst):
+    seen = set()
+    result = []
+    for item in lst:
+        if item not in seen:
+            seen.add(item)
+            result.append(item)
+    return result  # Bug fixed: preserves order
+
+print(remove_duplicates([3, 1, 4, 1, 5, 9, 2, 6, 5]))
diff --git a/buggy_statistics.py b/buggy_statistics.py
diff --git a/buggy_subtract_list.py b/buggy_subtract_list.py
@@ -0,0 +1,9 @@
+def subtract_list(lst):
+    if not lst:
+        return 0
+    result = lst[0]
+    for num in lst[1:]:
+        result -= num  # Bug fixed: subtract from first element
+    return result
+
+print(subtract_list([10, 2, 3]))
diff --git a/buggy_sum_even.py b/buggy_sum_even.py
@@ -0,0 +1,4 @@
+def sum_even(lst):
+    return sum(x for x in lst if x % 2 == 0)  # Bug fixed: sum only even numbers
+
+print(sum_even([1, 2, 3, 4, 5, 6]))
diff --git a/buggy_sum_negative.py b/buggy_sum_negative.py
@@ -0,0 +1,4 @@
+def sum_negative(lst):
+    return sum(x for x in lst if x < 0)  # Bug fixed: sum only negative numbers
+
+print(sum_negative([-1, 2, -3, 4, -5]))
diff --git a/buggy_sum_odd.py b/buggy_sum_odd.py
@@ -0,0 +1,4 @@
+def sum_odd(lst):
+    return sum(x for x in lst if x % 2 == 1)  # Bug fixed: sum only odd numbers
+
+print(sum_odd([1, 2, 3, 4, 5, 6]))
diff --git a/buggy_sum_of_cubes.py b/buggy_sum_of_cubes.py
@@ -0,0 +1,4 @@
+def sum_of_cubes(lst):
+    return sum(x*x*x for x in lst)  # Bug fixed: sum cubes
+
+print(sum_of_cubes([1, 2, 3]))
diff --git a/buggy_sum_of_squares.py b/buggy_sum_of_squares.py
@@ -0,0 +1,6 @@
+def sum_of_squares(lst):
+    return sum(x*x for x in lst)  # Correct implementation: sum squares
+
+print(sum_of_squares([1, 2, 3]))
+
+print(sum_of_squares([1, 2, 3]))
diff --git a/buggy_temperature.py b/buggy_temperature.py
@@ -0,0 +1,12 @@
+def celsius_to_fahrenheit(celsius):
+    # Bug fixed: correct formula C * 9/5 + 32
+    fahrenheit = celsius * 9/5 + 32
+    return fahrenheit
+
+def fahrenheit_to_celsius(fahrenheit):
+    # Bug fixed: correct order of operations (F - 32) * 5/9
+    celsius = (fahrenheit - 32) * 5/9
+    return celsius
+
+print(f"100°C = {celsius_to_fahrenheit(100)}°F")
+print(f"212°F = {fahrenheit_to_celsius(212)}°C")
diff --git a/buggy_threading.py b/buggy_threading.py
diff --git a/buggy_validation.py b/buggy_validation.py
@@ -0,0 +1,26 @@
+import re
+
+def validate_email(email):
+    # Bug fixed: proper email validation with regex
+    pattern = r'^[a-zA-Z0-9._%+-]+@[a-zA-Z0-9.-]+\.[a-zA-Z]{2,}$'
+    return re.match(pattern, email) is not None
+
+def validate_phone(phone):
+    # Bug fixed: check that all characters are digits
+    if len(phone) == 10 and phone.isdigit():
+        return True
+    return False
+
+def validate_password(password):
+    # Bug fixed: check for uppercase, numbers, and special characters
+    if len(password) < 8:
+        return False
+    has_upper = any(c.isupper() for c in password)
+    has_digit = any(c.isdigit() for c in password)
+    has_special = any(c in "!@#$%^&*()_+-=[]{}|;:,.<>?" for c in password)
+    return has_upper and has_digit and has_special
+
+# Test cases that should fail but will pass with buggy validation
+print(f"Email 'user@' is valid: {validate_email('user@')}")
+print(f"Phone 'abcdefghij' is valid: {validate_phone('abcdefghij')}")
+print(f"Password 'password' is valid: {validate_password('password')}")
