related: https://www.janko.at/Raetsel/index.htm huge collection of games and playable online (general desciptions are in German only but the rules of every game are translated in English and Japanese)
Also related: https://puzz.link/db/
Readit Newstangus commented on Simon Tatham's Portable Puzzle Collection chiark.greenend.org.uk/~s... · Posted by u/sogen
How does this work under the hood? Does Ruby keep a giant map of all strings in the application to check new strings against to see if it can dedupe? Does it keep a reference count to each unique string that requires a set lookup to update on each string instance’s deallocation? Set lookups in a giant set can be pretty expensive!
Even if it didn't dedupe strings, mutable string literals means that it has to create a new string every time it encounters a literal in run time. If you have a literal string in a method, every time you call the method a new string is created. If you have one inside a loop, every iteration a new string is created. You get the idea.
With immutable strings literals, string literals can be reused.
TIL that Ruby has mutable strings, and (until the announced change) even had them mutable by default (and the change only affects literal strings; non-literal strings are still mutable). Python has always only ever had immutable strings.
Strings are going to keep being mutable by default. Only strings created by string literals won't be.
That quote about JavaScript is... huh. I do not understand how you can even begin coming to the conclusion of "JavaScript [is] utterly broken, incapable of executing the simplest programs without errors" when obviously, JavaScript (which I do not like, by the way) is productively used on a large scale (even back then), and constantly under scrutiny from programmers, computer scientists, language designers... it's just baffling.
It reminds me of when I was around 10 years old or so, maybe slightly older, and playing around with Turbo C (or maybe Turbo C++) on DOS. I must have gotten something very basic about pointers (which were new to me at the time) wrong, probably having declared a char* pointer but not actually allocated any memory, leaving it entirely uninitialized, and my string manipulation failed in weird and interesting ways (since this was on DOS without memory protection, you wouldn't get a program crash like a segmentation fault very easily, instead you'd often see "more interesting" corruption).
Hilariously, at the time I concluded that the string functions of Turbo C(++) must be broken and moved away "string.h" so I wouldn't use it. But even then I shortly after realized how insane I was: Borland could never sell Turbo C(++) if the functions behind the string.h API were actually broken, and it became clear that my code must be buggy instead. And remember, I was 10 years old or so, otherwise I don't think I would have come to that weird conclusion in the first place.
Nowadays, I do live in this very tiny niche where I actually encounter not only compiler bugs, but actual hardware/CPU bugs, but even then I need a lot of experiments and evidence for myself that that's what I'm actually hitting...
>I do not understand how you can even begin coming to the conclusion of ...
Obviously he's not serious, he's playing the part of the out of touch old man.
Related to "Last is first", old Spanish books sometimes put at the end of the page the first syllable of the next page. (It was quite disconcerting when I first saw it.)
Dead Comment
tangus commented on Show HN: I wrote a Java decompiler in pure C language github.com/neocanable/gar... · Posted by u/neocanable
Why is it silly?
They say it right in the next sentence.
tangus commented on Ask HN: Has anybody built search on top of Anna's Archive? · Posted by u/neonate
There is a search solution for zipped fb2 files. Not exactly what you need, but it has potential.
The project has similar story to Anna's archive. There is 0.5 TB of archived books, and the project creates index of all the books with text, title and aruthor search capabilities, gives html UI for search and reading. On weak machine it takes about 2 hours to build that index.
So if you have zipped archives of fb2, you can use the project to create web UI with search for those files. Without need of enough space to unpack all the files.
You'll have to translate some russian though to get instructions on how to set it up.
https://gitlab.com/opennota/fb2index/-/blob/master/README.ru...
But fb2 files are marked up text, which is (relatively) trivial to index. The bulk of Anna's Archive's books are made of from scanned images.
tangus commented on Red Programming Language red-lang.org/p/about.html... · Posted by u/hotpocket777
So, REBOL and Red are basically Fexpr-based Lisps, right? They never describe themselves this way (instead using terms like definitional scoping, etc.), but it all just seems like a non-rigorous Fexpr based Lisp (almost like a light-weight version of vau-calculus of Kernel).
I don't think in Red a function can decide whether to evaluate its arguments or not. It's more like a Logo: functions have fixed arity, so you don't need to delimite the call, and lists ("blocks") are always quoted, so you need to explicitly evaluate them.
Here's an account: https://www.huffpost.com/entry/wash-post-busted-pressmens-un...