【读码练习/cron4j】(二）半个设计模式：不暴露底层表现（简化了的迭代器模式）...

publicinterface TaskCollector {
public TaskTable getTasks();
}

1 class FileTaskCollector implements TaskCollector {
2
3 private ArrayList files &＃61;new ArrayList();
4
5 publicsynchronizedvoid addFile(File file) {
6 files.add(file);
7 }
8
9 publicsynchronizedvoid removeFile(File file) {
10 files.remove(file);
11 }
12
13 publicsynchronized File[] getFiles() {
14 int size &＃61; files.size();
15 File[] ret &＃61;new File[size];
16 for (int i &＃61;0; i < size; i&＃43;&＃43;) {
17 ret[i] &＃61; (File) files.get(i);
18 }
19 return ret;
20 }
21
22 publicsynchronized TaskTable getTasks() {
23 TaskTable ret &＃61;new TaskTable();
24 int size &＃61; files.size();
25 for (int i &＃61;0; i < size; i&＃43;&＃43;) {
26 File f &＃61; (File) files.get(i);
27 TaskTable aux &＃61;null;
28 try {
29 aux &＃61; CronParser.parse(f);
30 } catch (IOException e) {
31 Exception e1 &＃61;new Exception("Cannot parse cron file: "
32 &＃43; f.getAbsolutePath(), e);
33 e1.printStackTrace();
34 }
35 if (aux !&＃61;null) {
36 int auxSize &＃61; aux.size();
37 for (int j &＃61;0; j < auxSize; j&＃43;&＃43;) {
38 ret.add(aux.getSchedulingPattern(j), aux.getTask(j));
39 }
40 }
41 }
42 return ret;
43 }
44
45 }

1 publicclass TaskTable {
2
3 privateint size &＃61;0;
4
5 private ArrayList patterns &＃61;new ArrayList();
6
7 private ArrayList tasks &＃61;new ArrayList();
8
9 publicvoid add(SchedulingPattern pattern, Task task) {
10 patterns.add(pattern);
11 tasks.add(task);
12 size&＃43;&＃43;;
13 }
14
15 publicint size() {
16 return size;
17 }
18
19 public Task getTask(int index) throws IndexOutOfBoundsException {
20 return (Task) tasks.get(index);
21 }
22
23
24 public SchedulingPattern getSchedulingPattern(int index)
25 throws IndexOutOfBoundsException {
26 return (SchedulingPattern) patterns.get(index);
27 }
28
29 publicvoid remove(int index) throws IndexOutOfBoundsException {
30 tasks.remove(index);
31 patterns.remove(index);
32 size--;
33 }
34
35 }