So I have this DataSet. It has a recursive relation defining a tree structure. I have this nice UI that prevents you from deleting non-empty folders. What you can do, is delete leaves then delete branches from the bottom up.
When the user is happy, they can hit a little save button. This grabs the changes from the DataSet and sends them to a webservice. The webservice then uses dataadapters to commit the changes to the database.
I was thinking that since the deletes occur from bottom to top on the tree, the dataadapter would know enough to delete them in the same order. Wrong!! It does reverse order, like the deletes are on a stack or something.
Someone tell me there's a good reason for this. Usually when something in .NET is upseting me, a good reason for the behavior is revealed down the line. What's the good reason?!?!?
When the user is happy, they can hit a little save button. This grabs the changes from the DataSet and sends them to a webservice. The webservice then uses dataadapters to commit the changes to the database.
I was thinking that since the deletes occur from bottom to top on the tree, the dataadapter would know enough to delete them in the same order. Wrong!! It does reverse order, like the deletes are on a stack or something.
Someone tell me there's a good reason for this. Usually when something in .NET is upseting me, a good reason for the behavior is revealed down the line. What's the good reason?!?!?
