Safe Haskell | None |
---|---|
Language | Haskell2010 |
Determining the strongest item wrt some property. No operation in this module involves the state or any of our custom monads.
- strengthOnSmash :: ItemFull -> [Effect Int]
- strengthToThrow :: Item -> ThrowMod
- strengthEqpSlot :: Item -> Maybe (EqpSlot, Text)
- strengthFromEqpSlot :: EqpSlot -> ItemFull -> Maybe Int
- strongestSlotNoFilter :: EqpSlot -> [(ItemId, ItemFull)] -> [(Int, (ItemId, ItemFull))]
- strongestSlot :: EqpSlot -> [(ItemId, ItemFull)] -> [(Int, (ItemId, ItemFull))]
- sumSlotNoFilter :: EqpSlot -> [ItemFull] -> Int
- sumSkills :: [ItemFull] -> Skills
- totalRange :: Item -> Int
- computeTrajectory :: Int -> Int -> Int -> [Point] -> ([Vector], (Speed, Int))
- itemTrajectory :: Item -> [Point] -> ([Vector], (Speed, Int))
- unknownPrecious :: ItemFull -> Bool
- permittedRanged :: ItemFull -> Maybe Int -> Bool
- unknownMelee :: [ItemFull] -> Bool
Strongest items
strengthOnSmash :: ItemFull -> [Effect Int] Source
strengthToThrow :: Item -> ThrowMod Source
sumSlotNoFilter :: EqpSlot -> [ItemFull] -> Int Source
Assorted
totalRange :: Item -> Int Source
unknownPrecious :: ItemFull -> Bool Source
unknownMelee :: [ItemFull] -> Bool Source