本文整理汇总了C#中System.Collections.Generic.PriorityQueue.DequeueFirst方法的典型用法代码示例。如果您正苦于以下问题：C# PriorityQueue.DequeueFirst方法的具体用法？C# PriorityQueue.DequeueFirst怎么用？C# PriorityQueue.DequeueFirst使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类System.Collections.Generic.PriorityQueue的用法示例。
在下文中一共展示了PriorityQueue.DequeueFirst方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: ScheduleSearchPlan
//.........这里部分代码省略.........
}
foreach(SearchPlanEdge edge in spGraph.Root.OutgoingEdges)
{
if(edge.Type == SearchOperationType.PickFromIndex)
{
foreach(SearchPlanEdge edgeOutgoingFromPickedElement in edge.Target.OutgoingEdges)
activeEdges.Add(edgeOutgoingFromPickedElement);
SearchOperation newOp = new SearchOperation(edge.Type,
edge.Target, spGraph.Root, 0);
newOp.IndexAccess = edge.Target.PatternElement.IndexAccess;
operations.Add(newOp);
}
}
foreach(SearchPlanEdge edge in spGraph.Root.OutgoingEdges)
{
if(edge.Type == SearchOperationType.PickByName)
{
foreach(SearchPlanEdge edgeOutgoingFromPickedElement in edge.Target.OutgoingEdges)
activeEdges.Add(edgeOutgoingFromPickedElement);
SearchOperation newOp = new SearchOperation(edge.Type,
edge.Target, spGraph.Root, 0);
newOp.NameLookup = edge.Target.PatternElement.NameLookup;
operations.Add(newOp);
}
}
foreach(SearchPlanEdge edge in spGraph.Root.OutgoingEdges)
{
if(edge.Type == SearchOperationType.PickByUnique)
{
foreach(SearchPlanEdge edgeOutgoingFromPickedElement in edge.Target.OutgoingEdges)
activeEdges.Add(edgeOutgoingFromPickedElement);
SearchOperation newOp = new SearchOperation(edge.Type,
edge.Target, spGraph.Root, 0);
newOp.UniqueLookup = edge.Target.PatternElement.UniqueLookup;
operations.Add(newOp);
}
}
// iterate over all reachable elements until the whole graph has been scheduled(/visited),
// choose next cheapest operation, update the reachable elements and the search plan costs
SearchPlanNode lastNode = spGraph.Root;
for(int i = 0; i < spGraph.Nodes.Length - spGraph.NumPresetElements - spGraph.NumIndependentStorageIndexElements; ++i)
{
foreach(SearchPlanEdge edge in lastNode.OutgoingEdges)
{
if(edge.Target.IsPreset)
continue;
if(edge.Target.PatternElement.Storage != null
&& edge.Target.PatternElement.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness()==null)
continue;
if(edge.Target.PatternElement.IndexAccess != null
&& edge.Target.PatternElement.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness()==null)
continue;
if(edge.Target.PatternElement.NameLookup != null
&& edge.Target.PatternElement.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness()==null)
continue;
if(edge.Target.PatternElement.UniqueLookup != null
&& edge.Target.PatternElement.GetPatternElementThisElementDependsOnOutsideOfGraphConnectedness()==null)
continue;
CostDecreaseForLeavingInlinedIndependent(edge);
activeEdges.Add(edge);
}
SearchPlanEdge minEdge = activeEdges.DequeueFirst();
lastNode = minEdge.Target;
SearchOperation newOp = new SearchOperation(minEdge.Type,
lastNode, minEdge.Source, minEdge.Cost);
newOp.Storage = minEdge.Target.PatternElement.Storage;
newOp.StorageIndex = minEdge.Target.PatternElement.StorageIndex;
newOp.IndexAccess = minEdge.Target.PatternElement.IndexAccess;
newOp.NameLookup = minEdge.Target.PatternElement.NameLookup;
newOp.UniqueLookup = minEdge.Target.PatternElement.UniqueLookup;
foreach(SearchOperation op in operations)
op.CostToEnd += minEdge.Cost;
operations.Add(newOp);
}
// remove the elements stemming from inlined independents
// they were added in the hope that they might help in matching this pattern,
// they don't if they are matched after the elements of this pattern (in fact they only increase the costs then)
RemoveInlinedIndependentElementsAtEnd(operations);
// insert inlined element identity check into the schedule in case neither of the possible assignments was scheduled
InsertInlinedElementIdentityCheckIntoSchedule(patternGraph, operations);
// insert inlined variable assignments into the schedule
InsertInlinedVariableAssignmentsIntoSchedule(patternGraph, operations);
// insert conditions into the schedule
InsertConditionsIntoSchedule(patternGraph.ConditionsPlusInlined, operations);
float cost = operations.Count > 0 ? operations[0].CostToEnd : 0;
return new ScheduledSearchPlan(patternGraph, operations.ToArray(), cost);
}