• 0 Posts
  • 240 Comments
Joined 1 year ago
cake
Cake day: June 4th, 2025

help-circle


  • notabot@piefed.socialtoSelfhosted@lemmy.worldContinuwuity
    link
    fedilink
    English
    arrow-up
    37
    arrow-down
    2
    ·
    2 days ago

    The problem is “cuteness” is very much in the eye of the beholder for things like this, and I’m with neatchee here, it’s not cute, and it makes it basically unshareable, and hence unusable in a lot of contexts. I appreciate the effort that’s gone into the project, but the name and publicity massively detract from that.



  • If there’s one layer of clothes then you’re correct, it O(1). On further thought deeper piles are not O(log N), but O(N). Once the number of items exceeds C it takes more than a single operation to retrieve an item from the bottom layer, and the number of operations is proportional to the number of layers, or N/C.

    If you consider either picking an item up or moving it aside as a single operation, then retrieval from a single layer take 1 operation, and is O(1), but retrieval from the bottom of a two layer pile actually takes 3 operations (move the top item, retrieve the target item, replace the top item into the bottom layer, or you risk getting a deeper pile in one slot in the pathalogical case). Retrieval from the bottom of 3 layers takes 5 operations (move, move, take, replace, replace). in other words we have an O(1) process for taking the target item, and an O(N/C)=O(N) process for uncovering it in the first place, giving O(N) over all.

    Your statement that “considering that the naximum amount of clothes is likely very small, it can be treated as O(1).” is true iff N<=C, which, I concede, is a likely scenario in any well managed laundry pile, hence comment about cache sizing.


  • Not if items are covered by other items. You’ve got a layer of fast L1 cache that is O(1), but exceed the limit of that layer by placing an item of clothing on top of it, and some elements are effectively “pushed down” to a higher latency tier, which is going to be closer to O(log N) as you have to move some percentage of the items out of the way to get to the target item. Cache eviction (doing the laundry) will reset this.

    As always careful optimisation of the cache size, in relation to the expected distribution of items to be accessed, is key to maximising performance.






  • Ok, it’s a detail from the Procession of the Magi fresco in the Medici chapel in Florence, specifically part of the Procession of the youngest king. There’s images of parts of it in the link above, or a full landscape here. Our chap is near the left end.

    Benozzo Gozzoli, the artist, seems perfectly capable of painting hands, so it seems likely that he did this deliberately. He’s included the likenesses of key members of the Medici family as the kings, and more of the family and their friends as the retinue, so it is very likely that the image represents a specific person. There’s another figure, in the next panel, wearing a bright red cap, holding his hand in a similar way, so I suspect it is just supposed to show them relaxed, although the way the figure in the OP is holding his belt and staring at the viewer in an alnost challenging way makes me wonder if there is more the artist was trying to communicate.





  • notabot@piefed.socialtoLemmy Shitpost@lemmy.worldsmart ☝️🤓
    link
    fedilink
    English
    arrow-up
    55
    arrow-down
    1
    ·
    11 days ago

    Set up a shell company. Set up a trust somewhere with no capital gain tax. Shift ownership of the shell to the trust. As the shell, come to an agreement in principal with the bank to buy it. Use this as colateral to raise a loan from the bank for the purchase amount. Transfer the debt to the bank as part of the merger with the shell company. The bank now basically owes itself to itself. Sell the combined company from the trust, thus avoiding capital gain tax.