Change straight algorithm

[Aurelius7309]

The current algorithm for straights is pretty bad with custom ranks that have split paths. This proposes a new one that works correctly in cases where the previous one failed.
Example: Given ranks 10->11->12->13 with SMODS.Ranks['10'].next = {'Jack', '11'}.

• 9,10,J,Q is a valid 4-finger straight
• 9,10,J,11,12 should also be a valid 4-finger straight but isn't because the current algorithm gets trapped in the first path

Originally tried to base an implementation of quantum ranks on this but realized this would be inefficient as candidate straights can be invalidated at each step and checking a given hand with quantum ranks for containing a straight is exponential in the length of the straight.

Also builds prev tables in ranks when injected. Not used here but figured it might be useful to have

[Aurelius7309]

Performance is about the same, shortcut is slower with large amounts of cards selected. Measured around 2.5ms with shortcut vs. 0.8ms without, while the previous implementation takes barely any hit at all

[DigitalDetective47]

are prev tables built automatically by reversing the next tables, or do they have to be specified manually?

[Aurelius7309]

Builds prev tables automatically, but I didn't end up using them here