source_file stringclasses 1
value | source_line int64 1 132 | record_json stringlengths 8.77k 45.1k |
|---|---|---|
candidates.jsonl | 1 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def merge(arr: list[int]) -> list[int]:\n \"\"\"Return a sorted array.\n >>> merge([10,9,8,7,6,5,4,3,2,1])\n [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]\n >>> merge([1,2,3,4,5,... |
candidates.jsonl | 2 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def is_isogram(string: str) -> bool:\n \"\"\"\n An isogram is a word in which no letter is repeated.\n Examples of isograms are uncopyrightable and ambidextrously.\n ... |
candidates.jsonl | 3 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def count_vowels(s: str) -> int:\n \"\"\"\n Count the number of vowels in a given string.\n\n :param s: Input string to count vowels in.\n :return: Number of vowels... |
candidates.jsonl | 4 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef maximum_non_adjacent_sum(nums: list[int]) -> int:\n \"\"\"\n Find the maximum non-adjacent sum of the integers in the nums inp... |
candidates.jsonl | 5 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def ceil(x: float) -> int:\n \"\"\"\n Return the ceiling of x as an Integral.\n\n :param x: the number\n :return: the smallest integer >= x.\n\n >>> import math\... |
candidates.jsonl | 6 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\... |
candidates.jsonl | 7 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef find_median(nums: list[int | float]) -> float:\n \"\"\"\n This is the implementation of the median.\n :param nums: The list... |
candidates.jsonl | 8 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def trapped_rainwater(heights: tuple[int, ...]) -> int:\n \"\"\"\n The trapped_rainwater function calculates the total amount of rainwater that can be\n trapped given ... |
candidates.jsonl | 9 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def catalan_numbers(upper_limit: int) -> \"list[int]\":\n \"\"\"\n Return a list of the Catalan number sequence from 0 through `upper_limit`.\n\n >>> catalan_numbers(5... |
candidates.jsonl | 10 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def hex_to_bin(hex_num: str) -> int:\n \"\"\"\n Convert a hexadecimal value to its binary equivalent\n #https://stackoverflow.com/questions/1425493/convert-hex-to-bina... |
candidates.jsonl | 11 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def binary_xor(a: int, b: int) -> str:\n \"\"\"\n Take in 2 integers, convert them to binary,\n return a binary number that is the\n result of a binary xor operatio... |
candidates.jsonl | 12 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def abs_max(x: list[int]) -> int:\n \"\"\"\n >>> abs_max([0,5,1,11])\n 11\n >>> abs_max([3,-10,-2])\n -10\n >>> abs_max([])\n Traceback (most recent call l... |
candidates.jsonl | 13 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def perfect_cube_binary_search(n: int) -> bool:\n \"\"\"\n Check if a number is a perfect cube or not using binary search.\n Time complexity : O(Log(n))\n Space com... |
candidates.jsonl | 14 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef find_median(nums: list[int | float]) -> float:\n \"\"\"\n This is the implementation of the median.\n :param nums: The list... |
candidates.jsonl | 15 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def compute_geometric_mean(*args: int) -> float:\n \"\"\"\n Return the geometric mean of the argument numbers.\n >>> compute_geometric_mean(2,8)\n 4.0\n >>> comp... |
candidates.jsonl | 16 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def clear_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 0.\n\n Details: perform bitwise and for given number and X.\n Where X is a n... |
candidates.jsonl | 17 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def find_minimum_partitions(string: str) -> int:\n \"\"\"\n Returns the minimum cuts needed for a palindrome partitioning of string\n\n >>> find_minimum_partitions(\"a... |
candidates.jsonl | 18 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def is_isogram(string: str) -> bool:\n \"\"\"\n An isogram is a word in which no letter is repeated.\n Examples of isograms are uncopyrightable and ambidextrously.\n ... |
candidates.jsonl | 19 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef prime_factors(n: int) -> list[int]:\n \"\"\"\n Returns prime factors of n as a list.\n\n >>> prime_factors(0)\n []\n ... |
candidates.jsonl | 20 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def prime_sieve_eratosthenes(num: int) -> list[int]:\n \"\"\"\n Print the prime numbers up to n\n\n >>> prime_sieve_eratosthenes(10)\n [2, 3, 5, 7]\n >>> prime_s... |
candidates.jsonl | 21 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def molarity_to_normality(nfactor: int, moles: float, volume: float) -> float:\n \"\"\"\n Convert molarity to normality.\n Volume is taken in litres.\n\n Wikipe... |
candidates.jsonl | 22 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def median_of_five(arr: list) -> int:\n \"\"\"\n Return the median of the input list\n :param arr: Array to find median of\n :return: median of arr\n\n >>> media... |
candidates.jsonl | 23 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def dodecahedron_surface_area(edge: float) -> float:\n \"\"\"\n Calculates the surface area of a regular dodecahedron\n a = 3 * ((25 + 10 * (5** (1 / 2))) ** (1 / 2 ))... |
candidates.jsonl | 24 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def dodecahedron_volume(edge: float) -> float:\n \"\"\"\n Calculates the volume of a regular dodecahedron\n v = ((15 + (7 * (5** (1 / 2)))) / 4) * (e**3)\n where:\n... |
candidates.jsonl | 25 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def find_previous_power_of_two(number: int) -> int:\n \"\"\"\n Find the largest power of two that is less than or equal to a given integer.\n https://stackoverflow.com... |
candidates.jsonl | 26 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef two_pointer(nums: list[int], target: int) -> list[int]:\n \"\"\"\n >>> two_pointer([2, 7, 11, 15], 9)\n [0, 1]\n >>> two... |
candidates.jsonl | 27 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef minimum_cost_path(matrix: list[list[int]]) -> int:\n \"\"\"\n Find the minimum cost traced by all possible paths from top left... |
candidates.jsonl | 28 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def combinations(n: int, k: int) -> int:\n \"\"\"\n Returns the number of different combinations of k length which can\n be made from n values, where n >= k.\n\n Ex... |
candidates.jsonl | 29 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def clear_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 0.\n\n Details: perform bitwise and for given number and X.\n Where X is a n... |
candidates.jsonl | 30 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def binomial_coefficient(n: int, r: int) -> int:\n \"\"\"\n Find binomial coefficient using Pascal's triangle.\n\n Calculate C(n, r) using Pascal's triangle.\n\n :p... |
candidates.jsonl | 31 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from fractions import Fraction\nfrom math import floor\n\n\ndef continued_fraction(num: Fraction) -> list[int]:\n \"\"\"\n :param num:\n Fraction of the number whose c... |
candidates.jsonl | 32 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def power_of_4(number: int) -> bool:\n \"\"\"\n Return True if this number is power of 4 or False otherwise.\n\n >>> power_of_4(0)\n Traceback (most recent call las... |
candidates.jsonl | 33 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef find_min_iterative(nums: list[int | float]) -> int | float:\n \"\"\"\n Find Minimum Number in a List\n :param nums: contain... |
candidates.jsonl | 34 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def factorial_recursive(n: int) -> int:\n \"\"\"\n Calculate the factorial of a positive integer\n https://en.wikipedia.org/wiki/Factorial\n\n >>> import math\n ... |
candidates.jsonl | 35 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def get_bit(number: int, position: int) -> int:\n \"\"\"\n Get the bit at the given position\n\n Details: perform bitwise and for the given number and X,\n Where X ... |
candidates.jsonl | 36 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def comb_sort(data: list) -> list:\n \"\"\"Pure implementation of comb sort algorithm in Python\n :param data: mutable collection with comparable items\n :return: the ... |
candidates.jsonl | 37 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def binary_xor(a: int, b: int) -> str:\n \"\"\"\n Take in 2 integers, convert them to binary,\n return a binary number that is the\n result of a binary xor operatio... |
candidates.jsonl | 38 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def dynamic_lucas_number(n_th_number: int) -> int:\n \"\"\"\n Returns the nth lucas number\n >>> dynamic_lucas_number(1)\n 1\n >>> dynamic_lucas_number(20)\n ... |
candidates.jsonl | 39 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def lucas_lehmer_test(p: int) -> bool:\n \"\"\"\n >>> lucas_lehmer_test(p=7)\n True\n\n >>> lucas_lehmer_test(p=11)\n False\n\n # M_11 = 2^11 - 1 = 2047 = 23 ... |
candidates.jsonl | 40 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def multiplicative_persistence(num: int) -> int:\n \"\"\"\n Return the persistence of a given number.\n\n https://en.wikipedia.org/wiki/Persistence_of_a_number\n\n ... |
candidates.jsonl | 41 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def snake_to_camel_case(input_str: str, use_pascal: bool = False) -> str:\n \"\"\"\n Transforms a snake_case given string to camelCase (or PascalCase if indicated)\n (... |
candidates.jsonl | 42 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def decimal_to_ipv4(decimal_ipv4: int) -> str:\n \"\"\"\n Convert a decimal representation of an IP address to its IPv4 format.\n\n Args:\n decimal_ipv4: An int... |
candidates.jsonl | 43 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def power(base: int, exponent: int) -> float:\n \"\"\"\n Calculate the power of a base raised to an exponent.\n\n >>> power(3, 4)\n 81\n >>> power(2, 0)\n 1\n... |
candidates.jsonl | 44 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef insert_next(collection: list, index: int):\n \"\"\"\n Inserts the '(index-1)th' element into place\n\n >>> col = [3, 2, 4, ... |
candidates.jsonl | 45 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from math import pi\n\n\ndef arc_length(angle: int, radius: int) -> float:\n \"\"\"\n >>> arc_length(45, 5)\n 3.9269908169872414\n >>> arc_length(120, 15)\n 31.4... |
candidates.jsonl | 46 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef unique_prime_factors(n: int) -> list[int]:\n \"\"\"\n Returns unique prime factors of n as a list.\n\n >>> unique_prime_fac... |
candidates.jsonl | 47 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def aliquot_sum(input_num: int) -> int:\n \"\"\"\n Finds the aliquot sum of an input integer, where the\n aliquot sum of a number n is defined as the sum of all\n n... |
candidates.jsonl | 48 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def wave(txt: str) -> list:\n \"\"\"\n Returns a so called 'wave' of a given string\n >>> wave('cat')\n ['Cat', 'cAt', 'caT']\n >>> wave('one')\n ['One', 'oNe... |
candidates.jsonl | 49 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from math import factorial, radians\n\n\ndef sin(\n angle_in_degrees: float, accuracy: int = 18, rounded_values_count: int = 10\n) -> float:\n \"\"\"\n Implement sin f... |
candidates.jsonl | 50 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def shell_sort(collection: list[int]) -> list[int]:\n \"\"\"Pure implementation of shell sort algorithm in Python\n :param collection: Some mutable ordered collection wi... |
candidates.jsonl | 51 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def merge_sort(collection: list) -> list:\n \"\"\"\n Sorts a list using the merge sort algorithm.\n\n :param collection: A mutable ordered collection with comparable i... |
candidates.jsonl | 52 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def longest_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", ... |
candidates.jsonl | 53 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def longest_common_substring(text1: str, text2: str) -> str:\n \"\"\"\n Finds the longest common substring between two strings.\n\n >>> longest_common_substring(\"\", ... |
candidates.jsonl | 54 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def gnome_sort(lst: list) -> list:\n \"\"\"\n Pure implementation of the gnome sort algorithm in Python\n\n Take some mutable ordered collection with heterogeneous com... |
candidates.jsonl | 55 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def recursive_match(text: str, pattern: str) -> bool:\n r\"\"\"\n Recursive matching algorithm.\n\n | Time complexity: O(2^(\\|text\\| + \\|pattern\\|))\n | Space c... |
candidates.jsonl | 56 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def factorial_recursive(n: int) -> int:\n \"\"\"\n Calculate the factorial of a positive integer\n https://en.wikipedia.org/wiki/Factorial\n\n >>> import math\n ... |
candidates.jsonl | 57 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def binary_coded_decimal(number: int) -> str:\n \"\"\"\n Find binary coded decimal (bcd) of integer base 10.\n Each digit of the number is represented by a 4-bit binar... |
candidates.jsonl | 58 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def longest_common_subsequence(x: str, y: str):\n \"\"\"\n Finds the longest common subsequence between two strings. Also returns the\n The subsequence found\n\n Pa... |
candidates.jsonl | 59 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"import math\n\n\ndef juggler_sequence(number: int) -> list[int]:\n \"\"\"\n >>> juggler_sequence(0)\n Traceback (most recent call last):\n ...\n ValueError: ... |
candidates.jsonl | 60 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def pressure_and_volume_to_temperature(\n pressure: float, moles: float, volume: float\n) -> float:\n \"\"\"\n Convert pressure and volume to temperature.\n Ideal... |
candidates.jsonl | 61 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from math import factorial, radians\n\n\ndef sin(\n angle_in_degrees: float, accuracy: int = 18, rounded_values_count: int = 10\n) -> float:\n \"\"\"\n Implement sin f... |
candidates.jsonl | 62 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def catalan_numbers(upper_limit: int) -> \"list[int]\":\n \"\"\"\n Return a list of the Catalan number sequence from 0 through `upper_limit`.\n\n >>> catalan_numbers(5... |
candidates.jsonl | 63 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def reverse_letters(sentence: str, length: int = 0) -> str:\n \"\"\"\n Reverse all words that are longer than the given length of characters in a sentence.\n If ``leng... |
candidates.jsonl | 64 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def capitalize(sentence: str) -> str:\n \"\"\"\n Capitalizes the first letter of a sentence or word.\n\n >>> capitalize(\"hello world\")\n 'Hello world'\n >>> ca... |
candidates.jsonl | 65 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def exchange_sort(numbers: list[int]) -> list[int]:\n \"\"\"\n Uses exchange sort to sort a list of numbers.\n Source: https://en.wikipedia.org/wiki/Sorting_algorithm#... |
candidates.jsonl | 66 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def sumset(set_a: set, set_b: set) -> set:\n \"\"\"\n :param set_a: a set of numbers\n :param set_b: a set of numbers\n :return: the sumset of set_a and set_b (all ... |
candidates.jsonl | 67 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def linear_search(sequence: list, target: int) -> int:\n \"\"\"A pure Python implementation of a linear search algorithm\n\n :param sequence: a collection with comparable... |
candidates.jsonl | 68 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def ceil(x: float) -> int:\n \"\"\"\n Return the ceiling of x as an Integral.\n\n :param x: the number\n :return: the smallest integer >= x.\n\n >>> import math\... |
candidates.jsonl | 69 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef find_max_recursive(nums: list[int | float], left: int, right: int) -> int | float:\n \"\"\"\n find max value in list\n :par... |
candidates.jsonl | 70 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef binary_search(a_list: list[int], item: int) -> bool:\n \"\"\"\n >>> test_list = [0, 1, 2, 8, 13, 17, 19, 32, 42]\n >>> bina... |
candidates.jsonl | 71 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def signum(num: float) -> int:\n \"\"\"\n Applies signum function on the number\n\n Custom test cases:\n >>> signum(-10)\n -1\n >>> signum(10)\n 1\n >>>... |
candidates.jsonl | 72 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def flip_bit(number: int, position: int) -> int:\n \"\"\"\n Flip the bit at position.\n\n Details: perform bitwise xor for given number and X.\n Where X is a number... |
candidates.jsonl | 73 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def is_int_palindrome(num: int) -> bool:\n \"\"\"\n Returns whether `num` is a palindrome or not\n (see for reference https://en.wikipedia.org/wiki/Palindromic_number)... |
candidates.jsonl | 74 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def strip(user_string: str, characters: str = \" \\t\\n\\r\") -> str:\n \"\"\"\n Remove leading and trailing characters (whitespace by default) from a string.\n\n Args... |
candidates.jsonl | 75 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def ipv4_to_decimal(ipv4_address: str) -> int:\n \"\"\"\n Convert an IPv4 address to its decimal representation.\n\n Args:\n ip_address: A string representing a... |
candidates.jsonl | 76 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def average_absolute_deviation(nums: list[int]) -> float:\n \"\"\"\n Return the average absolute deviation of a list of numbers.\n Wiki: https://en.wikipedia.org/wiki/... |
candidates.jsonl | 77 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def compute_geometric_mean(*args: int) -> float:\n \"\"\"\n Return the geometric mean of the argument numbers.\n >>> compute_geometric_mean(2,8)\n 4.0\n >>> comp... |
candidates.jsonl | 78 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def lucas_lehmer_test(p: int) -> bool:\n \"\"\"\n >>> lucas_lehmer_test(p=7)\n True\n\n >>> lucas_lehmer_test(p=11)\n False\n\n # M_11 = 2^11 - 1 = 2047 = 23 ... |
candidates.jsonl | 79 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def hamming_distance(string1: str, string2: str) -> int:\n \"\"\"Calculate the Hamming distance between two equal length strings\n In information theory, the Hamming dist... |
candidates.jsonl | 80 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def perfect(number: int) -> bool:\n \"\"\"\n Check if a number is a perfect number.\n\n A perfect number is a positive integer that is equal to the sum of its proper\n... |
candidates.jsonl | 81 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def prefix_sum(array: list[int], queries: list[tuple[int, int]]) -> list[int]:\n \"\"\"\n >>> prefix_sum([1, 4, 6, 2, 61, 12], [(2, 5), (1, 5), (3, 4)])\n [81, 85, 63]... |
candidates.jsonl | 82 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef mean(nums: list) -> float:\n \"\"\"\n Find mean of a list of numbers.\n Wiki: https://en.wikipedia.org/wiki/Mean\n\n >>>... |
candidates.jsonl | 83 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def selection_sort(collection: list[int]) -> list[int]:\n \"\"\"\n Sorts a list in ascending order using the selection sort algorithm.\n\n :param collection: A list of... |
candidates.jsonl | 84 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def abs_max(x: list[int]) -> int:\n \"\"\"\n >>> abs_max([0,5,1,11])\n 11\n >>> abs_max([3,-10,-2])\n -10\n >>> abs_max([])\n Traceback (most recent call l... |
candidates.jsonl | 85 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"import re\n\n\ndef dna(dna: str) -> str:\n \"\"\"\n https://en.wikipedia.org/wiki/DNA\n Returns the second side of a DNA strand\n\n >>> dna(\"GCTA\")\n 'CGAT'\n ... |
candidates.jsonl | 86 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def get_index_of_rightmost_set_bit(number: int) -> int:\n \"\"\"\n Take in a positive integer 'number'.\n Returns the zero-based index of first set bit in that 'number... |
candidates.jsonl | 87 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def lucas_lehmer_test(p: int) -> bool:\n \"\"\"\n >>> lucas_lehmer_test(p=7)\n True\n\n >>> lucas_lehmer_test(p=11)\n False\n\n # M_11 = 2^11 - 1 = 2047 = 23 ... |
candidates.jsonl | 88 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def decimal_to_ipv4(decimal_ipv4: int) -> str:\n \"\"\"\n Convert a decimal representation of an IP address to its IPv4 format.\n\n Args:\n decimal_ipv4: An int... |
candidates.jsonl | 89 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def set_bit(number: int, position: int) -> int:\n \"\"\"\n Set the bit at position to 1.\n\n Details: perform bitwise or for given number and X.\n Where X is a numb... |
candidates.jsonl | 90 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def get_index_of_rightmost_set_bit(number: int) -> int:\n \"\"\"\n Take in a positive integer 'number'.\n Returns the zero-based index of first set bit in that 'number... |
candidates.jsonl | 91 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def three_sum(nums: list[int]) -> list[list[int]]:\n \"\"\"\n Find all unique triplets in a sorted array of integers that sum up to zero.\n\n Args:\n nums: A so... |
candidates.jsonl | 92 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def stalin_sort(sequence: list[int]) -> list[int]:\n \"\"\"\n Sorts a list using the Stalin sort algorithm.\n\n >>> stalin_sort([4, 3, 5, 2, 1, 7])\n [4, 5, 7]\n\n ... |
candidates.jsonl | 93 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def selection_sort(collection: list[int]) -> list[int]:\n \"\"\"\n Sorts a list in ascending order using the selection sort algorithm.\n\n :param collection: A list of... |
candidates.jsonl | 94 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"from __future__ import annotations\n\n\ndef pigeon_sort(array: list[int]) -> list[int]:\n \"\"\"\n Implementation of pigeon hole sort algorithm\n :param array: Collect... |
candidates.jsonl | 95 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def search(list_data: list, key: int, left: int = 0, right: int = 0) -> int:\n \"\"\"\n Iterate through the array to find the index of key using recursion.\n :param li... |
candidates.jsonl | 96 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def sentinel_linear_search(sequence, target):\n \"\"\"Pure implementation of sentinel linear search algorithm in Python\n\n :param sequence: some sequence with comparable... |
candidates.jsonl | 97 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def binary_count_setbits(a: int) -> int:\n \"\"\"\n Take in 1 integer, return a number that is\n the number of 1's in binary representation of that number.\n\n >>> ... |
candidates.jsonl | 98 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def find_minimum_partitions(string: str) -> int:\n \"\"\"\n Returns the minimum cuts needed for a palindrome partitioning of string\n\n >>> find_minimum_partitions(\"a... |
candidates.jsonl | 99 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def find_min(numbers: list[int]) -> int:\n \"\"\"\n >>> find_min([1, 2, 3, 4, 5])\n 1\n >>> find_min([5, 5, 5, 5, 5])\n 5\n >>> find_min([5, 5, 5, 5])\n 0\... |
candidates.jsonl | 100 | {"candidate_prediction":{"method":"inverse of the generator's own mutation (original span restored)","predicted_repair":{"files":{"program.py":"def join(separator: str, separated: list[str]) -> str:\n \"\"\"\n Joins a list of strings using a separator\n and returns the result.\n\n :param separator: Separato... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.