mirror of
https://github.com/kwsch/PKHeX.git
synced 2026-05-23 23:26:07 -05: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 |
||
|---|---|---|
| .. | ||
| General | ||
| Generation 1 Tradeback | ||
| Generation 2 | ||
| Generation 3 | ||
| Generation 4 | ||
| Generation 4 EncounterType | ||
| Generation 4 Transfer | ||
| Generation 5 | ||
| Generation 6 | ||
| Generation 6 Static | ||
| Generation 7 Static | ||
| Generation 7 Transfer | ||
| Generation 7 Wild | ||