/// <summary> /// Delete current node. /// </summary> /// <typeparam name="TFactRule">FatcRule type.</typeparam> /// <typeparam name="TWantAction">WantAction type.</typeparam> /// <typeparam name="TFactContainer">FactContainer type.</typeparam> /// <param name="node">Node to be removed.</param> /// <param name="treeByFactRule">Rule tree.</param> /// <param name="level">Level in tree.</param> /// <returns>True - remove root node.</returns> /// <remarks> /// Recursively delete parent nodes /// if they do not have other nodes calculating the fact from the child node. /// </remarks> private bool TryRemoveRootNode <TFactRule, TWantAction, TFactContainer>(NodeByFactRule <TFactRule> node, TreeByFactRule <TFactRule, TWantAction, TFactContainer> treeByFactRule, int level) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { treeByFactRule.Levels[level].Remove(node); if (level == 0) { return(true); } NodeByFactRule <TFactRule> parent = node.Parent; parent.Childs.Remove(node); // If the node has a child node that can calculate this fact if (parent.Childs.Any(n => n.Info.Rule.OutputFactType.EqualsFactType(node.Info.Rule.OutputFactType))) { return(false); } else { return(TryRemoveRootNode(parent, treeByFactRule, level - 1)); } }
/// <inheritdoc/> public virtual bool TryBuildTreeForFactInfo <TFactRule, TWantAction, TFactContainer>(BuildTreeForFactInfoRequest <TFactRule, TWantAction, TFactContainer> request, out TreeByFactRule <TFactRule, TWantAction, TFactContainer> treeResult, out List <DeriveFactErrorDetail> deriveFactErrorDetails) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { var context = request.Context; treeResult = null; deriveFactErrorDetails = null; // find the rules that can calculate the fact List <TreeByFactRule <TFactRule, TWantAction, TFactContainer> > treesByWantFactType = request.GetTreesByRequest(); var treeReady = treesByWantFactType.FirstOrDefault(tree => tree.Status == TreeStatus.Built); if (treeReady != null) { treeResult = treeReady; return(true); } List <List <IFactType> > notFoundFactSet = treesByWantFactType.ConvertAll(item => new List <IFactType>()); var allFinichedNodes = new Dictionary <NodeByFactRuleInfo <TFactRule>, NodeByFactRule <TFactRule> >(); while (true) { for (int i = treesByWantFactType.Count - 1; i >= 0; i--) { var treeByWantFactType = treesByWantFactType[i]; if (treeByWantFactType.Status != TreeStatus.BeingBuilt) { continue; } int lastlevelNumber = treeByWantFactType.Levels.Count - 1; // If after synchronization we can calculate the tree. if (TrySyncTreeLevelsAndFinishedNodes(treeByWantFactType, lastlevelNumber, allFinichedNodes)) { treeByWantFactType.Built(); continue; } List <NodeByFactRule <TFactRule> > lastTreeLevel = treeByWantFactType.Levels[lastlevelNumber]; // If in the last level there are no nodes for calculation, then the tree can be calculated. if (lastTreeLevel.Count == 0) { treeByWantFactType.Built(); continue; } // Next level nodes. var nextTreeLevel = new List <NodeByFactRule <TFactRule> >(); var currentLevelFinishedNodes = new Dictionary <NodeByFactRuleInfo <TFactRule>, NodeByFactRule <TFactRule> >(); bool cannotDerived = false; for (int j = 0; j < lastTreeLevel.Count; j++) { NodeByFactRule <TFactRule> node = lastTreeLevel[j]; NodeByFactRuleInfo <TFactRule> nodeInfo = node.Info; Dictionary <NodeByFactRuleInfo <TFactRule>, NodeByFactRule <TFactRule> > copatibleAllFinishedNodes = nodeInfo.GetCompatibleFinishedNodes(allFinichedNodes, context); List <IFactType> needFacts = nodeInfo .RequiredFactTypes .FindAll(needFactType => !CanRemoveFromNeedFactTypes(needFactType, node, context, copatibleAllFinishedNodes)); // If the rule can be calculated from the parameters in the container, then add the node to the list of complete. if (needFacts.IsNullOrEmpty()) { allFinichedNodes.Add(node.Info, node); currentLevelFinishedNodes.Add(node.Info, node); continue; } bool canTryRemoveNode = false; foreach (var needFact in needFacts) { if (needFact.IsFactType <ISpecialFact>()) { if (!canTryRemoveNode) { canTryRemoveNode = true; } notFoundFactSet[i].Add(needFact); continue; } var needRules = nodeInfo .CompatibleRules .FindAll(rule => rule.OutputFactType.EqualsFactType(needFact) && !rule.RuleContainBranch(node)); if (needRules.Count > 0) { List <NodeByFactRule <TFactRule> > nodes = needRules.GetNodesByRules(node, treeByWantFactType); nextTreeLevel.AddRange(nodes); node.Childs.AddRange(nodes); } else { if (!canTryRemoveNode) { canTryRemoveNode = true; } notFoundFactSet[i].Add(needFact); } } if (canTryRemoveNode) { // Is there a neighboring node capable of deriving this fact. cannotDerived = TryRemoveRootNode(node, treeByWantFactType, lastlevelNumber); j--; } } if (cannotDerived) { treeByWantFactType.Cencel(); } else if (currentLevelFinishedNodes.Count > 0) { if (TrySyncTreeLevelsAndFinishedNodes(treeByWantFactType, lastlevelNumber, currentLevelFinishedNodes)) { treeByWantFactType.Built(); } else if (nextTreeLevel.Count > 0) { SyncTreeLevelAndFinishedNodes(nextTreeLevel, currentLevelFinishedNodes, context); treeByWantFactType.Levels.Add(nextTreeLevel); } } else if (nextTreeLevel.Count > 0) { treeByWantFactType.Levels.Add(nextTreeLevel); } else { treeByWantFactType.Built(); } } List <TreeByFactRule <TFactRule, TWantAction, TFactContainer> > builtTrees = treesByWantFactType .FindAll(tree => tree.Status == TreeStatus.Built); if (builtTrees.Count != 0) { var countRuleByBuiltTrees = builtTrees.ToDictionary(tree => tree, tree => tree.GetUniqueRulesFromTree().Count); int minRuleCount = countRuleByBuiltTrees.Min(item => item.Value); var suitableTree = countRuleByBuiltTrees.First(item => item.Value == minRuleCount).Key; foreach (var tree in treesByWantFactType) { if (tree != suitableTree && tree.Status != TreeStatus.Cencel && tree.GetUniqueRulesFromTree().Count >= minRuleCount) { tree.Cencel(); } } if (treesByWantFactType.All(tree => tree.Status != TreeStatus.BeingBuilt)) { treeResult = suitableTree; return(true); } } if (treesByWantFactType.All(tree => tree.Status == TreeStatus.Cencel)) { break; } } deriveFactErrorDetails = new List <DeriveFactErrorDetail>(); foreach (var factSet in notFoundFactSet) { if (factSet.Count != 0) { deriveFactErrorDetails.Add(new DeriveFactErrorDetail(request.WantFactType, factSet.AsReadOnly())); } } return(false); }
/// <summary> /// Synchronize tree levels with years ready for calculation. /// </summary> /// <typeparam name="TFactRule">FatcRule type.</typeparam> /// <typeparam name="TWantAction">WantAction type.</typeparam> /// <typeparam name="TFactContainer">FactContainer type.</typeparam> /// <param name="treeByFactRule">Tree whose levels you want to synchronize.</param> /// <param name="level">The level at which to start synchronization.</param> /// <param name="finishedNodes"></param> /// <returns>True - managed to sync root level</returns> private bool TrySyncTreeLevelsAndFinishedNodes <TFactRule, TWantAction, TFactContainer>(TreeByFactRule <TFactRule, TWantAction, TFactContainer> treeByFactRule, int level, Dictionary <NodeByFactRuleInfo <TFactRule>, NodeByFactRule <TFactRule> > finishedNodes) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { if (level < 0) { return(true); } var context = treeByFactRule.Context; List <NodeByFactRule <TFactRule> > currentLevel = treeByFactRule.Levels[level]; var finishedNodesInCurrentLevel = new Dictionary <NodeByFactRuleInfo <TFactRule>, NodeByFactRule <TFactRule> >(); foreach (var node in currentLevel) { TFactRule rule = node.Info.Rule; IFactRuleCollection <TFactRule> finishedRules = context .FactRules .FindAll(r => finishedNodes.Any(n => n.Key.Rule.EqualsWork(r, context.WantAction, context.Container))); IFactRuleCollection <TFactRule> copabilitiesFinishedRules = rule.GetCompatibleRulesEx(finishedRules, context); if (rule.InputFactTypes.Count == 0) { finishedNodesInCurrentLevel.Add(node.Info, node); } else if (node.Info.RequiredFactTypes.All(requiredFactType => !requiredFactType.IsBuildOrRuntimeFact() && copabilitiesFinishedRules.Any(r => r.OutputFactType.EqualsFactType(requiredFactType)))) { finishedNodesInCurrentLevel.Add(node.Info, node); } else if (copabilitiesFinishedRules.Any(r => r.EqualsWork(rule, context.WantAction, context.Container))) { finishedNodesInCurrentLevel.Add(node.Info, node); } } if (finishedNodesInCurrentLevel.IsNullOrEmpty()) { return(false); } SyncTreeLevelAndFinishedNodes(currentLevel, finishedNodesInCurrentLevel, context); foreach (var finishedNode in finishedNodesInCurrentLevel) { if (finishedNodes.Keys.Any(nodeInfo => nodeInfo.Rule.EqualsWork(finishedNode.Key.Rule, context.WantAction, context.Container))) { continue; } finishedNodes.Add(finishedNode.Key, finishedNode.Value); } return(TrySyncTreeLevelsAndFinishedNodes(treeByFactRule, level - 1, finishedNodes)); }
/// <summary> /// Get <see cref="TreeByFactRule{TFactRule, TWantAction, TFactContainer}"/> by <paramref name="request"/>. /// </summary> /// <typeparam name="TFactRule"></typeparam> /// <typeparam name="TWantAction"></typeparam> /// <typeparam name="TFactContainer"></typeparam> /// <param name="request"></param> /// <returns></returns> internal static List <TreeByFactRule <TFactRule, TWantAction, TFactContainer> > GetTreesByRequest <TFactRule, TWantAction, TFactContainer>(this BuildTreeForFactInfoRequest <TFactRule, TWantAction, TFactContainer> request) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { var context = request.Context; var factRules = request.Context.FactRules; if (factRules.IsNullOrEmpty()) { throw CommonHelper.CreateDeriveException(ErrorCode.EmptyRuleCollection, "Rules cannot be null."); } var needRules = factRules .Where(rule => rule.OutputFactType.EqualsFactType(request.WantFactType)) .ToList(); if (needRules.IsNullOrEmpty()) { throw CommonHelper.CreateDeriveException(ErrorCode.RuleNotFound, $"No rules found able to calculate fact {request.WantFactType.FactName}."); } var nodeInfos = needRules.ConvertAll(rule => new NodeByFactRuleInfo <TFactRule> { BuildSuccessConditions = new List <IBuildConditionFact>(rule.InputFactTypes.Count(type => type.IsFactType <IBuildConditionFact>())), BuildFailedConditions = new List <IBuildConditionFact>(), RuntimeConditions = new List <IRuntimeConditionFact>(rule.InputFactTypes.Count(type => type.IsFactType <IRuntimeConditionFact>())), Rule = rule, RequiredFactTypes = context.SingleEntity.GetRequiredTypesOfFacts(rule, context).ToList(), CompatibleRules = rule.GetCompatibleRulesEx(context.FactRules, context), }); return(nodeInfos.ConvertAll(info => { var node = new NodeByFactRule <TFactRule> { Childs = new List <NodeByFactRule <TFactRule> >(), Info = info, }; var tree = new TreeByFactRule <TFactRule, TWantAction, TFactContainer> { Levels = new List <List <NodeByFactRule <TFactRule> > > { new List <NodeByFactRule <TFactRule> > { node }, }, NodeInfos = nodeInfos, Root = node, Context = context, }; if (info.RequiredFactTypes.Count == 0) { tree.Built(); } return tree; })); }
/// <summary> /// Get unique rules from tree. /// </summary> /// <typeparam name="TFactRule"></typeparam> /// <typeparam name="TWantAction"></typeparam> /// <typeparam name="TFactContainer"></typeparam> /// <param name="treeByFactRule"></param> /// <returns></returns> internal static HashSet <TFactRule> GetUniqueRulesFromTree <TFactRule, TWantAction, TFactContainer>(this TreeByFactRule <TFactRule, TWantAction, TFactContainer> treeByFactRule) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { var result = new HashSet <TFactRule>(); FillUniqueRulesFromTree(treeByFactRule.Root, result); return(result); }
/// <summary> /// Returns nodes by rules. /// </summary> /// <typeparam name="TFactRule">FatcRule type.</typeparam> /// <typeparam name="TWantAction">WantAction type.</typeparam> /// <typeparam name="TFactContainer">FactContainer type.</typeparam> /// <param name="rules">List of rule.</param> /// <param name="treeByFactRule">Rule tree.</param> /// <param name="parentNode">Parent node.</param> /// <returns>Node list.</returns> public static List <NodeByFactRule <TFactRule> > GetNodesByRules <TFactRule, TWantAction, TFactContainer>(this IEnumerable <TFactRule> rules, NodeByFactRule <TFactRule> parentNode, TreeByFactRule <TFactRule, TWantAction, TFactContainer> treeByFactRule) where TFactRule : IFactRule where TWantAction : IWantAction where TFactContainer : IFactContainer { var context = treeByFactRule.Context; var result = new List <NodeByFactRule <TFactRule> >(); foreach (var rule in rules) { NodeByFactRuleInfo <TFactRule> nodeInfo = treeByFactRule.NodeInfos.FirstOrDefault(nInfo => nInfo.Rule.EqualsWork(rule, context.WantAction, context.Container)); if (nodeInfo == null) { nodeInfo = new NodeByFactRuleInfo <TFactRule> { Rule = rule, BuildSuccessConditions = new List <IBuildConditionFact>(rule.InputFactTypes.Count(type => type.IsFactType <IBuildConditionFact>())), BuildFailedConditions = new List <IBuildConditionFact>(), RuntimeConditions = new List <IRuntimeConditionFact>(rule.InputFactTypes.Count(type => type.IsFactType <IRuntimeConditionFact>())), RequiredFactTypes = context.SingleEntity.GetRequiredTypesOfFacts(rule, context).ToList(), CompatibleRules = rule.GetCompatibleRulesEx(context.FactRules, context), } } ; result.Add(new NodeByFactRule <TFactRule> { Childs = new List <NodeByFactRule <TFactRule> >(), Info = nodeInfo, Parent = parentNode, }); } return(result); }