Experimental browser for the Atmosphere
does anyone know an algorithm for summarizing file paths like a/b/x -> …/b/x a/b/y -> …/b/y a/c/x -> …/c/… so that a unique correspondence to the original inputs can still be recovered? (there are multiple valid solutions, and I’d prefer something predictable over something optimal)
Apr 4, 2025, 6:36 PM
{ "uri": "at://did:plc:kis5bnrceksghgqo5xecrntl/app.bsky.feed.post/3llz2putd7c2n", "cid": "bafyreiglndoy5dqdr63jzoswj43r4n2dwuxlwt6scs3pdkwmml3xq6laby", "value": { "text": "does anyone know an algorithm for summarizing file paths like\na/b/x -> …/b/x\na/b/y -> …/b/y\na/c/x -> …/c/…\n\nso that a unique correspondence to the original inputs can still be recovered? (there are multiple valid solutions, and I’d prefer something predictable over something optimal)", "$type": "app.bsky.feed.post", "langs": [ "en" ], "createdAt": "2025-04-04T18:36:54.649Z" } }