Search results

map :: forall f a b. Functor f => (a -> b) -> f a -> f b
P purescript-prelude M Data.Functor

Map k v represents maps from keys of type k to values of type v.

P purescript-ordered-collections M Data.Map.Internal
map :: forall a b. Ord b => (a -> b) -> Set a -> Set b

Maps over the values in a set.

This operation is not structure-preserving for sets, so is not a valid Functor. An example case: mapping const x over a set with n > 0 elements will result in a set with one element.

P purescript-ordered-collections M Data.Set
map :: forall a b. Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b

Maps over the values in a set.

This operation is not structure-preserving for sets, so is not a valid Functor. An example case: mapping const x over a set with n > 0 elements will result in a set with one element.

P purescript-ordered-collections M Data.Set.NonEmpty
map :: forall a b m r. Monad m => (a -> b) -> Pipe a b m r

Apply a function to all values flowing downstream

P purescript-pipes M Pipes.Prelude
map :: Array Props -> Array ReactElement -> ReactElement
P purescript-react M React.DOM
map :: Array Props -> Array ReactElement -> ReactElement
P purescript-react M React.DOM.Dynamic
map :: forall w i. Node HTMLmap w i
P purescript-halogen M Halogen.HTML.Elements
map :: forall e. Markup e -> Markup e
P purescript-smolder M Text.Smolder.HTML
map :: forall f a b x y. IxFunctor f => (a -> b) -> f x y a -> f x y b
P purescript-indexed-monad M Control.Monad.Indexed.Qualified
map :: forall a b. Hashable b => (a -> b) -> HashSet a -> HashSet b

Construct a new set by applying a function to each element of an input set.

If distinct inputs map to the same output, this changes the cardinality of the set, therefore hash set is not a Functor. Also, the order in which elements appear in the new set is entirely dependent on the hash function for type b.

P purescript-unordered-collections M Data.HashSet
map :: Selector
P purescript-css M CSS.Elements
map :: forall a t. TypedArray a t => (t -> t) -> ArrayView a -> ArrayView a

Maps a new value over the typed array, creating a new ArrayBuffer and typed array as well.

P purescript-arraybuffer M Data.ArrayBuffer.Typed
map :: forall attrs attrs_. Union attrs attrs_ Props_map => Record attrs -> JSX
P purescript-react-basic-dom M React.Basic.DOM.Generated
map :: forall attrsNoChildren attrsWithDuplicate attrs attrs_ jsx. Union attrs attrs_ Props_map => ToJSX jsx => Union (children :: Array JSX) attrsNoChildren attrsWithDuplicate => Nub (children :: Array JSX | attrsNoChildren) attrs => Record attrsNoChildren -> jsx -> JSX
P purescript-react-basic-dom M React.Basic.DOM.Simplified.Generated
map :: (Octet -> Octet) -> ByteString -> ByteString

Θ(n) Transform the bytes in the byte string.

P purescript-bytestrings M Data.ByteString
map :: ElemName

Defines an image map

P purescript-chameleon M Chameleon.HTML.ElemNames
map :: forall html a. Html html => Array (Prop a) -> Array (html a) -> html a

Defines an image map

P purescript-chameleon M Chameleon.HTML.Elements
map :: forall html a. Html html => Array (Prop a) -> Array (Key /\ (html a)) -> html a

Defines an image map

P purescript-chameleon M Chameleon.HTML.KeyedElements
map :: forall e a. (ReactElement -> a) -> ReactWrapper -> Eff (enzyme :: ENZYME | e) (Array a)
P purescript-enzyme M Enzyme.ReactWrapper
map :: forall e a. (ReactElement -> a) -> ShallowWrapper -> Eff (enzyme :: ENZYME | e) (Array a)
P purescript-enzyme M Enzyme.ShallowWrapper
map :: forall b a. Ord b => (a -> b) -> OSet a -> OSet b

Maps over the values in a set.

This operation is not structure-preserving for sets, so is not a valid Functor. An example case: mapping const x over a set with n > 0 elements will result in a set with one element.

P purescript-ordered-set M Data.Set.Ordered
map :: forall a b. (a -> b) -> Seq a -> Seq b

O(n). Apply a function to every element within a sequence. Note that this function is performed lazily — the actual call is almost instantaneous, regardless of the length of the sequence, because the function is not applied to all elements immediately. The eventual running time (assuming all elements are later requested) is O(n), though.

