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_51_remove_vowels | jl | """remove_vowels is a function that takes string and returns string without vowels.
>>> remove_vowels('')
''
>>> remove_vowels('abcdef')
'bcdf'
>>> remove_vowels('aaaaa')
''
>>> remove_vowels('aaBAA')
'B'
>>> remove_vowels('zbcd')
'zbcd'"""
function remove_vowels(text::String)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_51_remove_vowels.py | verbatim | using Test
@testset begin
candidate = remove_vowels;
@test(candidate("") == "")
@test(candidate("abcdef
ghijklm") == "bcdf
ghjklm")
@test(candidate("fedcba") == "fdcb")
@test(candidate("eeeee") == "")
@test(candidate("acBAA") == "cB")
@test(candidate("EcBOO") == "cB")
@test(candidate("ybcd") == "ybcd")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_52_below_threshold | jl | """Return True if all numbers in the list l are below threshold t.
>>> below_threshold([1, 2, 4, 10], 100)
True
>>> below_threshold([1, 20, 4, 10], 5)
False"""
function below_threshold(l::Vector{Int64}, t::Int64)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_52_below_threshold.py | verbatim | using Test
@testset begin
candidate = below_threshold;
@test(candidate([1, 2, 4, 10], 100) == true)
@test(candidate([1, 20, 4, 10], 5) == false)
@test(candidate([1, 20, 4, 10], 21) == true)
@test(candidate([1, 20, 4, 10], 22) == true)
@test(candidate([1, 8, 4, 10], 11) == true)
@test(candidate([1, 8, 4, 10], 10... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_53_add | jl | """Add two numbers x and y
>>> add(2, 3)
5
>>> add(5, 7)
12"""
function add(x::Int64, y::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_53_add.py | verbatim | using Test
@testset begin
candidate = add;
@test(candidate(0, 1) == 1)
@test(candidate(1, 0) == 1)
@test(candidate(2, 3) == 5)
@test(candidate(5, 7) == 12)
@test(candidate(7, 5) == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_54_same_chars | jl | """Check if two words have the same characters.
>>> same_chars('eabcdzzzz', 'dddzzzzzzzddeddabc')
True
>>> same_chars('abcd', 'dddddddabc')
True
>>> same_chars('dddddddabc', 'abcd')
True
>>> same_chars('eabcd', 'dddddddabc')
False
>>> same_chars('abcd', 'dddddddabce')
False
>>> same_chars('eabcdzzzz', 'dddzzzzzzzddddab... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_54_same_chars.py | verbatim | using Test
@testset begin
candidate = same_chars;
@test(candidate("eabcdzzzz", "dddzzzzzzzddeddabc") == true)
@test(candidate("abcd", "dddddddabc") == true)
@test(candidate("dddddddabc", "abcd") == true)
@test(candidate("eabcd", "dddddddabc") == false)
@test(candidate("abcd", "dddddddabcf") == false)
@test(cand... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_55_fib | jl | """Return n-th Fibonacci number.
>>> fib(10)
55
>>> fib(1)
1
>>> fib(8)
21"""
function fib(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_55_fib.py | verbatim | using Test
@testset begin
candidate = fib;
@test(candidate(10) == 55)
@test(candidate(1) == 1)
@test(candidate(8) == 21)
@test(candidate(11) == 89)
@test(candidate(12) == 144)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_56_correct_bracketing | jl | """ brackets is a string of "<" and ">".
return True if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("<")
False
>>> correct_bracketing("<>")
True
>>> correct_bracketing("<<><>>")
True
>>> correct_bracketing("><<>")
False"""
function correct_bracketing(brackets::String)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_56_correct_bracketing.py | verbatim | using Test
@testset begin
candidate = correct_bracketing;
@test(candidate("<>") == true)
@test(candidate("<<><>>") == true)
@test(candidate("<><><<><>><>") == true)
@test(candidate("<><><<<><><>><>><<><><<>>>") == true)
@test(candidate("<<<><>>>>") == false)
@test(candidate("><<>") == false)
@test(candidate("<... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_57_monotonic | jl | """Return True is list elements are monotonically increasing or decreasing.
>>> monotonic([1, 2, 4, 20])
True
>>> monotonic([1, 20, 4, 10])
False
>>> monotonic([4, 1, 0, -10])
True"""
function monotonic(l::Vector{Int64})::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_57_monotonic.py | verbatim | using Test
@testset begin
candidate = monotonic;
@test(candidate([1, 2, 4, 10]) == true)
@test(candidate([1, 2, 4, 20]) == true)
@test(candidate([1, 20, 4, 10]) == false)
@test(candidate([4, 1, 0, -10]) == true)
@test(candidate([4, 1, 1, 0]) == true)
@test(candidate([1, 2, 3, 2, 5, 60]) == false)
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_58_common | jl | """Return sorted unique common elements for two lists.
>>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])
[1, 5, 653]
>>> common([5, 3, 2, 8], [3, 2])
[2, 3]"""
function common(l1::Vector{Int64}, l2::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_58_common.py | verbatim | using Test
@testset begin
candidate = common;
@test(candidate([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121]) == [1, 5, 653])
@test(candidate([5, 3, 2, 8], [3, 2]) == [2, 3])
@test(candidate([4, 3, 2, 8], [3, 2, 4]) == [2, 3, 4])
@test(candidate([4, 3, 2, 8], Vector{Int64}([])) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_59_largest_prime_factor | jl | """Return the largest prime factor of n. Assume n > 1 and is not a prime.
>>> largest_prime_factor(13195)
29
>>> largest_prime_factor(2048)
2"""
function largest_prime_factor(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_59_largest_prime_factor.py | verbatim | using Test
@testset begin
candidate = largest_prime_factor;
@test(candidate(15) == 5)
@test(candidate(27) == 3)
@test(candidate(63) == 7)
@test(candidate(330) == 11)
@test(candidate(13195) == 29)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_5_intersperse | jl | """ Insert a number 'delimeter' between every two consecutive elements of input list `numbers'
>>> intersperse([], 4)
[]
>>> intersperse([1, 2, 3], 4)
[1, 4, 2, 4, 3]"""
function intersperse(numbers::Vector{Int64}, delimeter::Int64)::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_5_intersperse.py | verbatim | using Test
@testset begin
candidate = intersperse;
@test(candidate(Vector{Int64}([]), 7) == Vector{Int64}([]))
@test(candidate([5, 6, 3, 2], 8) == [5, 8, 6, 8, 3, 8, 2])
@test(candidate([2, 2, 2], 2) == [2, 2, 2, 2, 2])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_60_sum_to_n | jl | """sum_to_n is a function that sums numbers from 1 to n.
>>> sum_to_n(30)
465
>>> sum_to_n(100)
5050
>>> sum_to_n(5)
15
>>> sum_to_n(10)
55
>>> sum_to_n(1)
1"""
function sum_to_n(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_60_sum_to_n.py | verbatim | using Test
@testset begin
candidate = sum_to_n;
@test(candidate(1) == 1)
@test(candidate(6) == 21)
@test(candidate(11) == 66)
@test(candidate(30) == 465)
@test(candidate(100) == 5050)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_61_correct_bracketing | jl | """ brackets is a string of "(" and ")".
return True if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("(")
False
>>> correct_bracketing("()")
True
>>> correct_bracketing("(()())")
True
>>> correct_bracketing(")(()")
False"""
function correct_bracketing(brackets::String)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_61_correct_bracketing.py | verbatim | using Test
@testset begin
candidate = correct_bracketing;
@test(candidate("()") == true)
@test(candidate("(()())") == true)
@test(candidate("()()(()())()") == true)
@test(candidate("()()((()()())())(()()(()))") == true)
@test(candidate("((()())))") == false)
@test(candidate(")(()") == false)
@test(candidate("(... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_62_derivative | jl | """ xs represent coefficients of a polynomial.
xs[0] + xs[1] * x + xs[2] * x^2 + ....
Return derivative of this polynomial in the same form.
>>> derivative([3, 1, 2, 4, 5])
[1, 4, 12, 20]
>>> derivative([1, 2, 3])
[2, 6]"""
function derivative(xs::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_62_derivative.py | verbatim | using Test
@testset begin
candidate = derivative;
@test(candidate([3, 1, 2, 4, 5]) == [1, 4, 12, 20])
@test(candidate([1, 2, 3]) == [2, 6])
@test(candidate([3, 2, 1]) == [2, 2])
@test(candidate([3, 2, 1, 0, 4]) == [2, 2, 0, 16])
@test(candidate([1]) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_63_fibfib | jl | """The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fibfib(0) == 0
fibfib(1) == 0
fibfib(2) == 1
fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
Please write a function to efficiently compute the n-th element of the fibfib number sequence.
>>> fibfib(1)
0
>>> ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_63_fibfib.py | verbatim | using Test
@testset begin
candidate = fibfib;
@test(candidate(2) == 1)
@test(candidate(1) == 0)
@test(candidate(5) == 4)
@test(candidate(8) == 24)
@test(candidate(10) == 81)
@test(candidate(12) == 274)
@test(candidate(14) == 927)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_64_vowels_count | jl | """Write a function vowels_count which takes a string representing
a word as input and returns the number of vowels in the string.
Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
vowel, but only when it is at the end of the given word.
Example:
>>> vowels_count("abcde")
2
>>> vowels_count("ACEDY")
... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_64_vowels_count.py | verbatim | using Test
@testset begin
candidate = vowels_count;
@test(candidate("abcde") == 2)
@test(candidate("Alone") == 3)
@test(candidate("key") == 2)
@test(candidate("bye") == 1)
@test(candidate("keY") == 2)
@test(candidate("bYe") == 1)
@test(candidate("ACEDY") == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_65_circular_shift | jl | """Circular shift the digits of the integer x, shift the digits right by shift
and return the result as a string.
If shift > number of digits, return digits reversed.
>>> circular_shift(12, 1)
"21"
>>> circular_shift(12, 2)
"12""""
function circular_shift(x::Int64, shift::Int64)::String
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_65_circular_shift.py | verbatim | using Test
@testset begin
candidate = circular_shift;
@test(candidate(100, 2) == "001")
@test(candidate(12, 2) == "12")
@test(candidate(97, 8) == "79")
@test(candidate(12, 1) == "21")
@test(candidate(11, 101) == "11")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_66_digitSum | jl | """Task
Write a function that takes a string as input and returns the sum of the upper characters only'
ASCII codes.
Examples:
digitSum("") => 0
digitSum("abAB") => 131
digitSum("abcCd") => 67
digitSum("helloE") => 69
digitSum("woArBld") => 131
digitSum("aAaaaXa") => 153"""
function digitSum(s::... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_66_digitSum.py | verbatim | using Test
@testset begin
candidate = digitSum;
@test(candidate("") == 0)
@test(candidate("abAB") == 131)
@test(candidate("abcCd") == 67)
@test(candidate("helloE") == 69)
@test(candidate("woArBld") == 131)
@test(candidate("aAaaaXa") == 153)
@test(candidate(" How are yOu?") == 151)
@test(candidate("You arE Ver... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_67_fruit_distribution | jl | """In this task, you will be given a string that represents a number of apples and oranges
that are distributed in a basket of fruit this basket contains
apples, oranges, and mango fruits. Given the string that represents the total number of
the oranges and apples and an integer that represent the total number of th... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_67_fruit_distribution.py | verbatim | using Test
@testset begin
candidate = fruit_distribution;
@test(candidate("5 apples and 6 oranges", 19) == 8)
@test(candidate("5 apples and 6 oranges", 21) == 10)
@test(candidate("0 apples and 1 oranges", 3) == 2)
@test(candidate("1 apples and 0 oranges", 3) == 2)
@test(candidate("2 apples and 3 oranges", 100) =... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_68_pluck | jl | """"Given an array representing a branch of a tree that has non-negative integer nodes
your task is to pluck one of the nodes and return it.
The plucked node should be the node with the smallest even value.
If multiple nodes with the same smallest even value are found return the node that has smallest index.
The plucke... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_68_pluck.py | verbatim | using Test
@testset begin
candidate = pluck;
@test(candidate([4, 2, 3]) == [2, 1])
@test(candidate([1, 2, 3]) == [2, 1])
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([5, 0, 3, 0, 4, 2]) == [0, 1])
@test(candidate([1, 2, 3, 0, 5, 3]) == [0, 3])
@test(candidate([5, 4, 8, 4, 8]) == [4, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_69_search | jl | """You are given a non-empty list of positive integers. Return the greatest integer that is greater than
zero, and has a frequency greater than or equal to the value of the integer itself.
The frequency of an integer is the number of times it appears in the list.
If no such a value exist, return -1.
Examples:
sea... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_69_search.py | verbatim | using Test
@testset begin
candidate = search;
@test(candidate([5, 5, 5, 5, 1]) == 1)
@test(candidate([4, 1, 4, 1, 4, 4]) == 4)
@test(candidate([3, 3]) == -1)
@test(candidate([8, 8, 8, 8, 8, 8, 8, 8]) == 8)
@test(candidate([2, 3, 3, 2, 2]) == 2)
@test(candidate([2, 7, 8, 8, 4, 8, 7, 3, 9, 6, 5, 10, 4, 3, 6, 7, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_6_parse_nested_parens | jl | """ Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
>>> parse_nested_parens('(()()) ((())) () ((())()())')
[2, 3, 1,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_6_parse_nested_parens.py | verbatim | using Test
@testset begin
candidate = parse_nested_parens;
@test(candidate("(()()) ((())) () ((())()())") == [2, 3, 1, 3])
@test(candidate("() (()) ((())) (((())))") == [1, 2, 3, 4])
@test(candidate("(()(())((())))") == [4])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_70_strange_sort_list | jl | """Given list of integers, return list in strange order.
Strange sorting, is when you start with the minimum value,
then maximum of the remaining integers, then minimum and so on.
Examples:
strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]
strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]
strange_sort_list([]) == []"""
fun... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_70_strange_sort_list.py | verbatim | using Test
@testset begin
candidate = strange_sort_list;
@test(candidate([1, 2, 3, 4]) == [1, 4, 2, 3])
@test(candidate([5, 6, 7, 8, 9]) == [5, 9, 6, 8, 7])
@test(candidate([1, 2, 3, 4, 5]) == [1, 5, 2, 4, 3])
@test(candidate([5, 6, 7, 8, 9, 1]) == [1, 9, 5, 8, 6, 7])
@test(candidate([5, 5, 5, 5]) == [5, 5, 5, 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_71_triangle_area | jl | """Given the lengths of the three sides of a triangle. Return the area of
the triangle rounded to 2 decimal points if the three sides form a valid triangle.
Otherwise return -1
Three sides make a valid triangle when the sum of any two sides is greater
than the third side.
Example:
triangle_area(3, 4, 5) == 6.00
trian... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_71_triangle_area.py | verbatim | using Test
@testset begin
candidate = triangle_area;
@test(candidate(3, 4, 5) == 6.0)
@test(candidate(1, 2, 10) == -1)
@test(candidate(4, 8, 5) == 8.18)
@test(candidate(2, 2, 2) == 1.73)
@test(candidate(1, 2, 3) == -1)
@test(candidate(10, 5, 7) == 16.25)
@test(candidate(2, 6, 3) == -1)
@test(candidate(1, 1, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_72_will_it_fly | jl | """Write a function that returns True if the object q will fly, and False otherwise.
The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.
Example:
will_it_fly([1, 2], 5) ➞ False
# 1+2 is less than the maximum possible weight,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_72_will_it_fly.py | verbatim | using Test
@testset begin
candidate = will_it_fly;
@test(candidate([3, 2, 3], 9) == true)
@test(candidate([1, 2], 5) == false)
@test(candidate([3], 5) == true)
@test(candidate([3, 2, 3], 1) == false)
@test(candidate([1, 2, 3], 6) == false)
@test(candidate([5], 5) == true)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_73_smallest_change | jl | """Given an array arr of integers, find the minimum number of elements that
need to be changed to make the array palindromic. A palindromic array is an array that
is read the same backwards and forwards. In one change, you can change one element to any other element.
For example:
smallest_change([1,2,3,5,4,7,9,6]) == 4... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_73_smallest_change.py | verbatim | using Test
@testset begin
candidate = smallest_change;
@test(candidate([1, 2, 3, 5, 4, 7, 9, 6]) == 4)
@test(candidate([1, 2, 3, 4, 3, 2, 2]) == 1)
@test(candidate([1, 4, 2]) == 1)
@test(candidate([1, 4, 4, 2]) == 1)
@test(candidate([1, 2, 3, 2, 1]) == 0)
@test(candidate([3, 1, 1, 3]) == 0)
@test(candidate([1]... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_74_total_match | jl | """Write a function that accepts two lists of strings and returns the list that has
total number of chars in the all strings of the list less than the other list.
if the two lists have the same number of chars, return the first list.
Examples
total_match([], []) ➞ []
total_match(['hi', 'admin'], ['hI', 'Hi']) ➞ ['hI',... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_74_total_match.py | verbatim | using Test
@testset begin
candidate = total_match;
@test(candidate(Vector{String}([]), Vector{String}([])) == Vector{String}([]))
@test(candidate(["hi", "admin"], ["hi", "hi"]) == ["hi", "hi"])
@test(candidate(["hi", "admin"], ["hi", "hi", "admin", "project"]) == ["hi", "admin"])
@test(candidate(["4"], ["1", "2",... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_75_is_multiply_prime | jl | """Write a function that returns true if the given number is the multiplication of 3 prime numbers
and false otherwise.
Knowing that (a) is less then 100.
Example:
is_multiply_prime(30) == True
30 = 2 * 3 * 5"""
function is_multiply_prime(a::Int64)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_75_is_multiply_prime.py | verbatim | using Test
@testset begin
candidate = is_multiply_prime;
@test(candidate(5) == false)
@test(candidate(30) == true)
@test(candidate(8) == true)
@test(candidate(10) == false)
@test(candidate(125) == true)
@test(candidate(105) == true)
@test(candidate(126) == false)
@test(candidate(729) == false)
@test(candidat... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_76_is_simple_power | jl | """Your task is to write a function that returns true if a number x is a simple
power of n and false in other cases.
x is a simple power of n if n**int=x
For example:
is_simple_power(1, 4) => true
is_simple_power(2, 2) => true
is_simple_power(8, 2) => true
is_simple_power(3, 2) => false
is_simple_power(3, 1) => false
i... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_76_is_simple_power.py | verbatim | using Test
@testset begin
candidate = is_simple_power;
@test(candidate(16, 2) == true)
@test(candidate(143214, 16) == false)
@test(candidate(4, 2) == true)
@test(candidate(9, 3) == true)
@test(candidate(16, 4) == true)
@test(candidate(24, 2) == false)
@test(candidate(128, 4) == false)
@test(candidate(12, 6) =... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_77_iscube | jl | """Write a function that takes an integer a and returns True
if this ingeger is a cube of some integer number.
Note: you may assume the input is always valid.
Examples:
iscube(1) ==> True
iscube(2) ==> False
iscube(-1) ==> True
iscube(64) ==> True
iscube(0) ==> True
iscube(180) ==> False"""
function iscube(a::Int64)::... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_77_iscube.py | verbatim | using Test
@testset begin
candidate = iscube;
@test(candidate(1) == true)
@test(candidate(2) == false)
@test(candidate(-1) == true)
@test(candidate(64) == true)
@test(candidate(180) == false)
@test(candidate(1000) == true)
@test(candidate(0) == true)
@test(candidate(1729) == false)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_78_hex_key | jl | """You have been tasked to write a function that receives
a hexadecimal number as a string and counts the number of hexadecimal
digits that are primes (prime number, or a prime, is a natural number
greater than 1 that is not a product of two smaller natural numbers).
Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8,... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_78_hex_key.py | verbatim | using Test
@testset begin
candidate = hex_key;
@test(candidate("AB") == 1)
@test(candidate("1077E") == 2)
@test(candidate("ABED1A33") == 4)
@test(candidate("2020") == 2)
@test(candidate("123456789ABCDEF0") == 6)
@test(candidate("112233445566778899AABBCCDDEEFF00") == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_79_decimal_to_binary | jl | """You will be given a number in decimal form and your task is to convert it to
binary format. The function should return a string, with each character representing a binary
number. Each character in the string will be '0' or '1'.
There will be an extra couple of characters 'db' at the beginning and at the end of the s... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_79_decimal_to_binary.py | verbatim | using Test
@testset begin
candidate = decimal_to_binary;
@test(candidate(0) == "db0db")
@test(candidate(32) == "db100000db")
@test(candidate(103) == "db1100111db")
@test(candidate(15) == "db1111db")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_7_filter_by_substring | jl | """ Filter an input list of strings only for ones that contain given substring
>>> filter_by_substring([], 'a')
[]
>>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')
['abc', 'bacd', 'array']"""
function filter_by_substring(strings::Vector{String}, substring::String)::Vector{String}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_7_filter_by_substring.py | verbatim | using Test
@testset begin
candidate = filter_by_substring;
@test(candidate(Vector{String}([]), "john") == Vector{String}([]))
@test(candidate(["xxx", "asd", "xxy", "john doe", "xxxAAA", "xxx"], "xxx") == ["xxx", "xxxAAA", "xxx"])
@test(candidate(["xxx", "asd", "aaaxxy", "john doe", "xxxAAA", "xxx"], "xx") == ["xxx... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_80_is_happy | jl | """You are given a string s.
Your task is to check if the string is happy or not.
A string is happy if its length is at least 3 and every 3 consecutive letters are distinct
For example:
is_happy(a) => False
is_happy(aa) => False
is_happy(abcd) => True
is_happy(aabb) => False
is_happy(adb) => True
is_happy(xyy) => False... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_80_is_happy.py | verbatim | using Test
@testset begin
candidate = is_happy;
@test(candidate("a") == false)
@test(candidate("aa") == false)
@test(candidate("abcd") == true)
@test(candidate("aabb") == false)
@test(candidate("adb") == true)
@test(candidate("xyy") == false)
@test(candidate("iopaxpoi") == true)
@test(candidate("iopaxioi") ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_81_numerical_letter_grade | jl | """It is the last week of the semester and the teacher has to give the grades
to students. The teacher has been making her own algorithm for grading.
The only problem is, she has lost the code she used for grading.
She has given you a list of GPAs for some students and you have to write
a function that can output a li... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_81_numerical_letter_grade.py | verbatim | using Test
@testset begin
candidate = numerical_letter_grade;
@test(candidate([4.0, 3, 1.7, 2, 3.5]) == ["A+", "B", "C-", "C", "A-"])
@test(candidate([1.2]) == ["D+"])
@test(candidate([0.5]) == ["D-"])
@test(candidate([0.0]) == ["E"])
@test(candidate([1.0, 0.3, 1.5, 2.8, 3.3]) == ["D", "D-", "C-", "B", "B+"])
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_82_prime_length | jl | """Write a function that takes a string and returns True if the string
length is a prime number or False otherwise
Examples
prime_length('Hello') == True
prime_length('abcdcba') == True
prime_length('kittens') == True
prime_length('orange') == False"""
function prime_length(string::String)::Bool
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_82_prime_length.py | verbatim | using Test
@testset begin
candidate = prime_length;
@test(candidate("Hello") == true)
@test(candidate("abcdcba") == true)
@test(candidate("kittens") == true)
@test(candidate("orange") == false)
@test(candidate("wow") == true)
@test(candidate("world") == true)
@test(candidate("MadaM") == true)
@test(candidate(... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_83_starts_one_ends | jl | """Given a positive integer n, return the count of the numbers of n-digit
positive integers that start or end with 1."""
function starts_one_ends(n::Int64)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_83_starts_one_ends.py | verbatim | using Test
@testset begin
candidate = starts_one_ends;
@test(candidate(1) == 1)
@test(candidate(2) == 18)
@test(candidate(3) == 180)
@test(candidate(4) == 1800)
@test(candidate(5) == 18000)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_84_solve | jl | """Given a positive integer N, return the total sum of its digits in binary.
Example
For N = 1000, the sum of digits will be 1 the output should be "1".
For N = 150, the sum of digits will be 6 the output should be "110".
For N = 147, the sum of digits will be 12 the output should be "1100".
Variables:
... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_84_solve.py | verbatim | using Test
@testset begin
candidate = solve;
@test(candidate(1000) == "1")
@test(candidate(150) == "110")
@test(candidate(147) == "1100")
@test(candidate(333) == "1001")
@test(candidate(963) == "10010")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_85_add | jl | """Given a non-empty list of integers lst. add the even elements that are at odd indices..
Examples:
add([4, 2, 6, 7]) ==> 2 """
function add(lst::Vector{Int64})::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_85_add.py | verbatim | using Test
@testset begin
candidate = add;
@test(candidate([4, 88]) == 88)
@test(candidate([4, 5, 6, 7, 2, 122]) == 122)
@test(candidate([4, 0, 6, 7]) == 0)
@test(candidate([4, 4, 6, 8]) == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_86_anti_shuffle | jl | """Write a function that takes a string and returns an ordered version of it.
Ordered version of string, is a string where all words (separated by space)
are replaced by a new word where all the characters arranged in
ascending order based on ascii value.
Note: You should keep the order of words and blank spaces in the... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_86_anti_shuffle.py | verbatim | using Test
@testset begin
candidate = anti_shuffle;
@test(candidate("Hi") == "Hi")
@test(candidate("hello") == "ehllo")
@test(candidate("number") == "bemnru")
@test(candidate("abcd") == "abcd")
@test(candidate("Hello World!!!") == "Hello !!!Wdlor")
@test(candidate("") == "")
@test(candidate("Hi. My name is Mis... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_87_get_row | jl | """You are given a 2 dimensional data, as a nested lists,
which is similar to matrix, however, unlike matrices,
each row may contain a different number of columns.
Given lst, and integer x, find integers x in the list,
and return list of tuples, [(x1, y1), (x2, y2) ...] such that
each tuple is a coordinate - (row, colu... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_87_get_row.py | verbatim | using Test
@testset begin
candidate = get_row;
@test(candidate([[1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 1, 6], [1, 2, 3, 4, 5, 1]], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)])
@test(candidate([[1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6]], 2) ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_88_sort_array | jl | """Given an array of non-negative integers, return a copy of the given array after sorting,
you will sort the given array in ascending order if the sum( first index value, last index value) is odd,
or sort it in descending order if the sum( first index value, last index value) is even.
Note:
* don't change the given ar... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_88_sort_array.py | verbatim | using Test
@testset begin
candidate = sort_array;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([5]) == [5])
@test(candidate([2, 4, 3, 0, 1, 5]) == [0, 1, 2, 3, 4, 5])
@test(candidate([2, 4, 3, 0, 1, 5, 6]) == [6, 5, 4, 3, 2, 1, 0])
@test(candidate([2, 1]) == [1, 2])
@test(candidate([... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_89_encrypt | jl | """Create a function encrypt that takes a string as an argument and
returns a string encrypted with the alphabet being rotated.
The alphabet should be rotated in a manner such that the letters
shift down by two multiplied to two places.
For example:
encrypt('hi') returns 'lm'
encrypt('asdfghjkl') returns 'ewhjklnop'
... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_89_encrypt.py | verbatim | using Test
@testset begin
candidate = encrypt;
@test(candidate("hi") == "lm")
@test(candidate("asdfghjkl") == "ewhjklnop")
@test(candidate("gf") == "kj")
@test(candidate("et") == "ix")
@test(candidate("faewfawefaewg") == "jeiajeaijeiak")
@test(candidate("hellomyfriend") == "lippsqcjvmirh")
@test(candidate("dxz... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_8_sum_product | jl | """ For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.
Empty sum should be equal to 0 and empty product should be equal to 1.
>>> sum_product([])
(0, 1)
>>> sum_product([1, 2, 3, 4])
(10, 24)"""
function sum_product(numbers::Vector{Int64})::Tuple{Int64, Int64} ... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_8_sum_product.py | verbatim | using Test
@testset begin
candidate = sum_product;
@test(candidate(Vector{Int64}([])) == (0, 1))
@test(candidate([1, 1, 1]) == (3, 1))
@test(candidate([100, 0]) == (100, 0))
@test(candidate([3, 5, 7]) == (15, 105))
@test(candidate([10]) == (10, 10))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_90_next_smallest | jl | """You are given a list of integers.
Write a function next_smallest() that returns the 2nd smallest element of the list.
Return None if there is no such element.
next_smallest([1, 2, 3, 4, 5]) == 2
next_smallest([5, 1, 4, 3, 2]) == 2
next_smallest([]) == None
next_smallest([1, 1]) == None"""
function next_smallest(lst:... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_90_next_smallest.py | verbatim | using Test
@testset begin
candidate = next_smallest;
@test(candidate([1, 2, 3, 4, 5]) == 2)
@test(candidate([5, 1, 4, 3, 2]) == 2)
@test(candidate(Vector{Int64}([])) == nothing)
@test(candidate([1, 1]) == nothing)
@test(candidate([1, 1, 1, 1, 0]) == 1)
@test(candidate([1, 1]) == nothing)
@test(candidate([-35, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_91_is_bored | jl | """You'll be given a string of words, and your task is to count the number
of boredoms. A boredom is a sentence that starts with the word "I".
Sentences are delimited by '.', '?' or '!'.
For example:
>>> is_bored("Hello world")
0
>>> is_bored("The sky is blue. The sun is shining. I love this weather")
1"""
function is_... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_91_is_bored.py | verbatim | using Test
@testset begin
candidate = is_bored;
@test(candidate("Hello world") == 0)
@test(candidate("Is the sky blue?") == 0)
@test(candidate("I love It !") == 1)
@test(candidate("bIt") == 0)
@test(candidate("I feel good today. I will be productive. will kill It") == 2)
@test(candidate("You and I are going for... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_92_any_int | jl | """Create a function that takes 3 numbers.
Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
Returns false in any other cases.
Examples
any_int(5, 2, 7) ➞ True
any_int(3, 2, 2) ➞ False
any_int(3, -2, 1) ➞ True
any_int(3.6, -2.2, 2) ➞ False"""
function any_int(x::Floa... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_92_any_int.py | verbatim | using Test
@testset begin
candidate = any_int;
@test(candidate(2, 3, 1) == true)
@test(candidate(2.5, 2, 3) == false)
@test(candidate(1.5, 5, 3.5) == false)
@test(candidate(2, 6, 2) == false)
@test(candidate(4, 2, 2) == true)
@test(candidate(2.2, 2.2, 2.2) == false)
@test(candidate(-4, 6, 2) == true)
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_93_encode | jl | """Write a function that takes a message, and encodes in such a
way that it swaps case of all letters, replaces all vowels in
the message with the letter that appears 2 places ahead of that
vowel in the english alphabet.
Assume only letters.
Examples:
>>> encode('test')
'TGST'
>>> encode('This is a message')
'tHKS... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_93_encode.py | verbatim | using Test
@testset begin
candidate = encode;
@test(candidate("TEST") == "tgst")
@test(candidate("Mudasir") == "mWDCSKR")
@test(candidate("YES") == "ygs")
@test(candidate("This is a message") == "tHKS KS C MGSSCGG")
@test(candidate("I DoNt KnOw WhAt tO WrItE") == "k dQnT kNqW wHcT Tq wRkTg")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_94_skjkasdkd | jl | """You are given a list of integers.
You need to find the largest prime value and return the sum of its digits.
Examples:
For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10
For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25
For lst = [1,3,1,32,5107,34,83278,1... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_94_skjkasdkd.py | verbatim | using Test
@testset begin
candidate = skjkasdkd;
@test(candidate([0, 3, 2, 1, 3, 5, 7, 4, 5, 5, 5, 2, 181, 32, 4, 32, 3, 2, 32, 324, 4, 3]) == 10)
@test(candidate([1, 0, 1, 8, 2, 4597, 2, 1, 3, 40, 1, 2, 1, 2, 4, 2, 5, 1]) == 25)
@test(candidate([1, 3, 1, 32, 5107, 34, 83278, 109, 163, 23, 2323, 32, 30, 1, 9, 3]) ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_95_check_dict_case | jl | """Given a dictionary, return True if all keys are strings in lower
case or all keys are strings in upper case, else return False.
The function should return False is the given dictionary is empty.
Examples:
check_dict_case({"a":"apple", "b":"banana"}) should return True.
check_dict_case({"a":"apple", "A":"banana", "B... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_95_check_dict_case.py | verbatim | using Test
@testset begin
candidate = check_dict_case;
@test(candidate(Dict("p" => "pineapple", "b" => "banana")) == true)
@test(candidate(Dict("p" => "pineapple", "A" => "banana", "B" => "banana")) == false)
@test(candidate(Dict("p" => "pineapple", "5" => "banana", "a" => "apple")) == false)
@test(candidate(Dict... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_96_count_up_to | jl | """Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
for example:
count_up_to(5) => [2,3]
count_up_to(11) => [2,3,5,7]
count_up_to(0) => []
count_up_to(20) => [2,3,5,7,11,13,17,19]
count_up_to(1) => []
count_up_to(18) => [2,3,5,7... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_96_count_up_to.py | verbatim | using Test
@testset begin
candidate = count_up_to;
@test(candidate(5) == [2, 3])
@test(candidate(6) == [2, 3, 5])
@test(candidate(7) == [2, 3, 5])
@test(candidate(10) == [2, 3, 5, 7])
@test(candidate(0) == Vector{Int64}([]))
@test(candidate(22) == [2, 3, 5, 7, 11, 13, 17, 19])
@test(candidate(1) == Vector{Int6... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_97_multiply | jl | """Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid.
Examples:
multiply(148, 412) should return 16.
multiply(19, 28) should return 72.
multiply(2020, 1851) should return 0.
multiply(14,-15) should return 20."""
function multiply(a::Int64, b::I... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_97_multiply.py | verbatim | using Test
@testset begin
candidate = multiply;
@test(candidate(148, 412) == 16)
@test(candidate(19, 28) == 72)
@test(candidate(2020, 1851) == 0)
@test(candidate(14, -15) == 20)
@test(candidate(76, 67) == 42)
@test(candidate(17, 27) == 49)
@test(candidate(0, 1) == 0)
@test(candidate(0, 0) == 0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_98_count_upper | jl | """Given a string s, count the number of uppercase vowels in even indices.
For example:
count_upper('aBCdEf') returns 1
count_upper('abcdefg') returns 0
count_upper('dBBE') returns 0"""
function count_upper(s::String)::Int64
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_98_count_upper.py | verbatim | using Test
@testset begin
candidate = count_upper;
@test(candidate("aBCdEf") == 1)
@test(candidate("abcdefg") == 0)
@test(candidate("dBBE") == 0)
@test(candidate("B") == 0)
@test(candidate("U") == 1)
@test(candidate("") == 0)
@test(candidate("EEEE") == 2)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_99_closest_integer | jl | """Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
Examples
>>> closest_integer("10")
10
>>> closest_integer("15.3")
15
Note:
Rounding away from zero means that if the given number is equi... | keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_99_closest_integer.py | verbatim | using Test
@testset begin
candidate = closest_integer;
@test(candidate("10") == 10)
@test(candidate("14.5") == 15)
@test(candidate("-15.5") == -16)
@test(candidate("15.3") == 15)
@test(candidate("0") == 0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_9_rolling_max | jl | """ From a given list of integers, generate a list of rolling maximum element found until given moment
in the sequence.
>>> rolling_max([1, 2, 3, 2, 3, 4, 2])
[1, 2, 3, 3, 3, 4, 4]"""
function rolling_max(numbers::Vector{Int64})::Vector{Int64}
| keep | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals/HumanEval_9_rolling_max.py | verbatim | using Test
@testset begin
candidate = rolling_max;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([1, 2, 3, 4]) == [1, 2, 3, 4])
@test(candidate([4, 3, 2, 1]) == [4, 4, 4, 4])
@test(candidate([3, 2, 3, 100, 3]) == [3, 3, 3, 100, 100])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_0_has_close_elements | jl | """ Check if in given list of numbers, are any two numbers closer to each other than
given threshold."""
function has_close_elements(numbers::Vector{Float64}, threshold::Float64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_0_has_close_elements.py | verbatim | using Test
@testset begin
candidate = has_close_elements;
@test(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.3) == true)
@test(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.05) == false)
@test(candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.95) == true)
@test(candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.8) == false)
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_100_make_a_pile | jl | """Given a positive integer n, you have to make a pile of n levels of stones.
The first level has n stones.
The number of stones in the next level is:
- the next odd number if n is odd.
- the next even number if n is even.
Return the number of stones in each level in a list, where element at index
i represents ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_100_make_a_pile.py | verbatim | using Test
@testset begin
candidate = make_a_pile;
@test(candidate(3) == [3, 5, 7])
@test(candidate(4) == [4, 6, 8, 10])
@test(candidate(5) == [5, 7, 9, 11, 13])
@test(candidate(6) == [6, 8, 10, 12, 14, 16])
@test(candidate(8) == [8, 10, 12, 14, 16, 18, 20, 22])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_101_words_string | jl | """You will be given a string of words separated by commas or spaces. Your task is
to split the string into words and return an array of the words.
For example:"""
function words_string(s::String)::Vector{String}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_101_words_string.py | verbatim | using Test
@testset begin
candidate = words_string;
@test(candidate("Hi, my name is John") == ["Hi", "my", "name", "is", "John"])
@test(candidate("One, two, three, four, five, six") == ["One", "two", "three", "four", "five", "six"])
@test(candidate("Hi, my name") == ["Hi", "my", "name"])
@test(candidate("One,, tw... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_102_choose_num | jl | """This function takes two positive numbers x and y and returns the
biggest even integer number that is in the range [x, y] inclusive. If
there's no such number, then the function should return -1.
For example:"""
function choose_num(x::Int64, y::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_102_choose_num.py | verbatim | using Test
@testset begin
candidate = choose_num;
@test(candidate(12, 15) == 14)
@test(candidate(13, 12) == -1)
@test(candidate(33, 12354) == 12354)
@test(candidate(5234, 5233) == -1)
@test(candidate(6, 29) == 28)
@test(candidate(27, 10) == -1)
@test(candidate(7, 7) == -1)
@test(candidate(546, 546) == 546)
en... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_103_rounded_avg | jl | """You are given two positive integers n and m, and your task is to compute the
average of the integers from n through m (including n and m).
Round the answer to the nearest integer and convert that to binary.
If n is greater than m, return -1.
Example:"""
function rounded_avg(n::Int64, m::Int64)::Union{String, Int64}... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_103_rounded_avg.py | verbatim | using Test
@testset begin
candidate = rounded_avg;
@test(candidate(1, 5) == "0b11")
@test(candidate(7, 13) == "0b1010")
@test(candidate(964, 977) == "0b1111001010")
@test(candidate(996, 997) == "0b1111100100")
@test(candidate(560, 851) == "0b1011000010")
@test(candidate(185, 546) == "0b101101110")
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
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:"""
function unique_digits(x::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
If the array is empty, return an empty array:
If the array... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
Explanation:
Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.
Example 2:
Explanation:
Integer palindrome are ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function count_nums(arr::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function make_palindrome(string::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function histogram(test::String)::Dict{String, Int64}>
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function odd_count(lst::Vector{Stri... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function minSubArraySum(nums::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function sort_array(arr::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function string_xor(a::String, b::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
Example 2:
Example 3:
Note:
1. The length of the array will be in the range of [1, 1000].
2. The elements in the array will be in the range of [-1000, 1000].
3. 0 <= k ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function solution(lst::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
Constraints:
1. 1 <= len(arr) <= 100
2. 1 <= k <= len(arr)"""
function add_elements(arr::Vector{Int64}, k::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function split_word... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function is_sorted(lst::Vector{Int64})::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function prod_signs(arr::Vector{Int64})::Union{Int64, Nothing}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function longest(strings::Vector{String})::Union{String, Nothing}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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.... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function digits(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function is_nested(string::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function sum_squares(lst::Vector{Float64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function check_if_last_char_is_a_letter(txt::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function can_arrange(arr::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function largest_smallest_integers(lst::Vector{Int64})::Tuple{Union{Int64, Nothing}, Un... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function is_equal_to_sum_even(n::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
The function will receive an integer as input and should return the special
factorial of this integer."""
function special_factorial(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function greatest_common_divisor(a::Int64, b::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 - """
function fix_spaces(text::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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.
- ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.