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.
Im looking for the fastest, most efficient way to parse a resultSet into a 2D array. Due to the structure of my program a 2D array is the preferable data structure, i dont want to use a map or a list.
Could anyone please point me to a simple way to parse a resultSet into a 2D array ?
There is no such thing as a 2D array, only an array of arrays.
Your result set consists of n results, but you would have to count them first probably with the next() method. Then you would have to go back, and your results in each row would be different type, so unsuitable for an array of arrays. You could more easily create an array of FooResult objects. I am surprised you think a Foo is a suitable data structure for a ResultSet.