Python_Modules.py

### OS Module
import os
print(os.path.dirname(__file__))  # Return  path of current working dir parent node =>C:/Users/DELL/PycharmProjects/api-ui-mobile-automation-frameworks/screens
print(os.path.abspath("slenium_automation.yml")) # Return full file dir path =>C:\Users\DELL\PycharmProjects\api-ui-mobile-automation-frameworks\screens\slenium_automation.yml
print(os.path.basename("C:/Users/DELL/PycharmProjects/api-ui-mobile-automation-frameworks")) # Return the the end separator value =>api-ui-mobile-automation-frameworks
ROOT_DIR = os.path.dirname(os.path.abspath(__file__))
print( os.path.join(ROOT_DIR, 'configuration.conf')) #append a file name in path
print( os.path.abspath('..\\')) # return parent to parent dir path
print( os.path.abspath('..\\ostest.py')) #append the file name in parent to parent dir
print( os.path.realpath('..')) # return parent to parent dir path

print(os.path.dirname(os.path.realpath(__file__)).rsplit(os.sep, 3)[0]) #Return the 3 level up path forn current working dir
print(os.environ)#all the directories of all user environment variables
print(os.listdir()) #returns a list of files and the folders in the current directory.

##os.stat() function returns the list of details about the file or the directory name given in the argument
print(os.stat('ostest.py').st_mtime)
print(os.stat('ostest.py').st_size)

##os.walk():Traverses and produces the directory path, the direct within that path and the files within that path. It is useful to keep track of all the directories.
#return 3 list
for dirpath, dirname, filename in os.walk('C://Users//DELL//PycharmProjects//Selenium'):
    print('Current path: ',dirpath)
    print('Directories: ', dirname)
    print('Files: ', filename)
##Remove the file/dir from the path
print(os.remove('C://Users//DELL//PycharmProjects//api-ui-mobile-automation-frameworks//.github//workflows//tes34')) 

## find all files in a directory with extension .txt ?
for file in os.listdir("F:/"):
    if file.endswith(".txt"):
        print(os.path.join("F:/", file)) # it print the the file path
        print( file) #It print only the files name
#It can also use the glob module to achieve the same:
import glob
os.chdir("F:/")
for file in glob.glob("*.txt"):
    print(file)

#to traverse directory, use os.walk:
for root, dirs, files in os.walk("F:/"):
    for file in files:
        if file.endswith(".txt"):
             print(os.path.join(root, file))
### math module
import math
print(math.sqrt(15)) # returns the exact number till last float same as fabs(x)
print(math.fmod(17,5)) # Returns the remainder when x is divided by y 17/5=>2.0  Note: Modulus operator returns the pure integer value while fmod returns the float
print(math.pow(3,2)) #3 to the power 2 =>9.0
print(math.trunc(5.9)) #Integer =>5
print(math.isnan(3)) #Returns True if x is a Not a Number =>False
print(math.factorial(3)) # =>6
print(math.floor(3.9)) # Lover integer value to number =>3
print(math.ceil(3.9)) #Greater integer to number =>4

### Sys module

### Collections Module
## Counter
from collections import Counter
my_list=['red', 'blue', 'red', 'green', 'blue', 'blue']
print(Counter(my_list)) #Retun the tuple dictionary values having occurance of element
print(Counter(my_list)['bacon'] ) # return 0
print(Counter(my_list)['blue'] ) # return 3
del( Counter(my_list)['green'] ) # remove green entry
# most_common() function: Find the 9 most common words in Hamlet text file
words = re.findall(r'\w+', open('installedapiversioninfo').read().lower())
print(Counter(words).most_common(9))
print(Counter(words).most_common(3)[2]) #from Top 3 tuple return index value 2 tuple
print(Counter(words).most_common(3)[2][0]) #Retuen the Tuple firtvalue(key)
print(Counter(words).most_common(3)[2][1]) #Retuen the Tuple second value(value or occurence)

# elements() function: Elements are returned in the order first encountered
my_list1='sdsjsffjfj'
c = Counter(my_list1)
print(sorted(c.elements())) # Return list of occured elements

# subtract() function:
d = Counter(d=1, f=1, j=2, s=1)
c.subtract(d)
print(c) # return subtracted occurence and print most duplicate first

# User full operaions:
sum(c.values())                 # its same as len(string)
c.clear()                       # reset all counts
list(c)                         # list unique elements
set(c)                          # convert to a set
dict(c)                         # convert to a regular dictionary
c.items()                       # convert to a list of (elem, cnt) pairs
+c                              # remove zero and negative counts
-c                              # remove zero and positive counts
c + d                       # add two counters together:  c[x] + d[x]
c - d                       # print the element from c which is not in d
c & d                       # common elements in both :  min(c[x], d[x])
c | d                       # combine all:  max(c[x], d[x])


### deque
from collections import deque
d = deque('ghi')                 # make a new deque with three items
d.append('j')                    # add a new entry to the right side
d.appendleft('f')                # add a new entry to the left side
d.pop()                          # return and remove the rightmost item
d.popleft()                      # return and remove the leftmost item
list(d)                          # list the contents of the deque
d[0]                             # peek at leftmost item
d[-1]                            # peek at rightmost item
list(reversed(d))                # list the contents of a deque in reverse
'h' in d                         # search the deque
d.extend('jkl')                  # add multiple elements at once  =>deque(['g', 'h', 'i', 'j', 'k', 'l'])
d.rotate(1)                      # right rotation=>deque(['l', 'g', 'h', 'i', 'j', 'k'])
d.rotate(-1)                     # left rotation =>deque(['g', 'h', 'i', 'j', 'k', 'l'])
deque(reversed(d))               # make a new deque in reverse order =>deque(['l', 'k', 'j', 'i', 'h', 'g'])
d.clear()                        # empty the deque

### defaultdict
# means that if a key is not found in the dictionary, then instead of a KeyError being thrown, a new entry is created.
# The type of this new entry is given by the argument of defaultdict.
from collections import defaultdict
somedict = {}
print(somedict[3]) # KeyError

someddict = defaultdict(int)
print(someddict[3]) # print int(), thus 0
#example to get the key with values
s = [('yellow', 1), ('blue', 2), ('yellow', 3), ('blue', 4), ('red', 1)]
d = defaultdict(list)  # => {}
for k, v in s:
    d[k].append(v) #=>defaultdict(<class 'list'>, {'yellow': [1]})
print(sorted(d.items())) #=>[('blue', [2, 4]), ('red', [1]), ('yellow', [1, 3])]
print(d['yellow']) # => [1,3]