Home
last modified time | relevance | path

Searched refs:LinkedListNode (Results 1 – 25 of 172) sorted by relevance

1234567

/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
345 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
345 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
350 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
350 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp63 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
84 LinkedListNode<E>* _head;
96 LinkedListNode<E>* p; in size()
118 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
119 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
127 LinkedListNode<E>* unlink_head() { in unlink_head()
223 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
242 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
268 LinkedListNode<E>* to_delete; in remove_after()
375 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp63 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
84 LinkedListNode<E>* _head;
96 LinkedListNode<E>* p; in size()
118 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
119 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
127 LinkedListNode<E>* unlink_head() { in unlink_head()
223 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
242 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
268 LinkedListNode<E>* to_delete; in remove_after()
375 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
350 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
350 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp63 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
84 LinkedListNode<E>* _head;
96 LinkedListNode<E>* p; in size()
118 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
119 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
127 LinkedListNode<E>* unlink_head() { in unlink_head()
223 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
242 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
268 LinkedListNode<E>* to_delete; in remove_after()
375 LinkedListNode<E>* node; in move()
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/utilities/
H A Dlinkedlist.hpp44 LinkedListNode() : _next(NULL) { } in LinkedListNode() function in LinkedListNode
61 LinkedListNode<E>* _head;
71 LinkedListNode<E>* p; in size()
93 virtual LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref) = 0;
94 virtual LinkedListNode<E>* insert_after (const E& e, LinkedListNode<E>* ref) = 0;
102 LinkedListNode<E>* unlink_head() { in unlink_head()
198 LinkedListNode<E>* insert_before(const E& e, LinkedListNode<E>* ref_node) { in insert_before()
217 LinkedListNode<E>* insert_after(const E& e, LinkedListNode<E>* ref_node) { in insert_after()
243 LinkedListNode<E>* to_delete; in remove_after()
350 LinkedListNode<E>* node; in move()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections/src/System/Collections/Generic/
H A DLinkedList.cs20 internal LinkedListNode<T> head;
63 public LinkedListNode<T> Last
78 public LinkedListNode<T> AddAfter(LinkedListNode<T> node, T value) in AddAfter()
81 LinkedListNode<T> result = new LinkedListNode<T>(node.list, value); in AddAfter()
86 public void AddAfter(LinkedListNode<T> node, LinkedListNode<T> newNode) in AddAfter()
94 public LinkedListNode<T> AddBefore(LinkedListNode<T> node, T value) in AddBefore()
97 LinkedListNode<T> result = new LinkedListNode<T>(node.list, value); in AddBefore()
106 public void AddBefore(LinkedListNode<T> node, LinkedListNode<T> newNode) in AddBefore()
120 LinkedListNode<T> result = new LinkedListNode<T>(this, value); in AddFirst()
151 LinkedListNode<T> result = new LinkedListNode<T>(this, value); in AddLast()
[all …]
/dports/net-im/openfire/Openfire-4.7.1/xmppserver/src/main/java/org/jivesoftware/util/
H A DLinkedList.java34 private LinkedListNode<E> head;
40 head = new LinkedListNode<>(); in LinkedList()
48 public LinkedListNode<E> getFirst() { in getFirst()
49 LinkedListNode<E> node = head.next; in getFirst()
61 public LinkedListNode<E> getLast() { in getLast()
62 LinkedListNode<E> node = head.previous; in getLast()
75 public LinkedListNode<E> addFirst(LinkedListNode<E> node) { in addFirst()
96 public LinkedListNode<E> addLast(LinkedListNode<E> node) { in addLast()
107 public LinkedListNode<E> addLast(E object) { in addLast()
116 LinkedListNode<E> node = getLast(); in clear()
[all …]
H A DLinkedListNode.java38 public class LinkedListNode<E> { class
40 public LinkedListNode<E> previous;
41 public LinkedListNode<E> next;
61 public LinkedListNode() { in LinkedListNode() method in LinkedListNode
72 public LinkedListNode(E object, LinkedListNode<E> next, LinkedListNode<E> previous) { in LinkedListNode() method in LinkedListNode
83 public LinkedListNode<E> remove() { in remove()
96 public LinkedListNode<E> insert(LinkedListNode<E> next, LinkedListNode<E> previous) { in insert()
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System/compmod/system/collections/generic/
H A Dlinkedlist.cs23 internal LinkedListNode<T> head;
63 public LinkedListNode<T> Last {
75 public LinkedListNode<T> AddAfter(LinkedListNode<T> node, T value) { in AddAfter()
77 LinkedListNode<T> result = new LinkedListNode<T>(node.list, value); in AddAfter()
82 public void AddAfter(LinkedListNode<T> node, LinkedListNode<T> newNode) { in AddAfter()
89 public LinkedListNode<T> AddBefore(LinkedListNode<T> node, T value) { in AddBefore()
91 LinkedListNode<T> result = new LinkedListNode<T>(node.list, value); in AddBefore()
99 public void AddBefore(LinkedListNode<T> node, LinkedListNode<T> newNode) { in AddBefore()
110 LinkedListNode<T> result = new LinkedListNode<T>(this, value); in AddFirst()
135 LinkedListNode<T> result = new LinkedListNode<T>(this, value); in AddLast()
[all …]
/dports/devel/flex-sdk/flex-sdk-4.6.0.23201/frameworks/projects/framework/src/mx/utils/
H A DLinkedList.as31 private var _head:LinkedListNode;
32 private var _tail:LinkedListNode;
51 _head = new LinkedListNode();
52 _tail = new LinkedListNode();
75 public function get head():LinkedListNode
135 public function insertAfter(value:*, prev:LinkedListNode):LinkedListNode
162 public function insertBefore(value:*, next:LinkedListNode):LinkedListNode
189 var cur:LinkedListNode = _head;
246 public function pop():LinkedListNode
277 public function shift():LinkedListNode
[all …]
/dports/games/xonotic/Xonotic/source/qcsrc/lib/
H A Dlinkedlist.qh3 CLASS(LinkedListNode, Object)
4 ATTRIB(LinkedListNode, ll_data, entity);
5 ATTRIB(LinkedListNode, ll_prev, LinkedListNode);
6 ATTRIB(LinkedListNode, ll_next, LinkedListNode);
7 ENDCLASS(LinkedListNode)
10 ATTRIB(LinkedList, ll_head, LinkedListNode);
11 ATTRIB(LinkedList, ll_tail, LinkedListNode);
24 LinkedListNode n = NEW(LinkedListNode);
26 LinkedListNode tail = n.ll_prev = this.ll_tail;
38 LinkedListNode n = this.ll_tail;
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Web/System.Web.Caching/
H A DCacheItemLRU.cs36 Dictionary<string, LinkedListNode <CacheItem>> dict;
37 Dictionary<LinkedListNode<CacheItem>, string> revdict;
55 dict = new Dictionary<string, LinkedListNode<CacheItem>> (StringComparer.Ordinal); in CacheItemLRU()
56 revdict = new Dictionary<LinkedListNode<CacheItem>, string> (); in CacheItemLRU()
65 LinkedListNode <CacheItem> item; in TryGetValue()
111 foreach (LinkedListNode <CacheItem> node in dict.Values) { in SelectItems()
129 foreach (LinkedListNode <CacheItem> node in dict.Values) in ToList()
140 LinkedListNode <CacheItem> node; in Remove()
158 LinkedListNode<CacheItem> node;
175 LinkedListNode<CacheItem> node;
[all …]
/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections/tests/Generic/LinkedList/
H A DLinkedList.Generic.Tests.Node.cs15 LinkedListNode<T> node; in Verify()
20 node = new LinkedListNode<T>(default(T)); in Verify()
25 node = new LinkedListNode<T>(value); in Verify()
30 node = new LinkedListNode<T>(value); in Verify()
38 node = new LinkedListNode<T>(value); in Verify()
44 node = new LinkedListNode<T>(default(T)); in Verify()
51 node = new LinkedListNode<T>(default(T)); in Verify()
H A DLinkedList.Generic.Tests.cs52 LinkedListNode<T> currentNode, previousNode, nextNode; in VerifyState()
135 LinkedListNode<T> expectedPrevious, LinkedListNode<T> expectedNext) in VerifyLinkedListNode()
320 LinkedListNode<T> previousNode, currentNode = null, nextNode; in VerifyFindLastDuplicates()
321 LinkedListNode<T>[] nodes = new LinkedListNode<T>[expectedItems.Length]; in VerifyFindLastDuplicates()
349 LinkedListNode<T> previousNode, currentNode = null, nextNode; in VerifyFindDuplicates()
350 LinkedListNode<T>[] nodes = new LinkedListNode<T>[expectedItems.Length]; in VerifyFindDuplicates()
378 LinkedListNode<T> previousNode, currentNode, nextNode; in VerifyFindLast()
401 LinkedListNode<T> previousNode, currentNode, nextNode; in VerifyFind()
425 LinkedListNode<T> headNode, tailNode; in VerifyRemovedNode()
449 LinkedListNode<T> tailNode = linkedList.Last; in VerifyRemovedNode()
[all …]
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Web/System.Web.Configuration_2.0/
H A DLruCache.cs36 Dictionary<TKey, LinkedListNode <TValue>> dict;
37 Dictionary<LinkedListNode<TValue>, TKey> revdict;
49 dict = new Dictionary<TKey, LinkedListNode<TValue>> (); in LruCache()
50 revdict = new Dictionary<LinkedListNode<TValue>, TKey> (); in LruCache()
98 LinkedListNode<TValue> node; in TryGetValue()
113 LinkedListNode<TValue> node; in Add()
132 node = new LinkedListNode<TValue> (value); in Add()
/dports/lang/mono/mono-5.10.1.57/mcs/class/Microsoft.Build/Microsoft.Build.Construction/
H A DProjectElement.cs42 linkedListNode = new LinkedListNode<ProjectElement> (this); in ProjectElement()
46 … get { return LinkedListNode.Previous == null ? null : LinkedListNode.Previous.Value; }
51 … get { return LinkedListNode.Next == null ? null : LinkedListNode.Next.Value; }
67 readonly LinkedListNode<ProjectElement> linkedListNode;
68 … internal LinkedListNode<ProjectElement> LinkedListNode { get { return linkedListNode; } } property in Microsoft.Build.Construction.ProjectElement
H A DProjectElementContainer.cs78 children.AddLast (child.LinkedListNode); in AppendChild()
88 children.AddAfter (reference.LinkedListNode, child.LinkedListNode); in InsertAfterChild()
98 children.AddBefore (reference.LinkedListNode, child.LinkedListNode); in InsertBeforeChild()
104 children.AddFirst (child.LinkedListNode); in PrependChild()
117 children.Remove (child.LinkedListNode); in RemoveChild()
/dports/lang/mono/mono-5.10.1.57/external/api-doc-tools/external/Lucene.Net.Light/src/core/Util/Cache/
H A DSimpleLRUCache.cs38 private Dictionary<TKey, LinkedListNode<ListValueEntry<TKey, TValue>>> lookup;
43 private LinkedListNode<ListValueEntry<TKey, TValue>> openNode;
49 … this.lookup = new Dictionary<TKey, LinkedListNode<ListValueEntry<TKey, TValue>>>(Capacity + 1); in SimpleLRUCache()
50 …this.openNode = new LinkedListNode<ListValueEntry<TKey, TValue>>(new ListValueEntry<TKey, TValue>(… in SimpleLRUCache()
74 …this.openNode = new LinkedListNode<ListValueEntry<TKey, TValue>>(new ListValueEntry<TKey, TValue>(… in Put()
81 LinkedListNode<ListValueEntry<TKey, TValue>> node = null; in Get()
/dports/lang/mono/mono-5.10.1.57/mcs/class/System/Test/System.Collections.Generic/
H A DLinkedListTest.cs84 LinkedListNode <int> node = intlist.First; in NonCircularNodeTest()
86 LinkedListNode <int> previous = node.Previous; in NonCircularNodeTest()
104 LinkedListNode <int> node = intlist.First; in ClearTest()
123 LinkedListNode <int> node = intlist.Find (3); in AddBeforeAndAfterTest()
124 intlist.AddAfter (node, new LinkedListNode <int> (5)); in AddBeforeAndAfterTest()
125 LinkedListNode <int> sixNode = intlist.AddAfter (node, 6); in AddBeforeAndAfterTest()
126 LinkedListNode <int> sevenNode = intlist.AddBefore (node, 7); in AddBeforeAndAfterTest()
127 intlist.AddBefore (node, new LinkedListNode <int> (8)); in AddBeforeAndAfterTest()
163 LinkedListNode <int> head, tail; in FindTest()
185 LinkedListNode <string> node = strings.Find ("baz"); in RemoveTest()
[all …]
/dports/lang/mono/mono-5.10.1.57/external/api-doc-tools/monodoc/Mono.Utilities/
H A DLRUCache.cs36 Dictionary<TKey, LinkedListNode<ListValueEntry<TKey, TValue>>> lookup;
37 LinkedListNode<ListValueEntry<TKey, TValue>> openNode;
43 … this.lookup = new Dictionary<TKey, LinkedListNode<ListValueEntry<TKey, TValue>>> (capacity + 1); in LRUCache()
44 …this.openNode = new LinkedListNode<ListValueEntry<TKey, TValue>>(new ListValueEntry<TKey, TValue> … in LRUCache()
64 …this.openNode = new LinkedListNode<ListValueEntry<TKey, TValue>>(new ListValueEntry<TKey, TValue>(… in Put()
71 LinkedListNode<ListValueEntry<TKey, TValue>> node = null; in Get()

1234567