Class LeastUpperBoundLogic

java.lang.Object

com.github.javaparser.symbolsolver.resolution.typeinference.LeastUpperBoundLogic

public class LeastUpperBoundLogic
extends Object

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
(package private) static class	LeastUpperBoundLogic.TypeSubstitution

Field Summary

Fields

Modifier and Type	Field	Description
private Set<Set<ResolvedType>>	lubCache

Constructor Summary

Constructors

Modifier	Constructor	Description
private	LeastUpperBoundLogic()

Method Summary

Modifier and Type	Method	Description
private ResolvedType	best(List<ResolvedType> minimalCandidates)
private ResolvedType	bound(ResolvedType type, ResolvedWildcard.BoundType boundType)
private boolean	boundedAsObject(ResolvedTypeParameterDeclaration typeDecl)
private ResolvedType	concreteType(ResolvedType type)
private List<Set<ResolvedType>>	erased(List<Set<ResolvedType>> typeSets)
private void	filterEnumType(Set<ResolvedType> resolvedTypes)
private List<ResolvedType>	intersection(List<Set<ResolvedType>> supertypes)
private boolean	isEnum(ResolvedType type)
private boolean	isSubstituable(ResolvedTypeParameterDeclaration typeDecl, ResolvedType type)
private ResolvedType	lcta(ResolvedType type1, ResolvedType type2)
private ResolvedType	lctaBothWildcards(ResolvedWildcard type1, ResolvedWildcard type2)
private ResolvedType	lctaNoWildcard(ResolvedType type1, ResolvedType type2)
private ResolvedType	lctaOneWildcard(ResolvedType rawType, ResolvedWildcard wildcardType)
private ResolvedType	leastContainingParameterization(List<ResolvedType> types)
private ResolvedType	leastContainingTypeArgument(ResolvedType type1, ResolvedType type2)
ResolvedType	lub(Set<ResolvedType> types)	See JLS 4.10.4.
private List<ResolvedType>	minimalCandidates(List<ResolvedType> erasedCandidates)	Let MEC, the minimal erased candidate set for U1 ...
static LeastUpperBoundLogic	of()
private com.google.common.collect.Multimap<ResolvedType, ResolvedType>	relevantParameterizations(List<ResolvedType> minimalErasedCandidates, List<Set<ResolvedType>> supertypes)	For any element G of MEC that is a generic type, let the "relevant" parameterizations of G, Relevant(G), be: Relevant(G) = { V | 1 ≤ i ≤ k: V in ST(Ui) and V = Ginvalid input: '<'...> }
private ResolvedType	substituteType(ResolvedType type1, LeastUpperBoundLogic.TypeSubstitution typeSubstitution)
private LeastUpperBoundLogic.TypeSubstitution	substitution(List<Pair<ResolvedTypeParameterDeclaration, ResolvedType>> pairs)
private Set<ResolvedType>	supertypes(ResolvedReferenceType type)
private Set<ResolvedType>	supertypes(ResolvedType type)
private List<Set<ResolvedType>>	supertypes(Set<ResolvedType> types)
private Set<ResolvedType>	toSet(ResolvedType... resolvedTypes)
private Set<ResolvedType>	union(List<Set<ResolvedType>> supertypes)

Methods inherited from class Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

lubCache

private Set<Set<ResolvedType>> lubCache

Constructor Details

LeastUpperBoundLogic

private LeastUpperBoundLogic()

Method Details

of

public static LeastUpperBoundLogic of()

lub

public ResolvedType lub(Set<ResolvedType> types)

See JLS 4.10.4. Least Upper Bound.

concreteType

private ResolvedType concreteType(ResolvedType type)

isEnum

private boolean isEnum(ResolvedType type)

filterEnumType

private void filterEnumType(Set<ResolvedType> resolvedTypes)

supertypes

private List<Set<ResolvedType>> supertypes(Set<ResolvedType> types)

supertypes

private Set<ResolvedType> supertypes(ResolvedType type)

supertypes

private Set<ResolvedType> supertypes(ResolvedReferenceType type)

erased

private List<Set<ResolvedType>> erased(List<Set<ResolvedType>> typeSets)

intersection

private List<ResolvedType> intersection(List<Set<ResolvedType>> supertypes)

union

private Set<ResolvedType> union(List<Set<ResolvedType>> supertypes)

minimalCandidates

private List<ResolvedType> minimalCandidates(List<ResolvedType> erasedCandidates)

Let MEC, the minimal erased candidate set for U1 ... Uk, be: MEC = { V | V in EC, and for all W != V in EC, it is not the case that W invalid input: '<': V }

Parameters:

erasedCandidates -

Returns:

relevantParameterizations

private com.google.common.collect.Multimap<ResolvedType, ResolvedType> relevantParameterizations(List<ResolvedType> minimalErasedCandidates,
 List<Set<ResolvedType>> supertypes)

For any element G of MEC that is a generic type, let the "relevant" parameterizations of G, Relevant(G), be: Relevant(G) = { V | 1 ≤ i ≤ k: V in ST(Ui) and V = Ginvalid input: '<'...> }

Parameters:

minimalErasedCandidates - MEC

supertypes -

Returns:

the set of known parameterizations for each generic type G of MEC

best

private ResolvedType best(List<ResolvedType> minimalCandidates)

leastContainingParameterization

private ResolvedType leastContainingParameterization(List<ResolvedType> types)

leastContainingTypeArgument

private ResolvedType leastContainingTypeArgument(ResolvedType type1,
 ResolvedType type2)

isSubstituable

private boolean isSubstituable(ResolvedTypeParameterDeclaration typeDecl,
 ResolvedType type)

boundedAsObject

private boolean boundedAsObject(ResolvedTypeParameterDeclaration typeDecl)

substituteType

private ResolvedType substituteType(ResolvedType type1,
 LeastUpperBoundLogic.TypeSubstitution typeSubstitution)

substitution

private LeastUpperBoundLogic.TypeSubstitution substitution(List<Pair<ResolvedTypeParameterDeclaration, ResolvedType>> pairs)

lcta

private ResolvedType lcta(ResolvedType type1,
 ResolvedType type2)

lctaNoWildcard

private ResolvedType lctaNoWildcard(ResolvedType type1,
 ResolvedType type2)

lctaOneWildcard

private ResolvedType lctaOneWildcard(ResolvedType rawType,
 ResolvedWildcard wildcardType)

lctaBothWildcards

private ResolvedType lctaBothWildcards(ResolvedWildcard type1,
 ResolvedWildcard type2)

bound

private ResolvedType bound(ResolvedType type,
 ResolvedWildcard.BoundType boundType)

toSet

private Set<ResolvedType> toSet(ResolvedType... resolvedTypes)