> BitSet creates "small" arrays It is important for some JVM
> implemetations (not trivial to handle memory fragmentation),
> but possible optimizes nothing on current implementations.
These arrays don't get very big anyway, I expect (you dont have
objects with 100 properties. I can't imagine it being a
significant impact upon performance....
> Some callback must be the most performant way :
>
> callback.begin( types, x, y, persiter, session );
>
> for (int i=0; i<types.length; i++) {
> if ( check.get(i) && types[i].isDirty( x[i], y[i], persiter, session
> ) )
> {
> callback.handleDirty( i, types[i], x[i], y[i], persiter, session
> );
> //generates UPDATE,
>
> //does not need to check deleted and "new" objects
> }
> }
> callback.end( types, x, y, persiter, session );
>
> My current implementation with BitSet produces error at this time
> (FooBarTest), is it Ok in current cvs version ?
I don't follow ... what exactly is callback?
FooBarTest is working fine, as far as I know....
-------------------------------------------------------
This SF.NET email is sponsored by: FREE SSL Guide from Thawte
are you planning your Web Server Security? Click here to get a FREE
Thawte SSL guide and find the answers to all your SSL security issues.
http://ads.sourceforge.net/cgi-bin/redirect.pl?thaw0026en
_______________________________________________
hibernate-devel mailing list
[EMAIL PROTECTED]
https://lists.sourceforge.net/lists/listinfo/hibernate-devel
