Package arrow.meta.plugins.analysis.phases.analysis.solver

Types

data class ArgumentExpression( val name: String, val type: Type, val isVarArg: Boolean, val isSpread: Boolean, val expression: List<Expression>)

Information about an argument in a resolved call

fun ModuleDescriptor.gather( initialPackages: List<FqName> = listOf(FqName("")), addSubPackages: Boolean, predicate: (DeclarationDescriptor) -> Boolean): List<DeclarationDescriptor>

Gather all descriptors which satisfy a predicate, going inside every element recursively.

returns true if we have declared something with a @Law or lives inside an object that inherits Laws

check if a descriptor is compatible with other, in the sense that they refer to a function with the same signature

should we treat a node as a field and create 'field(name, x)'?

check if a descriptor is compatible with other, in the sense that the arguments are (possibly) supertypes

Obtain the descriptors which have been overridden by a declaration, if they exist

fun Solver.primitiveFormula( context: ResolutionContext, resolvedCall: ResolvedCall, args: List<Formula>): Formula?