AutoHotkey Community

[Superfraggle79]

In desperate need of a fast way to convert a large base 10 number into base 36.

Have searched the forum and found all other conversions, but not base 36, can anyone assist??????

[Laszlo]

[Laszlo]

...or a single line recursive function

[Superfraggle79]

Thanks worked like a charm, you are indeed a genius.

Thanks again.

[Veovis]

[apocalypse~r]

it stops working when passed a float. i suggest:

ToBase(n,b)
{
; n >= 0, 1 < b <= 36
if n is not integer
return "error"
Return (n < b ? "" : ToBase(n//b,b)) . ((d:=mod(n,b)) < 10 ? d : Chr(d+55))
}

[Raccoon]

Nice function, as always Laszlo!

Do recursive functions work efficiently (faster than loop?) and safely (stack overflow?) in AutoHotKey?

I know that C and other languages will try to optimize recursive functions, such as with tail recursion, but does AHK?

Also, when you say octal, do you mean decimal or truly octal (base values?
_________________
Need help right away? Get live support on IRC.
Already have an IRC client installed? /join #autohotkey

[Laszlo]

[Raccoon]

BTW, sorry about that last question. I misread that comment as meaning acceptable inputs were hex and oct for some reason. :S

Thanks, I'll have to add this to my \Libs. Source citation, yourself?

Edit: Would you mind expanding on this, to allow for in-base and out-base? ie, converting base36 back to base10. My method depends on converting to a neutral common base (base 10) before converting to another. eg: base(xyzzy, 36, 16) would convert xyzzy from base36 to base10 to base16. I'm certain you could cut out the middle-man.
_________________
Need help right away? Get live support on IRC.
Already have an IRC client installed? /join #autohotkey

[Laszlo]

As I said, the above functions were meant to demonstrate the algorithms. The base conversion functions are built into the C run time library supplied with Windows. You only need a wrapper:

[Joy2DWorld]

@Laszlo,

cool stuff. (Amazing how ignorant I feel sometimes when looking at your stuff)...
_________________
Joyce Jamce

[Guest]

I must say, Lazlo, you owned your first post with your second one's code. lol

[Laszlo]

Thanks, guys, but I use the third function (the wrapper for msvcrt) in my popup calculator. It is the fastest and small, although has no educational value.

[Guest]

So now you must educate me on how to write a base algorithm that converts baseA to baseB without stopping at base10 in between. No nested loops, no recursion, just math.

[Laszlo]

The wrapper version stops at binary in between, not base 10. Most computers do internal arithmetic in only a few bases (binary, BCD…), so you need to stop there, unless you want to emulate arbitrary base arithmetic. It would be complicated and slow, so why do you want it? To learn how long division works?