Neon.Class.HasTraverse

class HasTraverse t  where

Represents data structures that can be traversed from left to right. Unlike Reduce, these structures can be traversed while keeping their shape.

[1, 2] :traverse (\ x -> x :inspect :Just) -- Just ["1", "2"]

Members

• traverse :: forall m b a. HasApply m => HasMap m => HasPure m => (a -> m b) -> t a -> m (t b)

Instances

• HasTraverse Array
• HasTraverse List
• HasTraverse Maybe