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_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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
Examp... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function order_by_points(nums::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function specialFilter(nums::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 :
Explanation:
a = [1, 3, 7, 13,... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function all_prefixes(string::String)::Vector{String}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function x_or_y(n::Int64, x::Int64, y::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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.
If the input list is empty, return 0."""
function double_the_difference(lst::Vector{Float64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function cycpattern_check(a::String, b::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function even_odd_count(num::Int64)::Tuple{Int64, Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function int_to_mini_roman(number::Int64)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function right_angle_triangle(a::Int64, b::Int64, c::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function find_max(words::Vector{String})::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function string_sequence(n::Int64)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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_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"""
function solve(s::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function string_to_md5(text::String)::Union{String, Nothing}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function generate_integers(a::Int64, b::Int64)::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function count_distinct_characters(string::String)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function how_many_times(string::String, substring::String)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function sort_numbers(numbers::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
f... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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)."""
function find_closest_elements(numbers::Vector{Float64})::Tuple{Float64, Float64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function rescale_to_unit(numbers::Vector{Float64})::Vector{Float64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function filter_integers(values::Vector{Any})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function strlen(string::String)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function largest_divisor(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function factorize(n::Int64)::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function remove_duplicates(numbers::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function flip_case(string::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function concatenate(strings::Vector{String})::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function filter_by_prefix(strings::Vector{String}, prefix::String)::Vector{String}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function truncate_number(number::Float64)::Float64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function get_positive(l::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function is_prime(n::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function sort_third(l::Vector{Int64})::Vector{Int6... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function unique(l::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function max_element(l::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function fizz_buzz(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function sort_even(l::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function prime_fib(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function below_zero(operations::Vector{Int64}... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function triples_sum_to_zero(l::Vector{Int64})::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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_42_incr_list | jl | """Return list with elements incremented by 1."""
function incr_list(l::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function pairs_sum_to_zero(l::Vector{Int64})::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function change_base(x::Int64, base::Int64)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function triangle_area(a::Int64, h::Int64)::Float64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function median(l::Vector{Int64})::Float64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function is_palindrome(text::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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)."""
function modp(n::Int64, p::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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 |"""
function mean_absolute_deviation(numbers::Vector{Float64})::Flo... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"
] |
HumanEval_51_remove_vowels | jl | """ remove_vowels is a function that takes string and returns string without vowels."""
function remove_vowels(text::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function below_threshold(l::Vector{Int64}, t::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function add(x::Int64, y::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function same_chars(s0::String, s1::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function fib(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function correct_bracketing(brackets::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function monotonic(l::Vector{Int64})::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function common(l1::Vector{Int64}, l2::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function largest_prime_factor(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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'"""
function intersperse(numbers::Vector{Int64}, delimeter::Int64)::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function sum_to_n(n::Int64)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function correct_bracketing(brackets::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function derivative(xs::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function fibfib(n... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function vowels_count(s::String)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function circular_shift(x::Int64, shift::Int64)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function digitSum(s::String)::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
func... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function parse_nested_parens(paren_string::String)::Vector{In... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function strange_sort_list(lst::Vector{Int64})::Vector{Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function triangle_area(a::Int64, ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
# 1+2 is less than the maximum possible weight, but it's unbalanced.
# ... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function smallest_change(arr::Vector... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function total_match(lst1::Vector{String}, lst2::Vector{String})::Vector{... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:
30 = 2 * 3 * 5"""
function is_multiply_prime(a::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function is_simple_power(x::Int64, n::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function iscube(a::Int64)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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,... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function filter_by_substring(strings::Vector{String}, substring::String)::Vector{String}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function is_happy(s::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"""
function prime_length(string::String)::Bool
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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_84_solve | jl | """Given a positive integer N, return the total sum of its digits in binary.
Example
Variables:
@N integer
Constraints: 0 ≤ N ≤ 10000.
Output:
a string of binary number"""
function solve(N::Int64)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function add(lst::Vector{Int64})::Int64
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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... | remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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:"""
function encrypt(s::String)::String
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function sum_product(numbers::Vector{Int64})::Tuple{Int64, Int64}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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."""
function next_smallest(lst::Vector{Int64})::Union{Int64, Nothing}
| remove | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/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"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.