cb321

19 ms·

181.
by cb321 1y ago
Lately, a lot of work has shifted to nimomy: https://news.ycombinator.com/item?id=43894666
182.
by cb321 1y ago
This is exactly how Nim is. The f-string like equivalent uses a macro called "fmt" which has a short alias "&". So you can say: import std/strformat let world = "planet" echo &&qu
183.
by cb321 1y ago
You may no longer be interested in this kind of thing, but if you are there might be some ideas of note over at https://github.com/c-blake/nio/blob/main/db-bench.md (in particular the demo/gbyGen.ni
184.
by cb321 2y ago
You're welcome. If you are interested in more background on biological brains, c.elegans is really just "the very first breakthrough" (in the phraseology of Max Bennett's A Brief History Of Intelligence -- a recent, wo
185.
by cb321 2y ago
Due to its technical content, some may be unaware that the author of TFA, Claire L. Evans, is a bona fide rock star: https://en.wikipedia.org/wiki/Claire_L._Evans with a grammy nomination and everything: https:/&
186.
by cb321 2y ago
While it may go against your personal expectations, I believe at least the Python variant is intentional not an accidental/unintended "bug". "Surprise" is observer-relative. From a blank slate, if --long=val and --
187.
by cb321 2y ago
Literally any short option key that takes a string or a char that could legitimately start with '=' has the problem, though, not just `cut`. The '=' will be "eaten" by one tool and left in another. But you kn
188.
by cb321 2y ago
Ha! I just said that. :-) Anyway, one other alternative for the `cut` situation is to allow either ':' or '=' to optionally separate the key and the value. Then you can say `cut -d:=` or `cut -d=:` if you wanted to us
189.
by cb321 2y ago
It is safer to just put in the space (much like you put in the quotes to be safe). Python's argparse will also accept but not require an `=` separator (maybe optparse, too - I haven't checked that one).
190.
by cb321 2y ago
Your historical examples are absolutely fantastic! A more fictionalized dramatization might be season 4 episode 9 of _The Good Wife_ trying to get a DOMA test case ( https://en.wikipedia.org/wiki/The_Good_Wife_season_4 )
191.
by cb321 2y ago
This is a good point. I've been using Gentoo since early 2004 (the dreaded Pentium IV era, Lol). Lately, I run into this with dev-lang/tcl only being need to build dev-db/sqlite. I actually think it's pretty weird tha
192.
by cb321 2y ago
I am not sure if the semantics have drifted over the decades to what you say, but this seems not quite right according to wikipedia: https://en.wikipedia.org/wiki/Second-system_effect EDIT: but I do agree that startin
193.
by cb321 2y ago
Thanks (to all correctors). FWIW, that zlib-ng discussion page you link to has way more information about what machine the benchmarks were run on than TFA. It's also a safe bet that Google timed their chromium lib (which seems reall
194.
by cb321 2y ago
I think this may not be a very high bar. zippy in Nim claims to be about 1.5x to 2.0x faster than zlib: https://github.com/guzba/zippy I think there are also faster zlib's around in C than the standard install
195.
by cb321 2y ago
That is a better than average benchmark page. As alluded to in https://news.ycombinator.com/item?id=43319010 , I see these tests were collected against just 2 Intel and 2 ARM CPUs. So, if you are looking for feedback to imp
196.
by cb321 2y ago
While some people here are citing 10% as "large" and 1% as "normal", there are optimizations like partial inlining of doubly recursive Fibonacci that can reduce the actual work (and so also time) exponentially (factors
197.
by cb321 2y ago
"pointerizing" might be another name. It would be utterly unsurprising if the database/sql world had more than one other name as well. Usually, ideas that go back to the 1950s at the dawn of data representation have many na
198.
by cb321 2y ago
Not sure there aren't 10 other "lines of discussion/disagreement" on this, but the one I think might be most salient is Davidson's https://en.wikipedia.org/wiki/Anomalous_monism (Davidson was a
199.
by cb321 2y ago
>In short: take (from anybody) as long as yougive (to anybody) Another pithy way people express this is with "pay it forward" https://en.wikipedia.org/wiki/Pay_it_forward
200.
by cb321 2y ago
To amplify your point, life is indeed weird that way. Feynmann's 69 while, as you say, is not exceptionally long was at least average for men in American in the 1980s. As a far too minimal smattering: https://en.wikipedia.
201.
by cb321 2y ago
For a different, perhaps more practical take on small pointers in hash tables, you might find this interesting: https://probablydance.com/2018/05/28/a-new-fast-hash-table-i... with contemporaneous discussion
202.
by cb321 2y ago
Many of those are very funny. Where would we be without the Chuck Norris joke format? Of course, paraphrasing @sitkack 's observation in the other comment thread (combining with my idea that streaming alone is faster than all that rep
203.
by cb321 2y ago
> The compression was trivial: store a suffix preceded by one byte that contained the length of the prefix that the word shared with its predecessor in dictionary order This is more or less what was speculated upon as compatible with his
204.
by cb321 2y ago
I was curious if "approximate was even faster than exact" at the time in 1975..78. So, I learned a bit how to get a v7 booting on a SIMH pdp11 simulator. I actually got an ordered merge against @Paul_Houle's delta-against-t
205.
by cb321 2y ago
How about MANTFANG (for microsoft, apple, nvidia, tesla, facebook, amazon, netflix, google)? If you drop Tesla, you can have "MANFANG" which fits 2025 Hollywood's year of the werewolf or if you reorder them you could have &q
206.
by cb321 2y ago
Actually, @probably_wrong was actually right above. It took a while, but I found Bentley 1986 Programming Pearls Column 13 describes Kernighan & Plaugher 1981 as describing the original v6 spell in more detail as indeed the smart merge
207.
by cb321 2y ago
I needed to disable the Enhanced Tracking Protection button (under the shield by the https lock icon in the URL bar) to get it to work, but otherwise firefox works fine for me on Linux with this site.
208.
by cb321 2y ago
In fact, I think this smart merge technique would have been faster (and exact, with no approximations!) than what McIlroy 1982 describes on 1975..1980 hardware in spite of not fitting in memory. The end of that article says it took abo
209.
by cb321 2y ago
Well, there is also https://nim-lang.org as well as a pretty big list at https://en.wikipedia.org/wiki/Off-side_rule . Just expanding, not trying to invalidate your valid question!
210.
by cb321 2y ago
I have a feeling the algorithm used was not the smart merge mentioned in the grandparent. That "slower" spell was in v6 Unix { https://en.wikipedia.org/wiki/Spell_(Unix) } which came out in 1975 and by 1973

More ›