GeezerVison is showing github.com — Java/DataStructures/Lists/CircleLinkedList.java at master · mimibar/Java

Expand file tree

CircleLinkedList.java

Copy path

More file actions

Latest commit

History

65 lines (55 loc) · 2.16 KB

CircleLinkedList.java

Copy path

File metadata and controls

65 lines (55 loc) · 2.16 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

package DataStructures.Lists;

public class CircleLinkedList<E> {

private static class Node<E> {

Node<E> next;

E value;

private Node(E value, Node<E> next) {

this.value = value;

this.next = next;

}

//For better O.O design this should be private allows for better black box design

private int size;

//this will point to dummy node;

private Node<E> head;

//constructer for class.. here we will make a dummy node for circly linked list implementation with reduced error catching as our list will never be empty;

public CircleLinkedList() {

//creation of the dummy node

head = new Node<E>(null, head);

size = 0;

}

// getter for the size... needed because size is private.

public int getSize() {

return size;

}

// for the sake of simplistiy this class will only contain the append function or addLast other add functions can be implemented however this is the basses of them all really.

public void append(E value) {

if (value == null) {

// we do not want to add null elements to the list.

throw new NullPointerException("Cannot add null element to the list");

}

//head.next points to the last element;

head.next = new Node<E>(value, head);

size++;

}

public E remove(int pos) {

if (pos > size || pos < 0) {

//catching errors

throw new IndexOutOfBoundsException("position cannot be greater than size or negative");

}

Node<E> iterator = head.next;

//we need to keep track of the element before the element we want to remove we can see why bellow.

Node<E> before = head;

for (int i = 1; i <= pos; i++) {

iterator = iterator.next;

before = before.next;

}

E saved = iterator.value;

// assigning the next reference to the the element following the element we want to remove... the last element will be assigned to the head.

before.next = iterator.next;

// scrubbing

iterator.next = null;

iterator.value = null;

return saved;

}