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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
#!/usr/bin/env python3
# Copyright (c) 2015 Egor Tensin <Egor.Tensin@gmail.com>
# This file is part of the "Sorting algorithms" project.
# For details, see https://github.com/egor-tensin/sorting-algorithms.
# Distributed under the MIT License.
import argparse
import sys
from algorithms.input_kind import InputKind
from algorithms.params import AlgorithmParameters
import algorithms.registry as registry
_DEFAULT_ITERATIONS = 100
_DEFAULT_INPUT_KIND = InputKind.AVERAGE
_DEFAULT_MIN_LENGTH = 0
_DEFAULT_MAX_LENGTH = 200
def plot_algorithm(algorithm, input_kind=_DEFAULT_INPUT_KIND,
min_len=_DEFAULT_MIN_LENGTH,
max_len=_DEFAULT_MAX_LENGTH,
iterations=_DEFAULT_ITERATIONS,
output_path=None):
if isinstance(algorithm, str):
algorithm = registry.get(algorithm)
params = AlgorithmParameters(algorithm, min_len, max_len,
input_kind=input_kind,
iterations=iterations)
params.plot_running_time(output_path)
def _parse_non_negative_integer(s):
try:
n = int(s)
except ValueError:
raise argparse.ArgumentTypeError('must be a non-negative integer: ' + str(s))
if n < 0:
raise argparse.ArgumentTypeError('must be a non-negative integer')
return n
def _parse_positive_integer(s):
try:
n = int(s)
except ValueError:
raise argparse.ArgumentTypeError('must be a positive integer: ' + str(s))
if n < 1:
raise argparse.ArgumentTypeError('must be a positive integer')
return n
def _parse_input_kind(s):
try:
return InputKind(s)
except ValueError:
raise argparse.ArgumentTypeError('invalid input kind: ' + str(s))
def _format_algorithm(codename):
return '* {}: {}'.format(codename, registry.get(codename).display_name)
def _format_available_algorithms():
descr = 'available algorithms (in the CODENAME: DISPLAY_NAME format):\n'
return descr + '\n'.join(map(
_format_algorithm, sorted(registry.get_codenames())))
def _format_description():
return _format_available_algorithms()
def _create_argument_parser():
return argparse.ArgumentParser(
description=_format_description(),
formatter_class=argparse.RawDescriptionHelpFormatter)
def _parse_args(args=None):
if args is None:
args = sys.argv[1:]
parser = _create_argument_parser()
parser.add_argument('algorithm', metavar='CODENAME',
choices=registry.get_codenames(),
help='algorithm codename')
parser.add_argument('--iterations', '-r', metavar='N',
type=_parse_positive_integer,
default=_DEFAULT_ITERATIONS,
help='set number of algorithm iterations')
parser.add_argument('--input', '-i', dest='input_kind',
choices=InputKind,
type=_parse_input_kind, default=_DEFAULT_INPUT_KIND,
help='specify input kind')
parser.add_argument('--min', '-a', metavar='N', dest='min_len',
type=_parse_non_negative_integer,
default=_DEFAULT_MIN_LENGTH,
help='set min input length')
parser.add_argument('--max', '-b', metavar='N', dest='max_len',
type=_parse_non_negative_integer,
default=_DEFAULT_MAX_LENGTH,
help='set max input length')
parser.add_argument('--output', '-o', metavar='PATH', dest='output_path',
help='set plot file path')
return parser.parse_args(args)
def main(args=None):
plot_algorithm(**vars(_parse_args(args)))
if __name__ == '__main__':
main()
|
