version2 VS Advent-of-Code

Vector class library - 938 GH stars

Most of the time is spent parsing, but this problem lends itself nicely to a SIMD formulation, which using vectorclass doesn't even require detailed knowledge of the intrinsics. Hot runs take ~14 µs on a Core i9-12900K, including I/O. Full code is (here)[https://github.com/ahans/aoc2022/blob/main/cpp/day04.cc], the interesting part is this, where we process 32 elements at once:

Swift. I tried to use GameplayKit's pathfinding, but I got fed up with it being in Objective-C and not working with subtypes properly. shortestPathSources is just an implementation of Dijkstra that works on matrices.

Swift.

Swift. Algorithms had me covered for Part 2, but I had to make something for Part 1 that would allow for getting the elements of a Sequence based on sorted offsets, without having to start from the beginning each time.

I recommend SIMD2—it can save you a lot of reinventing the 2D wheel!

Swift. We don't have good types for this. 🤮

Swift. containsOnlyUniqueElements is not in the standard library; it relies on this Set initializer.

Works grood.

No, I edited my comment. I was wrong in thinking that there was a proper overload. The one I'm using is just from `extension Collection where Self.Element : Equatable` in the new _StringProcessing section for Regex. It gives the correct result, but it's not as fast as it could be. (https://stackoverflow.com/questions/64066681/check-if-one-range-is-within-another)

Swift, using some helpers for `CaseIterable`.