|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
ModusPonensVo | Line # 28 | 32 | 23 | 100% |
1.0
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||
(38) | |||
Result | |||
0.703125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.609375
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.578125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.578125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.578125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.578125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.578125
|
org.qedeq.kernel.se.test.AbstractValueObjectTestCase.testAll
![]() |
1 PASS | |
0.5
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testNegativeGeneration2
![]() |
1 PASS | |
0.5
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testNegativeGeneration2
![]() |
1 PASS | |
0.5
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testGeneration2
![]() |
1 PASS | |
0.5
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testGeneration2
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.logic.SimpleProofFinderPluginTest.testPlugin
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.unicode.GenerateUtf8Test.testGeneration3b
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.logic.proof.finder.ProofFinderImplTest.testFind
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testGeneration
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.unicode.Qedeq2UnicodeTextExecutorTest.testGeneration3b
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.logic.proof.finder.ProofFinderImplTest.testFind2
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.unicode.Qedeq2UnicodeTextExecutorTest.testGeneration1b
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.unicode.GenerateUtf8Test.testGeneration1b
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.logic.SimpleProofFinderPluginTest.testPlugin2
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.logic.SimpleProofFinderPluginTest.testPluginFast
![]() |
1 PASS | |
0.4375
|
org.qedeq.kernel.bo.service.latex.GenerateLatexTest.testGeneration
![]() |
1 PASS | |
0.265625
|
org.qedeq.kernel.se.dto.module.ModusPonensVoTest.testGetReferences
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.logic.proof.checker.ProofCheckerTest.testCheck4
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.se.dto.module.ModusPonensVoTest.testGetModusPonens
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.service.logic.FormalProofCheckerPluginTest.testPlugin4
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.logic.proof.checker.ProofCheckerTest.testCheck1
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.service.logic.FormalProofCheckerPluginTest.testPlugin
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.service.logic.FormalProofCheckerPluginTest.testPlugin2
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.logic.proof.checker.ProofCheckerTest.testCheck6
![]() |
1 PASS | |
0.171875
|
org.qedeq.kernel.bo.service.logic.FormalProofCheckerPluginTest.testPlugin3
![]() |
1 PASS | |
0.140625
|
org.qedeq.kernel.bo.logic.wf.FormulaCheckerContextTest.testPositive03b
![]() |
1 PASS | |
0.140625
|
org.qedeq.kernel.bo.logic.proof.finder.ProofFinderImplTest.testFind3
![]() |
1 PASS | |
0.140625
|
org.qedeq.kernel.xml.dao.GenerateXmlTest.testGeneration
![]() |
1 PASS | |
0.046875
|
org.qedeq.kernel.se.visitor.QedeqNotNullTraverserTest.testQedeq
![]() |
1 PASS | |
0.03125
|
org.qedeq.kernel.se.dto.module.ModusPonensVoTest.testGetReference1
![]() |
1 PASS | |
0.03125
|
org.qedeq.kernel.se.dto.module.ModusPonensVoTest.testGetName
![]() |
1 PASS | |
0.03125
|
org.qedeq.kernel.se.dto.module.ModusPonensVoTest.testGetReference2
![]() |
1 PASS | |
1 | /* This file is part of the project "Hilbert II" - http://www.qedeq.org | |
2 | * | |
3 | * Copyright 2000-2014, Michael Meyling <mime@qedeq.org>. | |
4 | * | |
5 | * "Hilbert II" is free software; you can redistribute | |
6 | * it and/or modify it under the terms of the GNU General Public | |
7 | * License as published by the Free Software Foundation; either | |
8 | * version 2 of the License, or (at your option) any later version. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, | |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
14 | */ | |
15 | ||
16 | package org.qedeq.kernel.se.dto.module; | |
17 | ||
18 | import org.apache.commons.lang.ArrayUtils; | |
19 | import org.qedeq.base.utility.EqualsUtility; | |
20 | import org.qedeq.kernel.se.base.module.ModusPonens; | |
21 | ||
22 | ||
23 | /** | |
24 | * Modes Ponens usage. | |
25 | * | |
26 | * @author Michael Meyling | |
27 | */ | |
28 | public class ModusPonensVo implements ModusPonens { | |
29 | ||
30 | /** Usually reference to a formula like A -> B. */ | |
31 | private String reference1; | |
32 | ||
33 | /** Usually reference to a formula like A. */ | |
34 | private String reference2; | |
35 | ||
36 | /** | |
37 | * Constructs a Modus Ponens argument. | |
38 | * | |
39 | * @param reference1 Usually reference to a formula like A -> B. Might be <code>null</code>. | |
40 | * @param reference2 Usually reference to a formula like A. Might be <code>null</code>. | |
41 | */ | |
42 | 3504 |
![]() |
43 | 3504 | this.reference1 = reference1; |
44 | 3504 | this.reference2 = reference2; |
45 | } | |
46 | ||
47 | /** | |
48 | * Default constructor. | |
49 | */ | |
50 | 124 |
![]() |
51 | // nothing to do | |
52 | } | |
53 | ||
54 | 5036 |
![]() |
55 | 5036 | return this; |
56 | } | |
57 | ||
58 | 13840 |
![]() |
59 | 13840 | return reference1; |
60 | } | |
61 | ||
62 | /** | |
63 | * Set first formula reference. | |
64 | * | |
65 | * @param reference1 Reference to formula. Might be <code>null</code>. | |
66 | */ | |
67 | 98 |
![]() |
68 | 98 | this.reference1 = reference1; |
69 | } | |
70 | ||
71 | 7843 |
![]() |
72 | 7843 | return reference2; |
73 | } | |
74 | ||
75 | /** | |
76 | * Set second formula reference. | |
77 | * | |
78 | * @param reference2 Reference to formula. Might be <code>null</code>. | |
79 | */ | |
80 | 98 |
![]() |
81 | 98 | this.reference2 = reference2; |
82 | } | |
83 | ||
84 | 4 |
![]() |
85 | 4 | if (reference1 == null) { |
86 | 2 | if (reference2 == null) { |
87 | 1 | return ArrayUtils.EMPTY_STRING_ARRAY; |
88 | } | |
89 | 1 | return new String[] {reference2 }; |
90 | } | |
91 | 2 | if (reference2 == null) { |
92 | 1 | return new String[] {reference1 }; |
93 | } | |
94 | 1 | return new String[] {reference1, reference2 }; |
95 | } | |
96 | ||
97 | 151 |
![]() |
98 | 151 | if (!(obj instanceof ModusPonens)) { |
99 | 6 | return false; |
100 | } | |
101 | 145 | final ModusPonens other = (ModusPonens) obj; |
102 | 145 | return EqualsUtility.equals(getReference1(), other.getReference1()) |
103 | && EqualsUtility.equals(getReference2(), other.getReference2()); | |
104 | } | |
105 | ||
106 | 235 |
![]() |
107 | 235 | return (getReference1() != null ? getReference1().hashCode() : 0) |
108 | 235 | + (getReference2() != null ? 1 ^ getReference2().hashCode() : 0); |
109 | } | |
110 | ||
111 | 1611 |
![]() |
112 | 1611 | StringBuffer result = new StringBuffer(); |
113 | 1611 | result.append(getName()); |
114 | 1611 | if (getReference1() != null || getReference2() != null) { |
115 | 1590 | result.append(" ("); |
116 | 1590 | if (getReference1() != null) { |
117 | 1581 | result.append(getReference1()); |
118 | } | |
119 | 1590 | if (getReference2() != null) { |
120 | 1583 | if (getReference1() != null) { |
121 | 1574 | result.append(", "); |
122 | } | |
123 | 1583 | result.append(getReference2()); |
124 | } | |
125 | 1590 | result.append(")"); |
126 | } | |
127 | 1611 | return result.toString(); |
128 | } | |
129 | ||
130 | 3213 |
![]() |
131 | 3213 | return "MP"; |
132 | } | |
133 | ||
134 | } |
|