In Haskell, if the length of a list is fixed during an operation, - TopicsExpress



          

In Haskell, if the length of a list is fixed during an operation, processing the lists vector is MUCH faster than processing the list. For example: The conversion from one image format to another image format takes 12 seconds with Data.List. And the same process takes a fraction of a second with Data.Vector. I thought the conversion from Data.List to Data.Vector was going to consume some time. But the whole process of converting the List to a Vector and processing the Vector is MUCH faster than processing the List directly. Heres how you can obtain the vector of a list: https://hackage.haskell.org/package/vector-0.7.0.1/docs/Data-Vector.html#g:34
Posted on: Sun, 06 Jul 2014 01:13:39 +0000

Trending Topics



c-10152144210123974">NDEKO MOSALI NA NZAMBE TO PASTEUR Fête na yo EZA ya YO , Ya yo

Recently Viewed Topics




© 2015