[Haskell-cafe] List operation question

[Lennart Augustsson]

I agree.  If performance is important enough to worry about is shiftl  
traverses the list once or twice then it's time to switch to a better  
data type.

On Feb 4, 2007, at 19:27 , Yitzchak Gale wrote:

> Nicolas Frisby wrote:
>> I've always thought that when certain operations are of particular
>> interest, it's time to use more appropriate data structures, right?
>> Lists are great and simple and intuitive, but if you need such
>> operations as shifts, something like a deque is the way to go.
>
> This sounds like a job for Data.Sequence.
>
> -Yitz
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe