Class MonotonicityCounterexamples.ConceptPair
- java.lang.Object
-
- ptolemy.data.ontologies.lattice.adapters.monotonicityAnalysis.MonotonicityCounterexamples.ConceptPair
-
- Enclosing class:
- MonotonicityCounterexamples
public static class MonotonicityCounterexamples.ConceptPair extends java.lang.Object implements java.util.Map.Entry<Concept,Concept>
Encapsulate counterexample pairs. These are pairs of the form (x1, x2) where x1 ≤ x2, but f(x1) \not ≤ f(x2) for the function under consideration. Thus, these pairs prove as counterexamples to the monotonicity of f.
-
-
Constructor Summary
Constructors Constructor Description ConceptPair(Concept l, Concept g)
Create a counterexample pair given both of the concepts that make up the counterexample.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description Concept
getKey()
Return the lesser concept of the counterexample.Concept
getValue()
Return the greater concept of the counterexample.Concept
setValue(Concept value)
Do nothing.
-
-
-
Method Detail
-
getKey
public Concept getKey()
Return the lesser concept of the counterexample.
-
getValue
public Concept getValue()
Return the greater concept of the counterexample.- Specified by:
getValue
in interfacejava.util.Map.Entry<Concept,Concept>
- Returns:
- The greater concept
- See Also:
Map.Entry.getValue()
,setValue(Concept)
-
setValue
public Concept setValue(Concept value)
Do nothing. (Counterexamples are immutable)- Specified by:
setValue
in interfacejava.util.Map.Entry<Concept,Concept>
- Parameters:
value
- Ignored- Returns:
- Always return null.
- See Also:
Map.Entry.setValue(java.lang.Object)
,getValue()
-
-