13 instantiations of LinkedListNode
Microsoft.CodeAnalysis (1)
InternalUtilities\ConcurrentLruCache.cs (1)
110var node = new LinkedListNode<K>(key);
Microsoft.CodeAnalysis.EditorFeatures (1)
Classification\Syntactic\SyntacticClassificationTaggerProvider.ClassifiedLineCache.cs (1)
168return new LinkedListNode<SpanAndClassifiedSpans>(new SpanAndClassifiedSpans(span, s_classifiedSpanListPool.Allocate()));
Microsoft.CodeAnalysis.UnitTests (2)
Collections\List\SegmentedList.Generic.Tests.Misc.cs (2)
118Assert.Throws<ArgumentException>("value", () => _ilist.Insert(0, new LinkedListNode<string>("blargh"))); //"ArgumentException expected." 586Assert.False(_ilist.Contains(new LinkedListNode<string>("rah")),
Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (1)
src\Compilers\Core\Portable\InternalUtilities\ConcurrentLruCache.cs (1)
110var node = new LinkedListNode<K>(key);
Microsoft.ML.Tokenizers (1)
Utils\LruCache.cs (1)
116var node = new LinkedListNode<KeyValuePair<string, TValue>>(new KeyValuePair<string, TValue>(key, value));
Microsoft.VisualBasic.Core (2)
Microsoft\VisualBasic\CompilerServices\CacheDict.vb (1)
37Dim node As New LinkedListNode(Of TKey)(key)
Microsoft\VisualBasic\CompilerServices\IDOBinder.vb (1)
1602node = New LinkedListNode(Of T)(key)
Microsoft.VisualStudio.LanguageServices (1)
src\Compilers\Core\Portable\InternalUtilities\ConcurrentLruCache.cs (1)
110var node = new LinkedListNode<K>(key);
System.Collections (4)
System\Collections\Generic\LinkedList.cs (4)
77LinkedListNode<T> result = new LinkedListNode<T>(node.list!, value); 93LinkedListNode<T> result = new LinkedListNode<T>(node.list!, value); 116LinkedListNode<T> result = new LinkedListNode<T>(this, value); 147LinkedListNode<T> result = new LinkedListNode<T>(this, value);
118 references to LinkedListNode
dotnet-svcutil-lib (1)
FrameworkFork\System.ServiceModel\Internals\System\Runtime\MruCache.cs (1)
169internal LinkedListNode<TKey> node;
Microsoft.Build (21)
BackEnd\Components\RequestBuilder\Lookup.cs (2)
756LinkedListNode<Scope> node = _lookupScopes.First; 988LinkedListNode<Scope> node = _lookupScopes.First;
BackEnd\Components\Scheduler\SchedulingData.cs (4)
50private readonly Dictionary<SchedulableRequest, LinkedListNode<SchedulableRequest>> _unscheduledRequestNodesByRequest = new Dictionary<SchedulableRequest, LinkedListNode<SchedulableRequest>>(32); 272LinkedListNode<SchedulableRequest> requestNode = _unscheduledRequests.AddFirst(request); 331LinkedListNode<SchedulableRequest> requestNode = _unscheduledRequestNodesByRequest[request];
Collections\ItemDictionary.cs (8)
48private readonly Dictionary<T, LinkedListNode<T>> _nodes; 57_nodes = new Dictionary<T, LinkedListNode<T>>(); 68_nodes = new Dictionary<T, LinkedListNode<T>>(initialItemsCapacity); 78_nodes = new Dictionary<T, LinkedListNode<T>>(); 271if (!_nodes.TryGetValue(projectItem, out LinkedListNode<T> node)) 302if (_nodes.TryGetValue(existingItem, out LinkedListNode<T> node)) 342LinkedListNode<T> node = list.AddLast(item); 402LinkedListNode<T> node = list.AddLast(projectItem);
Evaluation\Evaluator.cs (5)
757Dictionary<string, LinkedListNode<ProjectTargetElement>> activeTargets = new Dictionary<string, LinkedListNode<ProjectTargetElement>>(StringComparer.OrdinalIgnoreCase); 1030private void ReadTargetElement(ProjectTargetElement targetElement, LinkedList<ProjectTargetElement> activeTargetsByEvaluationOrder, Dictionary<string, LinkedListNode<ProjectTargetElement>> activeTargets) 1042if (activeTargets.TryGetValue(targetName, out LinkedListNode<ProjectTargetElement> node)) 1054private void AddBeforeAndAfterTargetMappings(ProjectTargetElement targetElement, Dictionary<string, LinkedListNode<ProjectTargetElement>> activeTargets, Dictionary<string, List<TargetSpecification>> targetsWhichRunBeforeByTarget, Dictionary<string, List<TargetSpecification>> targetsWhichRunAfterByTarget)
Evaluation\ProjectRootElementCache.cs (2)
585LinkedListNode<ProjectRootElement> node = _strongCache.First; 624LinkedListNode<ProjectRootElement> strongCacheEntry = _strongCache.Find(projectRootElement);
Microsoft.CodeAnalysis (4)
InternalUtilities\ConcurrentLruCache.cs (4)
25public LinkedListNode<K> Node; 88private void MoveNodeToTop(LinkedListNode<K> node) 103var lastNode = _nodeList.Last; 110var node = new LinkedListNode<K>(key);
Microsoft.CodeAnalysis.CodeStyle (1)
src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\LinkedListExtensions.cs (1)
13LinkedListNode<T>? currentNode = null;
Microsoft.CodeAnalysis.CSharp.Scripting.UnitTests (1)
ObjectFormatterTests.cs (1)
343var node = list.AddFirst(i);
Microsoft.CodeAnalysis.EditorFeatures (5)
Classification\Syntactic\SyntacticClassificationTaggerProvider.ClassifiedLineCache.cs (5)
85private readonly Dictionary<Span, LinkedListNode<SpanAndClassifiedSpans>> _spanToLruNode = []; 121if (!_spanToLruNode.TryGetValue(snapshotSpan.Span, out var node)) 148var node = GetOrCreateLruNode(span); 163private LinkedListNode<SpanAndClassifiedSpans> GetOrCreateLruNode(Span span) 175var firstNode = _lruList.First;
Microsoft.CodeAnalysis.Remote.ServiceHub (5)
Host\RemoteSolutionCache.cs (3)
71for (var current = _cacheNodes.First; current != null; current = current.Next, index++) 110for (var current = _cacheNodes.First; current != null; current = current.Next, index++) 125for (var current = _cacheNodes.First; current != null; current = current.Next, index++)
Services\DiagnosticAnalyzer\PerformanceQueue.cs (1)
48var first = _snapshots.First;
Services\SemanticClassification\RemoteSemanticClassificationService.Caching.cs (1)
265for (var currentNode = _cachedData.First; currentNode != null; currentNode = currentNode.Next)
Microsoft.CodeAnalysis.Workspaces (1)
src\Workspaces\SharedUtilitiesAndExtensions\Compiler\Core\Extensions\LinkedListExtensions.cs (1)
13LinkedListNode<T>? currentNode = null;
Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (4)
src\Compilers\Core\Portable\InternalUtilities\ConcurrentLruCache.cs (4)
25public LinkedListNode<K> Node; 88private void MoveNodeToTop(LinkedListNode<K> node) 103var lastNode = _nodeList.Last; 110var node = new LinkedListNode<K>(key);
Microsoft.ML.Core (4)
Utilities\LruCache.cs (4)
18private readonly Dictionary<TKey, LinkedListNode<KeyValuePair<TKey, TValue>>> _cache; 35_cache = new Dictionary<TKey, LinkedListNode<KeyValuePair<TKey, TValue>>>(_size); 44LinkedListNode<KeyValuePair<TKey, TValue>> node; 65var node = _lru.AddFirst(new KeyValuePair<TKey, TValue>(key, value));
Microsoft.ML.Tokenizers (6)
Utils\LruCache.cs (6)
17private readonly Dictionary<StringSpanOrdinalKey, LinkedListNode<KeyValuePair<string, TValue>>> _cache = new(); 51if (_cache.TryGetValue(new StringSpanOrdinalKey(key), out LinkedListNode<KeyValuePair<string, TValue>>? cached)) 78if (_cache.TryGetValue(new StringSpanOrdinalKey(ptr, key.Length), out LinkedListNode<KeyValuePair<string, TValue>>? cached)) 101if (_cache.TryGetValue(new StringSpanOrdinalKey(key), out LinkedListNode<KeyValuePair<string, TValue>>? cached)) 111LinkedListNode<KeyValuePair<string, TValue>>? nodeToEvict = _lruList.Last; 116var node = new LinkedListNode<KeyValuePair<string, TValue>>(new KeyValuePair<string, TValue>(key, value));
Microsoft.VisualBasic.Core (6)
Microsoft\VisualBasic\CompilerServices\CacheDict.vb (4)
31Dim last As LinkedListNode(Of TKey) = _list.Last 45Dim list As LinkedListNode(Of TKey) = info.List 60Friend ReadOnly List As LinkedListNode(Of TKey) 62Friend Sub New(ByVal v As TValue, ByVal l As LinkedListNode(Of TKey))
Microsoft\VisualBasic\CompilerServices\IDOBinder.vb (2)
1568Private ReadOnly _dict As New Dictionary(Of T, LinkedListNode(Of T)) 1587Dim node As LinkedListNode(Of T) = Nothing
Microsoft.VisualStudio.LanguageServices (4)
src\Compilers\Core\Portable\InternalUtilities\ConcurrentLruCache.cs (4)
25public LinkedListNode<K> Node; 88private void MoveNodeToTop(LinkedListNode<K> node) 103var lastNode = _nodeList.Last; 110var node = new LinkedListNode<K>(key);
netstandard (1)
netstandard.cs (1)
127[assembly: System.Runtime.CompilerServices.TypeForwardedTo(typeof(System.Collections.Generic.LinkedListNode<>))]
System (1)
src\libraries\shims\System\ref\System.cs (1)
136[assembly: System.Runtime.CompilerServices.TypeForwardedTo(typeof(System.Collections.Generic.LinkedListNode<>))]
System.Collections (41)
System\Collections\Generic\LinkedList.cs (41)
18internal LinkedListNode<T>? head; 54public LinkedListNode<T>? First 59public LinkedListNode<T>? Last 74public LinkedListNode<T> AddAfter(LinkedListNode<T> node, T value) 77LinkedListNode<T> result = new LinkedListNode<T>(node.list!, value); 82public void AddAfter(LinkedListNode<T> node, LinkedListNode<T> newNode) 90public LinkedListNode<T> AddBefore(LinkedListNode<T> node, T value) 93LinkedListNode<T> result = new LinkedListNode<T>(node.list!, value); 102public void AddBefore(LinkedListNode<T> node, LinkedListNode<T> newNode) 114public LinkedListNode<T> AddFirst(T value) 116LinkedListNode<T> result = new LinkedListNode<T>(this, value); 129public void AddFirst(LinkedListNode<T> node) 145public LinkedListNode<T> AddLast(T value) 147LinkedListNode<T> result = new LinkedListNode<T>(this, value); 159public void AddLast(LinkedListNode<T> node) 176LinkedListNode<T>? current = head; 179LinkedListNode<T> temp = current; 210LinkedListNode<T>? node = head; 221public LinkedListNode<T>? Find(T value) 223LinkedListNode<T>? node = head; 253public LinkedListNode<T>? FindLast(T value) 257LinkedListNode<T>? last = head.prev; 258LinkedListNode<T>? node = last; 297LinkedListNode<T>? node = Find(value); 306public void Remove(LinkedListNode<T> node) 377private void InternalInsertNodeBefore(LinkedListNode<T> node, LinkedListNode<T> newNode) 387private void InternalInsertNodeToEmptyList(LinkedListNode<T> newNode) 397internal void InternalRemoveNode(LinkedListNode<T> node) 420internal static void ValidateNewNode(LinkedListNode<T> node) 430internal void ValidateNode(LinkedListNode<T> node) 482LinkedListNode<T>? node = head; 506private LinkedListNode<T>? _node; 590internal LinkedListNode<T>? next; 591internal LinkedListNode<T>? prev; 610public LinkedListNode<T>? Next 615public LinkedListNode<T>? Previous
System.Data.Common (2)
System\Data\SortExpressionBuilder.cs (2)
44private LinkedListNode<Func<T, object>>? _currentSelector; 45private LinkedListNode<Comparison<object>>? _currentComparer;
System.IO.Packaging (4)
System\IO\Packaging\OrderedDictionary.cs (4)
17private readonly Dictionary<TKey, LinkedListNode<TValue>> _dictionary; 22_dictionary = new Dictionary<TKey, LinkedListNode<TValue>>(initialCapacity); 47if (_dictionary.TryGetValue(key, out LinkedListNode<TValue>? value)) 59if (_dictionary.TryGetValue(key, out var node))
System.Net.Requests (3)
System\Net\TimerThread.cs (3)
509for (LinkedListNode<WeakReference>? node = s_newQueues.First; node != null; node = s_newQueues.First) 520for (LinkedListNode<WeakReference>? node = s_queues.First; node != null; /* node = node.Next must be done in the body */) 525LinkedListNode<WeakReference>? next = node.Next;
System.Windows.Forms.Tests (3)
System\Windows\Forms\AccessibleObjects\MonthCalendar.CalendarAccessibleObjectTests.cs (2)
143LinkedListNode<CalendarAccessibleObject> calendarNode = controlAccessibleObject.CalendarsAccessibleObjects.First; 289LinkedListNode<CalendarAccessibleObject> calendarNode = controlAccessibleObject.CalendarsAccessibleObjects.First;
System\Windows\Forms\AccessibleObjects\MonthCalendar.CalendarBodyAccessibleObjectTests.cs (1)
142LinkedListNode<CalendarAccessibleObject> calendarNode = controlAccessibleObject.CalendarsAccessibleObjects.First;