Post #580613
2026-03-08 02:48 UTC
no persistent storage
Doesn’t it have one-time copy-on-write persistent storage?
Performance - O(1) lookup time for any date
Going to need to see the math here. It’s March, explain the O(1) transition to view October 12th.
Replies (4)
-
@perishthethought@piefed.social 2026-03-08 03:00
Oh damn, I was afraid someone would ask about that. I just thought it sounded good.
-
@Trilogy3452@lemmy.world 2026-03-08 04:54
Constant: 12 months. Beyond this year? Error 404
-
@Ephera@lemmy.ml 2026-03-08 05:53
Yeah, this should be equivalent to interpolation search, which has an average performance of O(log(log(n))). It helps that the months are separately indexed, so instead of a search on 365 input elements, you can do two searches with much lower input size, i.e. 12 and 31. But yeah, you’re still in the larger O(log(log(n))) category with that.
-
@cornishon@lemmygrad.ml 2026-03-08 06:39
Since the data structure has a static size, that is N is constant (12 months, 365 days) , technically any operation on it is O(1).