Skip to main content

Python Unittest

Unittest library helps you to test your program and inform you whether it is working fine. It is useful to recheck if a program is running fine when you make certain changes to any related code. Making a test file makes testing easy. All you need to do later is run this file and it will inform you if a program that you are testing is working fine with all possible inputs.

Here is an example of Unitest file working on another file:

CAP.PY FILE

def capitalizing_text(text):
    '''
    Input string's first letter is capitalized.
    '''
    return text.cap()

TEST_CAP.PY FILE

#importing unitest library
import unittest
import cap

class TestCap(unittest.TestCase):

#functions in test file must start with the word 'test'
    def test_one_word(self):
        text = 'python'
#running the program
        result = cap.capitalizing_text(text)
#The following line checks if the result and expected result match
        self.assertEqual(result, 'Python')

#second function to test a different set of input
    def test_multiple_words(self):
        text='monty python'
        result = cap.capitalizing_text(text)
        self.assertEqual(result, 'Monty Python')

#The following if statement is used to run the program directly from command prompt without having to call from a different file
if __name__=='__main__':
    unittest.main()

On running the test file, it will inform you that there is an error with the result in the second function. It is not returning as expected. On making the following changes to the program and running the test program again, the errors will be gone.

CAP.PY

def capitalizing_text(text):
    '''
    Input string's first letter is capitalized.
    '''
    return text.title()

Comments

Post a Comment

Popular posts from this blog

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

Machine Learning — Supervised, Unsupervised, and Reinforcement — Explanation with Example

🤖 Let's take an example of machine learning and see how it can be performed in three different ways — Supervised, Unsupervised, and Reinforcement. We want a program to be able to identify apple in pictures Supervised Learning You will create or use a model that takes a set of pictures of apple and it analyses the commonality in those pictures. Now when you show a new picture to the program, it will identify whether it has an apple or not. It can also provide details on how confident is the program about it. Unsupervised Learning In this method, you create or use a model that goes through some images and tries to group them as per the commonalities it observes such as color, shape, size, partern, etc. And now you can go through the groups and inform the program what to call them. So, you can inform the program about the group that is apple mostly. Next time you show a picture, it can tell if an apple is there or not. Reinforcement Learning Here the model you create or...
Post a Comment
Read more

269. Alien Dictionary

  Solution This article assumes you already have some confidence with  graph algorithms , such as  breadth-first search  and  depth-first searching . If you're familiar with those, but not with  topological sort  (the topic tag for this problem), don't panic, as you should still be able to make sense of it. It is one of the many more advanced algorithms that keen programmers tend to "invent" themselves before realizing it's already a widely known and used algorithm. There are a couple of approaches to topological sort;  Kahn's Algorithm  and DFS. A few things to keep in mind: The letters  within a word  don't tell us anything about the relative order. For example, the presence of the word  kitten  in the list does  not  tell us that the letter  k  is before the letter  i . The input can contain words followed by their prefix, for example,  abcd  and then  ab . These cases will never ...
Post a Comment
Read more