name stringclasses 161
values | language stringclasses 22
values | prompt stringlengths 40 2.27k | doctests stringclasses 3
values | original stringclasses 956
values | prompt_terminology stringclasses 2
values | tests stringlengths 125 5.35k | stop_tokens listlengths 1 7 |
|---|---|---|---|---|---|---|---|
HumanEval_104_unique_digits | jl | """Given a list of positive integers x. return a sorted list of all
elements that hasn't any even digit.
Note: Returned list should be sorted in increasing order.
For example:
>>> unique_digits([15, 33, 1422, 1])
[1, 15, 33]
>>> unique_digits([152, 323, 1422, 10])
[]"""
function unique_digits(x::Vector{Int64})::Vector... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_104_unique_digits.py | verbatim | using Test
@testset begin
candidate = unique_digits;
@test(candidate([15, 33, 1422, 1]) == [1, 15, 33])
@test(candidate([152, 323, 1422, 10]) == Vector{Int64}([]))
@test(candidate([12345, 2033, 111, 151]) == [111, 151])
@test(candidate([135, 103, 31]) == [31, 135])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_105_by_length | jl | """Given an array of integers, sort the integers that are between 1 and 9 inclusive,
reverse the resulting array, and then replace each digit by its corresponding name from
"One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine".
For example:
arr = [2, 1, 1, 4, 5, 8, 2, 3]
-> sort arr -> [1,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_105_by_length.py | verbatim | using Test
@testset begin
candidate = by_length;
@test(candidate([2, 1, 1, 4, 5, 8, 2, 3]) == ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"])
@test(candidate(Vector{Int64}([])) == Vector{String}([]))
@test(candidate([1, -1, 55]) == ["One"])
@test(candidate([1, -1, 3, 2]) == ["Three", "Two", "One"]... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_106_f | jl | """ Implement the function f that takes n as a parameter,
and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even
or the sum of numbers from 1 to i otherwise.
i starts from 1.
the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i).
Ex... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_106_f.py | verbatim | using Test
@testset begin
candidate = f;
@test(candidate(5) == [1, 2, 6, 24, 15])
@test(candidate(7) == [1, 2, 6, 24, 15, 720, 28])
@test(candidate(1) == [1])
@test(candidate(3) == [1, 2, 6])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_107_even_odd_palindrome | jl | """Given a positive integer n, return a tuple that has the number of even and odd
integer palindromes that fall within the range(1, n), inclusive.
Example 1:
Input: 3
Output: (1, 2)
Explanation:
Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.
Example 2:
Input: 12
Ou... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_107_even_odd_palindrome.py | verbatim | using Test
@testset begin
candidate = even_odd_palindrome;
@test(candidate(123) == (8, 13))
@test(candidate(12) == (4, 6))
@test(candidate(3) == (1, 2))
@test(candidate(63) == (6, 8))
@test(candidate(25) == (5, 6))
@test(candidate(19) == (4, 6))
@test(candidate(9) == (4, 5))
@test(candidate(1) == (0, 1))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_108_count_nums | jl | """Write a function count_nums which takes an array of integers and returns
the number of elements which has a sum of digits > 0.
If a number is negative, then its first signed digit will be negative:
e.g. -123 has signed digits -1, 2, and 3.
>>> count_nums([]) == 0
>>> count_nums([-1, 11, -11]) == 1
>>> count_nums([1,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_108_count_nums.py | verbatim | using Test
@testset begin
candidate = count_nums;
@test(candidate(Vector{Int64}([])) == 0)
@test(candidate([-1, -2, 0]) == 0)
@test(candidate([1, 1, 2, -2, 3, 4, 5]) == 6)
@test(candidate([1, 6, 9, -6, 0, 1, 5]) == 5)
@test(candidate([1, 100, 98, -7, 1, -1]) == 4)
@test(candidate([12, 23, 34, -45, -56, 0]) == 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_109_move_one_ball | jl | """We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The
numbers in the array will be randomly ordered. Your task is to determine if
it is possible to get an array sorted in non-decreasing order by performing
the following operation on the given array:
You are allowed to perform right shift operatio... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_109_move_one_ball.py | verbatim | using Test
@testset begin
candidate = move_one_ball;
@test(candidate([3, 4, 5, 1, 2]) == true)
@test(candidate([3, 5, 10, 1, 2]) == true)
@test(candidate([4, 3, 1, 2]) == false)
@test(candidate([3, 5, 4, 1, 2]) == false)
@test(candidate(Vector{Int64}([])) == true)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_10_make_palindrome | jl | """ Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
>>> make_palindrome('')
''
>>> make_palindrome('cat')
... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_10_make_palindrome.py | verbatim | using Test
@testset begin
candidate = make_palindrome;
@test(candidate("") == "")
@test(candidate("x") == "x")
@test(candidate("xyz") == "xyzyx")
@test(candidate("xyx") == "xyx")
@test(candidate("jerry") == "jerryrrej")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_110_exchange | jl | """In this problem, you will implement a function that takes two lists of numbers,
and determines whether it is possible to perform an exchange of elements
between them to make lst1 a list of only even numbers.
There is no limit on the number of exchanged elements between lst1 and lst2.
If it is possible to exchange el... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_110_exchange.py | verbatim | using Test
@testset begin
candidate = exchange;
@test(candidate([1, 2, 3, 4], [1, 2, 3, 4]) == "YES")
@test(candidate([1, 2, 3, 4], [1, 5, 3, 4]) == "NO")
@test(candidate([1, 2, 3, 4], [2, 1, 4, 3]) == "YES")
@test(candidate([5, 7, 3], [2, 6, 4]) == "YES")
@test(candidate([5, 7, 3], [2, 6, 3]) == "NO")
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_111_histogram | jl | """Given a string representing a space separated lowercase letters, return a dictionary
of the letter with the most repetition and containing the corresponding count.
If several letters have the same occurrence, return all of them.
Example:
histogram('a b c') == {'a': 1, 'b': 1, 'c': 1}
histogram('a b b a') == {'a': 2,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_111_histogram.py | verbatim | using Test
@testset begin
candidate = histogram;
@test(candidate("a b b a") == Dict("a" => 2, "b" => 2))
@test(candidate("a b c a b") == Dict("a" => 2, "b" => 2))
@test(candidate("a b c d g") == Dict("a" => 1, "b" => 1, "c" => 1, "d" => 1, "g" => 1))
@test(candidate("r t g") == Dict("r" => 1, "t" => 1, "g" => 1))... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_112_reverse_delete | jl | """Task
We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c
then check if the result string is palindrome.
A string is called palindrome if it reads the same backward as forward.
You should return a tuple containing the result string and True/False for the ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_112_reverse_delete.py | verbatim | using Test
@testset begin
candidate = reverse_delete;
@test(candidate("abcde", "ae") == ("bcd", false))
@test(candidate("abcdef", "b") == ("acdef", false))
@test(candidate("abcdedcba", "ab") == ("cdedc", true))
@test(candidate("dwik", "w") == ("dik", false))
@test(candidate("a", "a") == ("", true))
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_113_odd_count | jl | """Given a list of strings, where each string consists of only digits, return a list.
Each element i of the output should be "the number of odd elements in the
string i of the input." where all the i's should be replaced by the number
of odd digits in the i'th string of the input.
>>> odd_count(['1234567'])
["the numbe... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_113_odd_count.py | verbatim | using Test
@testset begin
candidate = odd_count;
@test(candidate(["1234567"]) == ["the number of odd elements 4n the str4ng 4 of the 4nput."])
@test(candidate(["3", "11111111"]) == ["the number of odd elements 1n the str1ng 1 of the 1nput.", "the number of odd elements 8n the str8ng 8 of the 8nput."])
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_114_minSubArraySum | jl | """Given an array of integers nums, find the minimum sum of any non-empty sub-array
of nums.
Example
minSubArraySum([2, 3, 4, 1, 2, 4]) == 1
minSubArraySum([-1, -2, -3]) == -6"""
function minSubArraySum(nums::Vector{Int64})::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_114_minSubArraySum.py | verbatim | using Test
@testset begin
candidate = minSubArraySum;
@test(candidate([2, 3, 4, 1, 2, 4]) == 1)
@test(candidate([-1, -2, -3]) == -6)
@test(candidate([-1, -2, -3, 2, -10]) == -14)
@test(candidate([-9999999999999999]) == -9999999999999999)
@test(candidate([0, 10, 20, 1000000]) == 0)
@test(candidate([-1, -2, -3, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_115_max_fill | jl | """You are given a rectangular grid of wells. Each row represents a single well,
and each 1 in a row represents a single unit of water.
Each well has a corresponding bucket that can be used to extract water from it,
and all buckets have the same capacity.
Your task is to use the buckets to empty the wells.
Output the ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_115_max_fill.py | verbatim | using Test
@testset begin
candidate = max_fill;
@test(candidate([[0, 0, 1, 0], [0, 1, 0, 0], [1, 1, 1, 1]], 1) == 6)
@test(candidate([[0, 0, 1, 1], [0, 0, 0, 0], [1, 1, 1, 1], [0, 1, 1, 1]], 2) == 5)
@test(candidate([[0, 0, 0], [0, 0, 0]], 5) == 0)
@test(candidate([[1, 1, 1, 1], [1, 1, 1, 1]], 2) == 4)
@test(can... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_116_sort_array | jl | """In this Kata, you have to sort an array of non-negative integers according to
number of ones in their binary representation in ascending order.
For similar number of ones, sort based on decimal value.
It must be implemented like this:
>>> sort_array([1, 5, 2, 3, 4]) == [1, 2, 3, 4, 5]
>>> sort_array([-2, -3, -4, -5,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_116_sort_array.py | verbatim | using Test
@testset begin
candidate = sort_array;
@test(candidate([1, 5, 2, 3, 4]) == [1, 2, 4, 3, 5])
@test(candidate([-2, -3, -4, -5, -6]) == [-4, -2, -6, -5, -3])
@test(candidate([1, 0, 2, 3, 4]) == [0, 1, 2, 4, 3])
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([2, 5, 77, 4, 5, 3, 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_117_select_words | jl | """Given a string s and a natural number n, you have been tasked to implement
a function that returns a list of all words from string s that contain exactly
n consonants, in order these words appear in the string s.
If the string s is empty then the function should return an empty list.
Note: you may assume the input... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_117_select_words.py | verbatim | using Test
@testset begin
candidate = select_words;
@test(candidate("Mary had a little lamb", 4) == ["little"])
@test(candidate("Mary had a little lamb", 3) == ["Mary", "lamb"])
@test(candidate("simple white space", 2) == Vector{String}([]))
@test(candidate("Hello world", 4) == ["world"])
@test(candidate("Uncle ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_118_get_closest_vowel | jl | """You are given a word. Your task is to find the closest vowel that stands between
two consonants from the right side of the word (case sensitive).
Vowels in the beginning and ending doesn't count. Return empty string if you didn't
find any vowel met the above condition.
You may assume that the given string contains... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_118_get_closest_vowel.py | verbatim | using Test
@testset begin
candidate = get_closest_vowel;
@test(candidate("yogurt") == "u")
@test(candidate("full") == "u")
@test(candidate("easy") == "")
@test(candidate("eAsy") == "")
@test(candidate("ali") == "")
@test(candidate("bad") == "a")
@test(candidate("most") == "o")
@test(candidate("ab") == "")
@t... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_119_match_parens | jl | """You are given a list of two strings, both strings consist of open
parentheses '(' or close parentheses ')' only.
Your job is to check if it is possible to concatenate the two strings in
some order, that the resulting string will be good.
A string S is considered to be good if and only if all parentheses in S
are bal... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_119_match_parens.py | verbatim | using Test
@testset begin
candidate = match_parens;
@test(candidate(["()(", ")"]) == "Yes")
@test(candidate([")", ")"]) == "No")
@test(candidate(["(()(())", "())())"]) == "No")
@test(candidate([")())", "(()()("]) == "Yes")
@test(candidate(["(())))", "(()())(("]) == "Yes")
@test(candidate(["()", "())"]) == "No")... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_11_string_xor | jl | """ Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
>>> string_xor('010', '110')
'100'"""
function string_xor(a::String, b::String)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_11_string_xor.py | verbatim | using Test
@testset begin
candidate = string_xor;
@test(candidate("111000", "101010") == "010010")
@test(candidate("1", "1") == "0")
@test(candidate("0101", "0000") == "0101")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_120_maximum | jl | """Given an array arr of integers and a positive integer k, return a sorted list
of length k with the maximum k numbers in arr.
Example 1:
Input: arr = [-3, -4, 5], k = 3
Output: [-4, -3, 5]
Example 2:
Input: arr = [4, -4, 4], k = 2
Output: [4, 4]
Example 3:
Input: arr = [-3, 2, 1, 2, -1, -2, 1], k... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_120_maximum.py | verbatim | using Test
@testset begin
candidate = maximum;
@test(candidate([-3, -4, 5], 3) == [-4, -3, 5])
@test(candidate([4, -4, 4], 2) == [4, 4])
@test(candidate([-3, 2, 1, 2, -1, -2, 1], 1) == [2])
@test(candidate([123, -123, 20, 0, 1, 2, -3], 3) == [2, 20, 123])
@test(candidate([-123, 20, 0, 1, 2, -3], 4) == [0, 1, 2, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_121_solution | jl | """Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.
Examples
solution([5, 8, 7, 1]) ==> 12
solution([3, 3, 3, 3, 3]) ==> 9
solution([30, 13, 24, 321]) ==>0"""
function solution(lst::Vector{Int64})::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_121_solution.py | verbatim | using Test
@testset begin
candidate = solution;
@test(candidate([5, 8, 7, 1]) == 12)
@test(candidate([3, 3, 3, 3, 3]) == 9)
@test(candidate([30, 13, 24, 321]) == 0)
@test(candidate([5, 9]) == 5)
@test(candidate([2, 4, 8]) == 0)
@test(candidate([30, 13, 23, 32]) == 23)
@test(candidate([3, 13, 2, 9]) == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_122_add_elements | jl | """Given a non-empty array of integers arr and an integer k, return
the sum of the elements with at most two digits from the first k elements of arr.
Example:
Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4
Output: 24 # sum of 21 + 3
Constraints:
1. 1 <= len(arr) <= 100
2. 1 <= k <= len(arr)"""
function a... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_122_add_elements.py | verbatim | using Test
@testset begin
candidate = add_elements;
@test(candidate([1, -2, -3, 41, 57, 76, 87, 88, 99], 3) == -4)
@test(candidate([111, 121, 3, 4000, 5, 6], 2) == 0)
@test(candidate([11, 21, 3, 90, 5, 6, 7, 8, 9], 4) == 125)
@test(candidate([111, 21, 3, 4000, 5, 6, 7, 8, 9], 4) == 24)
@test(candidate([1], 1) ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_123_get_odd_collatz | jl | """Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.
The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined
as follows: start with any positive integer n. Then each term is obtained from the
previous term as follows: if the previous term is e... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_123_get_odd_collatz.py | verbatim | using Test
@testset begin
candidate = get_odd_collatz;
@test(candidate(14) == [1, 5, 7, 11, 13, 17])
@test(candidate(5) == [1, 5])
@test(candidate(12) == [1, 3, 5])
@test(candidate(1) == [1])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_124_valid_date | jl | """You have to write a function which validates a given date string and
returns True if the date is valid otherwise False.
The date is valid if all of the following rules are satisfied:
1. The date string is not empty.
2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the n... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_124_valid_date.py | verbatim | using Test
@testset begin
candidate = valid_date;
@test(candidate("03-11-2000") == true)
@test(candidate("15-01-2012") == false)
@test(candidate("04-0-2040") == false)
@test(candidate("06-04-2020") == true)
@test(candidate("01-01-2007") == true)
@test(candidate("03-32-2011") == false)
@test(candidate("") == fa... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_125_split_words | jl | """Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you
should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the
alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25
Examples
split_words("Hello wor... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_125_split_words.py | verbatim | using Test
@testset begin
candidate = split_words;
@test(candidate("Hello world!") == ["Hello", "world!"])
@test(candidate("Hello,world!") == ["Hello", "world!"])
@test(candidate("Hello world,!") == ["Hello", "world,!"])
@test(candidate("Hello,Hello,world !") == ["Hello,Hello,world", "!"])
@test(candidate("abcde... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_126_is_sorted | jl | """Given a list of numbers, return whether or not they are sorted
in ascending order. If list has more than 1 duplicate of the same
number, return False. Assume no negative numbers and only integers.
Examples
is_sorted([5]) ➞ True
is_sorted([1, 2, 3, 4, 5]) ➞ True
is_sorted([1, 3, 2, 4, 5]) ➞ False
is_sorted([1, 2, 3, ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_126_is_sorted.py | verbatim | using Test
@testset begin
candidate = is_sorted;
@test(candidate([5]) == true)
@test(candidate([1, 2, 3, 4, 5]) == true)
@test(candidate([1, 3, 2, 4, 5]) == false)
@test(candidate([1, 2, 3, 4, 5, 6]) == true)
@test(candidate([1, 2, 3, 4, 5, 6, 7]) == true)
@test(candidate([1, 3, 2, 4, 5, 6, 7]) == false)
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_127_intersection | jl | """You are given two intervals,
where each interval is a pair of integers. For example, interval = (start, end) = (1, 2).
The given intervals are closed which means that the interval (start, end)
includes both start and end.
For each given interval, it is assumed that its start is less or equal its end.
Your task is to... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_127_intersection.py | verbatim | using Test
@testset begin
candidate = intersection;
@test(candidate((1, 2), (2, 3)) == "NO")
@test(candidate((-1, 1), (0, 4)) == "NO")
@test(candidate((-3, -1), (-5, 5)) == "YES")
@test(candidate((-2, 2), (-4, 0)) == "YES")
@test(candidate((-11, 2), (-1, -1)) == "NO")
@test(candidate((1, 2), (3, 5)) == "NO")
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_128_prod_signs | jl | """You are given an array arr of integers and you need to return
sum of magnitudes of integers multiplied by product of all signs
of each number in the array, represented by 1, -1 or 0.
Note: return None for empty arr.
Example:
>>> prod_signs([1, 2, 2, -4]) == -9
>>> prod_signs([0, 1]) == 0
>>> prod_signs([]) == None""... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_128_prod_signs.py | verbatim | using Test
@testset begin
candidate = prod_signs;
@test(candidate([1, 2, 2, -4]) == -9)
@test(candidate([0, 1]) == 0)
@test(candidate([1, 1, 1, 2, 3, -1, 1]) == -10)
@test(candidate(Vector{Int64}([])) == nothing)
@test(candidate([2, 4, 1, 2, -1, -1, 9]) == 20)
@test(candidate([-1, 1, -1, 1]) == 4)
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_129_minPath | jl | """Given a grid with N rows and N columns (N >= 2) and a positive integer k,
each cell of the grid contains a value. Every integer in the range [1, N * N]
inclusive appears exactly once on the cells of the grid.
You have to find the minimum path of length k in the grid. You can start
from any cell, and in each step yo... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_129_minPath.py | verbatim | using Test
@testset begin
candidate = minPath;
@test(candidate([[1, 2, 3], [4, 5, 6], [7, 8, 9]], 3) == [1, 2, 1])
@test(candidate([[5, 9, 3], [4, 1, 6], [7, 8, 2]], 1) == [1])
@test(candidate([[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16]], 4) == [1, 2, 1, 2])
@test(candidate([[6, 4, 13, 10], [5,... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_12_longest | jl | """ Out of list of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return None in case the input list is empty.
>>> longest([])
>>> longest(['a', 'b', 'c'])
'a'
>>> longest(['a', 'bb', 'ccc'])
'ccc'"""
function longest(strings::Vector{String})::Union{String, Nothing... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_12_longest.py | verbatim | using Test
@testset begin
candidate = longest;
@test(candidate(Vector{String}([])) == nothing)
@test(candidate(["x", "y", "z"]) == "x")
@test(candidate(["x", "yyy", "zzzz", "www", "kkkk", "abc"]) == "zzzz")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_130_tri | jl | """Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in
the last couple centuries. However, what people don't know is Tribonacci sequence.
Tribonacci sequence is defined by the recurrence:
tri(1) = 3
tri(n) = 1 + n / 2, if n is even.
tri(n) = tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_130_tri.py | verbatim | using Test
@testset begin
candidate = tri;
@test(candidate(3) == [1, 3, 2, 8])
@test(candidate(4) == [1, 3, 2, 8, 3])
@test(candidate(5) == [1, 3, 2, 8, 3, 15])
@test(candidate(6) == [1, 3, 2, 8, 3, 15, 4])
@test(candidate(7) == [1, 3, 2, 8, 3, 15, 4, 24])
@test(candidate(8) == [1, 3, 2, 8, 3, 15, 4, 24, 5])
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_131_digits | jl | """Given a positive integer n, return the product of the odd digits.
Return 0 if all digits are even.
For example:
digits(1) == 1
digits(4) == 0
digits(235) == 15"""
function digits(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_131_digits.py | verbatim | using Test
@testset begin
candidate = digits;
@test(candidate(5) == 5)
@test(candidate(54) == 5)
@test(candidate(120) == 1)
@test(candidate(5014) == 5)
@test(candidate(98765) == 315)
@test(candidate(5576543) == 2625)
@test(candidate(2468) == 0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_132_is_nested | jl | """Create a function that takes a string as input which contains only square brackets.
The function should return True if and only if there is a valid subsequence of brackets
where at least one bracket in the subsequence is nested.
is_nested('[[]]') ➞ True
is_nested('[]]]]]]][[[[[]') ➞ False
is_nested('[][]') ➞ False
... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_132_is_nested.py | verbatim | using Test
@testset begin
candidate = is_nested;
@test(candidate("[[]]") == true)
@test(candidate("[]]]]]]][[[[[]") == false)
@test(candidate("[][]") == false)
@test(candidate("[]") == false)
@test(candidate("[[[[]]]]") == true)
@test(candidate("[]]]]]]]]]]") == false)
@test(candidate("[][][[]]") == true)
@te... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_133_sum_squares | jl | """You are given a list of numbers.
You need to return the sum of squared numbers in the given list,
round each element in the list to the upper int(Ceiling) first.
Examples:
For lst = [1,2,3] the output should be 14
For lst = [1,4,9] the output should be 98
For lst = [1,3,5,7] the output should be 84
For lst = [1.4,4.... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_133_sum_squares.py | verbatim | using Test
@testset begin
candidate = sum_squares;
@test(candidate([1.0, 2.0, 3.0]) == 14)
@test(candidate([1.0, 2.0, 3.0]) == 14)
@test(candidate([1.0, 3.0, 5.0, 7.0]) == 84)
@test(candidate([1.4, 4.2, 0.0]) == 29)
@test(candidate([-2.4, 1.0, 1.0]) == 6)
@test(candidate([100.0, 1.0, 15.0, 2.0]) == 10230)
@tes... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_134_check_if_last_char_is_a_letter | jl | """Create a function that returns True if the last character
of a given string is an alphabetical character and is not
a part of a word, and False otherwise.
Note: "word" is a group of characters separated by space.
Examples:
check_if_last_char_is_a_letter("apple pie") ➞ False
check_if_last_char_is_a_letter("apple pi e... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_134_check_if_last_char_is_a_letter.py | verbatim | using Test
@testset begin
candidate = check_if_last_char_is_a_letter;
@test(candidate("apple") == false)
@test(candidate("apple pi e") == true)
@test(candidate("eeeee") == false)
@test(candidate("A") == true)
@test(candidate("Pumpkin pie ") == false)
@test(candidate("Pumpkin pie 1") == false)
@test(candidate("... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_135_can_arrange | jl | """Create a function which returns the largest index of an element which
is not greater than or equal to the element immediately preceding it. If
no such element exists then return -1. The given array will not contain
duplicate values.
Examples:
can_arrange([1,2,4,3,5]) = 3
can_arrange([1,2,3]) = -1"""
function can_arr... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_135_can_arrange.py | verbatim | using Test
@testset begin
candidate = can_arrange;
@test(candidate([1, 2, 4, 3, 5]) == 3)
@test(candidate([1, 2, 4, 5]) == -1)
@test(candidate([1, 4, 2, 5, 6, 7, 8, 9, 10]) == 2)
@test(candidate([4, 8, 5, 7, 3]) == 4)
@test(candidate(Vector{Int64}([])) == -1)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_136_largest_smallest_integers | jl | """Create a function that returns a tuple (a, b), where 'a' is
the largest of negative integers, and 'b' is the smallest
of positive integers in a list.
If there is no negative or positive integers, return them as None.
Examples:
largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1)
largest_smallest_integers([]) =... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_136_largest_smallest_integers.py | verbatim | using Test
@testset begin
candidate = largest_smallest_integers;
@test(candidate([2, 4, 1, 3, 5, 7]) == (nothing, 1))
@test(candidate([2, 4, 1, 3, 5, 7, 0]) == (nothing, 1))
@test(candidate([1, 3, 2, 4, 5, 6, -2]) == (-2, 1))
@test(candidate([4, 5, 3, 6, 2, 7, -7]) == (-7, 2))
@test(candidate([7, 3, 8, 4, 9, 2, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_138_is_equal_to_sum_even | jl | """Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers
Example
is_equal_to_sum_even(4) == False
is_equal_to_sum_even(6) == False
is_equal_to_sum_even(8) == True"""
function is_equal_to_sum_even(n::Int64)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_138_is_equal_to_sum_even.py | verbatim | using Test
@testset begin
candidate = is_equal_to_sum_even;
@test(candidate(4) == false)
@test(candidate(6) == false)
@test(candidate(8) == true)
@test(candidate(10) == true)
@test(candidate(11) == false)
@test(candidate(12) == true)
@test(candidate(13) == false)
@test(candidate(16) == true)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_139_special_factorial | jl | """The Brazilian factorial is defined as:
brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!
where n > 0
For example:
>>> special_factorial(4)
288
The function will receive an integer as input and should return the special
factorial of this integer."""
function special_factorial(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_139_special_factorial.py | verbatim | using Test
@testset begin
candidate = special_factorial;
@test(candidate(4) == 288)
@test(candidate(5) == 34560)
@test(candidate(7) == 125411328000)
@test(candidate(1) == 1)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_13_greatest_common_divisor | jl | """ Return a greatest common divisor of two integers a and b
>>> greatest_common_divisor(3, 5)
1
>>> greatest_common_divisor(25, 15)
5"""
function greatest_common_divisor(a::Int64, b::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_13_greatest_common_divisor.py | verbatim | using Test
@testset begin
candidate = greatest_common_divisor;
@test(candidate(3, 7) == 1)
@test(candidate(10, 15) == 5)
@test(candidate(49, 14) == 7)
@test(candidate(144, 60) == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_140_fix_spaces | jl | """Given a string text, replace all spaces in it with underscores,
and if a string has more than 2 consecutive spaces,
then replace all consecutive spaces with -
fix_spaces("Example") == "Example"
fix_spaces("Example 1") == "Example_1"
fix_spaces(" Example 2") == "_Example_2"
fix_spaces(" Example 3") == "_Example-... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_140_fix_spaces.py | verbatim | using Test
@testset begin
candidate = fix_spaces;
@test(candidate("Example") == "Example")
@test(candidate("Mudasir Hanif ") == "Mudasir_Hanif_")
@test(candidate("Yellow Yellow Dirty Fellow") == "Yellow_Yellow__Dirty__Fellow")
@test(candidate("Exa mple") == "Exa-mple")
@test(candidate(" Exa 1 2 2 mple") ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_141_file_name_check | jl | """Create a function which takes a string representing a file's name, and returns
'Yes' if the the file's name is valid, and returns 'No' otherwise.
A file's name is considered to be valid if and only if all the following conditions
are met:
- There should not be more than three digits ('0'-'9') in the file's name.
- ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_141_file_name_check.py | verbatim | using Test
@testset begin
candidate = file_name_check;
@test(candidate("example.txt") == "Yes")
@test(candidate("1example.dll") == "No")
@test(candidate("s1sdf3.asd") == "No")
@test(candidate("K.dll") == "Yes")
@test(candidate("MY16FILE3.exe") == "Yes")
@test(candidate("His12FILE94.exe") == "No")
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_142_sum_squares | jl | """"
This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a
multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not
change the entries in the list whose indexes are not ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_142_sum_squares.py | verbatim | using Test
@testset begin
candidate = sum_squares;
@test(candidate([1, 2, 3]) == 6)
@test(candidate([1, 4, 9]) == 14)
@test(candidate(Vector{Int64}([])) == 0)
@test(candidate([1, 1, 1, 1, 1, 1, 1, 1, 1]) == 9)
@test(candidate([-1, -1, -1, -1, -1, -1, -1, -1, -1]) == -3)
@test(candidate([0]) == 0)
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_143_words_in_sentence | jl | """You are given a string representing a sentence,
the sentence contains some words separated by a space,
and you have to return a string that contains the words from the original sentence,
whose lengths are prime numbers,
the order of the words in the new string should be the same as the original one.
Example 1:
I... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_143_words_in_sentence.py | verbatim | using Test
@testset begin
candidate = words_in_sentence;
@test(candidate("This is a test") == "is")
@test(candidate("lets go for swimming") == "go for")
@test(candidate("there is no place available here") == "there is no place")
@test(candidate("Hi I am Hussein") == "Hi am Hussein")
@test(candidate("go for it") ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_144_simplify | jl | """Your task is to implement a function that will simplify the expression
x * n. The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the following format,
<numerator>/<denominator> where both numerator and denominator are po... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_144_simplify.py | verbatim | using Test
@testset begin
candidate = simplify;
@test(candidate("1/5", "5/1") == true)
@test(candidate("1/6", "2/1") == false)
@test(candidate("5/1", "3/1") == true)
@test(candidate("7/10", "10/2") == false)
@test(candidate("2/10", "50/10") == true)
@test(candidate("7/2", "4/2") == true)
@test(candidate("11/6"... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_145_order_by_points | jl | """Write a function which sorts the given list of integers
in ascending order according to the sum of their digits.
Note: if there are several items with similar sum of their digits,
order them based on their index in original list.
For example:
>>> order_by_points([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11]
>>> or... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_145_order_by_points.py | verbatim | using Test
@testset begin
candidate = order_by_points;
@test(candidate([1, 11, -1, -11, -12]) == [-1, -11, 1, -12, 11])
@test(candidate([1234, 423, 463, 145, 2, 423, 423, 53, 6, 37, 3457, 3, 56, 0, 46]) == [0, 2, 3, 6, 53, 423, 423, 423, 1234, 145, 37, 46, 56, 463, 3457])
@test(candidate(Vector{Int64}([])) == Vect... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_146_specialFilter | jl | """Write a function that takes an array of numbers as input and returns
the number of elements in the array that are greater than 10 and both
first and last digits of a number are odd (1, 3, 5, 7, 9).
For example:
specialFilter([15, -73, 14, -15]) => 1
specialFilter([33, -2, -3, 45, 21, 109]) => 2"""
function specia... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_146_specialFilter.py | verbatim | using Test
@testset begin
candidate = specialFilter;
@test(candidate([5, -2, 1, -5]) == 0)
@test(candidate([15, -73, 14, -15]) == 1)
@test(candidate([33, -2, -3, 45, 21, 109]) == 2)
@test(candidate([43, -12, 93, 125, 121, 109]) == 4)
@test(candidate([71, -2, -33, 75, 21, 19]) == 3)
@test(candidate([1]) == 0)
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_147_get_max_triples | jl | """ You are given a positive integer n. You have to create an integer array a of length n.
For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,
and a[i] + a[j] + a[k] is a multiple of 3.
Example :
Input: n = 5
Output: 1
Explanation:... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_147_get_max_triples.py | verbatim | using Test
@testset begin
candidate = get_max_triples;
@test(candidate(5) == 1)
@test(candidate(6) == 4)
@test(candidate(10) == 36)
@test(candidate(100) == 53361)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_149_sorted_list_sum | jl | """Write a function that accepts a list of strings as a parameter,
deletes the strings that have odd lengths from it,
and returns the resulted list with a sorted order,
The list is always a list of strings and never an array of numbers,
and it may contain duplicates.
The order of the list should be ascending by length ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_149_sorted_list_sum.py | verbatim | using Test
@testset begin
candidate = sorted_list_sum;
@test(candidate(["aa", "a", "aaa"]) == ["aa"])
@test(candidate(["school", "AI", "asdf", "b"]) == ["AI", "asdf", "school"])
@test(candidate(["d", "b", "c", "a"]) == Vector{String}([]))
@test(candidate(["d", "dcba", "abcd", "a"]) == ["abcd", "dcba"])
@test(can... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_14_all_prefixes | jl | """ Return list of all prefixes from shortest to longest of the input string
>>> all_prefixes('abc')
['a', 'ab', 'abc']"""
function all_prefixes(string::String)::Vector{String}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_14_all_prefixes.py | verbatim | using Test
@testset begin
candidate = all_prefixes;
@test(candidate("") == Vector{String}([]))
@test(candidate("asdfgh") == ["a", "as", "asd", "asdf", "asdfg", "asdfgh"])
@test(candidate("WWW") == ["W", "WW", "WWW"])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_150_x_or_y | jl | """A simple program which should return the value of x if n is
a prime number and should return the value of y otherwise.
Examples:
for x_or_y(7, 34, 12) == 34
for x_or_y(15, 8, 5) == 5"""
function x_or_y(n::Int64, x::Int64, y::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_150_x_or_y.py | verbatim | using Test
@testset begin
candidate = x_or_y;
@test(candidate(7, 34, 12) == 34)
@test(candidate(15, 8, 5) == 5)
@test(candidate(3, 33, 5212) == 33)
@test(candidate(1259, 3, 52) == 3)
@test(candidate(7919, -1, 12) == -1)
@test(candidate(3609, 1245, 583) == 583)
@test(candidate(91, 56, 129) == 129)
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_151_double_the_difference | jl | """Given a list of numbers, return the sum of squares of the numbers
in the list that are odd. Ignore numbers that are negative or not integers.
double_the_difference([1, 3, 2, 0]) == 1 + 9 + 0 + 0 = 10
double_the_difference([-1, -2, 0]) == 0
double_the_difference([9, -2]) == 81
double_the_difference([0]) == 0
If the... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_151_double_the_difference.py | verbatim | using Test
@testset begin
candidate = double_the_difference;
@test(candidate(Vector{Float64}([])) == 0)
@test(candidate([5.0, 4.0]) == 25)
@test(candidate([0.1, 0.2, 0.3]) == 0)
@test(candidate([-10.0, -20.0, -30.0]) == 0)
@test(candidate([-1.0, -2.0, 8.0]) == 0)
@test(candidate([0.2, 3.0, 5.0]) == 34)
@test(c... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_152_compare | jl | """I think we all remember that feeling when the result of some long-awaited
event is finally known. The feelings and thoughts you have at that moment are
definitely worth noting down and comparing.
Your task is to determine if a person correctly guessed the results of a number of matches.
You are given two arrays of s... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_152_compare.py | verbatim | using Test
@testset begin
candidate = compare;
@test(candidate([1, 2, 3, 4, 5, 1], [1, 2, 3, 4, 2, -2]) == [0, 0, 0, 0, 3, 3])
@test(candidate([0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0]) == [0, 0, 0, 0, 0, 0])
@test(candidate([1, 2, 3], [-1, -2, -3]) == [2, 4, 6])
@test(candidate([1, 2, 3, 5], [-1, 2, 3, 4]) == [2, 0... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_153_Strongest_Extension | jl | """You will be given the name of a class (a string) and a list of extensions.
The extensions are to be used to load additional classes to the class. The
strength of the extension is as follows: Let CAP be the number of the uppercase
letters in the extension's name, and let SM be the number of lowercase letters
in the ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_153_Strongest_Extension.py | verbatim | using Test
@testset begin
candidate = Strongest_Extension;
@test(candidate("Watashi", ["tEN", "niNE", "eIGHt8OKe"]) == "Watashi.eIGHt8OKe")
@test(candidate("Boku123", ["nani", "NazeDa", "YEs.WeCaNe", "32145tggg"]) == "Boku123.YEs.WeCaNe")
@test(candidate("__YESIMHERE", ["t", "eMptY", "nothing", "zeR00", "NuLl__", ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_154_cycpattern_check | jl | """You are given 2 words. You need to return True if the second word or any of its rotations is a substring in the first word
cycpattern_check("abcd","abd") => False
cycpattern_check("hello","ell") => True
cycpattern_check("whassup","psus") => False
cycpattern_check("abab","baa") => True
cycpattern_check("efef","eeff")... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_154_cycpattern_check.py | verbatim | using Test
@testset begin
candidate = cycpattern_check;
@test(candidate("xyzw", "xyw") == false)
@test(candidate("yello", "ell") == true)
@test(candidate("whattup", "ptut") == false)
@test(candidate("efef", "fee") == true)
@test(candidate("abab", "aabb") == false)
@test(candidate("winemtt", "tinem") == true)
en... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_155_even_odd_count | jl | """Given an integer. return a tuple that has the number of even and odd digits respectively.
Example:
even_odd_count(-12) ==> (1, 1)
even_odd_count(123) ==> (1, 2)"""
function even_odd_count(num::Int64)::Tuple{Int64, Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_155_even_odd_count.py | verbatim | using Test
@testset begin
candidate = even_odd_count;
@test(candidate(7) == (0, 1))
@test(candidate(-78) == (1, 1))
@test(candidate(3452) == (2, 2))
@test(candidate(346211) == (3, 3))
@test(candidate(-345821) == (3, 3))
@test(candidate(-2) == (1, 0))
@test(candidate(-45347) == (2, 3))
@test(candidate(0) == (1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_156_int_to_mini_roman | jl | """Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> int_to_mini_roman(19) == 'xix'
>>> int_to_mini_roman(152) == 'clii'
>>> int_to_mini_roman(426) == 'cdxxvi'"""
function int_to_mini_roman(number::Int64)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_156_int_to_mini_roman.py | verbatim | using Test
@testset begin
candidate = int_to_mini_roman;
@test(candidate(19) == "xix")
@test(candidate(152) == "clii")
@test(candidate(251) == "ccli")
@test(candidate(426) == "cdxxvi")
@test(candidate(500) == "d")
@test(candidate(1) == "i")
@test(candidate(4) == "iv")
@test(candidate(43) == "xliii")
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_157_right_angle_triangle | jl | """Given the lengths of the three sides of a triangle. Return True if the three
sides form a right-angled triangle, False otherwise.
A right-angled triangle is a triangle in which one angle is right angle or
90 degree.
Example:
right_angle_triangle(3, 4, 5) == True
right_angle_triangle(1, 2, 3) == False"""
function ri... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_157_right_angle_triangle.py | verbatim | using Test
@testset begin
candidate = right_angle_triangle;
@test(candidate(3, 4, 5) == true)
@test(candidate(1, 2, 3) == false)
@test(candidate(10, 6, 8) == true)
@test(candidate(2, 2, 2) == false)
@test(candidate(7, 24, 25) == true)
@test(candidate(10, 5, 7) == false)
@test(candidate(5, 12, 13) == true)
@te... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_158_find_max | jl | """Write a function that accepts a list of strings.
The list contains different words. Return the word with maximum number
of unique characters. If multiple strings have maximum number of unique
characters, return the one which comes first in lexicographical order.
find_max(["name", "of", "string"]) == "string"
find_ma... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_158_find_max.py | verbatim | using Test
@testset begin
candidate = find_max;
@test(candidate(["name", "of", "string"]) == "string")
@test(candidate(["name", "enam", "game"]) == "enam")
@test(candidate(["aaaaaaa", "bb", "cc"]) == "aaaaaaa")
@test(candidate(["abc", "cba"]) == "abc")
@test(candidate(["play", "this", "game", "of", "footbott"]) ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_159_eat | jl | """You're a hungry rabbit, and you already have eaten a certain number of carrots,
but now you need to eat more carrots to complete the day's meals.
you should return an array of [ total number of eaten carrots after your meals,
the number of carrots left after your meals ]
if there are ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_159_eat.py | verbatim | using Test
@testset begin
candidate = eat;
@test(candidate(5, 6, 10) == [11, 4])
@test(candidate(4, 8, 9) == [12, 1])
@test(candidate(1, 10, 10) == [11, 0])
@test(candidate(2, 11, 5) == [7, 0])
@test(candidate(4, 5, 7) == [9, 2])
@test(candidate(4, 5, 1) == [5, 0])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_15_string_sequence | jl | """ Return a string containing space-delimited numbers starting from 0 upto n inclusive.
>>> string_sequence(0)
'0'
>>> string_sequence(5)
'0 1 2 3 4 5'"""
function string_sequence(n::Int64)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_15_string_sequence.py | verbatim | using Test
@testset begin
candidate = string_sequence;
@test(candidate(0) == "0")
@test(candidate(3) == "0 1 2 3")
@test(candidate(10) == "0 1 2 3 4 5 6 7 8 9 10")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_160_do_algebra | jl | """Given two lists operator, and operand. The first list has basic algebra operations, and
the second list is a list of integers. Use the two given lists to build the algebric
expression and return the evaluation of this expression.
The basic algebra operations:
Addition ( + )
Subtraction ( - )
Multiplication ( * )... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_160_do_algebra.py | verbatim | using Test
@testset begin
candidate = do_algebra;
@test(candidate(["**", "*", "+"], [2, 3, 4, 5]) == 37)
@test(candidate(["+", "*", "-"], [2, 3, 4, 5]) == 9)
@test(candidate(["//", "*"], [7, 3, 4]) == 8)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_161_solve | jl | """You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
solve("1234") = "4321"
solve("ab") = "AB"
solve("#a@C") = "#A@c""""
function ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_161_solve.py | verbatim | using Test
@testset begin
candidate = solve;
@test(candidate("AsDf") == "aSdF")
@test(candidate("1234") == "4321")
@test(candidate("ab") == "AB")
@test(candidate("#a@C") == "#A@c")
@test(candidate("#AsdfW^45") == "#aSDFw^45")
@test(candidate("#6@2") == "2@6#")
@test(candidate("#\$a^D") == "#\$A^d")
@test(cand... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_162_string_to_md5 | jl | """Given a string 'text', return its md5 hash equivalent string.
If 'text' is an empty string, return None.
>>> string_to_md5('Hello world') == '3e25960a79dbc69b674cd4ec67a72c62'"""
function string_to_md5(text::String)::Union{String, Nothing}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_162_string_to_md5.py | verbatim | using Test
@testset begin
candidate = string_to_md5;
@test(candidate("Hello world") == "3e25960a79dbc69b674cd4ec67a72c62")
@test(candidate("") == nothing)
@test(candidate("A B C") == "0ef78513b0cb8cef12743f5aeb35f888")
@test(candidate("password") == "5f4dcc3b5aa765d61d8327deb882cf99")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_163_generate_integers | jl | """Given two positive integers a and b, return the even digits between a
and b, in ascending order.
For example:
generate_integers(2, 8) => [2, 4, 6, 8]
generate_integers(8, 2) => [2, 4, 6, 8]
generate_integers(10, 14) => []"""
function generate_integers(a::Int64, b::Int64)::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_163_generate_integers.py | verbatim | using Test
@testset begin
candidate = generate_integers;
@test(candidate(2, 10) == [2, 4, 6, 8])
@test(candidate(10, 2) == [2, 4, 6, 8])
@test(candidate(132, 2) == [2, 4, 6, 8])
@test(candidate(17, 89) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_16_count_distinct_characters | jl | """ Given a string, find out how many distinct characters (regardless of case) does it consist of
>>> count_distinct_characters('xyzXYZ')
3
>>> count_distinct_characters('Jerry')
4"""
function count_distinct_characters(string::String)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_16_count_distinct_characters.py | verbatim | using Test
@testset begin
candidate = count_distinct_characters;
@test(candidate("") == 0)
@test(candidate("abcde") == 5)
@test(candidate("abcdecadeCADE") == 5)
@test(candidate("aaaaAAAAaaaa") == 1)
@test(candidate("Jerry jERRY JeRRRY") == 5)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_17_parse_music | jl | """ Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return list of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, lasts two beats
'.|' - quater note, lasts ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_17_parse_music.py | verbatim | using Test
@testset begin
candidate = parse_music;
@test(candidate("") == Vector{Int64}([]))
@test(candidate("o o o o") == [4, 4, 4, 4])
@test(candidate(".| .| .| .|") == [1, 1, 1, 1])
@test(candidate("o| o| .| .| o o o o") == [2, 2, 1, 1, 4, 4, 4, 4])
@test(candidate("o| .| o| .| o o| o o|") == [2, 1, 2, 1, 4, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_18_how_many_times | jl | """ Find how many times a given substring can be found in the original string. Count overlaping cases.
>>> how_many_times('', 'a')
0
>>> how_many_times('aaa', 'a')
3
>>> how_many_times('aaaa', 'aa')
3"""
function how_many_times(string::String, substring::String)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_18_how_many_times.py | verbatim | using Test
@testset begin
candidate = how_many_times;
@test(candidate("", "x") == 0)
@test(candidate("xyxyxyx", "x") == 4)
@test(candidate("cacacacac", "cac") == 4)
@test(candidate("john doe", "john") == 1)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_19_sort_numbers | jl | """ Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
>>> sort_numbers('three one five')
'one three five'"""
function sort_numbers(numbe... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_19_sort_numbers.py | verbatim | using Test
@testset begin
candidate = sort_numbers;
@test(candidate("") == "")
@test(candidate("three") == "three")
@test(candidate("three five nine") == "three five nine")
@test(candidate("five zero four seven nine eight") == "zero four five seven eight nine")
@test(candidate("six five four three two one zero")... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_1_separate_paren_groups | jl | """ Input to this function is a string containing multiple groups of nested parentheses. Your goal is to
separate those group into separate strings and return the list of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Ignore any spaces in the input string.
>>> ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_1_separate_paren_groups.py | verbatim | using Test
@testset begin
candidate = separate_paren_groups;
@test(candidate("(()()) ((())) () ((())()())") == ["(()())", "((()))", "()", "((())()())"])
@test(candidate("() (()) ((())) (((())))") == ["()", "(())", "((()))", "(((())))"])
@test(candidate("(()(())((())))") == ["(()(())((())))"])
@test(candidate("( )... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_20_find_closest_elements | jl | """ From a supplied list of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
>>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])
(2.0, 2.2)
>>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.0])
(2.0, 2.0)"""
fun... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_20_find_closest_elements.py | verbatim | using Test
@testset begin
candidate = find_closest_elements;
@test(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2]) == (3.9, 4.0))
@test(candidate([1.0, 2.0, 5.9, 4.0, 5.0]) == (5.0, 5.9))
@test(candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == (2.0, 2.2))
@test(candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.0]) == (2.0, 2.0))
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_21_rescale_to_unit | jl | """ Given list of numbers (of at least two elements), apply a linear transform to that list,
such that the smallest number will become 0 and the largest will become 1
>>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])
[0.0, 0.25, 0.5, 0.75, 1.0]"""
function rescale_to_unit(numbers::Vector{Float64})::Vector{Float64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_21_rescale_to_unit.py | verbatim | using Test
@testset begin
candidate = rescale_to_unit;
@test(candidate([2.0, 49.9]) == [0.0, 1.0])
@test(candidate([100.0, 49.9]) == [1.0, 0.0])
@test(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0])
@test(candidate([2.0, 1.0, 5.0, 3.0, 4.0]) == [0.25, 0.0, 1.0, 0.5, 0.75])
@test(candidate([1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_22_filter_integers | jl | """ Filter given list of any python values only for integers
>>> filter_integers(['a', 3.14, 5])
[5]
>>> filter_integers([1, 2, 3, 'abc', {}, []])
[1, 2, 3]"""
function filter_integers(values::Vector{Any})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_22_filter_integers.py | verbatim | using Test
@testset begin
candidate = filter_integers;
@test(candidate(Vector{Any}([])) == Vector{Int64}([]))
@test(candidate([4, Dict(), [], 23.2, 9, "adasd"]) == [4, 9])
@test(candidate([3, "c", 3, 3, "a", "b"]) == [3, 3, 3])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_23_strlen | jl | """ Return length of given string
>>> strlen('')
0
>>> strlen('abc')
3"""
function strlen(string::String)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_23_strlen.py | verbatim | using Test
@testset begin
candidate = strlen;
@test(candidate("") == 0)
@test(candidate("x") == 1)
@test(candidate("asdasnakj") == 9)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_24_largest_divisor | jl | """ For a given number n, find the largest number that divides n evenly, smaller than n
>>> largest_divisor(15)
5"""
function largest_divisor(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_24_largest_divisor.py | verbatim | using Test
@testset begin
candidate = largest_divisor;
@test(candidate(3) == 1)
@test(candidate(7) == 1)
@test(candidate(10) == 5)
@test(candidate(100) == 50)
@test(candidate(49) == 7)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_25_factorize | jl | """ Return list of prime factors of given integer in the order from smallest to largest.
Each of the factors should be listed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
>>> factorize(8)
[2, 2, 2]
>>> factorize(25)
[5, 5]
>>> f... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_25_factorize.py | verbatim | using Test
@testset begin
candidate = factorize;
@test(candidate(2) == [2])
@test(candidate(4) == [2, 2])
@test(candidate(8) == [2, 2, 2])
@test(candidate(57) == [3, 19])
@test(candidate(3249) == [3, 3, 19, 19])
@test(candidate(185193) == [3, 3, 3, 19, 19, 19])
@test(candidate(20577) == [3, 19, 19, 19])
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_26_remove_duplicates | jl | """ From a list of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
>>> remove_duplicates([1, 2, 3, 2, 4])
[1, 3, 4]"""
function remove_duplicates(numbers::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_26_remove_duplicates.py | verbatim | using Test
@testset begin
candidate = remove_duplicates;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([1, 2, 3, 4]) == [1, 2, 3, 4])
@test(candidate([1, 2, 3, 2, 4, 3, 5]) == [1, 4, 5])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_27_flip_case | jl | """ For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
>>> flip_case('Hello')
'hELLO'"""
function flip_case(string::String)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_27_flip_case.py | verbatim | using Test
@testset begin
candidate = flip_case;
@test(candidate("") == "")
@test(candidate("Hello!") == "hELLO!")
@test(candidate("These violent delights have violent ends") == "tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_28_concatenate | jl | """ Concatenate list of strings into a single string
>>> concatenate([])
''
>>> concatenate(['a', 'b', 'c'])
'abc'"""
function concatenate(strings::Vector{String})::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_28_concatenate.py | verbatim | using Test
@testset begin
candidate = concatenate;
@test(candidate(Vector{String}([])) == "")
@test(candidate(["x", "y", "z"]) == "xyz")
@test(candidate(["x", "y", "z", "w", "k"]) == "xyzwk")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_29_filter_by_prefix | jl | """ Filter an input list of strings only for ones that start with a given prefix.
>>> filter_by_prefix([], 'a')
[]
>>> filter_by_prefix(['abc', 'bcd', 'cde', 'array'], 'a')
['abc', 'array']"""
function filter_by_prefix(strings::Vector{String}, prefix::String)::Vector{String}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_29_filter_by_prefix.py | verbatim | using Test
@testset begin
candidate = filter_by_prefix;
@test(candidate(Vector{String}([]), "john") == Vector{String}([]))
@test(candidate(["xxx", "asd", "xxy", "john doe", "xxxAAA", "xxx"], "xxx") == ["xxx", "xxxAAA", "xxx"])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_2_truncate_number | jl | """ Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
>>> truncate_number(3.5)
0.5"""
function truncate_number(number::Float64)::Float64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_2_truncate_number.py | verbatim | using Test
@testset begin
candidate = truncate_number;
@test(candidate(3.5) == 0.5)
@test(candidate(1.25) == 0.25)
@test(candidate(123.0) == 0.0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_30_get_positive | jl | """Return only positive numbers in the list.
>>> get_positive([-1, 2, -4, 5, 6])
[2, 5, 6]
>>> get_positive([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])
[5, 3, 2, 3, 9, 123, 1]"""
function get_positive(l::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_30_get_positive.py | verbatim | using Test
@testset begin
candidate = get_positive;
@test(candidate([-1, -2, 4, 5, 6]) == [4, 5, 6])
@test(candidate([5, 3, -5, 2, 3, 3, 9, 0, 123, 1, -10]) == [5, 3, 2, 3, 3, 9, 123, 1])
@test(candidate([-1, -2]) == Vector{Int64}([]))
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_31_is_prime | jl | """Return true if a given number is prime, and false otherwise.
>>> is_prime(6)
False
>>> is_prime(101)
True
>>> is_prime(11)
True
>>> is_prime(13441)
True
>>> is_prime(61)
True
>>> is_prime(4)
False
>>> is_prime(1)
False"""
function is_prime(n::Int64)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_31_is_prime.py | verbatim | using Test
@testset begin
candidate = is_prime;
@test(candidate(6) == false)
@test(candidate(101) == true)
@test(candidate(11) == true)
@test(candidate(13441) == true)
@test(candidate(61) == true)
@test(candidate(4) == false)
@test(candidate(1) == false)
@test(candidate(5) == true)
@test(candidate(11) == tru... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_33_sort_third | jl | """This function takes a list l and returns a list l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
>>> sort_third([1, 2, 3])
[1, 2, 3]
>>> sort_third([5... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_33_sort_third.py | verbatim | using Test
@testset begin
candidate = sort_third;
@test(candidate([5, 6, 3, 4, 8, 9, 2]) == [2, 6, 3, 4, 8, 9, 5])
@test(candidate([5, 8, 3, 4, 6, 9, 2]) == [2, 8, 3, 4, 6, 9, 5])
@test(candidate([5, 6, 9, 4, 8, 3, 2]) == [2, 6, 9, 4, 8, 3, 5])
@test(candidate([5, 6, 3, 4, 8, 9, 2, 1]) == [2, 6, 3, 4, 8, 9, 5, 1]... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_34_unique | jl | """Return sorted unique elements in a list
>>> unique([5, 3, 5, 2, 3, 3, 9, 0, 123])
[0, 2, 3, 5, 9, 123]"""
function unique(l::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_34_unique.py | verbatim | using Test
@testset begin
candidate = unique;
@test(candidate([5, 3, 5, 2, 3, 3, 9, 0, 123]) == [0, 2, 3, 5, 9, 123])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_35_max_element | jl | """Return maximum element in the list.
>>> max_element([1, 2, 3])
3
>>> max_element([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10])
123"""
function max_element(l::Vector{Int64})::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_35_max_element.py | verbatim | using Test
@testset begin
candidate = max_element;
@test(candidate([1, 2, 3]) == 3)
@test(candidate([5, 3, -5, 2, -3, 3, 9, 0, 124, 1, -10]) == 124)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_36_fizz_buzz | jl | """Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
>>> fizz_buzz(50)
0
>>> fizz_buzz(78)
2
>>> fizz_buzz(79)
3"""
function fizz_buzz(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_36_fizz_buzz.py | verbatim | using Test
@testset begin
candidate = fizz_buzz;
@test(candidate(50) == 0)
@test(candidate(78) == 2)
@test(candidate(79) == 3)
@test(candidate(100) == 3)
@test(candidate(200) == 6)
@test(candidate(4000) == 192)
@test(candidate(10000) == 639)
@test(candidate(100000) == 8026)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_37_sort_even | jl | """This function takes a list l and returns a list l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
>>> sort_even([1, 2, 3])
[1, 2, 3]
>>> sort_even([5, 6, 3, 4])
[3, 6, 5, 4]"""
function sort_even(l::Vector{Int64... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_37_sort_even.py | verbatim | using Test
@testset begin
candidate = sort_even;
@test(candidate([1, 2, 3]) == [1, 2, 3])
@test(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [-10, 3, -5, 2, -3, 3, 5, 0, 9, 1, 123])
@test(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10]) == [-12, 8, 3, 4, 5, 2, 12, 11, 23, -10])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_39_prime_fib | jl | """prime_fib returns n-th number that is a Fibonacci number and it's also prime.
>>> prime_fib(1)
2
>>> prime_fib(2)
3
>>> prime_fib(3)
5
>>> prime_fib(4)
13
>>> prime_fib(5)
89"""
function prime_fib(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_39_prime_fib.py | verbatim | using Test
@testset begin
candidate = prime_fib;
@test(candidate(1) == 2)
@test(candidate(2) == 3)
@test(candidate(3) == 5)
@test(candidate(4) == 13)
@test(candidate(5) == 89)
@test(candidate(6) == 233)
@test(candidate(7) == 1597)
@test(candidate(8) == 28657)
@test(candidate(9) == 514229)
@test(candidate(10... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_3_below_zero | jl | """ You're given a list of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return True. Otherwise it should return False.
>>> below_zero([1, 2, 3])
False
>>> below_zero([... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_3_below_zero.py | verbatim | using Test
@testset begin
candidate = below_zero;
@test(candidate(Vector{Int64}([])) == false)
@test(candidate([1, 2, -3, 1, 2, -3]) == false)
@test(candidate([1, 2, -4, 5, 6]) == true)
@test(candidate([1, -1, 2, -2, 5, -5, 4, -4]) == false)
@test(candidate([1, -1, 2, -2, 5, -5, 4, -5]) == true)
@test(candidate... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_40_triples_sum_to_zero | jl | """triples_sum_to_zero takes a list of integers as an input.
it returns True if there are three distinct elements in the list that
sum to zero, and False otherwise.
>>> triples_sum_to_zero([1, 3, 5, 0])
False
>>> triples_sum_to_zero([1, 3, -2, 1])
True
>>> triples_sum_to_zero([1, 2, 3, 7])
False
>>> triples_sum_to_zero... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_40_triples_sum_to_zero.py | verbatim | using Test
@testset begin
candidate = triples_sum_to_zero;
@test(candidate([1, 3, 5, 0]) == false)
@test(candidate([1, 3, 5, -1]) == false)
@test(candidate([1, 3, -2, 1]) == true)
@test(candidate([1, 2, 3, 7]) == false)
@test(candidate([1, 2, 5, 7]) == false)
@test(candidate([2, 4, -5, 3, 9, 7]) == true)
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_41_car_race_collision | jl | """Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right; simultaneously, a different set of n cars
are driving right to left. The two sets of cars start out being very far from
each other. All cars move in the same speed. Two cars are said to collide
when a car that's m... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_41_car_race_collision.py | verbatim | using Test
@testset begin
candidate = car_race_collision;
@test(candidate(2) == 4)
@test(candidate(3) == 9)
@test(candidate(4) == 16)
@test(candidate(8) == 64)
@test(candidate(10) == 100)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_42_incr_list | jl | """Return list with elements incremented by 1.
>>> incr_list([1, 2, 3])
[2, 3, 4]
>>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])
[6, 4, 6, 3, 4, 4, 10, 1, 124]"""
function incr_list(l::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_42_incr_list.py | verbatim | using Test
@testset begin
candidate = incr_list;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([3, 2, 1]) == [4, 3, 2])
@test(candidate([5, 2, 5, 2, 3, 3, 9, 0, 123]) == [6, 3, 6, 3, 4, 4, 10, 1, 124])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_43_pairs_sum_to_zero | jl | """pairs_sum_to_zero takes a list of integers as an input.
it returns True if there are two distinct elements in the list that
sum to zero, and False otherwise.
>>> pairs_sum_to_zero([1, 3, 5, 0])
False
>>> pairs_sum_to_zero([1, 3, -2, 1])
False
>>> pairs_sum_to_zero([1, 2, 3, 7])
False
>>> pairs_sum_to_zero([2, 4, -5,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_43_pairs_sum_to_zero.py | verbatim | using Test
@testset begin
candidate = pairs_sum_to_zero;
@test(candidate([1, 3, 5, 0]) == false)
@test(candidate([1, 3, -2, 1]) == false)
@test(candidate([1, 2, 3, 7]) == false)
@test(candidate([2, 4, -5, 3, 5, 7]) == true)
@test(candidate([1]) == false)
@test(candidate([-3, 9, -1, 3, 2, 30]) == true)
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_44_change_base | jl | """Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
>>> change_base(8, 3)
'22'
>>> change_base(8, 2)
'1000'
>>> change_base(7, 2)
'111'"""
function change_base(x::Int64, base::Int64)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_44_change_base.py | verbatim | using Test
@testset begin
candidate = change_base;
@test(candidate(8, 3) == "22")
@test(candidate(9, 3) == "100")
@test(candidate(234, 2) == "11101010")
@test(candidate(16, 2) == "10000")
@test(candidate(8, 2) == "1000")
@test(candidate(7, 2) == "111")
@test(candidate(2, 3) == "2")
@test(candidate(3, 4) == "3... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_45_triangle_area | jl | """Given length of a side and high return area for a triangle.
>>> triangle_area(5, 3)
7.5"""
function triangle_area(a::Int64, h::Int64)::Float64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_45_triangle_area.py | verbatim | using Test
@testset begin
candidate = triangle_area;
@test(candidate(5, 3) == 7.5)
@test(candidate(2, 2) == 2.0)
@test(candidate(10, 8) == 40.0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_46_fib4 | jl | """The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use r... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_46_fib4.py | verbatim | using Test
@testset begin
candidate = fib4;
@test(candidate(5) == 4)
@test(candidate(8) == 28)
@test(candidate(10) == 104)
@test(candidate(12) == 386)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_47_median | jl | """Return median of elements in the list l.
>>> median([3, 1, 2, 4, 5])
3
>>> median([-10, 4, 6, 1000, 10, 20])
15.0"""
function median(l::Vector{Int64})::Float64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_47_median.py | verbatim | using Test
@testset begin
candidate = median;
@test(candidate([3, 1, 2, 4, 5]) == 3)
@test(candidate([-10, 4, 6, 1000, 10, 20]) == 8.0)
@test(candidate([5]) == 5)
@test(candidate([6, 5]) == 5.5)
@test(candidate([8, 1, 3, 9, 9, 2, 7]) == 7)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_48_is_palindrome | jl | """Checks if given string is a palindrome
>>> is_palindrome('')
True
>>> is_palindrome('aba')
True
>>> is_palindrome('aaaaa')
True
>>> is_palindrome('zbcd')
False"""
function is_palindrome(text::String)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_48_is_palindrome.py | verbatim | using Test
@testset begin
candidate = is_palindrome;
@test(candidate("") == true)
@test(candidate("aba") == true)
@test(candidate("aaaaa") == true)
@test(candidate("zbcd") == false)
@test(candidate("xywyx") == true)
@test(candidate("xywyz") == false)
@test(candidate("xywzx") == false)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_49_modp | jl | """Return 2^n modulo p (be aware of numerics).
>>> modp(3, 5)
3
>>> modp(1101, 101)
2
>>> modp(0, 101)
1
>>> modp(3, 11)
8
>>> modp(100, 101)
1"""
function modp(n::Int64, p::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_49_modp.py | verbatim | using Test
@testset begin
candidate = modp;
@test(candidate(3, 5) == 3)
@test(candidate(1101, 101) == 2)
@test(candidate(0, 101) == 1)
@test(candidate(3, 11) == 8)
@test(candidate(100, 101) == 1)
@test(candidate(30, 5) == 4)
@test(candidate(31, 5) == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_4_mean_absolute_deviation | jl | """ For a given list of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
>>> mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])
1.0"""
function ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_4_mean_absolute_deviation.py | verbatim | using Test
@testset begin
candidate = mean_absolute_deviation;
@test(candidate([1.0, 2.0]) == 0.5)
@test(candidate([1.0, 2.0, 3.0, 4.0]) == 1.0)
@test(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == 1.2)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.