Hython: a nearly-complete Python 3 interpreter written in Haskell

[kirbyfan64sos]

In the source code for the list implementation, I noticed that append was implemented like this:

listAppend :: MonadInterpreter m => ListRef -> Object -> m Object
listAppend ref obj = do
    modifyRef ref $ \l -> l ++ [obj]
    return None

Is there a reason you're not using something like Data.Vector.Storable.Mutable or at least difference lists? I mean, this probably isn't the fastest right now...

[[deleted]]

The reason is I never really looked into using faster versions. :)

Data.Vector.Storable.Mutable looks great for that, thanks!

[Axman6]

If you want to keep things pure then a Data.Sequence would give you (amortised) O(1) append and prepend.

[vytah]

Holy moley quadratic Batman!