search

treeowl / compact-sequences

Stacks and queues with compact representations
BSD 3-Clause "New" or "Revised" License
16 stars 4 forks source link

Add bagMerge #43

Open treeowl opened 4 years ago

treeowl commented 4 years ago

Stacks, at least, can support a rather more efficient (in constant factors) unordered merge than append. This is just plain addition of the numerical representations. We might as well offer it.

treeowl commented 4 years ago

I guess all the structures support it, but it's a bit hard to imagine anyone wanting it for a queue or deque.