On Sunday March 22 2009, Henry Ware wrote:
> I know you are probably solved, and seemed to be asking about
> mutables. But enclosed is a Deque trait with an decently fast
> immutable implementation: ie almost as fast as Queue, faster on some
> some machines and better worse case performance (no O(N) dequeues).
Thanks. Even if I stick with my split solution (which I'm realizing is
seriously flawed due to the amount of code duplication), it's good to
have examples of implementations of immutable data structures.
On Sunday March 22 2009, Henry Ware wrote:
> I know you are probably solved, and seemed to be asking about
> mutables. But enclosed is a Deque trait with an decently fast
> immutable implementation: ie almost as fast as Queue, faster on some
> some machines and better worse case performance (no O(N) dequeues).
Thanks. Even if I stick with my split solution (which I'm realizing is
seriously flawed due to the amount of code duplication), it's good to
have examples of implementations of immutable data structures.
> Cheers,
> H
Randall Schulz