Frans, We're trying to find a way to flatten UOW or Collection to be able to parse through each element while avoiding endless recursion loops. Optimally we wanted to use ObjectGraphUtils, but once we got into it we realized that we couldn't because of ActionQueueElement being an internal class... Is there another way we can do it easily?

We attempted to reverse the ProduceTopologyOrderedList function and implement it ourself, but when it attempted to check if the entity had been recursed or not, recursively using the ProduceTopologyOrderedList function caused the entity to become out of sync somehow. Also was the issue that we couldn't check if the entity needed an FK Sync in the same way that your topology funciton does.

We desperately need some way of iterating through each and every possible entity in a collection or UOW. Please help?

Chris

Call UoW.ConstructSaveProcessQueues() then call GetInsertQueue() and GetUpdateQueue()

Thanks Frans What about for just a collection alone?

Oh, and we just discovered that those methods return an ArrayList of ActionQueElements... Same problem

hmm, that's a mistake indeed.

I'll make it public as that won't harm any code. It was already marked public in the dev version of the v2.0 runtime lib. This is fixed in the hotfix for 1.0.2005.1 released in half an hour.

Thanks much

Trig wrote:

Thanks much

The hotfix is now available. Please download the hotfix for the runtime libraries to be able to use the getinsert/update queue routines. The reference manual isn't updated yet, so docs on the class are slim, but it doesn't contain much properties, so it should be straight forward.