cl-containers VS Advent_of_Code_in_Pascal

Now the main mutable state in my A* function is the use of cl-containers's priority queue. I might see if Sycamore's pairing heap is a suitably-performant pure-functional replacement.

We're using cl-containers [1] and cl-graph [2] and to make it very fast lparallel [3] and rtg-math [4] (among many others)

[1] https://github.com/gwkkwg/cl-containers

I'm doing it in Lazarus/Free Pascal again.

https://github.com/mikewarot/Advent_of_Code_in_Pascal

Free Pascal - 2251/1744 34.5 seconds runtime No objects, no recursion After brute forcing part 1, I stared at part 2 until I though only handling the different values of X,Y,Z and letting the grid represent variable size cubes.. only to hit memory size limits anyway... and then I learned how to use BITPACKED array, and was able to eventually brute force part 2. Whew!

Pascal 2235/4609

Pascal - Github

Pascal 7079/6330 - github

Github - https://github.com/mikewarot/Advent_of_Code_in_Pascal/blob/master/2021/advent2021_15b.lpr

My pascal based solver eventually got valid text out of your input.

Pascal 2437/6187

Pascal 3590/5744