We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
2 parents a5018f7 + 1473e6d commit 59d6599Copy full SHA for 59d6599
fitz/utils.py
@@ -4735,11 +4735,16 @@ def integerToLetter(i) -> str:
4735
# William Chapman, Jorj McKie, 2021-01-06
4736
4737
ls = string.ascii_uppercase
4738
- m = int((i - 1) / 26) # how many times over
4739
- n = (i % 26) - 1 # remainder
+ n, a = 1, i
+ while pow(26, n) <= a:
4740
+ a -= int(math.pow(26, n))
4741
+ n += 1
4742
+
4743
str_t = ""
- for _ in range(0, m + 1):
- str_t = str_t + ls[n]
4744
+ for j in reversed(range(n)):
4745
+ f, g = divmod(a, int(math.pow(26, j)))
4746
+ str_t += ls[f]
4747
+ a = g
4748
return str_t
4749
4750
0 commit comments