PascalRowAction

Complexity

Total Complexity

11

Size/Duplication

Total Lines	27
Duplicated Lines	0 %

Importance

Changes	1
Bugs	0	Features	0

2 Methods

Rating	Name	Duplication	Size	Complexity
A	run()	0	2	1
D	_compute_pascal_row()	0	23	10

import math


from st2common.runners.base_action import Action


class PascalRowAction(Action):
    def run(self, **kwargs):
        return PascalRowAction._compute_pascal_row(**kwargs)

    @staticmethod
    def _compute_pascal_row(row_index=0):
        if row_index == 'a':
            return False, 'This is suppose to fail don\'t worry!!'
        elif row_index == 'b':
            return None
        elif row_index == 'complex_type':
            result = PascalRowAction()
            return (False, result)
        elif row_index == 'c':
            return False, None
        elif row_index == 'd':
            return 'succeeded', [1, 2, 3, 4]
        elif row_index == 'e':
            return [1, 2]
        elif row_index == 5:
            return [math.factorial(row_index) /
                    (math.factorial(i) * math.factorial(row_index - i))
                    for i in range(row_index + 1)]
        else:
            return True, [math.factorial(row_index) /
                          (math.factorial(i) * math.factorial(row_index - i))
                          for i in range(row_index + 1)]