FilesExpand file tree

 master

/

gen_comp.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

52 lines (41 loc) · 1.24 KB

 master

/

gen_comp.py

Copy path

Top

File metadata and controls

• Code
• Blame

52 lines (41 loc) · 1.24 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

"""

# Generators are used to create iterators, but with a different approach

# Generators are simple functions which return an iterable set of items, one at a time, in a special way.

# Lazy iterator

# Similar to List comprehensions

# Memory footprint: Here it doesn't store all values in RAM. Constant size

"""

nums = [1, 2, 3, 4, 5]

print('Calculate square without using - Generator:')

def square_numbers(nums):

result = []

for i in nums:

result.append(i * i)

return result

my_nums = square_numbers(nums)

print(my_nums)

print('\nCalculate square using - Generator:')

def square_numbers_generator(nums):

for i in nums:

yield i * i

my_nums = square_numbers_generator(nums)

print(my_nums)

# print(next(my_nums))

for num in my_nums:

print(num)

print('\nCalculate square using - List Comprehension:')

# I want 'n*n' for each 'n' in nums

my_nums = [n*n for n in nums]

print(my_nums)

print('\nCalculate square using - map + lambda,')

my_nums = map(lambda n: n*n, nums)

for num in my_nums:

print(num)

print('\nGet list of even numbers using - filter + lambda,')

my_nums = filter(lambda n: n % 2 == 0, nums)

for num in my_nums:

print(num)

print()

my_nums = [n for n in nums if n % 2 == 0]

for num in my_nums:

print(num)