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

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

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