P purescript-sequences M Data.Sequence
map :: forall f b a. ((a -> b) -> f a -> f b) -> (a -> b) -> NonEmpty f a -> NonEmpty f b
P purescript-probability M Data.NonEmpty.Extras
map :: forall p b a. Ord b => Semiring p => (a -> b) -> Dist p a -> Dist p b
P purescript-probability M Math.Probability
map :: forall c f v1 v0. HasMap c f => ObjectOf c v0 => ObjectOf c v1 => ObjectOf c (f v0) => ObjectOf c (f v1) => c v0 v1 -> c (f v0) (f v1)
P purescript-subcategory M Control.Subcategory.Endofunctor.HasMap
map :: forall c f v1 v0. HasMap c f => ObjectOf c v0 => ObjectOf c v1 => c v0 v1 -> f v0 -> f v1
P purescript-subcategory M Control.Subcategory.Functor.HasMap

Maps a type constructor to a List'.

P purescript-typelevel-lists M Type.Data.List
map :: forall f xs ys fproxy kproxy lproxy. Map f xs ys => fproxy f -> kproxy xs -> lproxy ys
P purescript-typelevel-lists M Type.Data.List
map :: forall b a. NotJSPromise b => (a -> b) -> PromiseSpec a -> PromiseSpec b

map the value in a promise spec

P purescript-bonjiri M Bonjiri
map :: forall a b. Ord a => JsonCodec a -> JsonCodec b -> JsonCodec (Map a b)

A codec for Map values.

Encodes as an array of two-element key/value arrays in JSON.

P purescript-codec-argonaut M Data.Codec.Argonaut.Common
map :: forall lock payload. Event (Attribute Map_) -> Array (Domable lock payload) -> Domable lock payload
P purescript-deku M Deku.DOM.Elt.Map
map :: forall p q a b. Dissect p q => (a -> b) -> p a -> p b

A tail-recursive map operation, implemented in terms of Dissect.

P purescript-dissect M Dissect.Class
map :: forall t. Corecursive t EJsonF => Map t t -> t
P purescript-ejson M Data.Json.Extended
Map :: forall a. (EJsonMap a) -> EJsonF a
P purescript-ejson M Data.Json.Extended.Signature.Core
Map :: EJsonType
P purescript-ejson M Data.Json.Extended.Type
map :: forall db da b a. Patch a da => Patch b db => (Jet a -> Jet b) -> Jet (IArray a) -> Jet (IArray b)

Modify each array element by applying the specified function.

P purescript-incremental-functions M Data.Incremental.Array
map :: forall b a. (a -> b) -> Jet (Atomic a) -> Jet (Atomic b)

Change an Atomic value using a regular function.

P purescript-incremental-functions M Data.Incremental.Eq
map :: forall db b da a k. Ord k => Patch a da => Patch b db => (Jet a -> Jet b) -> Jet (IMap k a) -> Jet (IMap k b)

Update every key by applying a function.

P purescript-incremental-functions M Data.Incremental.Map
map :: forall m. Array (Prop m) -> Component m -> Component m
P purescript-jelly M Jelly.Element
P purescript-js-maps M JS.Map.Internal
Map :: forall k v. (Map String (Tuple k v)) -> Map k v
P purescript-js-maps M JS.Map.Internal
P purescript-js-maps M JS.Map.Primitive.Internal

A map object (http://leafletjs.com/reference-1.0.3.html#map-example)

P purescript-leaflet-tdammers M Leaflet.Map
map :: forall e. String -> LatLng -> Zoom -> Eff (leaflet :: LEAFLET | e) Map

map domID latLng zoom creates a new map object centered at latLng, at zoom level zoom, and attaches it to the DOM element with ID domID.

P purescript-leaflet-tdammers M Leaflet.Map
map :: forall b a. Hashable b => (a -> b) -> MultiSet a -> MultiSet b
P purescript-multiset-hashed M Data.HashSet.Multi
map :: forall f b a. IsoFunctor f => Iso a b -> f a -> f b
P purescript-partial-isomorphisms M Control.Isomorphism.Partial
map :: forall r2 r1 r0 p l1 l0 g f. RMap p f g l0 r0 l1 r1 r2 => RowToList r0 l0 => RowToList r1 l1 => g r0 -> p (f r1) (f r2)
P purescript-struct M Data.Struct.Map.Map
map :: forall barbie f g. Functor barbie => (forall a. f a -> g a) -> barbie f -> barbie g
P purescript-barbies M Data.Barbie
map :: forall a b. (Mapper a) -> Node a -> Node b
P purescript-bf-gun M Gun