dave/pyfa
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 17 Wiki Activity

Add web strength vs range graph

Browse Source
This commit is contained in:
DarkPhoenix
2019-08-13 08:28:59 +03:00
parent 69bd988174
commit 3bc93899fe
9 changed files with 227 additions and 60 deletions
Download Patch File Download Diff File Expand all files Collapse all files

31
graphs/wrapper.py
View File

@@ -18,12 +18,11 @@
# =============================================================================
import math
from eos.saveddata.damagePattern import DamagePattern
from eos.saveddata.fit import Fit
from eos.saveddata.targetProfile import TargetProfile
from service.const import TargetResistMode
from .calc import calculateMultiplier
class BaseWrapper:
@@ -64,7 +63,7 @@ class BaseWrapper:
elif self.isProfile:
maxVelocity = self.item.maxVelocity
if extraMultipliers:
maxVelocity *= _calculateMultiplier(extraMultipliers)
maxVelocity *= calculateMultiplier(extraMultipliers)
else:
maxVelocity = None
return maxVelocity
@@ -78,7 +77,7 @@ class BaseWrapper:
elif self.isProfile:
sigRadius = self.item.signatureRadius
if extraMultipliers:
sigRadius *= _calculateMultiplier(extraMultipliers)
sigRadius *= calculateMultiplier(extraMultipliers)
else:
sigRadius = None
return sigRadius
@@ -141,30 +140,6 @@ class TargetWrapper(BaseWrapper):
return em, therm, kin, explo
# Just copy-paste penalization chain calculation code (with some modifications,
# as multipliers arrive in different form) in here to not make actual attribute
# calculations slower than they already are due to extra function calls
def _calculateMultiplier(multipliers):
val = 1
for penalizedMultipliers in multipliers.values():
# A quick explanation of how this works:
# 1: Bonuses and penalties are calculated seperately, so we'll have to filter each of them
l1 = [v[0] for v in penalizedMultipliers if v[0] > 1]
l2 = [v[0] for v in penalizedMultipliers if v[0] < 1]
# 2: The most significant bonuses take the smallest penalty,
# This means we'll have to sort
abssort = lambda _val: -abs(_val - 1)
l1.sort(key=abssort)
l2.sort(key=abssort)
# 3: The first module doesn't get penalized at all
# Any module after the first takes penalties according to:
# 1 + (multiplier - 1) * math.exp(- math.pow(i, 2) / 7.1289)
for l in (l1, l2):
for i in range(len(l)):
bonus = l[i]
val *= 1 + (bonus - 1) * math.exp(- i ** 2 / 7.1289)
return val
def _getShieldResists(ship):
em = 1 - ship.getModifiedItemAttr('shieldEmDamageResonance')