Skip to main content

Lambda, Map, and Filter in Python


Lambda: Lambda functions are known as the anonymous functions in Python. This kind of functions are declared without any name.

  • Can accept any number of argument. 
  • Restricted to only a single expression. 
  • Used only one-time.
  • Lambda function is used when you need a function for a short period of time. 
Basic syntax: 
lambda arguments : expression

Example:

Map: Map is a built-in function that takes a function object and iterable list (list/dictionary) as its parameter.
Basic syntax:
map (function_object, iterable_1, iterable_2, ... )

Few examples of Map in python:

Filter: It works similar way like map. The difference is it makes a new list from the element in the list that satisfy some condition. In case of of parameters, it takes a function and one iterable.
Basic syntax:
filter (function, iterable)

Normally used with lambda functions. Example is given below:



Labels:

Comments

Post a Comment

Popular posts from this blog

Difference between abstract class and interface in OOP

Source: Amit Sethi In Interface: > All variables must be public static final. > No constructors. An interface can not be instantiated using the new operator.   > All methods must be public abstract .  
2 comments
Read more

DFS Performance Measurement

Completeness DFS is not complete, to convince yourself consider that our search start expanding the left subtree of the root for so long path (maybe infinite) when different choice near the root could lead to a solution, now suppose that the left subtree of the root has no solution, and it is unbounded, then the search will continue going deep infinitely, in this case , we say that DFS is not complete. Optimality  Consider the scenario that there is more than one goal node, and our search decided to first expand the left subtree of the root where there is a solution at a very deep level of this left subtree , in the same time the right subtree of the root has a solution near the root, here comes the non-optimality of DFS that it is not guaranteed that the first goal to find is the optimal one, so we conclude that DFS is not optimal. Time Complexity Consider a state space that is identical to that of BFS, with branching factor b, and we start the search from th
Post a Comment
Read more

Difference between a Singly LinkedList and Doubly LinkedList

3 comments
Read more