4 instantiations of Node
System.Collections.Concurrent (4)
System\Collections\Concurrent\ConcurrentStack.cs (4)
96
Node newNode = new
Node
(element);
280
Node newNode = new
Node
(item);
342
head = tail = new
Node
(items[startIndex]);
345
Node node = new
Node
(items[i]);
23 references to Node
System.Collections.Concurrent (23)
System\Collections\Concurrent\ConcurrentStack.cs (23)
47
internal
Node
? _next; // Next pointer.
60
private volatile
Node
? _head; // The stack is a singly linked list, and only remembers the head.
93
Node
? lastNode = null;
96
Node
newNode = new Node(element);
149
for (
Node
? curr = _head; curr != null; curr = curr._next)
280
Node
newNode = new Node(item);
341
Node
head, tail;
345
Node
node = new Node(items[i]);
367
private void PushCore(
Node
head,
Node
tail)
434
Node
? head = _head;
461
Node
? head = _head;
541
Node
? poppedHead;
557
Node
? poppedNode;
580
private int TryPopCore(int count, out
Node
? poppedHead)
586
Node
? head;
587
Node
next;
647
private static void CopyRemovedItems(
Node
head, T[] collection, int startIndex, int nodesCount)
649
Node
? current = head;
681
Node
? curr = _head;
701
private static List<T> ToList(
Node
? curr)
737
private static IEnumerator<T> GetEnumerator(
Node
? head)
739
Node
? current = head;