Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
mrkeen
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
44 ms
·
541.
▲
by
mrkeen
1y ago
Adding onto this. > LinkedIn used site activity data (e.g. someone liked this, someone posted this)1 for many things - tracking fraud/abuse, matching jobs to users, training ML models, basic features of the website (e.g who viewed y
542.
▲
by
mrkeen
1y ago
1) We regularly get given bad data that requires us to debug. Financial transactions whose description and/or dates change, unique Ids are sometimes present and sometimes missing. 2) We have those - support app for the support team, a
543.
▲
by
mrkeen
1y ago
> if i have 1mil ARR, i can hire some devs to remake my product from scratch This assumes a pool of available devs who haven't already drunk the Koolaid. To put it another way: the 2nd wave of devs will also vibe code. Or 'foc
544.
▲
by
mrkeen
1y ago
What are the tricks for investigating customers' data that don't violate privacy?
545.
▲
by
mrkeen
1y ago
(x, y)f;
546.
▲
by
mrkeen
1y ago
It's chaining functions with a dot, just like you do in typical OO languages. When it's OO, it's a virtue that everyone loves - a "fluent interface". When it's FP - oh it's unreadable! Why don't they
547.
▲
by
mrkeen
1y ago
> Built upon the robust European Digital Identity Wallet framework Doesn't exist. Everything written about it is in the future tense.
548.
▲
by
mrkeen
1y ago
> Selecting a sync engine is a lot about knowing the constraints of your application. Not so sure about this. These seem more like fundamentals than sliding scales. > How many people will concurrently edit the same resources? More th
549.
▲
by
mrkeen
1y ago
Probably both? Paxos is used in Spanner.
550.
▲
by
mrkeen
1y ago
Other way around. Step 1 of Raft is for the distributed nodes to come to consensus on a fact - i.e. who the leader is. ALL of Paxos is the distributed nodes coming to consensus on a fact. Raft just sounds easier because its descriptions u
551.
▲
by
mrkeen
1y ago
So what do you do if a balance has $30 and the audit table shows two deposits of $20?
552.
▲
by
mrkeen
1y ago
Nah I think I'd just prefer to figure out the types in type-checking phase, then erase and get on with things. I don't buy that most polymorphism is dynamic. No example of 'new T()' (which wouldn't be improved by
553.
▲
by
mrkeen
1y ago
Exactly. If they agree, then there was no point to introducing a second source of truth. If they disagree, then which one do you trust?
554.
▲
by
mrkeen
1y ago
Hackers can add weight to an aircraft as fast - if not faster - than formally-trained engineers. As long as we keep measuring LOCs or features added, there will always be jobs for them.
555.
▲
by
mrkeen
1y ago
And you get this part somewhat for free if you're actually testing as you're going. When my service wants to store and retrieve as part of its behaviour, of course I'm going to back it with a hashmap first. Once I know it f
556.
▲
by
mrkeen
1y ago
> but you can't do that many things wrong with a stateless application running in a container > As long as you don't shred your dataset with a bad migration or some bad database code, most bad things at this level can be fix
557.
▲
by
mrkeen
1y ago
Audit tables are a dumb concept because they imply bolting on an actual source of truth in addition to the regular not so source of truth tables , and only if the programmer gets around to it (like documentation or logging or whatever el
558.
▲
by
mrkeen
1y ago
6:55> "C98" 7:05> "It's faster to write five lines of code today, than to write one line today, and have to edit it in the future" This is my experience writing C as well, which is why I now avoid it. There ar
559.
▲
by
mrkeen
1y ago
No idea how common it is. It's never been my main work language but I've been using it at work for prototyping/scripting/automation/analysis etc for at least ten years now. It looks like what I've done is most
560.
▲
by
mrkeen
1y ago
Haskeller here! > The idea that the example program could use pattern matching to bind to either test values or production ones is interesting, but I can’t conceptualize what that would look like with the verbal description alone. The ar
561.
▲
by
mrkeen
1y ago
> the very popular meme in software engineering was that functional programming is really hard > I'm certain the meme was mostly born out of unfamiliarity > I would go so far as to blame Haskell for the misplaced belief that F
562.
▲
by
mrkeen
1y ago
> I might not find your examples compelling, because they require 2 passes over the data. Are these the examples? >> For example, if you want to fold over a partial data structure, you can use `filter` to select only the elements y
563.
▲
by
mrkeen
1y ago
I don't know if you're referring to a particular language's peculiarities, but it doesn't really matter. It's mutation. tombert's point (I think) is that in a functional setting, factorial(n) is always facto
564.
▲
by
mrkeen
1y ago
It's implied by void-returning do-something-with(...). Otherwise you're just burning cycles and a good compiler should dead-code eliminate the whole loop. (see https://news.ycombinator.com/item?id=44873488 )
565.
▲
by
mrkeen
1y ago
If it does, then you would be able to express a race condition with it. EDIT: I re-read parent comment. >> the biggest advantage to using tail recursion over vanilla loops is the ability to keep using persistent data structures withou
566.
▲
by
mrkeen
1y ago
Nope. Loops are unnecessary unless you have mutation. If you don't mutate, there's no need to run the same code again: if the state of the world did not change during iteration 1, and you run the same code on it again, the state
567.
▲
by
mrkeen
1y ago
I'll bite. What's an example of such a loop?
568.
▲
by
mrkeen
1y ago
* I don't think you meant to compare forcing each element (as opposed to forcing the input or output data structures) * If you did mean it that way, I doubt Python can avoid forcing each element that goes through its generators. (W
569.
▲
by
mrkeen
1y ago
Once they've been converted from free variables to formal parameters then it's assumed you can just stack allocate them, and roll them off when you return from your lambda (which is no longer a closure)
570.
▲
by
mrkeen
1y ago
Given that Hack had generics as early as 2014, it seemed that those who were worried about PHP being stuck were right. Unless I'm misunderstanding what this proposal (not finished artifact) is about.
More ›