Reader9

@Reader9@programming.dev

• ⁨Comment⁩ on ⁨Lemmy 0.19 updates⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Agreed. My copy lost this documentation link in the original which gives more detail about the horizontal scaling: join-lemmy.org/docs/…/horizontal_scaling.html.

  It seems really straightforward (which is a good thing), each backend Lemmy_server handles incoming requests and also pulls from a shared queue of other federation work.

• ⁨Comment⁩ on ⁨Lemmy 0.19 updates⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Time zones are an endless source of frustration, this one doesn’t sound too bad though:

  Going forward, all timestamps in the API are switching from timestamps without time zone (2023-09-27T12:29:59.113132) to ISO8601 timestamps (e.g. 2023-10-29T15:10:51.557399+01:00 or Z suffix). In order to be compatible with both 0.18 and 0.19, parse the timestamp as ISO8601 and add a Z suffix if it fails (for older versions).

  github.com/LemmyNet/lemmy/pull/3496

• Lemmy 0.19 updatesprogramming.dev ↗
  Submitted ⁨⁨1⁩ ⁨year⁩ ago⁩ to ⁨programming@programming.dev⁩ | ⁨5⁩ ⁨comments⁩
• ⁨Comment⁩ on ⁨Bloom filters: real-world applications⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  This data structure uses a 2-dimensional array to store data, documented in this scala implementation: github.com/twitter/…/CountMinSketch.scala. I’m still trying to understand it as well.

  Similar to your idea, I had thought that by using k bloom filters, each with their own hash function and bit array, one could store an approximate count up to k for each key, which also might be wasteful or a naïve solution.

• ⁨Comment⁩ on ⁨Bloom filters: real-world applications⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  I haven’t used them in Spark directly but here’s how they are used for computing sparse joins in a similar data processing framework:

  Let’s say you want to join some data “tables” A and B. When B has many more unique keys than are present in A, computing “A inner join B” would require lots of shuffling if B, including those extra keys.

  Knowing this, you can add a step before the join to compute a bloom filter of the keys in A, then apply the filter to B. Now the join from A to B-filtered only considers relevant keys from B, hopefully not with much less total computation than the original join.

• ⁨Comment⁩ on ⁨Bloom filters: real-world applications⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Collage sounds really interesting , will check it out. Another variation on bloom filter I recently learned about is count-min-sketch. It allows for storing/incrementing a count along with each key, and can answer “probably in set with count greater than _”, “definitely not in set”.

  Thanks for adding more detail on the DB use-cases!

• Bloom filters: real-world applicationsllimllib.github.io ↗
  Submitted ⁨⁨1⁩ ⁨year⁩ ago⁩ to ⁨programming@programming.dev⁩ | ⁨10⁩ ⁨comments⁩
• ⁨Comment⁩ on ⁨Replacement Bulb for Ultrafire WF-500 Flashlight⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  I found a few references to this exact model on candlepowerforums.com which I believe has more folks who own(ed) incandescent lights. Not that has been such a long time, but LED technology advanced very quickly. Not sure if that will help your search.

  There’s also a few people over on !flashlight@lemmy.world !

• ⁨Comment⁩ on ⁨Help identifying job title⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Although your current role wouldn’t seem very senior at a large organizational, “senior“ is a relative term and at this company it seems like you are the engineer with ownership responsibilities over the end-to-end software development of a production system. So it might still be reasonable to use a senior title if there are other benefits

• ⁨Comment⁩ on ⁨Programming.Dev Feature Requests⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Good point and I agree with the downsides. Giving admins more granular ways of hiding content sounds healthy.

  There’s also the important distinction between admins finding opinions on the other instance “disagreeable” and muting vs. illegal content in the instance server’s jurisdiction and those of the admins. Defederating the whole instance does seem harsh if the problem is within specific communities only and doesn’t deal with illegal content.

  Difficult problem!

• ⁨Comment⁩ on ⁨Programming.Dev Feature Requests⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Feels odd for admins be able to prevent users from seeing content

  My understanding is those admins aren’t just allowing users to view it but also allowing copies of the federated data to be stored on the server those admins are responsible for, so for certain types of content it seems really important to be implemented in this way.

• ⁨Comment⁩ on ⁨How do you get your team to write tests?⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  This is a great suggestion because it focuses directly on tracking the outcome (did the software work?) and it gives a fair chance to the folks who don’t want to test - maybe their code really is perfect!

  Another similar metric I would add is the number of rollbacks of newly released code, if the CD system supports it using a method like canary or blue-green rollouts.

• ⁨Comment⁩ on ⁨How do you get your team to write tests?⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Focusing on code coverage (which doesn’t distinguish between more and less important parts of the code) seems like the opposite of your very good (IMO) recommendation in another comment to focus on specific high-value use-cases.

  From my experience it’s far easier to sell the need for specific tests if they are framed as “we need assurances that this component does not fail under conceivable usecases” and specially as “we were screwed by this bug and we need to be absolutely sure we don’t experience it ever again.”

  Code coverage is an OK metric and I agree with tracking it, but I wouldn’t recommend making it a target. It might force developers to write tests, but it probably won’t convince them. And as a developer I hate feeling “forced” and prefer if at all possible to use consensus to decide on team practices.

• ⁨Comment⁩ on ⁨How do you get your team to write tests?⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  One aspect that does work is framing the need for tests as assurance that specific invariants are verified and preserved

  Agreed - this is the specific aspect which I hoped would be communicated by studying TDD a bit!

  The team is afraid that making changes will be more difficult when tests exist, but TDD (or maybe a more specific concept like you mentioned) demonstrates that tests make future changes easier.

  And I specifically advocated not to follow “write tests first”.

  Name-dropping concepts actually contributes to loose credibility of any code quality effort, and works against you.

  OK. If I were having an in-depth discussion with my team of fellow developers to convince them to start writing tests, I don’t think that’s name-dropping.

• ⁨Comment⁩ on ⁨How do you get your team to write tests?⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  We can’t test yet, we’re going to make changes soon

  This could be a good opportunity to introduce the concept of test-driven development (TDD) without the necessity to “write tests first”. But I think it can help illustrate why having tests is better when you are expecting to make changes because of the safety they provide.

  “When we make those changes, wouldn’t it be great to have more confidence that the business logic didn’t break when adding a new technical capability?”

• ⁨Comment⁩ on ⁨Intentionally corrupting LLM training data?⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  It’s probably not going to work as a defense against training LLMs (unless everyone does it?) but it also doesn’t have to — it’s an interesting thought experiment which can aid in understanding of this technology from an outside perspective.

• ⁨Comment⁩ on ⁨Site Stability⁩ ⁨⁨1⁩ ⁨year⁩ ago⁩:

  Thank you! Anywhere we can follow along just to learn more? !lemmy_support@lemmy.ml ?