2 writes to InnerNodes
NuGet.DependencyResolver.Core (2)
GraphModel\GraphNode.cs (2)
24InnerNodes = hasInnerNodes ? new List<GraphNode<TItem>>() : EmptyList; 82InnerNodes = new List<GraphNode<TItem>>(additionalSpace);
25 references to InnerNodes
NuGet.Commands (7)
RestoreCommand\DependencyGraphResolver.cs (5)
526currentGraphNode.InnerNodes.Add(nodeWithConflict); 551rootGraphNode.InnerNodes.Add(newGraphNode); 557currentGraphNode.InnerNodes.Add(newGraphNode); 601currentGraphNode.InnerNodes.Remove(newGraphNode); 615currentGraphNode.InnerNodes.Add(conflictingNode);
RestoreCommand\LockFileBuilder.cs (1)
530foreach (GraphNode<RemoteResolveResult> node in rootNode.InnerNodes)
RestoreCommand\Utility\IncludeFlagUtils.cs (1)
103foreach (var root in graph.InnerNodes.Where(n => !n.Item.IsCentralTransitive))
NuGet.DependencyResolver.Core (18)
GraphModel\GraphNode.cs (2)
61/// Ensures that <see cref="InnerNodes"/> has the capacity to add 72if (InnerNodes is List<GraphNode<TItem>> innerList)
GraphModel\GraphOperations.cs (12)
132node.OuterNode.InnerNodes.Remove(node); 146var innerNodes = n.InnerNodes; 180node.OuterNode.InnerNodes.Remove(node); 225var innerNodes = node.InnerNodes; 362var centralTransitiveNodes = root.InnerNodes.Where(n => n.Item.IsCentralTransitive).ToList(); 417var innerNodes = node.InnerNodes; 542AddInnerNodesToQueue(work.InnerNodes, queue); 564AddInnerNodesToQueue(work.Node.InnerNodes, queue, state); 585AddInnerNodesToQueue(node.InnerNodes, queue); 605AddInnerNodesToQueue(node.InnerNodes, queue); 630AddInnerNodesToQueue(node.InnerNodes, queue); 944var children = root.InnerNodes;
Remote\RemoteDependencyWalker.cs (4)
48result.AddRange(rootNode.InnerNodes.Select(n => n.Key.Name)); 204node.InnerNodes.Add(dependencyNode); 230node.InnerNodes.Add(newNode); 602rootNode.InnerNodes.Add(node);