Fortsätt till huvudinnehåll

Currying with Python

Currying is not something that I have used before. I encountered it recently during my dive into functional programming. So what is it, and can it be done using Python?

I would describe Currying as a method to create specific functions by using a more generic function as base. If you are used to Object Oriented Programming (OOP) you can think of the generic function as the base class and the more specific function as the derived class. Let me show by example.

Think of a function that multiplies every element in a list with a given multiple. This function would require two input parameters, the list and the multiple. In Python this could look like:

 def multiplyListElements(multiple, list):  
  return [multiple*x for x in list]  

Now, imagine that you often want to multiply each element by three. You can do this by calling 'multiplyListElements(3, list)'. Or you can use Currying:

 def multiplyListElements(multiple):  
  def f(list):  
   return [multiple*x for x in list]  
  return f  

Now multiplyListElements takes only one argument, the multiple to use, and returns a function f that takes the list as argument. It can be used like this:

 >>> doubleElements = multiplyListElements(2)  
 >>> doubleElements([1,2,3,4])  
 [2, 4, 6, 8]  
 >>> tripleElements = multiplyListElements(3)  
 >>> tripleElements([1,2,3,4])  
 [3, 6, 9, 12]  

Pretty neat! Now this was a very simple, pedagogic, example. But it is easy to imagine a generic method that takes more arguments and where Currying can be used as an alternative to create nice specific functions.

Bonus level. You can use an anonymous - lambda - function instead of defining 'f' inside the multiplyListElements function. If you do that it will look like this:

 def multiplyListElements(multiple):  
  return lambda list: [multiple*x for x in list]  

Kommentarer

Populära inlägg i den här bloggen

C# Enum as bit field

Bit field enum Whenever you wish to express combinations of properties of an object, bit fields are a good way to accomplish this. As a simple example, consider a file in the file system. It can be Readable , Writable , Hidden or a combination these. The different attributes can be defined as an enum : [Flags] public enum FileAttribute {   None      = 0b0000;   Readable  = 0b0001;   Writeable = 0b0010;   Hidden    = 0b0100; } To indicate that this enum is expected to be used as a bit field I have defined it with the FlagsAttribute . It is important to understand that the FlagsAttribute does nothing more than making some changes to how the ToString method of the enum works, making it possible to print out all flags. It does not introduce any validation or special treatment of the enum in any other way. I have defined the values of the different fields of the enum using binary representation, this should make it even more clear that this is a bit field and which bi

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i