A
common implementation involves calling a set of functions sequentially with the
results of the previous call be passed to the subsequent call.

from math import sqrt, ceil def transform(value): x = float(value) x = int(ceil(x)) x = pow(x, 2) x = sqrt(x) return x

This is less than ideal because it's verbose and the explicit variable assignment seems unnecessary. However, the inline representation may be a little tough to read, especially if you have longer names, or different fixed arguments.

from math import sqrt, ceil def transform(value): return sqrt(pow(int(ceil(float(value))), 2))

The other limitation is that the sequence of commands is hard coded. I have to create a function for each variant I may have. However, I may have a need for the ability to compose the sequence dynamically.

One alternative is to use a functional idiom to compose all the functions together into a new function. This new function represent the pipeline the previous set of functions ran the value through. The benefits are that we extract the functions into their own data structure (in this case a tuple). Each element represents a step in the pipeline. You can also build up the sequence dynamically should that be a need.

Here we use foldl aka reduce and some lambda's to create the pipeline from the sequence of functions.

One alternative is to use a functional idiom to compose all the functions together into a new function. This new function represent the pipeline the previous set of functions ran the value through. The benefits are that we extract the functions into their own data structure (in this case a tuple). Each element represents a step in the pipeline. You can also build up the sequence dynamically should that be a need.

Here we use foldl aka reduce and some lambda's to create the pipeline from the sequence of functions.

fn_sequence=(float, ceil, int, lambda x: pow(x, 2), sqrt) transform = reduce(lambda a, b: lambda x: b(a(x)), fn_sequence) return transform('2.1') # => 3.0

Now I have a convenience function that represents the pipeline of functions. We can extrapolate this type of pipeline solution for more complex and/or more dynamic pipelines, limited only by the sequence of commands. The unfortunate cost to this idiom is the additional n-1 function calls created by the reduce when composing the sequence of functions together.

**§**