Skip Navigation

InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)T

TehPers

@ TehPers @beehaw.org

Posts
0
Comments
458
Joined
3 yr. ago

  • AI Can't Help You Write Well

    Jump

  • The only person who can answer whether a tool will be useful to you is you. I understand that you tried and couldn't use it. Was it useful to you then? Seems like no.

    Broad generalizations of "X is good at Y" rarely can be accurately measured with a useful set of metrics, rarely are studied using sufficiently large sample sizes, and often discredit the edge cases where someone might find it useful or not useful despite the opposite being found generally true in the study.

    And no, I haven't tried it. It wouldn't be good at what I need it to do: think for me.

  • Does the AGPL license allows not disclosing the source of third party scripts (in)directly interacting with the main software?

    Jump

  • That's for deployed services that others are using.

    Either way, "generally" was the important word there. Every license is different, some licenses and parts of licenses are invalid in some jurisdictions, and the interpretation of the license by the judge, licensor, and licensee can affect a judgement on whether something is infringing or fair use.

    If you have questions about licensing for your specific situation and AGPL's plain text doesn't answer it for you (it's not just legalese, it's pretty readable), then talk to a lawyer who specializes in copyright for your jurisdiction.

  • Does the AGPL license allows not disclosing the source of third party scripts (in)directly interacting with the main software?

    Jump

  • Using an interface via something like HTTP is unlikely to be considered a derivative work or be bound by that server code's licenses (though there may still be other license agreements for end users of that service, ToS, etc - very, very unlikely if you're self hosting open source code), but if you're linking to an AGPL client library that connects to that API, you may be bound by the terms of the AGPL license.

    In all cases, copyright generally only applies to distribution. If you do not distribute any code or software, you are most likely fine.

    (Overusing "likely" because 1. not a lawyer and 2. copyright law is really complicated and mostly up to both jurisdiction and the judge)

  • Does the AGPL license allows not disclosing the source of third party scripts (in)directly interacting with the main software?

    Jump

  • Does the AGPL license allows not disclosing the source of third party scripts (in)directly interacting with the main software?

    Jump

  • GitHub CEO to step down

    Jump

  • Unity publishes some source code for reference purposes only. It is not open source, just made public.

  • New Method Is the Fastest Way To Find the Best Routes

    Jump

  • Guess I'll post another update. The block-based data structure makes no sense to me. At some point it claims that looking up a pair in the data structure is O(1):

    To delete the key/value pair ⟨a,b⟩, we remove it directly from the linked list, which can be done in O(1) time.

    This has me very confused. First, it doesn't explain how to find which linked list to remove it from (every block is a linked list, and there are many blocks). You can binary search for the blocks that can contain the value and search them in order based on their upper bounds, but that'd be O(M * |D_0|) just to search the non-bulk-prepended values.

    Second, it feels like in general the data structure is described primarily from a theoretical perspective. Linked lists here are only solid in theory, but from a practical standpoint, it's better to initialize each block as a preallocated array (vector) of size M. Also, it's not clear if each block's elements should be sorted by key within the block itself, but it would make the most sense to do that in my opinion, cutting the split operation from O(M) to O(1), and it'd answer how PULL() returns "the smallest M values".

    Anyway, it's possible also that the language of the paper is just beyond me.

    I like the divide-and-conquer approach, but the paper itself is difficult to implement in my opinion.

  • What Git clients do you use?

    Jump

  • Sorry, guess the replies are too tame. Let me help you with that.

    Anything more than the git CLI is a joke. Real developers should know how to raw-dog that thing. If you're not octopus merging your rebased branches to deploy to prod, you're just not a real developer.

    (I use gitui)

  • New Method Is the Fastest Way To Find the Best Routes

    Jump

  • Algorithms can be designed for multithreading yes. Divide and conquer algorithms, like this one, break the problem into independent chunks, and a map reduce on that work can force it to be done across multiple threads.

    The real question is whether you gain anything from it. Creating a thread and sending data back and forth has a cost as well, and it's usually a pretty big one relative to the work being done.

  • New Method Is the Fastest Way To Find the Best Routes

    Jump

  • In case anyone's curious, still working on it. It's not as simple as something like Dijkstra's algorithm.

    What's really interesting is the requirement that it seems to place on the graph itself. From what I can tell, the graph it wants to use is a graph where each node has a maximum in-degree of 2 and maximum out-degree of 2, with a total degree of no greater than 3. A traditional di-graph can be converted to this format by splitting each node into a strongly connected cycle of nodes, with each node in the cycle containing the in-edge and out-edge needed to maintain that cycle (with weights of 0) plus one of the previous edges.

    Theorerically, this invariant can be held by the graph data structure itself by adding nodes as needed when adding edges. That's what my implementation is doing to avoid having the cost of converting the graph each time you run the algorithm. In this case, one of these node cycles represents your higher level concept of a node (which I'm calling a node group).

    The block-based list is also interesting, and I've been having trouble converting it to a data structure in code. I'm still working through the paper though, so hopefully that isn't too bad to get done.

  • Announcing Rust 1.89.0

    Jump

  • A lot of code doesn't really care where the error came from. This can be useful when using anyhow in application code, for example.

    For library code, I don't see myself really using it, so it'll live next to all the other functions I don't use there I guess.

  • New Method Is the Fastest Way To Find the Best Routes

    Jump

  • This is awesome! I'm reading through their paper right now, and might try to implement it to see how it works in practice.

  • Connect and corrupt: C++ coroutines prone to code-reuse attack despite control flow integrity

    Jump

  • The same holds true for C++20's modules, which are really cool! Except you can't really use them because compilers don't fully support them yet.

  • Connect and corrupt: C++ coroutines prone to code-reuse attack despite control flow integrity

    Jump

  • It seems like the more interesting thing is bypassing CFI protections by abusing coroutines to jump around instead of inserting jumps to other functions.

  • What does everyone think of this new WIP language?

    Jump

  • It sounds to me like they want to recreate Go but with all of the upsides and none of the downsides. Pretty good goal. I think I'll give it another look now that it's been a while.

    Thanks for the overview!

  • What does everyone think of this new WIP language?

    Jump

  • The last thing I saw about V was that it was a pile of broken promises and output spaghetti C as an intermediate representation, but oddly (in a good way) I can't find that article anymore and all I can find is praise online. Maybe it'd be worth giving it another look now.

  • AWS deleted my 10-year account and all data without warning

    Jump

  • I've consulted in the software dev teams of dozens of major multinationals and the projects were always, without exception, some variant on "how can we replace people" or "how can we reduce costs by doing something slightly worse".

    Always might be an overstatement, but this has been true over the past couple years for myself and the people I know at these companies. Especially right now - upper management seems to be deluded into thinking that LLMs can do anything, or more likely, they're just trying to sell hype like everyone else just to raise the stock price.

  • What does everyone think of this new WIP language?

    Jump

  • It's extremely immature and only has a few examples. I can't find a reference or any real form of documentation either, though I'm sure it exists somewhere.

    If you're looking for an "efficient" programming language (you'll probably need to define that further but I'm assuming output size and compile speed), both Go (which seems to inspire this project) and Zig come to mind.

  • 2025 Stack Overflow Developer Survey

    Jump

  • My job has AI usage as an objective as well. It's ridiculous. If a tool will make my job easier, then I'll be the one to tell you, and I'll be the first person advocating for it. The people in charge aren't doing my job, so they can fuck off with the micromanagement.