ASM doesn’t care about your variable types, because it doesn’t care about your variables. What’s a variable, anyway? There is only address space.

Only Winsocks.

Yeah, 3 x 9!

https://en.m.wikipedia.org/wiki/Bingo_(British_version)

What’s the word? I started looking but realized I have better things to do. Before I stopped I did find “nips” and “chow”, both of which have completely unrelated, normal meanings. Hell, I didn’t even know “chow” could mean anything other than food until I read the definition in the dictionary file.

There are several other racist, sexist, and generally rude words in there too. There is even a slur which has been used against me, and it’s defined as such (one meaning among many), but I say leave them. Well, maybe “cunt” could go without being missed.

deleted by creator

I don’t think that even C++ is that bad. Like a lot of shows and music acts, I think it’s more the toxic fan base than the thing itself that really sucks. I’ve had the same feeling with a certain kind of JavaScript programmer.

*Edit for clarity: I’m not saying that the entire C++ community is toxic, just a vocal segment of it, in line with the other examples I gave.

The added difficulty with this in programming is that it can be much harder simply to ignore them, because you may be forced to work with them, or stuck needing to learn something from them (shudder).

Tail recursion in particular is usually just turned back into a loop at the compiler, and typical modern architectures implement a call stack at the hardware level, which allows you to do limited-depth recursion, but breaks like in OP if you try to go too deep.

Yes, in my experience this is what the term “recursion” means in a programming context; it doesn’t usually refer to a mathematical ideal. That was what tripped me up.

Could someone expand a little on this statement, or point me toward an applicable resource? How do “real” (modern?) CPUs prevent unwanted recursion? As in, not the compiler or the OS, but the CPU itself? I’ve been searching for a while now but I haven’t found anything that clears this up for me.

Seconding Markor for Android. I originally installed it because I was sick of all the note-taking apps that store your notes away in hidden directories and proprietary formats. I’ve been using it for years and it’s not let me down yet.

Sure, but as far as I’m aware, no other large group of LISP users exists. My contention isn’t that most AI researchers use LISP now, but that most LISP programmers are (were?) AI researchers.

I’ve been trying to learn about early AI work, and I’m finding that to get any practical details you’re almost guaranteed to have to wade through LISP code, although at least it’s usually pretty well commented.

LISP: You are an AI researcher and a nerd.

I use 10ten (previously Rikuchamp) for Japanese. I don’t think it does full translation, but it gives thorough dictionary lookups (from WWWJDIC) as mouseover tooltips. Very useful if you’re trying to learn the language, but maybe not so much if you just want to read stuff quickly. I think it’s now available for every major browser, but I mostly use it on FF.

I apologize, because between OP’s post and looking at the OnlyOffice website, I got the impression that it was only a web app, requiring a web server to run. After reading another comment here I looked harder on the website and found the download links for the standalone versions.

Where are these conversations happening? I could see a lot of enterprise-focused groups potentially getting behind OnlyOffice, but individual home users? Not so much.

EDIT: My mistake! I didn’t realize that there are standalone versions of OnlyOffice in addition to the web app version.

Despite this, I still bet that they post “nvm fixed it” an hour or two later.

Whoops! When I looked at the second time that the shift value is calculated, I wondered if it would be inverted from the first time, but for some reason I decided that it wouldn’t be. But looking at it again it’s clear now that (1 - i) = (-i + 1) = ((~i + 1) + 1), making bit 0 the inverse. Then I wondered why there wasn’t more corruption and realized that the author’s compiler must perform postfix increments and decrements immediately after the variable is used, so the initial shift is also inverted. That’s why the character pairs are flipped, but they still decode correctly otherwise. I hope this version works better:

long main () {
    char output;
    unsigned char shift;
    long temp;
    
    if (i < 152) {
        shift = (~i & 1) * 7;
        temp = b[i >> 1] >> shift;
        i++;
        output = (char)(64 & temp);
        output += (char)((n >> (temp & 63)) & main());
        printf("%c", output);
    }

    return 63;
}

EDIT: I just got a chance to compile it and it does work.

I first learned about Java in the late 90s and it sounded fantastic. “Write once, run anywhere!” Great!

After I got past “Hello world!” and other simple text output tutorials, things took a turn for the worse. It seemed like if you wanted to do just about anything beyond producing text output with compile-time data (e.g. graphics, sound, file access), you needed to figure out what platform and which edition/version of Java your program was being run on, so you could import the right libraries and call the right functions with the right parameters. I guess that technically this was still “write once, run anywhere”.

After that, I learned just enough Java to squeak past a university project that required it, then promptly forgot all of it.

I feel like Sun was trying to hit multiple moving targets at the same time, and failing to land a solid hit on any of them. They were laser-focused on portable binaries, but without standardized storage or multimedia APIs at a time when even low-powered devices were starting to come with those capabilities. I presume that things are better now, but I’ve never been tempted to have another look. Even just trying to get my machines set up to run other people’s Java programs has been enough to keep me away.

I don’t know if this will work or even compile, but I feel like I’m pretty close.

long main () {
    char output;
    unsigned char shift;
    long temp;
    
    if (i < 152) {
        shift = (i & 1) * 7;
        temp = b[i >> 1] >> shift;
        i++;
        output = (char)(64 & temp);
        output += (char)((n >> (temp & 63)) & main());
        printf("%c", output);
    }

    return 63;
}

deleted by creator

This genie must’ve read or watched Brewster’s Millions.