Problems with planning code how can I do this??

Question

I wonder if someone could help me I have a slight problem.. basically i'm writing a threaded application that needs to update jeopardy codes on all open tasks on an order if there is a jeopardy code on one of the tasks. As users only put the code on one task when they should put it on all but to make the users life easier i need to write an app to do it for them.
My problem is that there could be 5 tasks on one order and there could be 4 jeopardy codes on one of the tasks, all of these need to appear on all tasks, on another task there could be 2 jeopardy codes which then need to appear on all other tasks if one is closed then they all need to be closed on the basis that if the date closed is newer than the date opened then close all J codes if its older then create all J codes on corresponding tasks. I have written a database lookup to fetch the doc no, task nos, jep codes against each task, closed and modify dates. I have created an order object with all this info in. Other than iterating over order object to get doc number then to get list of tasks names then to get list of jeopardy codes then iterate over again to update each jeopardy code on each open task how else can I do this as this seems really messy to me... (I am updating by back end database not via api)
Sorry if this is confusing any help will be most appreciated

Answer 1

As users only put the code on one task when they
y should put it on all but to make the users life
easier i need to write an app to do it for them.
My problem is that there could be 5 tasks on one
order and there could be 4 jeopardy codes on one of
the 5 tasks, each jeopardy code needs to appear on
each tasks, on another task there could be 2 jeopardy
codes which then need to appear on all other tasks as
well.This sounds to me very much like the jeopardy code is (at least in practice) an attribute of the order and not an attribute of the task. I would suggest redesigning your data model to make this the case. Then the application that allowed the users to put a jeopardy code on a task would actually put it on the order containing the task.
If one is closed then they all need to be closed on
the basis that if the date closed is newer than the
date opened then close all J codes if its older then
create all J codes on corresponding tasks.
I have written a database lookup to fetch the doc no,
task nos, jep codes against each task, closed and
modify dates. I have created an order object with all
this info in.Or if redesigning your database isn't a palatable option (this is quite likely in most organizations) then you could modify your database lookup and object creation so that they treated the jeopardy codes for an order's tasks as if they were jeopardy codes for the order.