I have been reading this thread for days, and I am confused.
I might be wrong, but it seems to me the discussion started with a
simple problem - an object borrowed from an object pool could not be
returned to the pool because the object's hash value changed.
Now the discussion seems to be about how to create the proper hash
function so the object can be returned to the pool successfully.
In other words, object A can be borrowed from the pool, and object B can
be returned to the pool (instead of object A) - as long as object A and
object B both return the same hash value.
Does that make sense? Is that what you really want?
It seems to me the object being returned to the pool should be the same
object that was borrowed from the pool. A simple equality check (this
object == that object) would do that.
What am I missing?
Adrian Crum
Sandglass Software
www.sandglass-software.com
On 2/9/2015 10:33 AM, Matthew Hall wrote:
On Mon, Feb 09, 2015 at 06:37:32AM -0500, James Carman wrote:
Premature optimization. UUIDs aren't slow.
Could be indeed. Depends on the specific use case.
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
