proud owner of the 1000th post on apioforum

— amby

a very long time ago

recent posts

amby #3658

proposal: where possible, players should share their solutions on "git hub" or some other online version control frontend

amby #3585


amby #3459


amby #3458


i first saw that algorithm used in jonesforth btw

amby #3455

fun fact: this algorithm can be expanded to parse arbitrary bases (so long as you have a base-N digit to integer conversion)

start on the most significant digit
add it to an accumulator
multiply by the base
move to the next digit
repeat until you run out of digits

amby #2886

but they could probably afford to make it a little less strict?

iirc the safety checks will reject stuff that might be correct but it can't prove it, instead of accepting stuff that might be wrong but it can't prove it. because oracle problem

amby #2867

only cuz there's no runtime safety guards in place by default (save for what the os does)

amby #2863

The only two programming languages i think should be used are 0) C, because everything else is worse

enjoy your segfaults

amby #2621

i assume you dont mean the big hill in llandudno

amby #2517

hell yeah

amby #2292

i made a programming language! it is called ajal virtual cpu and it's a bytecode interpreter for a made up isa

there's no subtract instruction. you'll get used to it

amby #2071

the first prev next last header staying at the top of the screen is very cool and the

amby #2056

floating point infinity is all exponent and mantissa bits set high

so you get +/- infinity from the sign bit

see also +/-0

amby #2046

it wont be a float thing because all floats can be represented perfectly in decimal, and this has infinite repeating nines

amby #1957


amby #1907

that is one of the websites i have ever seen

amby #1747

le mon

amby #1614


amby #1613


amby #1537


amby #1491

this almost makes me angry enough to learn git so i can fix it myself

amby #1442


amby #1371

no (to my current knowledge)

however that is the answer i would have given if you asked me if i was bi 2 years ago

amby #1368


amby (edited ) #1367

(?<=\b||\s)([wW])[wWvVmM]\1(?=\b|$|\s) is a better one

uses lookbehind though so it might not work everywhere

amby #1355


amby #1328

omg rust on apioforum no way

amby #1235


because it's a double mersenne prime, was factorised by euler and was the largest known mersenne prime for around 100 years