From: Brian O'N. <Bri...@di...> - 2001-06-27 18:40:36
|
How about persisting a hash/equals/comparator/persistence strategy with the BTree and HTree? The BTree already does this with the Comparator. Just extend the concept a bit. Objects would still be used as keys and values, but if I wanted to be more efficient for managing just byte arrays, I'd create a strategy for it. |
From: Alex B. <boi...@in...> - 2001-06-27 18:56:02
|
Brian O'Neill wrote: > > How about persisting a hash/equals/comparator/persistence strategy with the > BTree and HTree? The BTree already does this with the Comparator. Just > extend the concept a bit. Objects would still be used as keys and values, > but if I wanted to be more efficient for managing just byte arrays, I'd > create a strategy for it. > Right, that's probably the best approach. BTW, I'll be leaving on vacation next week, so I don't expect anything to happen on my part in the next 3 weeks. If you want to make improvements to JDBM in the mean time, feel free to send me patches and I'll commit them when I return. regards, alex -- Alex Boisvert boi...@in... Project Manager, Intalio Inc. www.intalio.com Operate at the Process Level <SM> (650) 345 2777 |