This week's book giveaway is in the OO, Patterns, UML and Refactoring forum. We're giving away four copies of Refactoring for Software Design Smells: Managing Technical Debt and have Girish Suryanarayana, Ganesh Samarthyam & Tushar Sharma on-line! See this thread for details.
If I want to implement a Object pool in java using the built in data structures and the pros and cons, how do I go ahead and implement one.
Here is my approach. But I am sure there are many ways to implement and which is more efficient.
1. Implement using a queue. Its better to use arrays in the background and expose it via an Interface.
2. To implement using the LInkedList as it implements the Queue interface internally but exposing through an Interface which has only get and return method which will delegate to the internal linkedlist to return the first in element and to put it back to the Queue.
Well, a LinkedList already is a Queue. So that makes the first two the same thing. As for a PriorityQueue, I would only use that if there was some reason to put the objects in the pool into a certain sequence. Usually there isn't any such reason in an object pool, so I normally wouldn't consider that.
Joined: Sep 08, 2006
Are there any other data structures which is an optimum for implementation apart from Queue?