| | |
| | | */ |
| | | public Entry getTaskRootEntry() |
| | | { |
| | | return taskRootEntry; |
| | | return taskRootEntry.duplicate(true); |
| | | } |
| | | |
| | | |
| | |
| | | */ |
| | | public Entry getScheduledTaskParentEntry() |
| | | { |
| | | return scheduledTaskParentEntry; |
| | | return scheduledTaskParentEntry.duplicate(true); |
| | | } |
| | | |
| | | |
| | |
| | | */ |
| | | public Entry getRecurringTaskParentEntry() |
| | | { |
| | | return recurringTaskParentEntry; |
| | | return recurringTaskParentEntry.duplicate(true); |
| | | } |
| | | |
| | | |
| | |
| | | |
| | | if (scheduledTaskEntryDN.equals(taskEntry.getDN())) |
| | | { |
| | | return taskEntry; |
| | | return taskEntry.duplicate(true); |
| | | } |
| | | } |
| | | |
| | |
| | | |
| | | try |
| | | { |
| | | Entry e = t.getTaskEntry(); |
| | | Entry e = t.getTaskEntry().duplicate(true); |
| | | if (filter.matchesEntry(e)) |
| | | { |
| | | if (! searchOperation.returnEntry(e, null)) |
| | |
| | | |
| | | if (recurringTaskEntryDN.equals(recurringTaskEntry.getDN())) |
| | | { |
| | | return recurringTaskEntry; |
| | | return recurringTaskEntry.duplicate(true); |
| | | } |
| | | } |
| | | |
| | |
| | | |
| | | try |
| | | { |
| | | Entry e = rt.getRecurringTaskEntry(); |
| | | Entry e = rt.getRecurringTaskEntry().duplicate(true); |
| | | if (filter.matchesEntry(e)) |
| | | { |
| | | if (! searchOperation.returnEntry(e, null)) |