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_11_string_xor | d | import std.math;
import std.typecons;
/*
Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
>>> string_xor("010", "110")
"100"
*/
string string_xor(string a, string b)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_11_string_xor.py | reworded | unittest
{
alias candidate = string_xor;
assert(candidate("111000", "101010") == "010010");
assert(candidate("1", "1") == "0");
assert(candidate("0101", "0000") == "0101");
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_120_maximum | d | import std.math;
import std.typecons;
/*
Given an array arr of integers and a positive integer k, return a sorted array
of length k with the maximum k numbers in arr.
Example 1:
>>> maximum([-3L, -4L, 5L], 3L)
[-4L, -3L, 5L]
Example 2:
>>> maximum([4L, -4L, 4L], 2L)
[4L, 4L]
Example 3:
>>> maximum([-3L, 2L, 1L, 2L, -1... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_120_maximum.py | reworded | unittest
{
alias candidate = maximum;
assert(candidate([-3L, -4L, 5L], 3L) == [-4L, -3L, 5L]);
assert(candidate([4L, -4L, 4L], 2L) == [4L, 4L]);
assert(candidate([-3L, 2L, 1L, 2L, -1L, -2L, 1L], 1L) == [2L]);
assert(candidate([123L, -123L, 20L, 0L, 1L, 2L, -3L], 3L) == [2L, 20L, 123L]);
assert(... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_121_solution | d | import std.math;
import std.typecons;
/*
Given a non-empty array of integers, return the sum of all of the odd elements that are in even positions.
Examples
>>> solution([5L, 8L, 7L, 1L])
12L
>>> solution([3L, 3L, 3L, 3L, 3L])
9L
>>> solution([30L, 13L, 24L, 321L])
0L
*/
long solution(long[] lst)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_121_solution.py | reworded | unittest
{
alias candidate = solution;
assert(candidate([5L, 8L, 7L, 1L]) == 12L);
assert(candidate([3L, 3L, 3L, 3L, 3L]) == 9L);
assert(candidate([30L, 13L, 24L, 321L]) == 0L);
assert(candidate([5L, 9L]) == 5L);
assert(candidate([2L, 4L, 8L]) == 0L);
assert(candidate([30L, 13L, 23L, 32L]) ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_122_add_elements | d | import std.math;
import std.typecons;
/*
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:
>>> add_elements([111L, 21L, 3L, 4000L, 5L, 6L, 7L, 8L, 9L], 4L)
24L
Constraints:
1. 1 <= len(arr) <= 100
2. 1 <= k... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_122_add_elements.py | reworded | unittest
{
alias candidate = add_elements;
assert(candidate([1L, -2L, -3L, 41L, 57L, 76L, 87L, 88L, 99L], 3L) == -4L);
assert(candidate([111L, 121L, 3L, 4000L, 5L, 6L], 2L) == 0L);
assert(candidate([11L, 21L, 3L, 90L, 5L, 6L, 7L, 8L, 9L], 4L) == 125L);
assert(candidate([111L, 21L, 3L, 4000L, 5L, 6L... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_123_get_odd_collatz | d | import std.math;
import std.typecons;
/*
Given a positive integer n, return a sorted array 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 ter... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_123_get_odd_collatz.py | reworded | unittest
{
alias candidate = get_odd_collatz;
assert(candidate(14L) == [1L, 5L, 7L, 11L, 13L, 17L]);
assert(candidate(5L) == [1L, 5L]);
assert(candidate(12L) == [1L, 3L, 5L]);
assert(candidate(1L) == [1L]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_124_valid_date | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_124_valid_date.py | reworded | unittest
{
alias candidate = valid_date;
assert(candidate("03-11-2000") == true);
assert(candidate("15-01-2012") == false);
assert(candidate("04-0-2040") == false);
assert(candidate("06-04-2020") == true);
assert(candidate("01-01-2007") == true);
assert(candidate("03-32-2011") == false);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_126_is_sorted | d | import std.math;
import std.typecons;
/*
Given an array of numbers, return whether or not they are sorted
in ascending order. If array has more than 1 duplicate of the same
number, return false. Assume no negative numbers and only integers.
Examples
>>> is_sorted([5L])
true
>>> is_sorted([1L, 2L, 3L, 4L, 5L])
true
>>> ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_126_is_sorted.py | reworded | unittest
{
alias candidate = is_sorted;
assert(candidate([5L]) == true);
assert(candidate([1L, 2L, 3L, 4L, 5L]) == true);
assert(candidate([1L, 3L, 2L, 4L, 5L]) == false);
assert(candidate([1L, 2L, 3L, 4L, 5L, 6L]) == true);
assert(candidate([1L, 2L, 3L, 4L, 5L, 6L, 7L]) == true);
assert(ca... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_127_intersection | d | import std.math;
import std.typecons;
/*
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 ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_127_intersection.py | reworded | unittest
{
alias candidate = intersection;
assert(candidate(tuple(1L, 2L), tuple(2L, 3L)) == "NO");
assert(candidate(tuple(-1L, 1L), tuple(0L, 4L)) == "NO");
assert(candidate(tuple(-3L, -1L), tuple(-5L, 5L)) == "YES");
assert(candidate(tuple(-2L, 2L), tuple(-4L, 0L)) == "YES");
assert(candidate... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_128_prod_signs | d | import std.math;
import std.typecons;
/*
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 null for empty arr.
Example:
>>> prod_signs([1L, 2L, 2L, -4L])
9L
>>> prod_signs([0... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_128_prod_signs.py | reworded | unittest
{
alias candidate = prod_signs;
{
auto result = candidate([1L, 2L, 2L, -4L]);
assert(!result.isNull && result.get == -9L);
}
{
auto result = candidate([0L, 1L]);
assert(!result.isNull && result.get == 0L);
}
{
auto result = candidate([1L, 1L, 1L, 2L, 3L, -1L, 1L])... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_129_minPath | d | import std.math;
import std.typecons;
/*
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 st... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_129_minPath.py | reworded | unittest
{
alias candidate = minPath;
assert(candidate([[1L, 2L, 3L], [4L, 5L, 6L], [7L, 8L, 9L]], 3L) == [1L, 2L, 1L]);
assert(candidate([[5L, 9L, 3L], [4L, 1L, 6L], [7L, 8L, 2L]], 1L) == [1L]);
assert(candidate([[1L, 2L, 3L, 4L], [5L, 6L, 7L, 8L], [9L, 10L, 11L, 12L], [13L, 14L, 15L, 16L]], 4L) == [1... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_12_longest | d | import std.math;
import std.typecons;
/*
Out of array of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return null in case the input array is empty.
>>> longest([])
None
>>> longest(["a", "b", "c"])
"a"
>>> longest(["a", "bb", "ccc"])
"ccc"
*/
Nullable!(string) l... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_12_longest.py | reworded | unittest
{
alias candidate = longest;
{
auto result = candidate([]);
assert(result.isNull);
}
{
auto result = candidate(["x", "y", "z"]);
assert(!result.isNull && result.get == "x");
}
{
auto result = candidate(["x", "yyy", "zzzz", "www", "kkkk", "abc"]);
assert(!r... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_130_tri | d | import std.math;
import std.typecons;
/*
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) +... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_130_tri.py | reworded | unittest
{
alias candidate = tri;
assert(candidate(3L) == [1L, 3L, 2L, 8L]);
assert(candidate(4L) == [1L, 3L, 2L, 8L, 3L]);
assert(candidate(5L) == [1L, 3L, 2L, 8L, 3L, 15L]);
assert(candidate(6L) == [1L, 3L, 2L, 8L, 3L, 15L, 4L]);
assert(candidate(7L) == [1L, 3L, 2L, 8L, 3L, 15L, 4L, 24L]);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_131_digits | d | import std.math;
import std.typecons;
/*
Given a positive integer n, return the product of the odd digits.
Return 0 if all digits are even.
For example:
>>> digits(1L)
1L
>>> digits(4L)
0L
>>> digits(235L)
15L
*/
long digits(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_131_digits.py | reworded | unittest
{
alias candidate = digits;
assert(candidate(5L) == 5L);
assert(candidate(54L) == 5L);
assert(candidate(120L) == 1L);
assert(candidate(5014L) == 5L);
assert(candidate(98765L) == 315L);
assert(candidate(5576543L) == 2625L);
assert(candidate(2468L) == 0L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_132_is_nested | d | import std.math;
import std.typecons;
/*
Create a function that takes a string as input which contains only square brackets.
The function should return true if and only if there is a valid subsequence of brackets
where at least one bracket in the subsequence is nested.
>>> is_nested("[[]]")
true
>>> is_nested("[]]]]]]... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_132_is_nested.py | reworded | unittest
{
alias candidate = is_nested;
assert(candidate("[[]]") == true);
assert(candidate("[]]]]]]][[[[[]") == false);
assert(candidate("[][]") == false);
assert(candidate("[]") == false);
assert(candidate("[[[[]]]]") == true);
assert(candidate("[]]]]]]]]]]") == false);
assert(candida... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_133_sum_squares | d | import std.math;
import std.typecons;
/*
You are given an array of numbers.
You need to return the sum of squared numbers in the given array,
round each element in the array to the upper int(Ceiling) first.
Examples:
>>> lst([1.0, 2.0, 3.0])
14L
>>> lst([1.0, 4.0, 9.0])
98L
>>> lst([1.0, 3.0, 5.0, 7.0])
84L
>>> lst([1.... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_133_sum_squares.py | reworded | unittest
{
alias candidate = sum_squares;
assert(candidate([1.0, 2.0, 3.0]) == 14L);
assert(candidate([1.0, 2.0, 3.0]) == 14L);
assert(candidate([1.0, 3.0, 5.0, 7.0]) == 84L);
assert(candidate([1.4, 4.2, 0.0]) == 29L);
assert(candidate([-2.4, 1.0, 1.0]) == 6L);
assert(candidate([100.0, 1.0,... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_134_check_if_last_char_is_a_letter | d | import std.math;
import std.typecons;
/*
Create a function that returns true if the last character
of a given string is an alphabetical character and is not
a part of a word, and false otherwise.
Note: "word" is a group of characters separated by space.
Examples:
>>> check_if_last_char_is_a_letter("apple pie")
false
>>... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_134_check_if_last_char_is_a_letter.py | reworded | unittest
{
alias candidate = check_if_last_char_is_a_letter;
assert(candidate("apple") == false);
assert(candidate("apple pi e") == true);
assert(candidate("eeeee") == false);
assert(candidate("A") == true);
assert(candidate("Pumpkin pie ") == false);
assert(candidate("Pumpkin pie 1") == fa... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_135_can_arrange | d | import std.math;
import std.typecons;
/*
Create a function which returns the largest index of an element which
is not greater than or equal to the element immediately preceding it. If
no such element exists then return -1. The given array will not contain
duplicate values.
Examples:
>>> can_arrange([1L, 2L, 4L, 3L, 5L]... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_135_can_arrange.py | reworded | unittest
{
alias candidate = can_arrange;
assert(candidate([1L, 2L, 4L, 3L, 5L]) == 3L);
assert(candidate([1L, 2L, 4L, 5L]) == -1L);
assert(candidate([1L, 4L, 2L, 5L, 6L, 7L, 8L, 9L, 10L]) == 2L);
assert(candidate([4L, 8L, 5L, 7L, 3L]) == 4L);
assert(candidate([]) == -1L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_136_largest_smallest_integers | d | import std.math;
import std.typecons;
/*
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 an array.
If there is no negative or positive integers, return them as null.
Examples:
>>> largest_smallest_integers([2L, 4L, 1L, 3L, 5L,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_136_largest_smallest_integers.py | reworded | unittest
{
alias candidate = largest_smallest_integers;
{
auto result = candidate([2L, 4L, 1L, 3L, 5L, 7L]);
assert(result[0].isNull);
assert(!result[1].isNull && result[1].get == 1L);
}
{
auto result = candidate([2L, 4L, 1L, 3L, 5L, 7L, 0L]);
assert(result[0].isNull);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_138_is_equal_to_sum_even | d | import std.math;
import std.typecons;
/*
Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers
Example
>>> is_equal_to_sum_even(4L)
false
>>> is_equal_to_sum_even(6L)
false
>>> is_equal_to_sum_even(8L)
true
*/
bool is_equal_to_sum_even(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_138_is_equal_to_sum_even.py | reworded | unittest
{
alias candidate = is_equal_to_sum_even;
assert(candidate(4L) == false);
assert(candidate(6L) == false);
assert(candidate(8L) == true);
assert(candidate(10L) == true);
assert(candidate(11L) == false);
assert(candidate(12L) == true);
assert(candidate(13L) == false);
assert(... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_139_special_factorial | d | import std.math;
import std.typecons;
/*
The Brazilian factorial is defined as:
brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!
where n > 0
For example:
>>> special_factorial(4L)
288L
The function will receive an integer as input and should return the special
factorial of this integer.
*/
long special_factoria... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_139_special_factorial.py | reworded | unittest
{
alias candidate = special_factorial;
assert(candidate(4L) == 288L);
assert(candidate(5L) == 34560L);
assert(candidate(7L) == 125411328000L);
assert(candidate(1L) == 1L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_13_greatest_common_divisor | d | import std.math;
import std.typecons;
/*
Return a greatest common divisor of two integers a and b
>>> greatest_common_divisor(3L, 5L)
1L
>>> greatest_common_divisor(25L, 15L)
5L
*/
long greatest_common_divisor(long a, long b)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_13_greatest_common_divisor.py | reworded | unittest
{
alias candidate = greatest_common_divisor;
assert(candidate(3L, 7L) == 1L);
assert(candidate(10L, 15L) == 5L);
assert(candidate(49L, 14L) == 7L);
assert(candidate(144L, 60L) == 12L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_140_fix_spaces | d | import std.math;
import std.typecons;
/*
Given a string text, replace all spaces in it with underscores,
and if a string has more than 2 consecutive spaces,
then replace all consecutive spaces with -
>>> fix_spaces(" Example")
"Example"
>>> fix_spaces(" Example 1")
"Example_1"
>>> fix_spaces(" Example 2")
"_Example_... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_140_fix_spaces.py | reworded | unittest
{
alias candidate = fix_spaces;
assert(candidate("Example") == "Example");
assert(candidate("Mudasir Hanif ") == "Mudasir_Hanif_");
assert(candidate("Yellow Yellow Dirty Fellow") == "Yellow_Yellow__Dirty__Fellow");
assert(candidate("Exa mple") == "Exa-mple");
assert(candidate(" E... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_141_file_name_check | d | import std.math;
import std.typecons;
/*
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 d... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_141_file_name_check.py | reworded | unittest
{
alias candidate = file_name_check;
assert(candidate("example.txt") == "Yes");
assert(candidate("1example.dll") == "No");
assert(candidate("s1sdf3.asd") == "No");
assert(candidate("K.dll") == "Yes");
assert(candidate("MY16FILE3.exe") == "Yes");
assert(candidate("His12FILE94.exe") ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_142_sum_squares | d | import std.math;
import std.typecons;
/*
"
This function will take an array of integers. For all entries in the array, 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 e... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_142_sum_squares.py | reworded | unittest
{
alias candidate = sum_squares;
assert(candidate([1L, 2L, 3L]) == 6L);
assert(candidate([1L, 4L, 9L]) == 14L);
assert(candidate([]) == 0L);
assert(candidate([1L, 1L, 1L, 1L, 1L, 1L, 1L, 1L, 1L]) == 9L);
assert(candidate([-1L, -1L, -1L, -1L, -1L, -1L, -1L, -1L, -1L]) == -3L);
asser... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_143_words_in_sentence | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_143_words_in_sentence.py | reworded | unittest
{
alias candidate = words_in_sentence;
assert(candidate("This is a test") == "is");
assert(candidate("lets go for swimming") == "go for");
assert(candidate("there is no place available here") == "there is no place");
assert(candidate("Hi I am Hussein") == "Hi am Hussein");
assert(candi... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_144_simplify | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_144_simplify.py | reworded | unittest
{
alias candidate = simplify;
assert(candidate("1/5", "5/1") == true);
assert(candidate("1/6", "2/1") == false);
assert(candidate("5/1", "3/1") == true);
assert(candidate("7/10", "10/2") == false);
assert(candidate("2/10", "50/10") == true);
assert(candidate("7/2", "4/2") == true);... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_145_order_by_points | d | import std.math;
import std.typecons;
/*
Write a function which sorts the given array 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 array.
For example:
>>> order_by_points([1L, 11L, -1L,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_145_order_by_points.py | reworded | unittest
{
alias candidate = order_by_points;
assert(candidate([1L, 11L, -1L, -11L, -12L]) == [-1L, -11L, 1L, -12L, 11L]);
assert(candidate([1234L, 423L, 463L, 145L, 2L, 423L, 423L, 53L, 6L, 37L, 3457L, 3L, 56L, 0L, 46L]) == [0L, 2L, 3L, 6L, 53L, 423L, 423L, 423L, 1234L, 145L, 37L, 46L, 56L, 463L, 3457L]);... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_146_specialFilter | d | import std.math;
import std.typecons;
/*
Write a function that takes an array of numbers as input and returns
the number of elements in the array that are greater than 10 and both
first and last digits of a number are odd (1, 3, 5, 7, 9).
For example:
>>> specialFilter([15L, -73L, 14L, -15L])
1L
>>> specialFilter([33... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_146_specialFilter.py | reworded | unittest
{
alias candidate = specialFilter;
assert(candidate([5L, -2L, 1L, -5L]) == 0L);
assert(candidate([15L, -73L, 14L, -15L]) == 1L);
assert(candidate([33L, -2L, -3L, 45L, 21L, 109L]) == 2L);
assert(candidate([43L, -12L, 93L, 125L, 121L, 109L]) == 4L);
assert(candidate([71L, -2L, -33L, 75L,... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_147_get_max_triples | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_147_get_max_triples.py | reworded | unittest
{
alias candidate = get_max_triples;
assert(candidate(5L) == 1L);
assert(candidate(6L) == 4L);
assert(candidate(10L) == 36L);
assert(candidate(100L) == 53361L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_149_sorted_list_sum | d | import std.math;
import std.typecons;
/*
Write a function that accepts an array of strings as a parameter,
deletes the strings that have odd lengths from it,
and returns the resulted array with a sorted order,
The array is always an array of strings and never an array of numbers,
and it may contain duplicates.
The orde... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_149_sorted_list_sum.py | reworded | unittest
{
alias candidate = sorted_list_sum;
assert(candidate(["aa", "a", "aaa"]) == ["aa"]);
assert(candidate(["school", "AI", "asdf", "b"]) == ["AI", "asdf", "school"]);
assert(candidate(["d", "b", "c", "a"]) == []);
assert(candidate(["d", "dcba", "abcd", "a"]) == ["abcd", "dcba"]);
assert(c... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_14_all_prefixes | d | import std.math;
import std.typecons;
/*
Return array of all prefixes from shortest to longest of the input string
>>> all_prefixes("abc")
["a", "ab", "abc"]
*/
string[] all_prefixes(string string)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_14_all_prefixes.py | reworded | unittest
{
alias candidate = all_prefixes;
assert(candidate("") == []);
assert(candidate("asdfgh") == ["a", "as", "asd", "asdf", "asdfg", "asdfgh"]);
assert(candidate("WWW") == ["W", "WW", "WWW"]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_150_x_or_y | d | import std.math;
import std.typecons;
/*
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:
>>> x_or_y(7L, 34L, 12L)
34L
>>> x_or_y(15L, 8L, 5L)
5L
*/
long x_or_y(long n, long x, long y)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_150_x_or_y.py | reworded | unittest
{
alias candidate = x_or_y;
assert(candidate(7L, 34L, 12L) == 34L);
assert(candidate(15L, 8L, 5L) == 5L);
assert(candidate(3L, 33L, 5212L) == 33L);
assert(candidate(1259L, 3L, 52L) == 3L);
assert(candidate(7919L, -1L, 12L) == -1L);
assert(candidate(3609L, 1245L, 583L) == 583L);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_151_double_the_difference | d | import std.math;
import std.typecons;
/*
Given an array of numbers, return the sum of squares of the numbers
in the array that are odd. Ignore numbers that are negative or not integers.
>>> double_the_difference([1L, 3L, 2L, 0L])
10L
>>> double_the_difference([-1L, -2L, 0L])
0L
>>> double_the_difference([9L, -2L])
81L
... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_151_double_the_difference.py | reworded | unittest
{
alias candidate = double_the_difference;
assert(candidate([]) == 0L);
assert(candidate([5.0, 4.0]) == 25L);
assert(candidate([0.1, 0.2, 0.3]) == 0L);
assert(candidate([-10.0, -20.0, -30.0]) == 0L);
assert(candidate([-1.0, -2.0, 8.0]) == 0L);
assert(candidate([0.2, 3.0, 5.0]) == 3... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_152_compare | d | import std.math;
import std.typecons;
/*
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 ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_152_compare.py | reworded | unittest
{
alias candidate = compare;
assert(candidate([1L, 2L, 3L, 4L, 5L, 1L], [1L, 2L, 3L, 4L, 2L, -2L]) == [0L, 0L, 0L, 0L, 3L, 3L]);
assert(candidate([0L, 0L, 0L, 0L, 0L, 0L], [0L, 0L, 0L, 0L, 0L, 0L]) == [0L, 0L, 0L, 0L, 0L, 0L]);
assert(candidate([1L, 2L, 3L], [-1L, -2L, -3L]) == [2L, 4L, 6L]);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_153_Strongest_Extension | d | import std.math;
import std.typecons;
/*
You will be given the name of a class (a string) and an array 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 ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_153_Strongest_Extension.py | reworded | unittest
{
alias candidate = Strongest_Extension;
assert(candidate("Watashi", ["tEN", "niNE", "eIGHt8OKe"]) == "Watashi.eIGHt8OKe");
assert(candidate("Boku123", ["nani", "NazeDa", "YEs.WeCaNe", "32145tggg"]) == "Boku123.YEs.WeCaNe");
assert(candidate("__YESIMHERE", ["t", "eMptY", "nothing", "zeR00", "N... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_154_cycpattern_check | d | import std.math;
import std.typecons;
/*
You are given 2 words. You need to return true if the second word or any of its rotations is a substring in the first word
>>> cycpattern_check("abcd", "abd")
false
>>> cycpattern_check("hello", "ell")
true
>>> cycpattern_check("whassup", "psus")
false
>>> cycpattern_check("abab... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_154_cycpattern_check.py | reworded | unittest
{
alias candidate = cycpattern_check;
assert(candidate("xyzw", "xyw") == false);
assert(candidate("yello", "ell") == true);
assert(candidate("whattup", "ptut") == false);
assert(candidate("efef", "fee") == true);
assert(candidate("abab", "aabb") == false);
assert(candidate("winemtt... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_155_even_odd_count | d | import std.math;
import std.typecons;
/*
Given an integer. return a tuple that has the number of even and odd digits respectively.
Example:
>>> even_odd_count(-12L)
tuple(1L, 1L)
>>> even_odd_count(123L)
tuple(1L, 2L)
*/
Tuple!(long, long) even_odd_count(long num)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_155_even_odd_count.py | reworded | unittest
{
alias candidate = even_odd_count;
assert(candidate(7L) == tuple(0L, 1L));
assert(candidate(-78L) == tuple(1L, 1L));
assert(candidate(3452L) == tuple(2L, 2L));
assert(candidate(346211L) == tuple(3L, 3L));
assert(candidate(-345821L) == tuple(3L, 3L));
assert(candidate(-2L) == tuple... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_156_int_to_mini_roman | d | import std.math;
import std.typecons;
/*
Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> int_to_mini_roman(19L)
"xix"
>>> int_to_mini_roman(152L)
"clii"
>>> int_to_mini_roman(426L)
"cdxxvi"
*/
string int_to_mini_roman(lo... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_156_int_to_mini_roman.py | reworded | unittest
{
alias candidate = int_to_mini_roman;
assert(candidate(19L) == "xix");
assert(candidate(152L) == "clii");
assert(candidate(251L) == "ccli");
assert(candidate(426L) == "cdxxvi");
assert(candidate(500L) == "d");
assert(candidate(1L) == "i");
assert(candidate(4L) == "iv");
as... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_157_right_angle_triangle | d | import std.math;
import std.typecons;
/*
Given the lengths of the three sides of a triangle. Return true if the three
sides form a right-angled triangle, false otherwise.
A right-angled triangle is a triangle in which one angle is right angle or
90 degree.
Example:
>>> right_angle_triangle(3L, 4L, 5L)
true
>>> right_a... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_157_right_angle_triangle.py | reworded | unittest
{
alias candidate = right_angle_triangle;
assert(candidate(3L, 4L, 5L) == true);
assert(candidate(1L, 2L, 3L) == false);
assert(candidate(10L, 6L, 8L) == true);
assert(candidate(2L, 2L, 2L) == false);
assert(candidate(7L, 24L, 25L) == true);
assert(candidate(10L, 5L, 7L) == false);... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_158_find_max | d | import std.math;
import std.typecons;
/*
Write a function that accepts an array of strings.
The array contains different words. Return the word with maximum number
of unique characters. If multiple strings have maximum number of unique
characters, return the one which comes first in lexicographical order.
>>> find_max(... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_158_find_max.py | reworded | unittest
{
alias candidate = find_max;
assert(candidate(["name", "of", "string"]) == "string");
assert(candidate(["name", "enam", "game"]) == "enam");
assert(candidate(["aaaaaaa", "bb", "cc"]) == "aaaaaaa");
assert(candidate(["abc", "cba"]) == "abc");
assert(candidate(["play", "this", "game", "... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_159_eat | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_159_eat.py | reworded | unittest
{
alias candidate = eat;
assert(candidate(5L, 6L, 10L) == [11L, 4L]);
assert(candidate(4L, 8L, 9L) == [12L, 1L]);
assert(candidate(1L, 10L, 10L) == [11L, 0L]);
assert(candidate(2L, 11L, 5L) == [7L, 0L]);
assert(candidate(4L, 5L, 7L) == [9L, 2L]);
assert(candidate(4L, 5L, 1L) == [5L... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_15_string_sequence | d | import std.math;
import std.typecons;
/*
Return a string containing space-delimited numbers starting from 0 upto n inclusive.
>>> string_sequence(0L)
"0"
>>> string_sequence(5L)
"0 1 2 3 4 5"
*/
string string_sequence(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_15_string_sequence.py | reworded | unittest
{
alias candidate = string_sequence;
assert(candidate(0L) == "0");
assert(candidate(3L) == "0 1 2 3");
assert(candidate(10L) == "0 1 2 3 4 5 6 7 8 9 10");
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_160_do_algebra | d | import std.math;
import std.typecons;
/*
Given two arrays operator, and operand. The first array has basic algebra operations, and
the second array is an array of integers. Use the two given arrays to build the algebric
expression and return the evaluation of this expression.
The basic algebra operations:
Addition ( ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_160_do_algebra.py | reworded | unittest
{
alias candidate = do_algebra;
assert(candidate(["**", "*", "+"], [2L, 3L, 4L, 5L]) == 37L);
assert(candidate(["+", "*", "-"], [2L, 3L, 4L, 5L]) == 9L);
assert(candidate(["//", "*"], [7L, 3L, 4L]) == 8L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_161_solve | d | import std.math;
import std.typecons;
/*
You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
>>> solve("1234")
"4321"
>>> solve("ab"... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_161_solve.py | reworded | unittest
{
alias candidate = solve;
assert(candidate("AsDf") == "aSdF");
assert(candidate("1234") == "4321");
assert(candidate("ab") == "AB");
assert(candidate("#a@C") == "#A@c");
assert(candidate("#AsdfW^45") == "#aSDFw^45");
assert(candidate("#6@2") == "2@6#");
assert(candidate("#$a^D... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_162_string_to_md5 | d | import std.math;
import std.typecons;
/*
Given a string 'text', return its md5 hash equivalent string.
If 'text' is an empty string, return null.
>>> string_to_md5("Hello world")
"3e25960a79dbc69b674cd4ec67a72c62"
*/
Nullable!(string) string_to_md5(string text)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_162_string_to_md5.py | reworded | unittest
{
alias candidate = string_to_md5;
{
auto result = candidate("Hello world");
assert(!result.isNull && result.get == "3e25960a79dbc69b674cd4ec67a72c62");
}
{
auto result = candidate("");
assert(result.isNull);
}
{
auto result = candidate("A B C");
assert(!r... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_163_generate_integers | d | import std.math;
import std.typecons;
/*
Given two positive integers a and b, return the even digits between a
and b, in ascending order.
For example:
>>> generate_integers(2L, 8L)
[2L, 4L, 6L, 8L]
>>> generate_integers(8L, 2L)
[2L, 4L, 6L, 8L]
>>> generate_integers(10L, 14L)
[]
*/
long[] generate_integers(long a, long... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_163_generate_integers.py | reworded | unittest
{
alias candidate = generate_integers;
assert(candidate(2L, 10L) == [2L, 4L, 6L, 8L]);
assert(candidate(10L, 2L) == [2L, 4L, 6L, 8L]);
assert(candidate(132L, 2L) == [2L, 4L, 6L, 8L]);
assert(candidate(17L, 89L) == []);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_16_count_distinct_characters | d | import std.math;
import std.typecons;
/*
Given a string, find out how many distinct characters (regardless of case) does it consist of
>>> count_distinct_characters("xyzXYZ")
3L
>>> count_distinct_characters("Jerry")
4L
*/
long count_distinct_characters(string string)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_16_count_distinct_characters.py | reworded | unittest
{
alias candidate = count_distinct_characters;
assert(candidate("") == 0L);
assert(candidate("abcde") == 5L);
assert(candidate("abcdecadeCADE") == 5L);
assert(candidate("aaaaAAAAaaaa") == 1L);
assert(candidate("Jerry jERRY JeRRRY") == 5L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_17_parse_music | d | import std.math;
import std.typecons;
/*
Input to this function is a string representing musical notes in a special ASCII format.
Your task is to parse this string and return array of integers corresponding to how many beats does each
not last.
Here is a legend:
'o' - whole note, lasts four beats
'o|' - half note, las... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_17_parse_music.py | reworded | unittest
{
alias candidate = parse_music;
assert(candidate("") == []);
assert(candidate("o o o o") == [4L, 4L, 4L, 4L]);
assert(candidate(".| .| .| .|") == [1L, 1L, 1L, 1L]);
assert(candidate("o| o| .| .| o o o o") == [2L, 2L, 1L, 1L, 4L, 4L, 4L, 4L]);
assert(candidate("o| .| o| .| o o| o o|") ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_18_how_many_times | d | import std.math;
import std.typecons;
/*
Find how many times a given substring can be found in the original string. Count overlaping cases.
>>> how_many_times("", "a")
0L
>>> how_many_times("aaa", "a")
3L
>>> how_many_times("aaaa", "aa")
3L
*/
long how_many_times(string string, string substring)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_18_how_many_times.py | reworded | unittest
{
alias candidate = how_many_times;
assert(candidate("", "x") == 0L);
assert(candidate("xyxyxyx", "x") == 4L);
assert(candidate("cacacacac", "cac") == 4L);
assert(candidate("john doe", "john") == 1L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_19_sort_numbers | d | import std.math;
import std.typecons;
/*
Input is a space-delimited string of numberals from 'zero' to 'nine'.
Valid choices are 'zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight' and 'nine'.
Return the string with numbers sorted from smallest to largest
>>> sort_numbers("three one five")
"one thre... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_19_sort_numbers.py | reworded | unittest
{
alias candidate = sort_numbers;
assert(candidate("") == "");
assert(candidate("three") == "three");
assert(candidate("three five nine") == "three five nine");
assert(candidate("five zero four seven nine eight") == "zero four five seven eight nine");
assert(candidate("six five four th... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_1_separate_paren_groups | d | import std.math;
import std.typecons;
/*
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 array of those.
Separate groups are balanced (each open brace is properly closed) and not nested within each other
Igno... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_1_separate_paren_groups.py | reworded | unittest
{
alias candidate = separate_paren_groups;
assert(candidate("(()()) ((())) () ((())()())") == ["(()())", "((()))", "()", "((())()())"]);
assert(candidate("() (()) ((())) (((())))") == ["()", "(())", "((()))", "(((())))"]);
assert(candidate("(()(())((())))") == ["(()(())((())))"]);
assert(c... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_20_find_closest_elements | d | import std.math;
import std.typecons;
/*
From a supplied array of numbers (of length at least two) select and return two that are the closest to each
other and return them in order (smaller number, larger number).
>>> find_closest_elements([1.0, 2.0, 3.0, 4.0, 5.0, 2.2])
tuple(2.0, 2.2)
>>> find_closest_elements([1.0,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_20_find_closest_elements.py | reworded | unittest
{
alias candidate = find_closest_elements;
assert(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2]) == tuple(3.9, 4.0));
assert(candidate([1.0, 2.0, 5.9, 4.0, 5.0]) == tuple(5.0, 5.9));
assert(candidate([1.0, 2.0, 3.0, 4.0, 5.0, 2.2]) == tuple(2.0, 2.2));
assert(candidate([1.0, 2.0, 3.0, 4.0, 5.0,... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_21_rescale_to_unit | d | import std.math;
import std.typecons;
/*
Given array of numbers (of at least two elements), apply a linear transform to that array,
such that the smallest number will become 0 and the largest will become 1
>>> rescale_to_unit([1.0, 2.0, 3.0, 4.0, 5.0])
[0.0, 0.25, 0.5, 0.75, 1.0]
*/
float[] rescale_to_unit(float[] num... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_21_rescale_to_unit.py | reworded | unittest
{
alias candidate = rescale_to_unit;
assert(candidate([2.0, 49.9]) == [0.0, 1.0]);
assert(candidate([100.0, 49.9]) == [1.0, 0.0]);
assert(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == [0.0, 0.25, 0.5, 0.75, 1.0]);
assert(candidate([2.0, 1.0, 5.0, 3.0, 4.0]) == [0.25, 0.0, 1.0, 0.5, 0.75]);
a... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_23_strlen | d | import std.math;
import std.typecons;
/*
Return length of given string
>>> strlen("")
0L
>>> strlen("abc")
3L
*/
long strlen(string string)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_23_strlen.py | reworded | unittest
{
alias candidate = strlen;
assert(candidate("") == 0L);
assert(candidate("x") == 1L);
assert(candidate("asdasnakj") == 9L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_24_largest_divisor | d | import std.math;
import std.typecons;
/*
For a given number n, find the largest number that divides n evenly, smaller than n
>>> largest_divisor(15L)
5L
*/
long largest_divisor(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_24_largest_divisor.py | reworded | unittest
{
alias candidate = largest_divisor;
assert(candidate(3L) == 1L);
assert(candidate(7L) == 1L);
assert(candidate(10L) == 5L);
assert(candidate(100L) == 50L);
assert(candidate(49L) == 7L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_25_factorize | d | import std.math;
import std.typecons;
/*
Return array of prime factors of given integer in the order from smallest to largest.
Each of the factors should be arrayed number of times corresponding to how many times it appeares in factorization.
Input number should be equal to the product of all factors
>>> factorize(8L)... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_25_factorize.py | reworded | unittest
{
alias candidate = factorize;
assert(candidate(2L) == [2L]);
assert(candidate(4L) == [2L, 2L]);
assert(candidate(8L) == [2L, 2L, 2L]);
assert(candidate(57L) == [3L, 19L]);
assert(candidate(3249L) == [3L, 3L, 19L, 19L]);
assert(candidate(185193L) == [3L, 3L, 3L, 19L, 19L, 19L]);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_26_remove_duplicates | d | import std.math;
import std.typecons;
/*
From an array of integers, remove all elements that occur more than once.
Keep order of elements left the same as in the input.
>>> remove_duplicates([1L, 2L, 3L, 2L, 4L])
[1L, 3L, 4L]
*/
long[] remove_duplicates(long[] numbers)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_26_remove_duplicates.py | reworded | unittest
{
alias candidate = remove_duplicates;
assert(candidate([]) == []);
assert(candidate([1L, 2L, 3L, 4L]) == [1L, 2L, 3L, 4L]);
assert(candidate([1L, 2L, 3L, 2L, 4L, 3L, 5L]) == [1L, 4L, 5L]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_27_flip_case | d | import std.math;
import std.typecons;
/*
For a given string, flip lowercase characters to uppercase and uppercase to lowercase.
>>> flip_case("Hello")
"hELLO"
*/
string flip_case(string string)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_27_flip_case.py | reworded | unittest
{
alias candidate = flip_case;
assert(candidate("") == "");
assert(candidate("Hello!") == "hELLO!");
assert(candidate("These violent delights have violent ends") == "tHESE VIOLENT DELIGHTS HAVE VIOLENT ENDS");
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_28_concatenate | d | import std.math;
import std.typecons;
/*
Concatenate array of strings into a single string
>>> concatenate([])
""
>>> concatenate(["a", "b", "c"])
"abc"
*/
string concatenate(string[] strings)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_28_concatenate.py | reworded | unittest
{
alias candidate = concatenate;
assert(candidate([]) == "");
assert(candidate(["x", "y", "z"]) == "xyz");
assert(candidate(["x", "y", "z", "w", "k"]) == "xyzwk");
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_29_filter_by_prefix | d | import std.math;
import std.typecons;
/*
Filter an input array of strings only for ones that start with a given prefix.
>>> filter_by_prefix([], "a")
[]
>>> filter_by_prefix(["abc", "bcd", "cde", "array"], "a")
["abc", "array"]
*/
string[] filter_by_prefix(string[] strings, string prefix)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_29_filter_by_prefix.py | reworded | unittest
{
alias candidate = filter_by_prefix;
assert(candidate([], "john") == []);
assert(candidate(["xxx", "asd", "xxy", "john doe", "xxxAAA", "xxx"], "xxx") == ["xxx", "xxxAAA", "xxx"]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_2_truncate_number | d | import std.math;
import std.typecons;
/*
Given a positive floating point number, it can be decomposed into
and integer part (largest integer smaller than given number) and decimals
(leftover part always smaller than 1).
Return the decimal part of the number.
>>> truncate_number(3.5)
0.5
*/
float truncate_number(float ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_2_truncate_number.py | reworded | unittest
{
alias candidate = truncate_number;
assert(candidate(3.5) == 0.5);
assert(candidate(1.25) == 0.25);
assert(candidate(123.0) == 0.0);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_30_get_positive | d | import std.math;
import std.typecons;
/*
Return only positive numbers in the array.
>>> get_positive([-1L, 2L, -4L, 5L, 6L])
[2L, 5L, 6L]
>>> get_positive([5L, 3L, -5L, 2L, -3L, 3L, 9L, 0L, 123L, 1L, -10L])
[5L, 3L, 2L, 3L, 9L, 123L, 1L]
*/
long[] get_positive(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_30_get_positive.py | reworded | unittest
{
alias candidate = get_positive;
assert(candidate([-1L, -2L, 4L, 5L, 6L]) == [4L, 5L, 6L]);
assert(candidate([5L, 3L, -5L, 2L, 3L, 3L, 9L, 0L, 123L, 1L, -10L]) == [5L, 3L, 2L, 3L, 3L, 9L, 123L, 1L]);
assert(candidate([-1L, -2L]) == []);
assert(candidate([]) == []);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_31_is_prime | d | import std.math;
import std.typecons;
/*
Return true if a given number is prime, and false otherwise.
>>> is_prime(6L)
false
>>> is_prime(101L)
true
>>> is_prime(11L)
true
>>> is_prime(13441L)
true
>>> is_prime(61L)
true
>>> is_prime(4L)
false
>>> is_prime(1L)
false
*/
bool is_prime(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_31_is_prime.py | reworded | unittest
{
alias candidate = is_prime;
assert(candidate(6L) == false);
assert(candidate(101L) == true);
assert(candidate(11L) == true);
assert(candidate(13441L) == true);
assert(candidate(61L) == true);
assert(candidate(4L) == false);
assert(candidate(1L) == false);
assert(candidate... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_33_sort_third | d | import std.math;
import std.typecons;
/*
This function takes an array l and returns an array l' such that
l' is identical to l in the indicies that are not divisible by three, while its values at the indicies that are divisible by three are equal
to the values of the corresponding indicies of l, but sorted.
>>> sort_th... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_33_sort_third.py | reworded | unittest
{
alias candidate = sort_third;
assert(candidate([5L, 6L, 3L, 4L, 8L, 9L, 2L]) == [2L, 6L, 3L, 4L, 8L, 9L, 5L]);
assert(candidate([5L, 8L, 3L, 4L, 6L, 9L, 2L]) == [2L, 8L, 3L, 4L, 6L, 9L, 5L]);
assert(candidate([5L, 6L, 9L, 4L, 8L, 3L, 2L]) == [2L, 6L, 9L, 4L, 8L, 3L, 5L]);
assert(candidat... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_34_unique | d | import std.math;
import std.typecons;
/*
Return sorted unique elements in an array
>>> unique([5L, 3L, 5L, 2L, 3L, 3L, 9L, 0L, 123L])
[0L, 2L, 3L, 5L, 9L, 123L]
*/
long[] unique(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_34_unique.py | reworded | unittest
{
alias candidate = unique;
assert(candidate([5L, 3L, 5L, 2L, 3L, 3L, 9L, 0L, 123L]) == [0L, 2L, 3L, 5L, 9L, 123L]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_35_max_element | d | import std.math;
import std.typecons;
/*
Return maximum element in the array.
>>> max_element([1L, 2L, 3L])
3L
>>> max_element([5L, 3L, -5L, 2L, -3L, 3L, 9L, 0L, 123L, 1L, -10L])
123L
*/
long max_element(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_35_max_element.py | reworded | unittest
{
alias candidate = max_element;
assert(candidate([1L, 2L, 3L]) == 3L);
assert(candidate([5L, 3L, -5L, 2L, -3L, 3L, 9L, 0L, 124L, 1L, -10L]) == 124L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_36_fizz_buzz | d | import std.math;
import std.typecons;
/*
Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
>>> fizz_buzz(50L)
0L
>>> fizz_buzz(78L)
2L
>>> fizz_buzz(79L)
3L
*/
long fizz_buzz(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_36_fizz_buzz.py | reworded | unittest
{
alias candidate = fizz_buzz;
assert(candidate(50L) == 0L);
assert(candidate(78L) == 2L);
assert(candidate(79L) == 3L);
assert(candidate(100L) == 3L);
assert(candidate(200L) == 6L);
assert(candidate(4000L) == 192L);
assert(candidate(10000L) == 639L);
assert(candidate(10000... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_37_sort_even | d | import std.math;
import std.typecons;
/*
This function takes an array l and returns an array l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
>>> sort_even([1L, 2L, 3L])
[1L, 2L, 3L]
>>> sort_even([5L, 6L, 3L, 4L]... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_37_sort_even.py | reworded | unittest
{
alias candidate = sort_even;
assert(candidate([1L, 2L, 3L]) == [1L, 2L, 3L]);
assert(candidate([5L, 3L, -5L, 2L, -3L, 3L, 9L, 0L, 123L, 1L, -10L]) == [-10L, 3L, -5L, 2L, -3L, 3L, 5L, 0L, 9L, 1L, 123L]);
assert(candidate([5L, 8L, -12L, 4L, 23L, 2L, 3L, 11L, 12L, -10L]) == [-12L, 8L, 3L, 4L, 5... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_39_prime_fib | d | import std.math;
import std.typecons;
/*
prime_fib returns n-th number that is a Fibonacci number and it's also prime.
>>> prime_fib(1L)
2L
>>> prime_fib(2L)
3L
>>> prime_fib(3L)
5L
>>> prime_fib(4L)
13L
>>> prime_fib(5L)
89L
*/
long prime_fib(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_39_prime_fib.py | reworded | unittest
{
alias candidate = prime_fib;
assert(candidate(1L) == 2L);
assert(candidate(2L) == 3L);
assert(candidate(3L) == 5L);
assert(candidate(4L) == 13L);
assert(candidate(5L) == 89L);
assert(candidate(6L) == 233L);
assert(candidate(7L) == 1597L);
assert(candidate(8L) == 28657L);
... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_3_below_zero | d | import std.math;
import std.typecons;
/*
You're given an array 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.
>>> belo... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_3_below_zero.py | reworded | unittest
{
alias candidate = below_zero;
assert(candidate([]) == false);
assert(candidate([1L, 2L, -3L, 1L, 2L, -3L]) == false);
assert(candidate([1L, 2L, -4L, 5L, 6L]) == true);
assert(candidate([1L, -1L, 2L, -2L, 5L, -5L, 4L, -4L]) == false);
assert(candidate([1L, -1L, 2L, -2L, 5L, -5L, 4L, -... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_40_triples_sum_to_zero | d | import std.math;
import std.typecons;
/*
triples_sum_to_zero takes an array of integers as an input.
it returns true if there are three distinct elements in the array that
sum to zero, and false otherwise.
>>> triples_sum_to_zero([1L, 3L, 5L, 0L])
false
>>> triples_sum_to_zero([1L, 3L, -2L, 1L])
true
>>> triples_sum_to... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_40_triples_sum_to_zero.py | reworded | unittest
{
alias candidate = triples_sum_to_zero;
assert(candidate([1L, 3L, 5L, 0L]) == false);
assert(candidate([1L, 3L, 5L, -1L]) == false);
assert(candidate([1L, 3L, -2L, 1L]) == true);
assert(candidate([1L, 2L, 3L, 7L]) == false);
assert(candidate([1L, 2L, 5L, 7L]) == false);
assert(can... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_41_car_race_collision | d | import std.math;
import std.typecons;
/*
Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right; simultaneously, a different set of n cars
are driving right to left. The two sets of cars start out being very far from
each other. All cars move in the same speed. Two cars a... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_41_car_race_collision.py | reworded | unittest
{
alias candidate = car_race_collision;
assert(candidate(2L) == 4L);
assert(candidate(3L) == 9L);
assert(candidate(4L) == 16L);
assert(candidate(8L) == 64L);
assert(candidate(10L) == 100L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_42_incr_list | d | import std.math;
import std.typecons;
/*
Return array with elements incremented by 1.
>>> incr_list([1L, 2L, 3L])
[2L, 3L, 4L]
>>> incr_list([5L, 3L, 5L, 2L, 3L, 3L, 9L, 0L, 123L])
[6L, 4L, 6L, 3L, 4L, 4L, 10L, 1L, 124L]
*/
long[] incr_list(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_42_incr_list.py | reworded | unittest
{
alias candidate = incr_list;
assert(candidate([]) == []);
assert(candidate([3L, 2L, 1L]) == [4L, 3L, 2L]);
assert(candidate([5L, 2L, 5L, 2L, 3L, 3L, 9L, 0L, 123L]) == [6L, 3L, 6L, 3L, 4L, 4L, 10L, 1L, 124L]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_43_pairs_sum_to_zero | d | import std.math;
import std.typecons;
/*
pairs_sum_to_zero takes an array of integers as an input.
it returns true if there are two distinct elements in the array that
sum to zero, and false otherwise.
>>> pairs_sum_to_zero([1L, 3L, 5L, 0L])
false
>>> pairs_sum_to_zero([1L, 3L, -2L, 1L])
false
>>> pairs_sum_to_zero([1L... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_43_pairs_sum_to_zero.py | reworded | unittest
{
alias candidate = pairs_sum_to_zero;
assert(candidate([1L, 3L, 5L, 0L]) == false);
assert(candidate([1L, 3L, -2L, 1L]) == false);
assert(candidate([1L, 2L, 3L, 7L]) == false);
assert(candidate([2L, 4L, -5L, 3L, 5L, 7L]) == true);
assert(candidate([1L]) == false);
assert(candidate... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_44_change_base | d | import std.math;
import std.typecons;
/*
Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
>>> change_base(8L, 3L)
"22"
>>> change_base(8L, 2L)
"1000"
>>> change_base(7L, 2L)
"111"
*/
string change_base(long x, long base)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_44_change_base.py | reworded | unittest
{
alias candidate = change_base;
assert(candidate(8L, 3L) == "22");
assert(candidate(9L, 3L) == "100");
assert(candidate(234L, 2L) == "11101010");
assert(candidate(16L, 2L) == "10000");
assert(candidate(8L, 2L) == "1000");
assert(candidate(7L, 2L) == "111");
assert(candidate(2L... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_45_triangle_area | d | import std.math;
import std.typecons;
/*
Given length of a side and high return area for a triangle.
>>> triangle_area(5L, 3L)
7.5
*/
float triangle_area(long a, long h)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_45_triangle_area.py | reworded | unittest
{
alias candidate = triangle_area;
assert(candidate(5L, 3L) == 7.5);
assert(candidate(2L, 2L) == 2.0);
assert(candidate(10L, 8L) == 40.0);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_46_fib4 | d | import std.math;
import std.typecons;
/*
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 t... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_46_fib4.py | reworded | unittest
{
alias candidate = fib4;
assert(candidate(5L) == 4L);
assert(candidate(8L) == 28L);
assert(candidate(10L) == 104L);
assert(candidate(12L) == 386L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_47_median | d | import std.math;
import std.typecons;
/*
Return median of elements in the array l.
>>> median([3L, 1L, 2L, 4L, 5L])
3L
>>> median([-10L, 4L, 6L, 1000L, 10L, 20L])
15.0
*/
float median(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_47_median.py | reworded | unittest
{
alias candidate = median;
assert(candidate([3L, 1L, 2L, 4L, 5L]) == 3L);
assert(candidate([-10L, 4L, 6L, 1000L, 10L, 20L]) == 8.0);
assert(candidate([5L]) == 5L);
assert(candidate([6L, 5L]) == 5.5);
assert(candidate([8L, 1L, 3L, 9L, 9L, 2L, 7L]) == 7L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_48_is_palindrome | d | import std.math;
import std.typecons;
/*
Checks if given string is a palindrome
>>> is_palindrome("")
true
>>> is_palindrome("aba")
true
>>> is_palindrome("aaaaa")
true
>>> is_palindrome("zbcd")
false
*/
bool is_palindrome(string text)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_48_is_palindrome.py | reworded | unittest
{
alias candidate = is_palindrome;
assert(candidate("") == true);
assert(candidate("aba") == true);
assert(candidate("aaaaa") == true);
assert(candidate("zbcd") == false);
assert(candidate("xywyx") == true);
assert(candidate("xywyz") == false);
assert(candidate("xywzx") == fals... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_49_modp | d | import std.math;
import std.typecons;
/*
Return 2^n modulo p (be aware of numerics).
>>> modp(3L, 5L)
3L
>>> modp(1101L, 101L)
2L
>>> modp(0L, 101L)
1L
>>> modp(3L, 11L)
8L
>>> modp(100L, 101L)
1L
*/
long modp(long n, long p)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_49_modp.py | reworded | unittest
{
alias candidate = modp;
assert(candidate(3L, 5L) == 3L);
assert(candidate(1101L, 101L) == 2L);
assert(candidate(0L, 101L) == 1L);
assert(candidate(3L, 11L) == 8L);
assert(candidate(100L, 101L) == 1L);
assert(candidate(30L, 5L) == 4L);
assert(candidate(31L, 5L) == 3L);
}
void ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_4_mean_absolute_deviation | d | import std.math;
import std.typecons;
/*
For a given array of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
>>> mean_absolute_deviation... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_4_mean_absolute_deviation.py | reworded | unittest
{
alias candidate = mean_absolute_deviation;
assert(candidate([1.0, 2.0]) == 0.5);
assert(candidate([1.0, 2.0, 3.0, 4.0]) == 1.0);
assert(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == 1.2);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_51_remove_vowels | d | import std.math;
import std.typecons;
/*
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"
*/
string remove_vowels(string text)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_51_remove_vowels.py | reworded | unittest
{
alias candidate = remove_vowels;
assert(candidate("") == "");
assert(candidate("abcdef
ghijklm") == "bcdf
ghjklm");
assert(candidate("fedcba") == "fdcb");
assert(candidate("eeeee") == "");
assert(candidate("acBAA") == "cB");
assert(candidate("EcBOO") == "cB");
assert(candidat... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_52_below_threshold | d | import std.math;
import std.typecons;
/*
Return true if all numbers in the array l are below threshold t.
>>> below_threshold([1L, 2L, 4L, 10L], 100L)
true
>>> below_threshold([1L, 20L, 4L, 10L], 5L)
false
*/
bool below_threshold(long[] l, long t)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_52_below_threshold.py | reworded | unittest
{
alias candidate = below_threshold;
assert(candidate([1L, 2L, 4L, 10L], 100L) == true);
assert(candidate([1L, 20L, 4L, 10L], 5L) == false);
assert(candidate([1L, 20L, 4L, 10L], 21L) == true);
assert(candidate([1L, 20L, 4L, 10L], 22L) == true);
assert(candidate([1L, 8L, 4L, 10L], 11L) ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_53_add | d | import std.math;
import std.typecons;
/*
Add two numbers x and y
>>> add(2L, 3L)
5L
>>> add(5L, 7L)
12L
*/
long add(long x, long y)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_53_add.py | reworded | unittest
{
alias candidate = add;
assert(candidate(0L, 1L) == 1L);
assert(candidate(1L, 0L) == 1L);
assert(candidate(2L, 3L) == 5L);
assert(candidate(5L, 7L) == 12L);
assert(candidate(7L, 5L) == 12L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_54_same_chars | d | import std.math;
import std.typecons;
/*
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
>>> sam... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_54_same_chars.py | reworded | unittest
{
alias candidate = same_chars;
assert(candidate("eabcdzzzz", "dddzzzzzzzddeddabc") == true);
assert(candidate("abcd", "dddddddabc") == true);
assert(candidate("dddddddabc", "abcd") == true);
assert(candidate("eabcd", "dddddddabc") == false);
assert(candidate("abcd", "dddddddabcf") == ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_55_fib | d | import std.math;
import std.typecons;
/*
Return n-th Fibonacci number.
>>> fib(10L)
55L
>>> fib(1L)
1L
>>> fib(8L)
21L
*/
long fib(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_55_fib.py | reworded | unittest
{
alias candidate = fib;
assert(candidate(10L) == 55L);
assert(candidate(1L) == 1L);
assert(candidate(8L) == 21L);
assert(candidate(11L) == 89L);
assert(candidate(12L) == 144L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_56_correct_bracketing | d | import std.math;
import std.typecons;
/*
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
*/
bool correct_bracketi... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_56_correct_bracketing.py | reworded | unittest
{
alias candidate = correct_bracketing;
assert(candidate("<>") == true);
assert(candidate("<<><>>") == true);
assert(candidate("<><><<><>><>") == true);
assert(candidate("<><><<<><><>><>><<><><<>>>") == true);
assert(candidate("<<<><>>>>") == false);
assert(candidate("><<>") == fal... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_57_monotonic | d | import std.math;
import std.typecons;
/*
Return true is array elements are monotonically increasing or decreasing.
>>> monotonic([1L, 2L, 4L, 20L])
true
>>> monotonic([1L, 20L, 4L, 10L])
false
>>> monotonic([4L, 1L, 0L, -10L])
true
*/
bool monotonic(long[] l)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_57_monotonic.py | reworded | unittest
{
alias candidate = monotonic;
assert(candidate([1L, 2L, 4L, 10L]) == true);
assert(candidate([1L, 2L, 4L, 20L]) == true);
assert(candidate([1L, 20L, 4L, 10L]) == false);
assert(candidate([4L, 1L, 0L, -10L]) == true);
assert(candidate([4L, 1L, 1L, 0L]) == true);
assert(candidate([1... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_58_common | d | import std.math;
import std.typecons;
/*
Return sorted unique common elements for two arrays.
>>> common([1L, 4L, 3L, 34L, 653L, 2L, 5L], [5L, 7L, 1L, 5L, 9L, 653L, 121L])
[1L, 5L, 653L]
>>> common([5L, 3L, 2L, 8L], [3L, 2L])
[2L, 3L]
*/
long[] common(long[] l1, long[] l2)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_58_common.py | reworded | unittest
{
alias candidate = common;
assert(candidate([1L, 4L, 3L, 34L, 653L, 2L, 5L], [5L, 7L, 1L, 5L, 9L, 653L, 121L]) == [1L, 5L, 653L]);
assert(candidate([5L, 3L, 2L, 8L], [3L, 2L]) == [2L, 3L]);
assert(candidate([4L, 3L, 2L, 8L], [3L, 2L, 4L]) == [2L, 3L, 4L]);
assert(candidate([4L, 3L, 2L, 8L... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_59_largest_prime_factor | d | import std.math;
import std.typecons;
/*
Return the largest prime factor of n. Assume n > 1 and is not a prime.
>>> largest_prime_factor(13195L)
29L
>>> largest_prime_factor(2048L)
2L
*/
long largest_prime_factor(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_59_largest_prime_factor.py | reworded | unittest
{
alias candidate = largest_prime_factor;
assert(candidate(15L) == 5L);
assert(candidate(27L) == 3L);
assert(candidate(63L) == 7L);
assert(candidate(330L) == 11L);
assert(candidate(13195L) == 29L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_5_intersperse | d | import std.math;
import std.typecons;
/*
Insert a number 'delimeter' between every two consecutive elements of input array `numbers'
>>> intersperse([], 4L)
[]
>>> intersperse([1L, 2L, 3L], 4L)
[1L, 4L, 2L, 4L, 3L]
*/
long[] intersperse(long[] numbers, long delimeter)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_5_intersperse.py | reworded | unittest
{
alias candidate = intersperse;
assert(candidate([], 7L) == []);
assert(candidate([5L, 6L, 3L, 2L], 8L) == [5L, 8L, 6L, 8L, 3L, 8L, 2L]);
assert(candidate([2L, 2L, 2L], 2L) == [2L, 2L, 2L, 2L, 2L]);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_60_sum_to_n | d | import std.math;
import std.typecons;
/*
sum_to_n is a function that sums numbers from 1 to n.
>>> sum_to_n(30L)
465L
>>> sum_to_n(100L)
5050L
>>> sum_to_n(5L)
15L
>>> sum_to_n(10L)
55L
>>> sum_to_n(1L)
1L
*/
long sum_to_n(long n)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_60_sum_to_n.py | reworded | unittest
{
alias candidate = sum_to_n;
assert(candidate(1L) == 1L);
assert(candidate(6L) == 21L);
assert(candidate(11L) == 66L);
assert(candidate(30L) == 465L);
assert(candidate(100L) == 5050L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_61_correct_bracketing | d | import std.math;
import std.typecons;
/*
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
*/
bool correct_bracketi... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_61_correct_bracketing.py | reworded | unittest
{
alias candidate = correct_bracketing;
assert(candidate("()") == true);
assert(candidate("(()())") == true);
assert(candidate("()()(()())()") == true);
assert(candidate("()()((()()())())(()()(()))") == true);
assert(candidate("((()())))") == false);
assert(candidate(")(()") == fal... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_62_derivative | d | import std.math;
import std.typecons;
/*
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([3L, 1L, 2L, 4L, 5L])
[1L, 4L, 12L, 20L]
>>> derivative([1L, 2L, 3L])
[2L, 6L]
*/
long[] derivative(long[] xs)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_62_derivative.py | reworded | unittest
{
alias candidate = derivative;
assert(candidate([3L, 1L, 2L, 4L, 5L]) == [1L, 4L, 12L, 20L]);
assert(candidate([1L, 2L, 3L]) == [2L, 6L]);
assert(candidate([3L, 2L, 1L]) == [2L, 2L]);
assert(candidate([3L, 2L, 1L, 0L, 4L]) == [2L, 2L, 0L, 16L]);
assert(candidate([1L]) == []);
}
void m... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_63_fibfib | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_63_fibfib.py | reworded | unittest
{
alias candidate = fibfib;
assert(candidate(2L) == 1L);
assert(candidate(1L) == 0L);
assert(candidate(5L) == 4L);
assert(candidate(8L) == 24L);
assert(candidate(10L) == 81L);
assert(candidate(12L) == 274L);
assert(candidate(14L) == 927L);
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_64_vowels_count | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_64_vowels_count.py | reworded | unittest
{
alias candidate = vowels_count;
assert(candidate("abcde") == 2L);
assert(candidate("Alone") == 3L);
assert(candidate("key") == 2L);
assert(candidate("bye") == 1L);
assert(candidate("keY") == 2L);
assert(candidate("bYe") == 1L);
assert(candidate("ACEDY") == 3L);
}
void main(){... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_65_circular_shift | d | import std.math;
import std.typecons;
/*
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(12L, 1L)
"21"
>>> circular_shift(12L, 2L)
"12"
*/
string circular_shift(long x, long shift)
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_65_circular_shift.py | reworded | unittest
{
alias candidate = circular_shift;
assert(candidate(100L, 2L) == "001");
assert(candidate(12L, 2L) == "12");
assert(candidate(97L, 8L) == "79");
assert(candidate(12L, 1L) == "21");
assert(candidate(11L, 101L) == "11");
}
void main(){} | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_66_digitSum | d | import std.math;
import std.typecons;
/*
Task
Write a function that takes a string as input and returns the sum of the upper characters only'
ASCII codes.
Examples:
>>> digitSum("")
0L
>>> digitSum("abAB")
131L
>>> digitSum("abcCd")
67L
>>> digitSum("helloE")
69L
>>> digitSum("woArBld")
131L
>>> digitSum("aAaaaXa")
153... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_66_digitSum.py | reworded | unittest
{
alias candidate = digitSum;
assert(candidate("") == 0L);
assert(candidate("abAB") == 131L);
assert(candidate("abcCd") == 67L);
assert(candidate("helloE") == 69L);
assert(candidate("woArBld") == 131L);
assert(candidate("aAaaaXa") == 153L);
assert(candidate(" How are yOu?") == ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_67_fruit_distribution | d | import std.math;
import std.typecons;
/*
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... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_67_fruit_distribution.py | reworded | unittest
{
alias candidate = fruit_distribution;
assert(candidate("5 apples and 6 oranges", 19L) == 8L);
assert(candidate("5 apples and 6 oranges", 21L) == 10L);
assert(candidate("0 apples and 1 oranges", 3L) == 2L);
assert(candidate("1 apples and 0 oranges", 3L) == 2L);
assert(candidate("2 app... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
HumanEval_68_pluck | d | import std.math;
import std.typecons;
/*
"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 no... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_68_pluck.py | reworded | unittest
{
alias candidate = pluck;
assert(candidate([4L, 2L, 3L]) == [2L, 1L]);
assert(candidate([1L, 2L, 3L]) == [2L, 1L]);
assert(candidate([]) == []);
assert(candidate([5L, 0L, 3L, 0L, 4L, 2L]) == [0L, 1L]);
assert(candidate([1L, 2L, 3L, 0L, 5L, 3L]) == [0L, 3L]);
assert(candidate([5L, ... | [
"\n\n",
"\nvoid",
"\nbool",
"\nint"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.