prefix stringlengths 65 1.8k | suffix stringclasses 839
values | solution stringlengths 6 859 | test_cases listlengths 0 100 | import_str listlengths 0 1 | demos listlengths 0 8 | entry_func stringclasses 158
values | data_id stringlengths 36 40 | doc_string stringclasses 164
values | dataset_name stringclasses 1
value | task_name stringclasses 1
value | compare_func listlengths 0 0 | src_lang stringclasses 1
value | tgt_lang stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L2 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L3 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| is_prime = False
break
if is_prime:
primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L4 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| break
if is_prime:
primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L5 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| if is_prime:
primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| primes.append(i)
return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| return primes
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
| for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L1_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| is_prime = True
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L2 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| is_prime = True
for j in range(2, i):
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L3 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| is_prime = False
break
if is_prime:
primes.append(i)
return primes
| is_prime = True
for j in range(2, i):
if i % j == 0:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L4 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| break
if is_prime:
primes.append(i)
return primes
| is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L5 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| if is_prime:
primes.append(i)
return primes
| is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| primes.append(i)
return primes
| is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| return primes
| is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
| is_prime = True
for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L2_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| for j in range(2, i):
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L3 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| is_prime = False
break
if is_prime:
primes.append(i)
return primes
| for j in range(2, i):
if i % j == 0:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L4 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| break
if is_prime:
primes.append(i)
return primes
| for j in range(2, i):
if i % j == 0:
is_prime = False
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L5 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| if is_prime:
primes.append(i)
return primes
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| primes.append(i)
return primes
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| return primes
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
| for j in range(2, i):
if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L3_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| is_prime = False
break
if is_prime:
primes.append(i)
return primes
| if i % j == 0:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L4 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| break
if is_prime:
primes.append(i)
return primes
| if i % j == 0:
is_prime = False
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L5 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| if is_prime:
primes.append(i)
return primes
| if i % j == 0:
is_prime = False
break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| primes.append(i)
return primes
| if i % j == 0:
is_prime = False
break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| return primes
| if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
| if i % j == 0:
is_prime = False
break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L4_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| break
if is_prime:
primes.append(i)
return primes
| is_prime = False
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L5_L5 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| if is_prime:
primes.append(i)
return primes
| is_prime = False
break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L5_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| primes.append(i)
return primes
| is_prime = False
break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L5_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| return primes
| is_prime = False
break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L5_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
| is_prime = False
break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L5_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | if is_prime:
primes.append(i)
return primes
| break
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L6_L6 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | primes.append(i)
return primes
| break
if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L6_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | return primes
| break
if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L6_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | break
if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L6_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | primes.append(i)
return primes
| if is_prime:
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L7_L7 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | return primes
| if is_prime:
primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L7_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | if is_prime:
primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L7_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | return primes
| primes.append(i)
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L8_L8 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | primes.append(i)
return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L8_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_up_to(n):
"""Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n.
"""
primes = []
for i in range(2, n):
is_prime = True
for j in range(2, i):
if i % j == 0:
... | return primes
| [
[
"5",
"[2,3]"
],
[
"6",
"[2,3,5]"
],
[
"7",
"[2,3,5]"
],
[
"10",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"22",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
],
[
"47",
"[2, 3, 5, 7, 11, 13, 17, ... | [] | [
[
"5",
"[2,3]"
],
[
"11",
"[2,3,5,7]"
],
[
"0",
"[]"
],
[
"20",
"[2,3,5,7,11,13,17,19]"
],
[
"1",
"[]"
],
[
"18",
"[2,3,5,7,11,13,17]"
]
] | count_up_to | MultiLineInfilling/HumanEval/96/L9_L9 | Implement a function that takes an non-negative integer and returns an array of the first n
integers that are prime numbers and less than n. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def multiply(a, b):
"""Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid.
"""
| return abs(a % 10) * abs(b % 10)
| [
[
"148, 412",
"16"
],
[
"19, 28",
"72"
],
[
"2020, 1851",
"0"
],
[
"14, -15",
"20"
],
[
"76, 67",
"42"
],
[
"17, 27",
"49"
],
[
"0, 1",
"0"
],
[
"0, 0",
"0"
]
] | [] | [
[
"148, 412",
"16"
],
[
"19, 28",
"72"
],
[
"2020, 1851",
"0"
],
[
"14, -15",
"20"
]
] | multiply | MultiLineInfilling/HumanEval/97/L0_L0 | Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
| for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
return count
| count = 0
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L0_L0 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
| if s[i] in "AEIOU":
count += 1
return count
| count = 0
for i in range(0,len(s),2):
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L0_L1 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
| count += 1
return count
| count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L0_L2 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
| return count
| count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L0_L3 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
| count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
return count
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L0_L4 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
| if s[i] in "AEIOU":
count += 1
return count
| for i in range(0,len(s),2):
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L1_L1 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
| count += 1
return count
| for i in range(0,len(s),2):
if s[i] in "AEIOU":
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L1_L2 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
| return count
| for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L1_L3 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
| for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
return count
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L1_L4 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
| count += 1
return count
| if s[i] in "AEIOU":
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L2_L2 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
| return count
| if s[i] in "AEIOU":
count += 1
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L2_L3 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
| if s[i] in "AEIOU":
count += 1
return count
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L2_L4 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
| return count
| count += 1
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L3_L3 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
| count += 1
return count
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L3_L4 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
"""
count = 0
for i in range(0,len(s),2):
if s[i] in "AEIOU":
count += 1
| return count
| [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
],
[
"'B'",
"0"
],
[
"'U'",
"1"
],
[
"''",
"0"
],
[
"'EEEE'",
"2"
]
] | [] | [
[
"'aBCdEf'",
"1"
],
[
"'abcdefg'",
"0"
],
[
"'dBBE'",
"0"
]
] | count_upper | MultiLineInfilling/HumanEval/98/L4_L4 | Given a string s, count the number of uppercase vowels in even indices. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
|
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(n... | from math import floor, ceil
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L0 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
... | from math import floor, ceil
if value.count('.') == 1:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L2 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L3 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L4 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
|
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L5 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L7 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L8 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L9 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L10 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L11 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L12 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| res = int(round(num))
else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(valu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L13 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| else:
res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(valu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L14 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| res = 0
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(valu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L15 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
|
return res
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(valu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L16 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
| from math import floor, ceil
if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(valu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L0_L18 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
... | if value.count('.') == 1:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L2 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L3 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L4 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
|
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L5 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L7 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L8 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L9 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L10 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L11 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L12 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| res = int(round(num))
else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L13 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| else:
res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(nu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L14 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| res = 0
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(nu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L15 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
|
return res
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(nu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L16 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
| if value.count('.') == 1:
# remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(nu... | [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L2_L18 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python | |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L3 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L4 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
|
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L5 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L7 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| if num > 0:
res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L8 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| res = ceil(num)
else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L9 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| else:
res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L10 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| res = floor(num)
elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L11 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
def closest_integer(value):
"""
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
"""
from math import floor, ceil
if value.count('.') == 1:
| elif len(value) > 0:
res = int(round(num))
else:
res = 0
return res
| # remove trailing zeros
while (value[-1] == '0'):
value = value[:-1]
num = float(value)
if value[-2:] == '.5':
if num > 0:
res = ceil(num)
else:
res = floor(num)
| [
[
"\"10\"",
"10"
],
[
"\"14.5\"",
"15"
],
[
"\"-15.5\"",
"-16"
],
[
"\"15.3\"",
"15"
],
[
"\"0\"",
"0"
]
] | [] | [
[
"\"10\"",
"10"
],
[
"\"15.3\"",
"15"
]
] | closest_integer | MultiLineInfilling/HumanEval/99/L3_L12 | Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero. | HumanEval_MultiLineInfilling | code_infilling | [] | python | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.