• OO第四单元总结
  • 一、总结本单元两次作业的架构设计
    • 第一次作业
    • 第二次作业
• 学期最终总结
  • 二、四个单元中架构设计及OO方法理解
    • 2.1 第一单元作业
    • 2.2 第二单元作业
    • 2.3 第三单元作业
    • 2.4 第四单元作业
  • 三、四个单元中测试理解与实践的演进
  • 四、课程收获
  • 五、给课程组的建议
  • 六、总结致谢

 1    public String getTopParentClass(String className)
 2             throws ClassNotFoundException, ClassDuplicatedException {
 3         checkClass(className);
 4         if (ansMap.containsKey(className)) {
 5             return ansMap.get(className);
 6         }
 7         UmlElement element = nameToClass.get(className);
 8         String re = className;
 9         while (true) {
10             if (!inheritClass.containsKey(element)) {
11                 re = element.getName();
12                 break;
13             }
14             if (!inheritClass.get(element).getElementType().
15                     equals(ElementType.UML_CLASS)) {
16                 re = element.getName();
17                 break;
18             }
19             element = inheritClass.get(element);
20         }
21         ansMap.put(className,re);
22         return ansMap.get(className);
23     }
24  

 1   public List<String> getImplementInterfaceList(String className)
 2             throws ClassNotFoundException, ClassDuplicatedException {
 3         checkClass(className);
 4         UmlElement curInter = nameToClass.get(className);
 5         if (interMap.containsKey(className)) {
 6             return interMap.get(className);
 7         }
 8         ArrayList<String> result = new ArrayList<>(); //id
 9         //itself interface
10         if (curInter.getElementType().equals(ElementType.UML_INTERFACE)) {
11             ArrayList<String> result1 = new ArrayList<>(); //id
12             result1.add(curInter.getName());
13             return result1;
14         }
15         //interreals and father's
16         while (true) {
17             ArrayList<UmlElement> reals = classToInterReal.get(curInter);
18             for (UmlElement element : reals) {
19                 result.add(realToInter.get(element).getId());
20             }
21             if (!inheritClass.containsKey(curInter)) {
22                 break;
23             }
24             curInter = inheritClass.get(curInter);
25         }
26         //generalization
27         LinkedBlockingDeque<UmlElement> queue = new LinkedBlockingDeque<>();
28 ​
29         for (UmlElement element1:inheritInter.keySet()) {
30             HashSet<UmlElement> fathers = inheritInter.get(element1);
31             if (result.contains(element1.getId())) {
32                 queue.addAll(fathers);
33                 while (!queue.isEmpty()) {
34                     UmlElement element2 = queue.poll();
35                     if (!result.contains(element2.getId())) {
36                         result.add(element2.getId());
37                     }
38                     if (inheritInter.containsKey(element2)) {
39                         queue.addAll(inheritInter.get(element2)); }
40                 }
41             }
42         }
43         ArrayList<String> finalRe = new ArrayList<>();
44         for (String id :result) {
45             String tmp = idToElement.get(id).getName();
46             finalRe.add(tmp);
47         }
48         interMap.put(className,finalRe);
49         return finalRe;
50     }

 1     public int getSubsequentStateCount(String stateMachineName,
 2                                        String stateName)
 3             throws StateMachineNotFoundException,
 4             StateMachineDuplicatedException,
 5             StateNotFoundException, StateDuplicatedException {
 6         checkMac(stateMachineName);
 7         checkState(stateMachineName, stateName);
 8         if (substateCountCache.get(stateMachineName).containsKey(stateName)) {
 9             return substateCountCache.get(stateMachineName).get(stateName);
10         }
11         UmlElement reg = macToRegion.get(nameToMac.get(stateMachineName));
12         UmlElement curState = nameToState.get(stateMachineName).get(stateName);
13 ​
14         ArrayList<String> result = new ArrayList<>();
15         HashMap<UmlElement,Boolean> visited = new HashMap<>();
16 ​
17         for (UmlElement ele:allState) {
18             visited.put(ele,false);
19         }
20         //dfs
21         LinkedBlockingDeque<UmlElement> queue = new LinkedBlockingDeque<>();
22         queue.add(curState);
23         int i = 0;
24         while (!queue.isEmpty()) {
25 ​
26             UmlElement element2 = queue.poll();
27             if (!result.contains(element2.getId()) && i != 0) {
28                 visited.put(element2,true);
29                 result.add(element2.getId());
30             }
31             if (stateTrans.containsKey(element2)) {
32                 for (UmlElement nextEle:stateTrans.get(element2)) {
33                     if (!visited.get(nextEle)) {
34                         queue.add(nextEle);
35                     }
36                 }
37             }
38             i++;
39         }
40         substateCountCache.get(stateMachineName).put(stateName,result.size());
41         return result.size();
42     }

set addr="C:\Users\maltose\Desktop\result"
​
if not exist %addr% (md %addr%
)
​
for /l %%i in (1,1,1000) do (cd %addr%%build% >data_%%i.txt%correct% <data_%%i.txt >correct_%%i.txt%test1% <data_%%i.txt >test1_%%i.txt
fc test1_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 1 not same %%i
​
%test2% <data_%%i.txt >test2_%%i.txt
fc test2_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 2 not same %%i
​
%test3% <data_%%i.txt >test3_%%i.txt
fc test3_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 3 not same %%i
​
%test4% <data_%%i.txt >test4_%%i.txt
fc test4_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 4 not same %%i
​
%test5% <data_%%i.txt >test5_%%i.txt
fc test5_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 5 not same %%i
​
%test6% <data_%%i.txt >test6_%%i.txt
fc test6_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 6 not same %%i
​
%test7% <data_%%i.txt >test7_%%i.txt
fc test7_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 7 not same %%i
​
%test8% <data_%%i.txt >test8_%%i.txt
fc test8_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 8 not same %%i
​
%test9% <data_%%i.txt >test9_%%i.txt
fc test9_%%i.txt correct_%%i.txt >nul && echo >nul  || echo 9 not same %%i
​
set /a j=%%i%%10
if !j! equ 0 (echo %%i th
)