Safe Haskell | None |
---|---|
Language | Haskell2010 |
Determining the strongest item wrt some property.
- strengthEffect :: (Effect -> [b]) -> ItemFull -> [b]
- strengthOnSmash :: ItemFull -> [Effect]
- strengthCreateOrgan :: ItemFull -> [GroupName ItemKind]
- strengthDropOrgan :: ItemFull -> [GroupName ItemKind]
- strengthEqpSlot :: ItemFull -> Maybe EqpSlot
- strengthToThrow :: Item -> ThrowMod
- strongestSlot :: DiscoveryBenefit -> EqpSlot -> [(ItemId, ItemFull)] -> [(Int, (ItemId, ItemFull))]
- computeTrajectory :: Int -> Int -> Int -> [Point] -> ([Vector], (Speed, Int))
- itemTrajectory :: Item -> [Point] -> ([Vector], (Speed, Int))
- totalRange :: Item -> Int
- hasCharge :: Time -> ItemFull -> Bool
- damageUsefulness :: Item -> Double
- strongestMelee :: Maybe DiscoveryBenefit -> Time -> [(ItemId, ItemFull)] -> [(Double, (ItemId, ItemFull))]
- prEqpSlot :: EqpSlot -> AspectRecord -> Int
- unknownMeleeBonus :: [ItemFull] -> Bool
- filterRecharging :: [Effect] -> [Effect]
- stripRecharging :: [Effect] -> [Effect]
- stripOnSmash :: [Effect] -> [Effect]
- unknownAspect :: (Aspect -> [Dice]) -> ItemFull -> Bool
Strongest items
strengthEffect :: (Effect -> [b]) -> ItemFull -> [b] Source #
strengthOnSmash :: ItemFull -> [Effect] Source #
strengthToThrow :: Item -> ThrowMod Source #
strongestSlot :: DiscoveryBenefit -> EqpSlot -> [(ItemId, ItemFull)] -> [(Int, (ItemId, ItemFull))] Source #
Assorted
totalRange :: Item -> Int Source #
damageUsefulness :: Item -> Double Source #
strongestMelee :: Maybe DiscoveryBenefit -> Time -> [(ItemId, ItemFull)] -> [(Double, (ItemId, ItemFull))] Source #
unknownMeleeBonus :: [ItemFull] -> Bool Source #
filterRecharging :: [Effect] -> [Effect] Source #
stripRecharging :: [Effect] -> [Effect] Source #
stripOnSmash :: [Effect] -> [Effect] Source #