protected final class UpperBoundAnnotatedTypeFactory.UpperBoundQualifierHierarchy extends MultiGraphQualifierHierarchy
MultiGraphQualifierHierarchy.MultiGraphFactory
bottoms, polymorphicQualifier, polyQualifiers, supertypesDirect, supertypesTransitive, tops
Constructor and Description |
---|
UpperBoundQualifierHierarchy(MultiGraphQualifierHierarchy.MultiGraphFactory factory) |
Modifier and Type | Method and Description |
---|---|
AnnotationMirror |
greatestLowerBound(AnnotationMirror a1,
AnnotationMirror a2)
Returns the greatest lower bound for the qualifiers a1 and a2.
|
boolean |
isSubtype(AnnotationMirror subAnno,
AnnotationMirror superAnno)
Computes subtyping as per the subtyping in the qualifier hierarchy structure unless both
annotations are the same.
|
AnnotationMirror |
leastUpperBound(AnnotationMirror a1,
AnnotationMirror a2)
Determines the least upper bound of a1 and a2.
|
int |
numberOfIterationsBeforeWidening()
Returns the number of iterations dataflow should perform before
QualifierHierarchy.widenedUpperBound(AnnotationMirror, AnnotationMirror) is called or -1 if it should never be
called. |
AnnotationMirror |
widenedUpperBound(AnnotationMirror newQualifier,
AnnotationMirror previousQualifier)
If the type hierarchy has an infinite ascending chain, then the dataflow analysis might never
reach a fixed point.
|
addPolyRelations, findBottoms, findLub, findTops, finish, getBottomAnnotation, getBottomAnnotations, getPolymorphicAnnotation, getTopAnnotation, getTopAnnotations, getTypeQualifiers, greatestLowerBoundTypeVariable, isSubtype, isSubtypeTypeVariable, isSubtypeTypeVariable, leastUpperBoundTypeVariable, toString, transitiveClosure
canHaveEmptyAnnotationSet, findAnnotationInHierarchy, findAnnotationInSameHierarchy, getWidth, greatestLowerBound, greatestLowerBounds, greatestLowerBounds, greatestLowerBoundsTypeVariable, isSubtype, isSubtype, isValid, leastUpperBound, leastUpperBounds, leastUpperBounds, leastUpperBoundsTypeVariable, replacePolyAll, updateMappingToMutableSet
public UpperBoundQualifierHierarchy(MultiGraphQualifierHierarchy.MultiGraphFactory factory)
factory
- MultiGraphFactory to use to construct thispublic AnnotationMirror greatestLowerBound(AnnotationMirror a1, AnnotationMirror a2)
QualifierHierarchy
The two qualifiers have to be from the same qualifier hierarchy. Otherwise, null will be returned.
greatestLowerBound
in class MultiGraphQualifierHierarchy
a1
- first annotationa2
- second annotationpublic AnnotationMirror leastUpperBound(AnnotationMirror a1, AnnotationMirror a2)
leastUpperBound
in class MultiGraphQualifierHierarchy
public AnnotationMirror widenedUpperBound(AnnotationMirror newQualifier, AnnotationMirror previousQualifier)
QualifierHierarchy
QualifierHierarchy.numberOfIterationsBeforeWidening()
and
change its return to a positive number.
newQualifier
is newest qualifier dataflow computed for some expression and previousQualifier
is the qualifier dataflow computed on the last iteration.
If the type hierarchy has no infinite ascending chain, returns the least upper bound of the two annotations.
widenedUpperBound
in class QualifierHierarchy
newQualifier
- new qualifier dataflow computed for some expressionpreviousQualifier
- the previous qualifier dataflow computed on the last iterationpublic int numberOfIterationsBeforeWidening()
QualifierHierarchy
QualifierHierarchy.widenedUpperBound(AnnotationMirror, AnnotationMirror)
is called or -1 if it should never be
called.
Subclasses overriding this method should return some positive number or -1.
numberOfIterationsBeforeWidening
in class QualifierHierarchy
QualifierHierarchy.widenedUpperBound(AnnotationMirror, AnnotationMirror)
is called or -1 if it should
never be called.public boolean isSubtype(AnnotationMirror subAnno, AnnotationMirror superAnno)
isSubtype
in class MultiGraphQualifierHierarchy
subAnno
- the sub qualifiersuperAnno
- the super qualifier