-
Notifications
You must be signed in to change notification settings - Fork 78
Added support for increased Block Storage Volume limits #626
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Changes from all commits
fb04f1b
6a2bba7
fefbffe
0c9466b
c956b1c
d9a8998
c2a7f6a
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -2,6 +2,7 @@ | |
| Contains various utility functions. | ||
| """ | ||
|
|
||
| import string | ||
| from typing import Any, Dict | ||
|
|
||
|
|
||
|
|
@@ -27,3 +28,28 @@ def recursive_helper(value: Any) -> Any: | |
| return value | ||
|
|
||
| return recursive_helper(data) | ||
|
|
||
|
|
||
| def generate_device_suffixes(n: int) -> list[str]: | ||
| """ | ||
| Generate n alphabetical suffixes starting with a, b, c, etc. | ||
| After z, continue with aa, ab, ac, etc. followed by aaa, aab, etc. | ||
| Example: | ||
| generate_device_suffixes(30) -> | ||
| ['a', 'b', 'c', ..., 'z', 'aa', 'ab', 'ac', 'ad'] | ||
| """ | ||
| letters = string.ascii_lowercase | ||
| result = [] | ||
| i = 0 | ||
|
|
||
| while len(result) < n: | ||
| s = "" | ||
| x = i | ||
| while True: | ||
| s = letters[x % 26] + s | ||
| x = x // 26 - 1 | ||
| if x < 0: | ||
| break | ||
| result.append(s) | ||
| i += 1 | ||
| return result | ||
|
Comment on lines
+33
to
+55
Member
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Just an idea (optional), would it be better if we write this into a Python generator that yields one item every time?
Contributor
Author
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Yeah that's a good option! I think the current implementation is a bit simpler, but I can implement it using a generator if you think that's better. |
||
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Did we confirm how Linode back-end calculate this? There are two styles, 1GB = 1000 MB and 1GB = 1024 MB
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
According to the API spec it is 1024.