Hoogle Search
Within LTS Haskell 24.17 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
module GI.GtkSource.Objects.
Map Widget that displays a map for a specific [classview]. GtkSourceMap is a widget that maps the content of a [classview] into a smaller view so the user can have a quick overview of the whole document. This works by connecting a [classview] to to the GtkSourceMap using the [propertymap:view] property or [methodmap.set_view]. GtkSourceMap is a [classview] object. This means that you can add a [classgutterRenderer] to a gutter in the same way you would for a [classview]. One example might be a [classgutterRenderer] that shows which lines have changed in the document. Additionally, it is desirable to match the font of the GtkSourceMap and the [classview] used for editing. Therefore, [propertymap:font-desc] should be used to set the target font. You will need to adjust this to the desired font size for the map. A 1pt font generally seems to be an appropriate font size. "Monospace 1" is the default. See fontDescriptionSetSize for how to alter the size of an existing FontDescription. When FontConfig is available, GtkSourceMap will try to use a bundled "block" font to make the map more legible.
-
gi-gtksource5 GI.GtkSource.Objects.Map Memory-managed wrapper type.
-
gi-gtksource5 GI.GtkSource.Objects.Map No documentation available.
-
refined-containers Data.Map.Refined A wrapper around a regular Map with a type parameter s identifying the set of keys present in the map. A key of type k may not be present in the map, but a Key s k is guaranteed to be present (if the s parameters match). Thus the map is isomorphic to a (total) function Key s k -> a, which motivates many of the instances below. A Map always knows its set of keys, so given Map s k a we can always derive KnownSet s k by pattern matching on the Dict returned by keysSet.
-
refined-containers Data.Map.Strict.Refined A wrapper around a regular Map with a type parameter s identifying the set of keys present in the map. A key of type k may not be present in the map, but a Key s k is guaranteed to be present (if the s parameters match). Thus the map is isomorphic to a (total) function Key s k -> a, which motivates many of the instances below. A Map always knows its set of keys, so given Map s k a we can always derive KnownSet s k by pattern matching on the Dict returned by keysSet.
-
verset Verset A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)base Prelude Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.
Examples
mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()base Prelude Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.
mappend :: Monoid a => a -> a -> abase Prelude An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.
mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)base Data.List The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.
Examples
Basic usage:>>> mapAccumL (\a b -> (a + b, a)) 0 [1..10] (55,[0,1,3,6,10,15,21,28,36,45])
>>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5] ("012345",["0","01","012","0123","01234"])