[Haskell-cafe] Spine-lazy "multiqueue"
jgbailey at gmail.com
Tue Oct 21 17:02:24 EDT 2008
On Tue, Oct 21, 2008 at 11:43 AM, Luke Palmer <lrpalmer at gmail.com> wrote:
> Hi, I need a rather strange data structure, and I can't find any
> existing implementations or think of a way to implement it. It's a
> "multiqueue", basically a map of queues. The trick is that it should
> be lazy in its spine and still support efficient access. For example,
> the following should hold:
This doesn't answer your question, but how is a Map of queues not
"spine-lazy"? I'm mostly looking to understand that term.
More information about the Haskell-Cafe