Clarify that download rate is in bytes per second
[youtube-dl] / devscripts / youtube_genalgo.py
1 #!/usr/bin/env python
2
3 # Generate youtube signature algorithm from test cases
4
5 import sys
6
7 tests = [
8     # 88
9     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!@#$%^&*()_-+={[]}|:;?/>.<",
10      "J:|}][{=+-_)(*&;%$#@>MNBVCXZASDFGH^KLPOIUYTREWQ0987654321mnbvcxzasdfghrklpoiuytej"),
11     # 87
12     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!@#$^&*()_-+={[]}|:;?/>.<",
13      "!?;:|}][{=+-_)(*&^$#@/MNBVCXZASqFGHJKLPOIUYTREWQ0987654321mnbvcxzasdfghjklpoiuytr"),
14     # 86 - vfl_ymO4Z 2013/06/27
15     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!@#$%^&*()_-+={[|};?/>.<",
16      "ertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!/#$%^&*()_-+={[|};?@"),
17     # 85
18     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!@#$%^&*()_-+={[};?/>.<",
19      "{>/?;}[.=+-_)(*&^%$#@!MqBVCXZASDFwHJKLPOIUYTREWQ0987654321mnbvcxzasdfghjklpoiuytr"),
20     # 84
21     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!@#$%^&*()_-+={[};?>.<",
22      "<.>?;}[{=+-_)(*&^%$#@!MNBVCXZASDFGHJKLPOIUYTREWe098765432rmnbvcxzasdfghjklpoiuyt1"),
23     # 83 - vflcaqGO8 2013/07/11
24     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKJHGFDSAZXCVBNM!#$%^&*()_+={[};?/>.<",
25      "urty8ioplkjhgfdsazxcvbqm1234567S90QWERTYUIOPLKJHGFDnAZXCVBNM!#$%^&*()_+={[};?/>.<"),
26     # 82
27     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKHGFDSAZXCVBNM!@#$%^&*(-+={[};?/>.<",
28      "Q>/?;}[{=+-(*<^%$#@!MNBVCXZASDFGHKLPOIUY8REWT0q&7654321mnbvcxzasdfghjklpoiuytrew9"),
29     # 81
30     ("qwertyuioplkjhgfdsazxcvbnm1234567890QWERTYUIOPLKHGFDSAZXCVBNM!@#$%^&*(-+={[};?/>.",
31      "urty8ioplkjhgfdsazxcvbqm1234567e90QWERTYUIOPLKHGFDSnZXCVBNM!@#$%^&*(-+={[};?/>."),
32 ]
33
34 def find_matching(wrong, right):
35     idxs = [wrong.index(c) for c in right]
36     return compress(idxs)
37     return ('s[%d]' % i for i in idxs)
38
39 def compress(idxs):
40     def _genslice(start, end, step):
41         starts = '' if start == 0 else str(start)
42         ends = ':%d' % (end+step)
43         steps = '' if step == 1 else (':%d' % step)
44         return 's[%s%s%s]' % (starts, ends, steps)
45
46     step = None
47     for i, prev in zip(idxs[1:], idxs[:-1]):
48         if step is not None:
49             if i - prev == step:
50                 continue
51             yield _genslice(start, prev, step)
52             step = None
53             continue
54         if i - prev in [-1, 1]:
55             step = i - prev
56             start = prev
57             continue
58         else:
59             yield 's[%d]' % prev
60     if step is None:
61         yield 's[%d]' % i
62     else:
63         yield _genslice(start, i, step)
64
65 def _assert_compress(inp, exp):
66     res = list(compress(inp))
67     if res != exp:
68         print('Got %r, expected %r' % (res, exp))
69         assert res == exp
70 _assert_compress([0,2,4,6], ['s[0]', 's[2]', 's[4]', 's[6]'])
71 _assert_compress([0,1,2,4,6,7], ['s[:3]', 's[4]', 's[6:8]'])
72 _assert_compress([8,0,1,2,4,7,6,9], ['s[8]', 's[:3]', 's[4]', 's[7:5:-1]', 's[9]'])
73
74 def gen(wrong, right, indent):
75     code = ' + '.join(find_matching(wrong, right))
76     return 'if len(s) == %d:\n%s    return %s\n' % (len(wrong), indent, code)
77
78 def genall(tests):
79     indent = ' ' * 8
80     return indent + (indent + 'el').join(gen(wrong, right, indent) for wrong,right in tests)
81
82 def main():
83     print(genall(tests))
84
85 if __name__ == '__main__':
86     main()