It's time to find when a local extreme is adjacent to a previously found one.
If one such exists, I'll store an iterator to it; so we need two more iterators per SampleNode: one pointing left and one pointing right (this is because of my decision to no longer have a LocalExtreme class, but use the SampleNode class to store all information regarding local extremes - if they represent one).

You can follow the progress of the project as a whole here: https://github.com/CarloWood/machine-...
discord:   / discord