mirror of
https://github.com/kwsch/PKHeX
synced 2024-12-19 08:53:28 +00:00
3c50983afd
See previous commit for discussion; it's easier to read and maintain this rather than have the precomputed min/max comparisons. LevelMin - minDecrease <= min && max <= LevelMax + maxIncrease; See EncounterArea7b: Since we know min and minDecrease (0) before doing the linq filter we can precompute the lowbound, same for highbound; but this isn't immediately obvious to the reader. The perf cost is pretty much negligible in the big picture, so leave it in the more readable state. Thanks @fattard & @ammako ! #2389 |
||
---|---|---|
.. | ||
236 - Tyrogue - 88A5A8BF7345.pk6 | ||
263 - Zigzagoon - 2746E8288E7E.pk6 | ||
280 - Ralts - 4732E9FE3B34 No Nickname Trade.pk6 | ||
357 ★ - Walker Mower - 0272CF40335F.pk6 |