private SolvingNode CreateVarType(IState state = null)
{
var varNode = new SolvingNode(
name: "V" + _varNodeId,
state: state ?? new Constrains(),
type: SolvingNodeType.TypeVariable);
_varNodeId++;
_typeVariables.Add(varNode);
return(varNode);
}
private SolvingNode GetNamedNode(string name)
{
if (_variables.TryGetValue(name, out var varnode))
{
return(varnode);
}
var ans = new SolvingNode("T" + name, new Constrains(), SolvingNodeType.Named);
_variables.Add(name, ans);
return(ans);
}
private static IEnumerable <SolvingNode> GetAllLeafTypes(this SolvingNode node)
{
switch (node.State)
{
case ICompositeType composite:
return(composite.AllLeafTypes);
case RefTo _:
return(new[] { node.GetNonReference() });
default:
return(new[] { node });
}
}
public static void Merge(SolvingNode main, SolvingNode secondary)
{
var res = GetMergedState(main.State, secondary.State);
main.State = res;
if (res is IType t && t.IsSolved)
{
secondary.State = res;
return;
}
main.Ancestors.AddRange(secondary.Ancestors);
secondary.Ancestors.Clear();
secondary.State = new RefTo(main);
}
public static SolvingNode GetNonReference(this SolvingNode node)
{
var result = node;
if (result.State is RefTo referenceA)
{
result = referenceA.Node;
if (result.State is RefTo)
{
return(GetNonReference(result));
}
}
return(result);
}
/// <summary>
/// Превращает неопределенное ограничение в функциональный тип
/// </summary>
private static Fun TransformToFunOrNull(string descNodeName, Constrains descendant, Fun ancestor)
{
if (descendant.NoConstrains)
{
string eName;
if (descNodeName.StartsWith("T") && descNodeName.Length > 1)
{
eName = "e" + descNodeName.Substring(1).ToLower() + "'";
}
else
{
eName = "e" + descNodeName.ToLower() + "'";
}
var argNodes = new SolvingNode[ancestor.ArgsCount];
for (int i = 0; i < ancestor.ArgsCount; i++)
{
var argNode = new SolvingNode(eName, new Constrains(), SolvingNodeType.TypeVariable);
argNode.Ancestors.Add(ancestor.ArgNodes[i]);
argNodes[i] = argNode;
}
var retNode = new SolvingNode(eName, new Constrains(), SolvingNodeType.TypeVariable);
retNode.Ancestors.Add(ancestor.RetNode);
return(Fun.Of(argNodes, retNode));
}
if (descendant.Descedant is Fun arrayEDesc &&
arrayEDesc.ArgsCount == ancestor.ArgsCount)
{
if (arrayEDesc.IsSolved)
{
return(arrayEDesc);
}
var nrArgNodes = arrayEDesc.ArgNodes.Select(n => n.GetNonReference()).ToArray();
var nrRetNode = arrayEDesc.RetNode.GetNonReference();
if (nrArgNodes.All(n => n.IsSolved) && nrRetNode.IsSolved)
{
return(Fun.Of(nrArgNodes, nrRetNode));
}
}
return(null);
}
private SolvingNode GetOrCreateNode(int id)
{
while (_syntaxNodes.Count <= id)
{
_syntaxNodes.Add(null);
}
var alreadyExists = _syntaxNodes[id];
if (alreadyExists != null)
{
return(alreadyExists);
}
var res = new SolvingNode(id.ToString(), new Constrains(), SolvingNodeType.SyntaxNode);
_syntaxNodes[id] = res;
return(res);
}
private SolvingNode GetOrCreateArrayNode(int id, SolvingNode elementType)
{
while (_syntaxNodes.Count <= id)
{
_syntaxNodes.Add(null);
}
var alreadyExists = _syntaxNodes[id];
if (alreadyExists != null)
{
alreadyExists.State = SolvingFunctions.GetMergedState(new Array(elementType), alreadyExists.State);
return(alreadyExists);
}
var res = new SolvingNode(id.ToString(), new Array(elementType), SolvingNodeType.SyntaxNode);
_syntaxNodes[id] = res;
return(res);
}
private void SetOrCreateLambda(int lambdaId, SolvingNode[] args, SolvingNode ret)
{
var fun = Fun.Of(args, ret);
while (_syntaxNodes.Count <= lambdaId)
{
_syntaxNodes.Add(null);
}
var alreadyExists = _syntaxNodes[lambdaId];
if (alreadyExists != null)
{
alreadyExists.State = SolvingFunctions.GetMergedState(fun, alreadyExists.State);
}
else
{
var res = new SolvingNode(lambdaId.ToString(), fun, SolvingNodeType.SyntaxNode);
_syntaxNodes[lambdaId] = res;
}
}
/// <summary>
/// Превращает неопределенное ограничение в ограничение с массивом
/// </summary>
/// <param name="descNodeName"></param>
/// <param name="descendant"></param>
/// <param name="ancestor"></param>
/// <returns></returns>
private static Array TransformToArrayOrNull(string descNodeName, Constrains descendant,
Array ancestor)
{
if (descendant.NoConstrains)
{
var constrains = new Constrains();
string eName;
if (descNodeName.StartsWith("T") && descNodeName.Length > 1)
{
eName = "e" + descNodeName.Substring(1).ToLower() + "'";
}
else
{
eName = "e" + descNodeName.ToLower() + "'";
}
var node = new SolvingNode(eName, constrains, SolvingNodeType.TypeVariable);
node.Ancestors.Add(ancestor.ElementNode);
return(new Array(node));
}
if (descendant.HasDescendant && descendant.Descedant is Array arrayEDesc)
{
if (arrayEDesc.Element is RefTo)
{
var origin = arrayEDesc.ElementNode.GetNonReference();
if (origin.IsSolved)
{
return(new Array(origin));
}
}
else if (arrayEDesc.ElementNode.IsSolved)
{
return(arrayEDesc);
}
}
return(null);
}
public static void BecomeReferenceFor(this SolvingNode referencedNode, SolvingNode original)
{
referencedNode = referencedNode.GetNonReference();
original = original.GetNonReference();
Merge(referencedNode, original);
}
public static void BecomeAncestorFor(this SolvingNode ancestor, SolvingNode descendant)
{
descendant.Ancestors.Add(ancestor);
}
public static FinalizationResults FinalizeUp(SolvingNode[] toposortedNodes, SolvingNode[] outputNodes)
{
var typeVariables = new HashSet <SolvingNode>();
var syntaxNodes = new SolvingNode[toposortedNodes.Length];
var namedNodes = new List <SolvingNode>();
void Finalize(SolvingNode node)
{
if (node.State is RefTo)
{
var originalOne = node.GetNonReference();
if (originalOne != node)
{
Console.WriteLine($"\t{node.Name}->r");
node.State = new RefTo(originalOne);
}
if (originalOne.State is IType)
{
node.State = originalOne.State;
Console.WriteLine($"\t{node.Name}->s");
}
}
else if (node.State is ICompositeType composite)
{
if (composite.Members.Any(m => m.State is RefTo))
{
node.State = composite.GetNonReferenced();
Console.WriteLine($"\t{node.Name}->ar");
}
foreach (var member in composite.Members)
{
Finalize(member);
}
}
}
foreach (var node in toposortedNodes.Reverse())
{
Finalize(node);
foreach (var member in node.GetAllLeafTypes())
{
if (member.Type == SolvingNodeType.TypeVariable && member.State is Constrains)
{
if (!typeVariables.Contains(member))
{
typeVariables.Add(member);
}
}
}
if (node.Type == SolvingNodeType.Named)
{
namedNodes.Add(node);
}
else if (node.Type == SolvingNodeType.SyntaxNode)
{
syntaxNodes[int.Parse(node.Name)] = node;
}
}
var outputTypes = outputNodes
.SelectMany(s => s.GetAllLeafTypes())
.Distinct()
.ToArray();
var notSolved = toposortedNodes
.Where(t => t.State is Constrains)
.Except(outputTypes)
.ToArray();
foreach (var node in notSolved)
{
node.State = ((Constrains)node.State).TrySolveOrNull() ?? node.State;
}
return(new FinalizationResults(typeVariables.ToArray(), namedNodes.ToArray(), syntaxNodes));
}
public static void TryMergeDestructive(SolvingNode descendantNode, SolvingNode ancestorNode)
{
Console.WriteLine($"-dm: {ancestorNode} -> {descendantNode}");
var nonRefAncestor = GetNonReference(ancestorNode);
var nonRefDescendant = GetNonReference(descendantNode);
if (nonRefDescendant == nonRefAncestor)
{
Console.WriteLine($"Same deref. Skip");
return;
}
var originAnc = nonRefAncestor.ToString();
var originDes = nonRefDescendant.ToString();
switch (nonRefAncestor.State)
{
case Primitive concreteAnc:
{
if (nonRefDescendant.State is Constrains c && c.Fits(concreteAnc))
{
Console.Write("p+c");
if (c.Prefered != null && c.Fits(c.Prefered))
{
nonRefDescendant.State = c.Prefered;
}
else
{
nonRefDescendant.State = concreteAnc;
}
}
break;
}
case Array arrayAnc:
{
if (nonRefDescendant.State is Constrains constrainsDesc && constrainsDesc.Fits(arrayAnc))
{
Console.Write("a+c");
nonRefDescendant.State = new RefTo(nonRefAncestor);
}
break;
}
case Fun funAnc:
{
if (nonRefDescendant.State is Constrains constrainsDesc && constrainsDesc.Fits(funAnc))
{
Console.Write("f+c");
nonRefDescendant.State = new RefTo(nonRefAncestor);
}
break;
}
case Constrains constrainsAnc when nonRefDescendant.State is Primitive concreteDesc:
{
if (constrainsAnc.Fits(concreteDesc))
{
Console.Write("c+p");
descendantNode.State = ancestorNode.State = nonRefAncestor.State = concreteDesc;
}
break;
}
case Constrains constrainsAnc when nonRefDescendant.State is Constrains constrainsDesc:
{
Console.Write("c+c");
var result = constrainsAnc.MergeOrNull(constrainsDesc);
if (result == null)
{
return;
}
if (result is Primitive)
{
nonRefAncestor.State = nonRefDescendant.State = descendantNode.State = result;
return;
}
if (nonRefAncestor.Type == SolvingNodeType.TypeVariable ||
nonRefDescendant.Type != SolvingNodeType.TypeVariable)
{
nonRefAncestor.State = result;
nonRefDescendant.State = descendantNode.State = new RefTo(nonRefAncestor);
}
else
{
nonRefDescendant.State = result;
nonRefAncestor.State = ancestorNode.State = new RefTo(nonRefDescendant);
}
nonRefDescendant.Ancestors.Remove(nonRefAncestor);
descendantNode.Ancestors.Remove(nonRefAncestor);
break;
}
case Constrains constrainsAnc when nonRefDescendant.State is Array arrayDes:
{
Console.Write("c+a");
if (constrainsAnc.Fits(arrayDes))
{
nonRefAncestor.State = ancestorNode.State = new RefTo(nonRefDescendant);
}
break;
}
case Constrains constrainsAnc when nonRefDescendant.State is Fun funDes:
{
Console.Write("c+f");
if (constrainsAnc.Fits(funDes))
{
nonRefAncestor.State = ancestorNode.State = new RefTo(nonRefDescendant);
}
break;
}
}
Console.WriteLine($" {originAnc} + {originDes} = {nonRefDescendant.State}");
}
private static IState SetDownwardsLimits(SolvingNode descendant, SolvingNode ancestor)
{
#region todo проверить случаи ссылок
if (descendant == ancestor)
{
return(descendant.State);
}
if (descendant.State is RefTo referenceDesc)
{
referenceDesc.Node.State = SetDownwardsLimits(descendant, referenceDesc.Node);
return(referenceDesc);
}
if (ancestor.State is RefTo referenceAnc)
{
return(SetDownwardsLimits(referenceAnc.Node, descendant));
}
#endregion
if (ancestor.State is Array ancArray)
{
if (descendant.State is Constrains constr)
{
var result = TransformToArrayOrNull(descendant.Name, constr, ancArray);
if (result == null)
{
throw new InvalidOperationException();
}
descendant.State = result;
}
if (descendant.State is Array desArray)
{
desArray.ElementNode.State = SetDownwardsLimits(desArray.ElementNode, ancArray.ElementNode);
return(descendant.State);
}
throw new InvalidOperationException();
}
if (ancestor.State is Fun ancFun)
{
if (descendant.State is Constrains constr)
{
var result = TransformToFunOrNull(descendant.Name, constr, ancFun);
if (result == null)
{
throw new InvalidOperationException();
}
descendant.State = result;
}
if (descendant.State is Fun desArray)
{
if (desArray.ArgsCount != ancFun.ArgsCount)
{
throw new InvalidOperationException();
}
for (int i = 0; i < desArray.ArgsCount; i++)
{
desArray.ArgNodes[i].State = SetDownwardsLimits(desArray.ArgNodes[i], ancFun.ArgNodes[i]);
}
desArray.RetNode.State = SetDownwardsLimits(desArray.RetNode, ancFun.RetNode);
return(descendant.State);
}
throw new InvalidOperationException();
}
Primitive up = null;
if (ancestor.State is Primitive concreteAnc)
{
up = concreteAnc;
}
else if (ancestor.State is Constrains constrainsAnc)
{
if (constrainsAnc.HasAncestor)
{
up = constrainsAnc.Ancestor;
}
else
{
return(descendant.State);
}
}
else if (ancestor.State is Array)
{
return(descendant.State);
}
else if (ancestor.State is Fun)
{
return(descendant.State);
}
if (up == null)
{
throw new InvalidOperationException();
}
if (descendant.State is IType concreteDesc)
{
if (concreteDesc.CanBeImplicitlyConvertedTo(up))
{
return(descendant.State);
}
throw new InvalidOperationException();
}
if (descendant.State is Constrains constrainsDesc)
{
constrainsDesc.AddAncestor(up);
return(descendant.State);
}
throw new InvalidOperationException();
}
private static IState SetUpwardsLimits(SolvingNode descendant, SolvingNode ancestor)
{
#region handle refto cases.
if (ancestor == descendant)
{
return(ancestor.State);
}
if (ancestor.State is RefTo referenceAnc)
{
if (descendant.Ancestors.Contains(ancestor))
{
descendant.Ancestors.Remove(ancestor);
if (descendant != referenceAnc.Node)
{
descendant.Ancestors.Add(referenceAnc.Node);
}
}
referenceAnc.Node.State = SetUpwardsLimits(descendant, referenceAnc.Node);
return(referenceAnc);
}
if (descendant.State is RefTo referenceDesc)
{
if (descendant.Ancestors.Contains(ancestor))
{
descendant.Ancestors.Remove(ancestor);
if (referenceDesc.Node != ancestor)
{
referenceDesc.Node.Ancestors.Add(ancestor);
}
}
ancestor.State = SetUpwardsLimits(referenceDesc.Node, ancestor);
return(ancestor.State);
}
#endregion
if (descendant.State is IType typeDesc)
{
switch (ancestor.State)
{
case Primitive concreteAnc:
{
if (!typeDesc.CanBeImplicitlyConvertedTo(concreteAnc))
{
throw new InvalidOperationException();
}
return(ancestor.State);
}
case Constrains constrainsAnc:
{
var result = constrainsAnc.GetCopy();
result.AddDescedant(typeDesc);
return(result.GetOptimizedOrThrow());
}
case Array arrayAnc:
{
if (!(typeDesc is Array arrayDesc))
{
throw new NotSupportedException();
}
descendant.Ancestors.Remove(ancestor);
arrayDesc.ElementNode.Ancestors.Add(arrayAnc.ElementNode);
return(ancestor.State);
}
case Fun fun:
{
if (!(typeDesc is Fun funDesc))
{
throw new NotSupportedException();
}
if (funDesc.ArgsCount != fun.ArgsCount)
{
throw new NotSupportedException();
}
descendant.Ancestors.Remove(ancestor);
funDesc.RetNode.Ancestors.Add(fun.RetNode);
for (int i = 0; i < funDesc.ArgsCount; i++)
{
fun.ArgNodes[i].Ancestors.Add(funDesc.ArgNodes[i]);
}
return(ancestor.State);
}
default:
throw new NotSupportedException();
}
}
if (descendant.State is Constrains constrainsDesc)
{
switch (ancestor.State)
{
case Primitive concreteAnc:
{
if (constrainsDesc.HasDescendant &&
constrainsDesc.Descedant?.CanBeImplicitlyConvertedTo(concreteAnc) != true)
{
throw new InvalidOperationException();
}
return(ancestor.State);
}
case Constrains constrainsAnc:
{
var result = constrainsAnc.GetCopy();
result.AddDescedant(constrainsDesc.Descedant);
return(result.GetOptimizedOrThrow());
}
case Array arrayAnc:
{
var result = TransformToArrayOrNull(descendant.Name, constrainsDesc, arrayAnc);
if (result == null)
{
throw new InvalidOperationException();
}
result.ElementNode.Ancestors.Add(arrayAnc.ElementNode);
descendant.State = result;
descendant.Ancestors.Remove(ancestor);
return(ancestor.State);
}
case Fun funAnc:
{
var result = TransformToFunOrNull(descendant.Name, constrainsDesc, funAnc);
if (result == null)
{
throw new InvalidOperationException();
}
result.RetNode.Ancestors.Add(funAnc.RetNode);
for (int i = 0; i < result.ArgsCount; i++)
{
result.ArgNodes[i].Ancestors.Add(funAnc.ArgNodes[i]);
}
descendant.State = result;
descendant.Ancestors.Remove(ancestor);
return(ancestor.State);
}
default:
throw new NotSupportedException(
$"Ancestor type {ancestor.State.GetType().Name} is not supported");
}
}
throw new NotSupportedException($"Descendant type {descendant.State.GetType().Name} is not supported");
}
