2 writes to InnerNodes
NuGet.DependencyResolver.Core (2)
GraphModel\GraphNode.cs (2)
22InnerNodes = hasInnerNodes ? new List<GraphNode<TItem>>() : EmptyList; 80InnerNodes = new List<GraphNode<TItem>>(additionalSpace);
24 references to InnerNodes
NuGet.Commands (6)
RestoreCommand\DependencyGraphResolver.cs (4)
528currentGraphNode.InnerNodes.Add(nodeWithConflict); 562parentGraphNode.InnerNodes.Add(newGraphNode); 607currentGraphNode.InnerNodes.Remove(newGraphNode); 621currentGraphNode.InnerNodes.Add(conflictingNode);
RestoreCommand\LockFileBuilder.cs (1)
540foreach (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)
59/// Ensures that <see cref="InnerNodes"/> has the capacity to add 70if (InnerNodes is List<GraphNode<TItem>> innerList)
GraphModel\GraphOperations.cs (12)
130node.OuterNode!.InnerNodes.Remove(node); 144var innerNodes = n.InnerNodes; 178node.OuterNode!.InnerNodes.Remove(node); 223var innerNodes = node.InnerNodes; 360var centralTransitiveNodes = root.InnerNodes.Where(n => n.Item?.IsCentralTransitive == true).ToList(); 415var innerNodes = node.InnerNodes; 549AddInnerNodesToQueue(work.InnerNodes, queue); 571AddInnerNodesToQueue(work.Node.InnerNodes, queue, state); 592AddInnerNodesToQueue(node.InnerNodes, queue); 612AddInnerNodesToQueue(node.InnerNodes, queue); 637AddInnerNodesToQueue(node.InnerNodes, queue); 962var children = root.InnerNodes;
Remote\RemoteDependencyWalker.cs (4)
47result.AddRange(rootNode.InnerNodes.Select(n => n.Key.Name)); 205node.InnerNodes.Add(dependencyNode); 231node.InnerNodes.Add(newNode); 612rootNode.InnerNodes.Add(node);