cb321

80 ms·

841.
by cb321 6y ago
I could be wrong, but I believe the acronyms are: ARC = Automatic Reference Counting (NOTE: not Atomic) ORC = Optimized Reference Counting The loopy/circular character of the letter 'O' may be a secondary mnemonic since i
842.
by cb321 6y ago
Nim is indeed a great answer for this. Should you want to give that script a nice, traditional CLI then you can do so with very low effort using https://github.com/c-blake/cligen Should you want "script like"
843.
by cb321 6y ago
Compile times can be even faster (like 200 milliseconds) with the TinyCC/tcc backend. (Of course, optimization of the generated machine code suffers some.)
844.
by cb321 6y ago
I believe your point is valid. If the universe ends in big crunch there may also be insufficient proper time to form a singularity. People often confuse event horizons for singularities, partly because of Penrose's work. :) I think
845.
by cb321 6y ago
The Penrose-Hawking singularity theorems go back 55 years to work starting in 1965. No joke. This has be to near a record in time lag between the work the Nobel committee recognized and when that work was first published. Better late tha
846.
by cb321 6y ago
I agree with much else said here about the failure -> crank -> taboo problem, but it bears noting that the Fermi paradox is not really a paradox. There is this https://arxiv.org/abs/1806.02404 . The 2 minute lay
847.
by cb321 6y ago
Nim almost always produces faster running executables than Go in my experience, but is also higher level/more featureful. It also compiles very quickly if you use the TinyCC/tcc backend C compiler.
848.
by cb321 6y ago
Technically the request was for ls *(^/) in Zsh-ese.
849.
by cb321 6y ago
Well, sure. You can also switch to Robin-Hood linear probing to work well at high load factors and retain the almost never >1 DRAM hit. These are just various hash table options to claw back some load factor ratios of space usage.
850.
by cb321 6y ago
What Python calls "list" other languages call "array" (or "vector" or "seq" or "dynarray" or ...). So, it is not at all "instead of arrays" as you said, but rather "arrays by
851.
by cb321 6y ago
func-argparse seems much like https://pypi.org/project/argh/ the inspiration for the Nim https://github.com/c-blake/cligen which can source its "pseudo specification" from either a
852.
by cb321 6y ago
You can define an expose a C interface to Nim libraries, as you can with C++. See https://github.com/c-blake/lc/ and the extensions/lcNim.nim, for example. lc happens to load it from Nim, but the produced s
853.
by cb321 6y ago
If you use the TinyCC/tcc back end then compiling is nearly instant (I use the "tcc mob branch" all the time). You can even put a shebang at the top of your file (#!/usr/bin/nim r) and have an edit-run cycle s
854.
by cb321 6y ago
To follow up on lightgreen's comment, in arijun's own linked-to URI they specifically mention the new level of indirection right away. Indirection is not "free" at all. For very large dict()s in main memory/DRAM i
855.
by cb321 6y ago
> (everybody overlooks hash tables. I don't know why.) It is probably worse than you think since a hash table can also replace the Bloom filter in its "false positives allowed" filtration role. Not sure if that's wha
856.
by cb321 6y ago
I was wondering the same thing. Perhaps he means all the extra "fire::" annotations one needs to put in place in function parameter lists as well as the ultimate dispatcher instatiating cpp macro? Really there is always at least
857.
by cb321 6y ago
Agreed vis a vis SHIFT. cligen also has a global config file [1] to control syntax options like whether '-c=val' requires an '=' (and if it should be '=' or ':', etc.) which has been discussed here, v
858.
by cb321 6y ago
I feel like argh and plac preceded/inspired Click. Also, it's not Python but in Nim there is https://github.com/c-blake/cligen which also does spellcheck/typo suggestions, and allows --kebab-case --camel
859.
by cb321 6y ago
I should also have said that this competing idea was raised literally in the very same Burton Bloom 1970 paper that the more famous filters come from. Analysis of speed these days (where a single main memory hit is thousands of superscala
860.
by cb321 6y ago
It bears mentioning that not only cuckoo filters but also simply vanilla linear probed hash tables of B-bit truncated hashes (sometimes called fingerprints) can be a better substitute for Bloom filters. This seems a highly under propagated