• 0 Posts
  • 685 Comments
Joined 2 years ago
cake
Cake day: June 21st, 2023

help-circle











  • Downtown NY? Why would anyone want to make that their destination? Also, why does one have to be on the street?

    Well someone who can’t afford a home out of state would presumably need somewhere to live until then, and there tend to be better resources in cities than in rural towns.

    They can get a job.

    Clearly you’ve never needed to search for one. Consider yourself lucky.

    I think you assume it’s Texas or the Streets, which is just funny

    I still don’t see your attempt to prove this wrong. Lets see you make a cross-state move to somewhere better with almost nothing in the bank. Show us all how it’s done. I’m the random internet stranger, and I’m now issuing you the same challenge you gave to them.




  • A national reform of voting methods to kill FPTP. Making all forms of political bribery illegal. Making illegal all forms of judicial bribery. Paying civil servants a competitive salary so that people don’t just make fun of government jobs and actually view it as competent. Making illegal all forms of anticompetition, including stipulations that prevent the government from negotiating on prices, and instead require it to do so. Rehiring Lina Khan.

    I don’t know. The list is long. It won’t happen though. If it were going to happen, it would have already started to.


  • 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.




  • I know a few people who have more plaque than teeth. I always want to say something, but it always seems like it’d be rude so I don’t.

    The plaque isn’t really the problem though (well it might be to their dental health but that’s on them). It’s the breath. I can’t stand within 5ft without gagging. Like they’re cool people otherwise, and I feel bad that it’s so bad, but it literally smells like week old roadkill being near them.

    Maybe some flesh eating flies can help here? Put them on the plaque and see if they eat it. The whole “larvae corkscrewing into the flesh” bit might lead to some cavities, but hopefully someone can get that piece under control, and worst case it’ll help the dentist prepare for any necessary fillings I guess.