Logo Questions Linux Laravel Mysql Ubuntu Git Menu
HTML CSS JAVASCRIPT SQL PYTHON PHP BOOTSTRAP JAVA JQUERY R React Kotlin
 

Why isn't Haskell's Data.Vector an instance of Traversable?

Tags:

haskell

Don't understand, if Data.Map is and [] is. I found this out while wondering why I need Data.Vector.mapM for vectors and Data.Traversable.mapM for maps.

like image 920
Snoqual Avatar asked Aug 03 '11 21:08

Snoqual

1 Answers

There are orphan instances on hackage.

like image 59
Anthony Avatar answered Sep 30 '22 13:09

Anthony
Sign in to Comment

Related questions

Why sequence requires monad if applicative would suffice?
How to parse ternary expression using Parsec?
How do I lazily transform a list into this type?
Is the functor distribution law for the `Alt` typeclass trivial?
Can adding a constraint cause other constraints to go out of scope?
Trying to understanding why this function using foldr in Haskell isnt working
Can some explain the reflection package API in *very* simple terms?
How do i unset :set -v from ghci?
Haskell computation performance
Strange behavior of groupBy
Where can I find a full parenthesizer for Haskell?
STUArray with polymorphic type
Examples of attoparsec in parsing binary file formats? [closed]
How does this Haskell function to calculate permutations using list comprehension work?
Recursive bottom-up traversal of algebraic data types
In Haskell, concat builds a list lazily but my own version with a twist, doesn't
Emitting warnings from Template Haskell splices
GHC cabal install hamlet fails with an obscure error
How to take an array slice with Repa over a range
Find all capturing groups of a regular expression

Donate For Us

If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!