hub.darcs.net :: ross -> fingertree -> issue

treeowl

The priority queues makes claims about the order in which entries with equal keys are extracted depending on whether they're added with add or insert. But the predicate passed to search isn't monotone, so I believe the claim is bogus. It would appear that the right way to justify both the existence of two insertion functions and the implementation of a priority queue in terms of a two-fingered tree would be to add functions to view both ends of the structure as a deque. That is, to consider this thing a hybrid priority queue/deque. I don't know whether there are any likely applications for such an API.