benibela

53 ms·

571.
by benibela 6y ago
Or Wuffs I do not know much about Wuffs, but it seems to be completely safe. No arithmetic overflows, no bound checking failures, no None unwrapping panics, no memory allocation failure panics.
572.
by benibela 6y ago
XML tried to do that with the anyURI data type In XML/XSD 1.1 they gave up on it, and consider any string as valid anyURI I tried to implement the old XML types. I built a huge regex from the RFC, but it did seem to cover all cases
573.
by benibela 6y ago
An example of useless filters: today I spent like 15 minutes searching for my teapot on my kitchen bench. I did not find it. Later I walked in my kitchen and immediately spotted the teapot. It was standing next to the kettle in the middle o
574.
by benibela 6y ago
I just wrote my own comment system. It does not take long
575.
by benibela 6y ago
There is a severe lack of Pascal
576.
by benibela 6y ago
The worst is when project B is a closed source project. I have such an open-source project A that interacts with such a project B. That is the worst. Then I get a bug report, project B got a new version and your project A does not work an
577.
by benibela 6y ago
I have all my projects in a Mercurial monorepo on my laptop. And then I use a repo converter to create mirrors on SourceForge and Github. Now when I get a PR, I treat it as patch and merge it locally, before syncing the mirrors. But then it
578.
by benibela 6y ago
With a non-mainstream language, it is pretty much always a compiler bug I use Pascal, because it is very fast and has automated reference counting (ARC) for most types, so it is almost memory safe. It was the only way to get C-like speed, f
579.
by benibela 6y ago
I've used example.com in the test cases of my webscraper. When they changed the links on the page, the test cases were failing, and I complained to them, but they did not care
580.
by benibela 6y ago
>Most people readily agree that recursive descent parsers can provide the best possible error messages, Well, it could, but not all of them do. My hand-written parsers are pretty bad at it. At the lowest level I run through a string char
581.
by benibela 6y ago
This is about JSON xmlstarlet supports XPath 1, but the W3C did not stop there. They made XPath 2 featuring variables, lists and regular expressions, XPath 3 featuring higher order function, and finally XPath 3.1 featuring JSON support. Fo
582.
by benibela 6y ago
There is XPath 3.1: https://www.w3.org/TR/xpath-31/#id-lookup It is more verbose, like you get the size of something with array:size or map:size functions, so it is more readable I am implementing it in Xidel 0.9.
583.
by benibela 6y ago
files might be faster, because you can mmap them?
584.
by benibela 6y ago
Well, I had only skimmed the page But I am using xoshiro in my projects, because I thought xor was simpler than multiplication.
585.
by benibela 6y ago
However, this page claims PCG is rather bad: http://pcg.di.unimi.it/pcg.php They recommend to use their xoshiro PRNG.
586.
by benibela 6y ago
>Why not get a persistent vector? I have not read about them. Might take a while to implement. I use Pascal. But it is hard to find Pascal libraries for anything. Either they do not exist at all or have not been maintained for over a de
587.
by benibela 6y ago
>Sure. Map the HAMT to an index into a persistent vector or something e.g. Scala's VectorMap and TreeSeqMap I do not have a persistent vector, only a HAMT. Perhaps the HAMT becomes a standard trie if one sets hashcode(i) = i, and th
588.
by benibela 6y ago
Btw, can it be used to build a persistent dictionary that keeps the key in insertion-order?
589.
by benibela 6y ago
I have implemented something like that in Pascal: https://github.com/benibela/hamt
590.
by benibela 6y ago
You could freeze your brain and keep it frozen for a few hundred years, till they have nanobots to repair the freezing damage and scan the brain
591.
by benibela 6y ago
An refrigerated transporters are not the most efficient way to transport meat To transport lots of meat, we can look at the oil industry again and move it up to the next level: meat pipelines
592.
by benibela 6y ago
I once paid 350€/month when I made 200€/month The minimal self-employment fee
593.
by benibela 6y ago
The courts decide what is a large platform. And they decide what is "not illegal" In Germany, there were actually cases where courts have ruled that facebook is not allowed to delete non illegal posts: https://www.heis
594.
by benibela 6y ago
Most shrimp farming uses a lot of antibiotics and destroys mangroves
595.
by benibela 6y ago
> It's not bad for eye health by the way [1] Do not be so sure about this. http://www.myopia-manual.de/ has a lot of information. Page. 131ff: >The development of chicks towards emmetropization was observed at va
596.
by benibela 6y ago
Rather than a generator, I could use a good verifier, i.e., an accurate grammar checker
597.
by benibela 6y ago
It is the DeMillo-Lipton-Schwartz–Zippel lemma If two polynomials evaluate to equal numbers with random variables values, the polynomials are almost certainly equal themselves Ofc, x = 0 and x = 1 are hardly random
598.
by benibela 6y ago
Here is a library with lots of types: https://github.com/avk959/LGenerics
599.
by benibela 6y ago
>You could convince me bears or apes make beds of grass, too Apes build trees beds: https://www.nationalgeographic.com/science/phenomena/2012/04...
600.
by benibela 6y ago
I do not understand how this would help It would still need reference counting on the handles to know when the handle is not used anymore and the element in the array can be reused Without reusing handles it would surely run out of memory.

More ›