Skip to main content

Python - What is a Class? What is __init__()? What is __str__()?

🐍 A class is a blueprint of an object. How an object should look like and what functionalities it must have on creation is mentioned in a class.

A real life comparison would be, say there is class called Dog. It has 4 limbs, 2 eyes, 1 mouth. These are its variables. Then a dog barks on being scared. This is it's functionality. Now lets say, a new dog is born. This dog is named Leo by us. Leo is an object created from the class Dog. Dog is like a blueprint, on the basis of which Leo will have its variables and functionalities defined.

What is __init__()?

__init__() is a function of a class. It is called automatically when an object is created. Which means, we need not call it to use it. As soon as an object is created __init__() function is also called.

Continuing with the above real life example, in Dog class we can add __init__() function and define variables like limbs=4, ears=2, nose=1, mouth=1. So when Leo, as an object, is created or born, these variables will also be defined immediately.

What is __str__()?

__str__() is a function which is called upon when we print on screen an object. Say, we created an object named Leo from class Dog. When we say print(Leo), it calls __str__() function, if defined, and displays whatever is returned.

Run the below code in Jupyter notebook to clearly understand how Class, __init__(), and __str__() works

class Dog():
    
    def __init__(self, dog_name, limbs, mouth):
        self.dog_name = dog_name
        self.limbs = limbs
        self.mouth = mouth
    
    def __str__(self):
        return f"My name is {self.dog_name}"

leo = Dog('Leo', 4, 1)
print(leo)
Labels:

Comments

Post a Comment

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...
Post a Comment
Read more

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.
1 comment
Read more

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...
Post a Comment
Read more