Question

Define the function my_reduce() such that it emulates reduce(). Like the real reduce(), it must take a binary function (possibly None), an iterable and an optional seed. If the iterable is empty and there's no seed, my_reduce() raises a TypeError exception. If the iterable is empty and there is a seed, my_reduce() returns the seed. If the iterable is not empty and there's no seed, the first element of the iterable becomes the seed. Assume the iterable is not indexable. It must use * to detect the optionality of the seed. It must make only one pass through the iterable. It must not use reduce(). No need to check the preconditions. Your function must pass the below test case, test_reduce(). Hint: exploit the fact that you can use a for-loop with an iterator. Note: sub(x, y) will return x - y def test_reduce(): try: \tmy_reduce(sub, []) \tassert False except TypeError: \tpass assert my_reduce(None, [], 0) == 0 assert my_reduce(None, [2], 2) == 2 assert my_reduce(sub, [2], 0) == -2 assert my_reduce(sub, [2, 3, 4], 0) == -5 assert my_reduce(sub, [2, 3, 4], 0) == -9

          Define the function my_reduce() such that it emulates reduce().
Like the real reduce(), it must take a binary function (possibly None), an iterable and an optional seed.
If the iterable is empty and there's no seed, my_reduce() raises a TypeError exception.
If the iterable is empty and there is a seed, my_reduce() returns the seed.
If the iterable is not empty and there's no seed, the first element of the iterable becomes the seed.
Assume the iterable is not indexable.
It must use * to detect the optionality of the seed.
It must make only one pass through the iterable.
It must not use reduce().
No need to check the preconditions.
Your function must pass the below test case, test_reduce().
Hint: exploit the fact that you can use a for-loop with an iterator.
Note: sub(x, y) will return x - y
def test_reduce():
try:
\tmy_reduce(sub, [])
\tassert False
except TypeError:
\tpass
assert my_reduce(None, [], 0) == 0
assert my_reduce(None, [2], 2) == 2
assert my_reduce(sub, [2], 0) == -2
assert my_reduce(sub, [2, 3, 4], 0) == -5
assert my_reduce(sub, [2, 3, 4], 0) == -9

Define the function myreduce() such that it emulates reduce().
Like the real reduce(), it must take a binary function (possibly None), an iterable and an optional seed.
If the iterable is empty and there's no seed, myreduce() raises a TypeError exception.
If the iterable is empty and there is a seed, myreduce() returns the seed.
If the iterable is not empty and there's no seed, the first element of the iterable becomes the seed.
Assume the iterable is not indexable.
It must use * to detect the optionality of the seed.
It must make only one pass through the iterable.
It must not use reduce().
No need to check the preconditions.
Your function must pass the below test case, testreduce().
Hint: exploit the fact that you can use a for-loop with an iterator.
Note: sub(x, y) will return x - y
def testreduce():
try:
(sub, [])
False
except TypeError:
assert myreduce(None, [], 0) == 0
assert myreduce(None, [2], 2) == 2
assert myreduce(sub, [2], 0) == -2
assert myreduce(sub, [2, 3, 4], 0) == -5
assert myreduce(sub, [2, 3, 4], 0) == -9

Added by Ian S.

Question

Please give Ace some feedback