Hochschulprojekte
/
SpaceScooter
0
0
Fork 0
Code Issues Pull Requests Activity

Reuse free null-nodes in the list to add new entities.

This commit is contained in:
Jan Philipp Timme 2014-11-08 18:46:54 +01:00
parent a4c788ad22
commit f8246956c4
1 changed files with 13 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
src/de/teamteamteam/spacescooter/datastructure/ConcurrentLinkedList.java
View File

@ -17,6 +17,7 @@ public class ConcurrentLinkedList<T> {
*/
public ConcurrentLinkedList() {
this.head = new ConcurrentLinkedListNode<T>();
this.head.setNext(new ConcurrentLinkedListNode<T>());
}
@ -24,10 +25,18 @@ public class ConcurrentLinkedList<T> {
* Add an element to the list.
*/
public void add(T element) {
ConcurrentLinkedListNode<T> newNode = new ConcurrentLinkedListNode<T>(element);
ConcurrentLinkedListNode<T> currentNode = this.head;
while(currentNode.hasNext()) currentNode = currentNode.next();
currentNode.setNext(newNode);
ConcurrentLinkedListNode<T> currentNode = this.head.next();
//jump to the next node until we reached the last OR we got one that has a null value.
while(currentNode.hasNext() && currentNode.getValue() != null) currentNode = currentNode.next();
//if it has a null value, add the element here
if(currentNode.getValue() == null) {
currentNode.setValue(element);
} else {
//since getValue must be != null, we surely reached the _last_ node.
//create a new node and append it to the list.
ConcurrentLinkedListNode<T> newNode = new ConcurrentLinkedListNode<T>(element);
currentNode.setNext(newNode);
}
}
/**