nsajko

28 ms·

301.
by nsajko 4y ago
The information you present is completely consistent with what smoldesu said.
302.
by nsajko 4y ago
This linked page might be particularly interesting: https://en.wikipedia.org/wiki/Inattentional_blindness
303.
by nsajko 4y ago
Even if all current Wayland compositors adopted Gnome's protocol extensions, that wouldn't really solve anything; because another compositor could appear next week and choose to abide by pure Wayland, ignoring Gnome's quasi-s
304.
by nsajko 4y ago
> we now get proper standardized components This is exactly the thing that's missing and it's practically impossible to hack on top of Wayland now, because any new standard that appears would be just another competing standard
305.
by nsajko 4y ago
The elephant in the room that most people miss in these discussions is that these problems aren't so much bugs with any specific part of the Wayland stack as they are limitations core to the Wayland design. It's not going to get b
306.
by nsajko 4y ago
> You need deep understanding of the compiler to know what constructs will mess up performance. Especially how typeinfo is propagated. Could you expand on this? It's not clear whether you're just talking about issues that would
307.
by nsajko 4y ago
No. Take a look at the GCC or Clang bug trackers, for example.
308.
by nsajko 4y ago
> explaining to researchers and scientists [...] is exercise in frustration A person unwilling to learn how to use their tools won't be able to use them with optimal efficiency. Does this have anything to do with Julia, specifically
309.
by nsajko 4y ago
All other languages and language implementations have bugs, too.
310.
by nsajko 4y ago
> new things tend to have unknown bugs Guess what also has unknown bugs? Old C code.
311.
by nsajko 4y ago
So what's the problem with extending regexp then?
312.
by nsajko 4y ago
Thanks for voicing your opinion. That said, I don't see constructive criticism here. From what I gather I was basically at fault for daring to somewhat disagree with burntsushi. > who has implemented an excellent ... This is an appe
313.
by nsajko 4y ago
You say: > resistant to catastrophic backtracking despite features which normally translate to nfa I interpret this as you equating NFA with backtracking engines, which would be incorrect. Is my interpretation wrong?
314.
by nsajko 4y ago
I'm curious about why someone would downvote the comment I'm replying to.
315.
by nsajko 4y ago
> Using large, complicated regexes is a very bug-prone practice in general. Yes, this is exactly why extending RE is necessary.
316.
by nsajko 4y ago
Your proposed implementation makes sense for the case of merely taking the complement of a simple regular expression. But the point of having the complement operator available is to be able to take complements of arbitrary sub-expressions w
317.
by nsajko 4y ago
One of the papers that I was referring to above is "Derived-term automata for extended weighted rational expressions" by Akim Demaille, from 2016. I haven't managed to study the topic more closely yet, but the idea seems to b
318.
by nsajko 4y ago
There are tradeoffs, for sure; but say one creates an API with separate procedures for compilation and execution, I think one could call such an engine a "general purpose one" even with the compilation taking quadratic (or even ex
319.
by nsajko 4y ago
> Can you show me the research that states how to add things like complement and intersection to general purpose regex libraries? Sorry, don't have time for that right now, but look into regular expression derivatives and similar st
320.
by nsajko 4y ago
> the complement operation would need to take the complement inside the set of valid UTF-8 strings rather than the set of all byte-sequences Anything else would be a bug in any case.
321.
by nsajko 4y ago
Of course, Unicode is just another alphabet. Specific expressions might be problematic though, depending on the implementation. EDIT: If malicious inputs are something to be worried about, I think a good way to do this would be to check for
322.
by nsajko 4y ago
> features which normally translate to nfa (e.g. backrefs) You're very wrong, backreferences in general can't be translated to finite automata (NFA is short for nondeterministic finite automaton). See these comments: https:&#x
323.
by nsajko 4y ago
I guess that adding timeouts can significantly decrease the run time efficiency?
324.
by nsajko 4y ago
Various regexp implementation possibilities do exist, whether in software or in hardware. I think my general point stands independently of which regexp implementation is used (although the comparisons get hairy if you include the irregular
325.
by nsajko 4y ago
The owner of that repo had an interesting regexp-related thesis ("Skip Regex"): https://github.com/ethanpailes/thesis https://www.proquest.com/openview/e7295f20d24f203900f6291d6d...
326.
by nsajko 4y ago
This is effectively just a nicer syntax than usual for regular expressions, but there are actual areas of semantics where regexp languages are ripe for improvement - most regexp libraries are stuck in the 80s/90s, not keeping up with r
327.
by nsajko 4y ago
Your comment is implicitly backed by a false dichotomy. Some people (based in USA and old enough, for example) will know about it from direct experience. Other people know about it only from Billy the Mountain.
328.
by nsajko 4y ago
> Howard Johnson's had fried clams, did not know that. Funnily, I suppose there's many people who know about Howard Johnson's serving clams, even though we know almost nothing else about the chain . This is thanks to Zapp
329.
by nsajko 4y ago
Why do you think this is about ethnicity? The more plausible interpretation is that some scientists are considered (in this article) as German because they come from German universities, while the locals are supported by the Kurdish governm
330.
by nsajko 4y ago
AFAIK there is no indication that Michael Jackson ever did anything inappropriate towards the children he welcomed to his estate. He even won in court. And TBH I detest that you're sort of comparing Jackson to these Crowleyites.

More ›