9 writes to head
System (9)
compmod\system\collections\generic\linkedlist.cs (9)
94head = result; 105head = newNode; 116head = result; 129head = node; 165head = null; 318head = null; 339head = newNode; 349head = null; 355head = node.next;
36 references to head
System (36)
compmod\system\collections\generic\linkedlist.cs (36)
60get { return head;} 64get { return head == null? null: head.prev;} 93if ( node == head) { 104if ( node == head) { 111if (head == null) { 115InternalInsertNodeBefore( head, result); 124if (head == null) { 128InternalInsertNodeBefore( head, node); 136if (head== null) { 140InternalInsertNodeBefore( head, result); 148if (head == null) { 152InternalInsertNodeBefore( head, node); 158LinkedListNode<T> current = head; 187LinkedListNode<T> node = head; 192} while (node != head); 197LinkedListNode<T> node = head; 206} while (node != head); 214} while (node != head); 221if ( head == null) return null; 223LinkedListNode<T> last = head.prev; 271if ( head == null) { throw new InvalidOperationException(SR.GetString(SR.LinkedListEmpty)); } 272InternalRemoveNode(head); 276if ( head == null) { throw new InvalidOperationException(SR.GetString(SR.LinkedListEmpty)); } 277InternalRemoveNode(head.prev); 336Debug.Assert( head == null && count == 0, "LinkedList must be empty when this method is called!"); 346Debug.Assert( head != null, "This method shouldn't be called on empty list!"); 348Debug.Assert(count == 1 && head == node, "this should only be true for a list with only one node"); 354if ( head == node) { 439LinkedListNode<T> node = head; 445} while (node != head); 484node = list.head; 530if (node == list.head) { 542node = list.head; 624get { return next == null || next == list.head? null: next;} 628get { return prev == null || this == list.head? null: prev;}