Java - LinkedBlockingQueue problem

Question

    1  LinkedBlockingQueue queJobs = new LinkedBlockingQueue(150);
    2  ..........
    3  .. Some other code....
    4  ..........
    5  Job curJob = queJobs.take();
    6  ....................
    7  .. Again some other code...
    8  ....................
    9  if(condition1){
    10    queJobs.put(curJob);
    11  }

my problem is when condition1 is true, I am putting back the object into queue. but initially it was on top of the queue, but after putting, it will go at the end of queue.
My requirement is :
1. I can put back the element on top of the queue
or
2. Somehow I can wait at line 5, without removing element from the queue.

T-Bull · Accepted Answer · 2011-05-10 12:25:35Z

3

A Queue is defined to be read at one end and written to at the other end. So no, can't put it back in. But you can use a LinkedBlockingDeque instead, which is more versatile in this regard.

If this is not an option, you can use peek() to get, but not remove, the curJob and later only remove it if (!condition1).

UPDATE

but I am using take() because, it blocks the execution until queue is empty.

peek() will certainly not work for you then. But I suspect a shortcoming in your overall logic then. Normally you shouldn't have to put jobs back in the queue. Maybe the better solution is to use another collection which is only known to the worker thread, where you put the jobs that you started but not yet finished, and you read from that collection before the job queue.

edited May 10, 2011 at 12:25

answered May 10, 2011 at 12:03

T-Bull

2,1462 gold badges15 silver badges20 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

Aniruddha Over a year ago

thanx, I think LinkedBlockingDeque will help me out. peek() is certainly not my use.

Mike Kwan · Accepted Answer · 2011-05-10 11:54:37Z

1

You can use peek() which retrieves the head but does not remove it. Then later check whether condition1 is false. If yes, then remove it with take().

It is possible to add the element back to the head but it is messy. You can call toArray().toList() which supports adding at index 0.

Reference: http://download.oracle.com/javase/6/docs/api/java/util/concurrent/LinkedBlockingQueue.html

answered May 10, 2011 at 11:54

Mike Kwan

24.5k12 gold badges65 silver badges98 bronze badges

1 Comment

Aniruddha Over a year ago

but I am using take() because, it blocks the execution until queue is empty. there is second thread which add the element into queue & I need to stop execution of the thread which process that queue elements.

ditkin · Accepted Answer · 2011-05-10 12:02:17Z

1

A more natural fit might be to use a PriorityBlockingQueue that would allow you to assign priorities to the elements. This is not exactly what you asked for, but is just a suggestion.

answered May 10, 2011 at 12:02

ditkin

7,0641 gold badge37 silver badges40 bronze badges

Collectives™ on Stack Overflow

Java - LinkedBlockingQueue problem

3 Answers 3

1 Comment

1 Comment

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

3 Answers 3

1 Comment

1 Comment

Comments

Your Answer

Sign up or log in

Post as a guest

Related