Any efficient BlockingQueue implementations that allow combining of entries?

Question

Are there any efficient (without synchronize everything) implementations of java.util.concurrent.BlockingQueue that allow combining of entries?

By combining I mean to merge incoming item with existing "equal" entry on the queue (if there is one), otherwise item is added at the end as usual.

So, you mean a kind of Queue that behaves like a Set in that it doesn't allow duplicate elements? — Miquel, Jul 16 '12 at 09:36

score 2 · Answer 1 · edited May 23 '17 at 12:31

2

Check this answer out: Concurrent Set Queue. It might be a duplicate of your question if all that you mean by merging is ignoring elements that are equal to something that's already on the queue.

edited May 23 '17 at 12:31

Community

1
1

answered Jul 16 '12 at 09:40

Miquel

15,405
8
54
87

score 1 · Answer 2 · answered Jul 16 '12 at 09:42

1

BlockingQueue sports a contains method. Feel free to use it, but don't forget to synchronize. contains is O(n) f.x. in LinkedBlockingDeque, so you may try a more efficient approach with a HashSet.

answered Jul 16 '12 at 09:42

Arne

2,106
12
9

score 0 · Answer 3 · answered Jul 16 '12 at 09:36

0

I can't see combining events if timestamp and source are two of its attributes. Unless the same user sent two events within a nanosecond or less of each other, I don't believe they can be considered equal and should not be combined.

answered Jul 16 '12 at 09:36

duffymo

305,152
44
369
561

Any efficient BlockingQueue implementations that allow combining of entries?

3 Answers3