viralpraxis

Joined 3 years ago

Karma
12
Submissions
23
Member since
May 21
[ my public key: https://keybase.io/viralpraxis; my proof: https://keybase.io/viralpraxis/sigs/_hQ2XWkUCiEn888serGHcY9YhIPIjO4EQmDD6uA8kI0 ]
View on Hacker News

Recent submissions

Comment · 2 months ago
Every project I tested (mid- to large-sized) had some flaky tests caused by relying on the default row order. In my evaluation of 10 popular PG-based projects, most of them (6 or 7, although its hard to say for sure before sending patches and getting feedback) had at least one application-level bug related to this assumption. This probably isnt a very representative sample, but it at least shows that this is not a purely theoretical issue
Comment · 11 months ago
I’ve seen large Ruby projects with hunders of developers working on it for >10 years with almost 100% sorbet coverage. It’s just that in Ruby you have to pay (ie spend extra time) for decent degree of type safety.
Comment · 11 months ago
I was always wondering if there’s some sort of limitation in science. Just like in some games you can’t fly according to the rules (science), so there’s just no way to do that without cheating. What if e.g. in 5k years we will reach the limit? Basically like after playing a couple of months in minecraft the only thing you can do is to expand
Comment · 11 months ago
I don’t know, 210 is a lot. I’d expect him to solve the P =? NP problem during his morning coffe
Comment · 1 year ago
You can specify `minimum` and `maximum` property for these fields. So this schema

  {
    "$id": "https://example.com/test.schema.json",
    "$schema": "https://json-schema.org/draft/2020-12/schema",
    "title": "Person",
    "type": "object",
    "properties": {
      "hp": {
        "type": "integer",
        "description": "HP",
        "minimum": 1,
        "maximum": 15
      }
    }
  }
is converted to this BNF-like representation:

  hp ::= ([1-9] | "1" [0-5]) space
  hp-kv ::= "\"hp\"" space ":" space hp
  root ::= "{" space  (hp-kv )? "}" space
  space ::= | " " | "\n"{1,2} [ \t]{0,20}
Comment · 1 year ago
I’m not a parent, so it might be I completely do not understands some important aspects of this due to lack of expirience, but I hope I’ll be more smart than my parents. It was quite easy to google things my parents were silent about, but I still remeber that feeling of guiltiness. It affected me much more than knowing what the bdsm is
Comment · 1 year ago
I’m sorry for an off-topic, are there any non-determenistic compilers you can name? I’d been wondering for a while if they actually exist
Comment · 1 year ago
Even if that’s true, it still doesn’t mean vibe coding is safe. :P
Comment · 1 year ago
One thing people usually do is

D = Data.define do E = new end

which is wrong since ’E‘ escapes (it becomes ´Object::E´)

also, I agree that its kinda weird to use Ractor API but for us (service object gem) it was the best way to check if an argument is immutable (via Ractor.shareable?)

Comment · 1 year ago
Now, imagine this situation taken to the extreme: searching for a job with relocation opportunities while residing in a country that many avoid for ethical reasons. :(
Comment · 2 years ago
Comment · 2 years ago
Can it be used to trace containers with «host» network driver?
Comment · 2 years ago
Incompetence
Comment · 2 years ago
Can someone elaborate if the term “AST” is used correctly in the article?

I’ve been playing with mutation-injection framework for my master’s thesis for some time. I had to use LibCST to preserve syntax information which is usually lost during AST serialization/deserialization (like whitespaces, indentation and so on). I thought that the difference between abstract and concrete trees is that it’s guaranteed CST won’t lose any information, so it can be used to specific tasks where ASTs are useless. So, did they actually use CST-based approach?

Live from the official Hacker News API

A modern reader for Hacker News · SvelteKit + Skeleton