6 instantiations of LinkedListNode
System (4)
compmod\system\collections\generic\linkedlist.cs (4)
77
LinkedListNode<T> result = new
LinkedListNode
<T>(node.list, value);
91
LinkedListNode<T> result = new
LinkedListNode
<T>(node.list, value);
110
LinkedListNode<T> result = new
LinkedListNode
<T>(this, value);
135
LinkedListNode<T> result = new
LinkedListNode
<T>(this, value);
System.Data.Linq (1)
SqlClient\Reader\ObjectReaderCompiler.cs (1)
335
this.list.AddFirst(new
LinkedListNode
<CacheInfo>(new CacheInfo(elementType, dataReaderType, mapping, options, projection, factory)));
System.Workflow.Runtime (1)
WorkflowDefinitionDispenser.cs (1)
514
node = new
LinkedListNode
<Activity>(activity);
71 references to LinkedListNode
System (48)
compmod\system\collections\generic\linkedlist.cs (41)
23
internal
LinkedListNode
<T> head;
59
public
LinkedListNode
<T> First {
63
public
LinkedListNode
<T> Last {
75
public
LinkedListNode
<T> AddAfter(
LinkedListNode
<T> node, T value) {
77
LinkedListNode
<T> result = new LinkedListNode<T>(node.list, value);
82
public void AddAfter(
LinkedListNode
<T> node,
LinkedListNode
<T> newNode) {
89
public
LinkedListNode
<T> AddBefore(
LinkedListNode
<T> node, T value) {
91
LinkedListNode
<T> result = new LinkedListNode<T>(node.list, value);
99
public void AddBefore(
LinkedListNode
<T> node,
LinkedListNode
<T> newNode) {
109
public
LinkedListNode
<T> AddFirst(T value) {
110
LinkedListNode
<T> result = new LinkedListNode<T>(this, value);
121
public void AddFirst(
LinkedListNode
<T> node) {
134
public
LinkedListNode
<T> AddLast(T value) {
135
LinkedListNode
<T> result = new LinkedListNode<T>(this, value);
145
public void AddLast(
LinkedListNode
<T> node) {
158
LinkedListNode
<T> current = head;
160
LinkedListNode
<T> temp = current;
187
LinkedListNode
<T> node = head;
196
public
LinkedListNode
<T> Find(T value) {
197
LinkedListNode
<T> node = head;
220
public
LinkedListNode
<T> FindLast(T value) {
223
LinkedListNode
<T> last = head.prev;
224
LinkedListNode
<T> node = last;
257
LinkedListNode
<T> node = Find(value);
265
public void Remove(
LinkedListNode
<T> node) {
326
private void InternalInsertNodeBefore(
LinkedListNode
<T> node,
LinkedListNode
<T> newNode) {
335
private void InternalInsertNodeToEmptyList(
LinkedListNode
<T> newNode) {
344
internal void InternalRemoveNode(
LinkedListNode
<T> node) {
363
internal void ValidateNewNode(
LinkedListNode
<T> node) {
374
internal void ValidateNode(
LinkedListNode
<T> node) {
439
LinkedListNode
<T> node = head;
468
private
LinkedListNode
<T> node;
606
internal
LinkedListNode
<T> next;
607
internal
LinkedListNode
<T> prev;
623
public
LinkedListNode
<T> Next {
627
public
LinkedListNode
<T> Previous {
net\System\Net\_PrefixLookup.cs (2)
132
LinkedListNode
<PrefixValuePair> mostSpecificMatch = null;
143
for (
LinkedListNode
<PrefixValuePair> pairNode = lruList.First;
net\System\Net\_TimerThread.cs (3)
663
for (
LinkedListNode
<WeakReference> node = s_NewQueues.First; node != null; node = s_NewQueues.First) {
673
for (
LinkedListNode
<WeakReference> node = s_Queues.First; node != null; /* node = node.Next must be done in the body */) {
676
LinkedListNode
<WeakReference> next = node.Next;
regex\system\text\regularexpressions\Regex.cs (2)
1331
for (
LinkedListNode
<CachedCodeEntry> current = livecode.First; current != null; current = current.Next) {
1352
for (
LinkedListNode
<CachedCodeEntry> current = livecode.First; current != null; current = current.Next) {
System.Data.DataSetExtensions (2)
System\Data\SortExpressionBuilder.cs (2)
53
LinkedListNode
<Func<T, object>> _currentSelector = null;
54
LinkedListNode
<Comparison<object>> _currentComparer = null;
System.Data.Linq (1)
SqlClient\Reader\ObjectReaderCompiler.cs (1)
318
for (
LinkedListNode
<CacheInfo> info = this.list.First; info != null; info = info.Next) {
System.IdentityModel (1)
System\IdentityModel\Tokens\MruSessionSecurityTokenCache.cs (1)
344
public
LinkedListNode
<SessionSecurityTokenCacheKey> Node
System.ServiceModel.Internals (5)
System\Runtime\DuplicateDetector.cs (4)
12
Dictionary<T,
LinkedListNode
<T>> items;
21
this.items = new Dictionary<T,
LinkedListNode
<T>>();
49
LinkedListNode
<T> node = this.fifoList.Last;
62
LinkedListNode
<T> node;
System\Runtime\MruCache.cs (1)
168
internal
LinkedListNode
<TKey> node;
System.Web (4)
Util\SubscriptionQueue.cs (4)
34
LinkedListNode
<T> node = _list.AddLast(value);
53
LinkedListNode
<T> theNode = _list.First;
66
private readonly
LinkedListNode
<T> _node;
68
public SubscriptionToken(
LinkedListNode
<T> node) {
System.Web.DataVisualization (1)
WebForm\General\ChartHttpHandler.cs (1)
1767
private
LinkedListNode
<RingItem> _current;
System.Workflow.Runtime (9)
WorkflowDefinitionDispenser.cs (9)
413
private void AddToDictionary(
LinkedListNode
<Activity> node)
429
LinkedListNode
<Activity> node;
430
node = this.hashtable[md5Codes] as
LinkedListNode
<Activity>;
443
LinkedListNode
<Activity> node;
457
node = this.hashtable[key] as
LinkedListNode
<Activity>;
463
node = this.hashtable[key] as
LinkedListNode
<Activity>;
481
node = this.hashtable[key] as
LinkedListNode
<Activity>;
542
foreach (
LinkedListNode
<Activity> node in this.hashtable.Values)
558
foreach (
LinkedListNode
<Activity> node in hashtable.Values)