Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Ide.Plugin.RangeMap
Description
A map that allows fast "in-range" filtering. RangeMap
is meant
to be constructed once and cached as part of a Shake rule. If
not, the map will be rebuilt upon each invocation, yielding slower
results compared to the list-based approach!
Note that RangeMap
falls back to the list-based approach if
`use-fingertree` flag of `hls-plugin-api` is set to false.
Documentation
A map from code ranges to values.
Constructors
RangeMap | |
Fields |
Instances
Foldable RangeMap # | |
Defined in Ide.Plugin.RangeMap Methods fold :: Monoid m => RangeMap m -> m foldMap :: Monoid m => (a -> m) -> RangeMap a -> m foldMap' :: Monoid m => (a -> m) -> RangeMap a -> m foldr :: (a -> b -> b) -> b -> RangeMap a -> b foldr' :: (a -> b -> b) -> b -> RangeMap a -> b foldl :: (b -> a -> b) -> b -> RangeMap a -> b foldl' :: (b -> a -> b) -> b -> RangeMap a -> b foldr1 :: (a -> a -> a) -> RangeMap a -> a foldl1 :: (a -> a -> a) -> RangeMap a -> a elem :: Eq a => a -> RangeMap a -> Bool maximum :: Ord a => RangeMap a -> a minimum :: Ord a => RangeMap a -> a | |
Traversable RangeMap # | |
Functor RangeMap # | |
Monoid (RangeMap a) # | |
Semigroup (RangeMap a) # | |
NFData a => NFData (RangeMap a) # | |
Defined in Ide.Plugin.RangeMap |