[Haskell-cafe] Data.Vector.Mutable.mapM

[Joachim Breitner]

Hi,

Am Donnerstag, den 20.10.2011, 23:10 +0200 schrieb Ertugrul Soeylemez:
> In general you should try to work with immutable vectors as much as
> possible.  Done properly you shouldn't lose much performance that way.
> 
> However, sometimes an operation is just much easier to express and
> faster with the MVector interface.  In these cases you can escape to the
> mutable interface using 'create', 'modify', 'thaw' and 'freeze'.  Don't
> forget that you lose fusion that way, though.
> 
> In other words:  Don't use MVector exclusively.  Use it only when you
> really need it.

that was my plan, although it is a bit more complicated as I have a
immutable vector of immutable boxed vectors that I’d like to modify
destructively. Currently, I have lots of V.map and V.filter...

The code is here, and should perform constant propagation in a
SAT-instance:
http://git.nomeata.de/?p=sat-britney.git;a=blob;f=Picosat.hs;h=910e530a0aa546b7b8b9e9e995c0885b0a6e1371;hb=HEAD#l312

Greetings,
Joachim

-- 
Joachim "nomeata" Breitner
  mail at joachim-breitner.de  |  nomeata at debian.org  |  GPG: 0x4743206C
  xmpp: nomeata at joachim-breitner.de | http://www.joachim-breitner.de/

-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20111021/c00f1a95/attachment.pgp>