rix0r (u/rix0r) - Readit News

rix0r commented on The Gruen Transfer is consuming the internet sebs.website/blog/the%20g... · Posted by u/Incerto

miki123211 · 8 months ago

> In the EU, it is a legal requirement to allow your customers the same method, with the same number of steps and complexity, for canceling as for subscribing. So if it takes 10 seconds to fill in a form online to get subscribed, they need to offer the same ease of use for canceling.

> I like this idea of ‘complexity’ as a measure for legislation.

So, if all you needed to do to subscribe was to find an ad on Facebook encouraging you to do so (which was the only place your plan was offered), to cancel, you need to... find another ad on Facebook encouraging you to cancel?

If subscribing required you to visit a physical store to verify ID (pretty common for SIM cards here), it's fine to also require that to cancel the contract, even though there's no point for it?

rix0r · 8 months ago

Do you fundamentally disagree with the intent of the regulation, or are you just putting on your software engineer's hat and using your decades-long honed skill of trying to find edge case problems in a set of rules?

rix0r commented on Hedy: Textual programming made easy hedy.org/... · Posted by u/0x54MUR41

broken-kebab · a year ago

Software development has its lexicon derived from English. Not learning it does exactly zero favor to kids. On the contrary: their time is wasted, they will need to learn it anyway, and it's sad that some well-intentioned people make them skip what cannot be skipped.

And the mistake seems to be repeated every 5-7 years. One can gather a whole cemetery of such initiatives, the earliest dating back to 70s I believe

rix0r · a year ago

You are evaluating this as a tool that is intended to train people up to being professional software developers.

It's not!

It's instead intended to give every child in the world, regardless of inclination, some first-hand experience in programming computers. Some of these may go on to become professional software engineers, and if they do it will be time enough to become proficient in the common lexicon. Even if they don't, at least they've gotten a better understanding of these machines that inescapably pervade our lives. And kids that wouldn't have thought they'd have an interest in programming get an easy-entry exposure and may decide to pursue it professionally after all.

Given that that's the audience, the goal is to take away any barrier to the essential skill to learn, which in this case is writing instructions for an unthinking machine.

Kids that already know they love programming and are/were willing to do whatever it takes to learn it (i.e., probably nearly everyone on this forum, including myself), are not the audience! Those kids will make it one way or another. Hedy is for all the other kids out there.

rix0r commented on Sieve is simpler than LRU cachemon.github.io/SIEVE-... · Posted by u/SerCe

rix0r · 2 years ago

There seems to be a mistake in the animation.

> On a cache miss, SIEVE checks the object pointed to by the hand. If the object has been visited, its visited bit is reset

When the animation gets to the point where the I element is checked against the cache, the hand moves off of D without resetting its visited bit.

rix0r commented on Everything you need to know about monorepos monorepo.tools/... · Posted by u/SerCe

rix0r · 4 years ago

Something very important not covered by the article:

Is the tool going to help me detect when I accidentally bypass the declared dependencies?

For example, in a basic monorepo it's very easy to accidentally rely on the file layout on disk (require'ing a dependency not in your package.json but that has been hoisted because it's a dependency of a different package accidentally succeeds, cp'ing files from `../some-other-project` should not be allowed but is possible). All of these invalidate some optimizations that monorepo tools want to make.

At scale with many contributors, it's HARD to teach and remember and apply all these rules, and so the monorepo tool really should help you detect and fix them (basically: fail the build if you mess up).

The article doesn't really make it clear which tools will do that for you. Pretty sure that Bazel does, Nx probably does, and lerna and turborepo don't.

rix0r commented on Fixing memory leaks in popular Python libraries paulsprogrammingnotes.com... · Posted by u/postpawl

rix0r · 4 years ago

Shouldn't

   sock.close()

imply

   sock.shutdown()

? Isn't it pointless to call both?

rix0r commented on Windows 10 will use protected folders to thwart crypto ransomware helpnetsecurity.com/2017/... · Posted by u/Errorcod3

rix0r · 8 years ago

The UI is not really explained. I hope this is not going to train more generations of Windows user to click "yes yes yes" in response to annoying dialogs.

rix0r commented on Things I Hate About PostgreSQL (2013) kupershmidt.org/pg/10_Thi... · Posted by u/subleq

CJefferson · 9 years ago

If I was doing slides like this, it would be because I was going to use them in a talk. Then I would want the back button to go back one slide.

If I then put them on the internet, I may not bother editing them to make the more "internet friendly".

rix0r · 9 years ago

But how would you go forward in the first place? Not with the "Forward" button, because you haven't visited the page yet.

Instead, you press "Right" or "PgDn" or what have you. So I would expect the converse button ("Left" or "PgUp") to go back a slide as well (which it presumably does).

That leaves the browser's Back button to go back to the previous web page.

Everybody's happy!

rix0r commented on Hitchhiker trees: functional, persistent, off-heap sorted maps github.com/datacrypt-proj... · Posted by u/hadronzoo

dgrnbrg · 9 years ago

That is very cool! When you end up doing reads, do you compute all the pending writes along the path from root to leaf, and then run queries on the projection?

rix0r · 9 years ago

For index-seeks, yes.

For key-seeks, it's a normal tree walk to the leaf (unless an INSERT is found at a higher level, iirc)

In practice, the blocks are so huge that any tree is going to have at most depth 3, and the root page is likely in cache, so 1 or 2 s3 fetches (= roughly 200ms, let's say)

I've been toying with the idea of putting the root page (or maybe the top 2 levels of pages) in DynamoDB, which would make them fast even if they weren't in cache.

rix0r commented on Hitchhiker trees: functional, persistent, off-heap sorted maps github.com/datacrypt-proj... · Posted by u/hadronzoo

rix0r · 9 years ago

Funny: I implemented the exact same thing, with a focus on AWS and pagination (albeit less well-documented):

https://github.com/rix0rrr/libbruce/blob/master/README.md