add circularly linked lists

Signed-off-by: Mattias Andrée <maandree@operamail.com>

2 files changed, 84 insertions, 0 deletions

diff --git a/src/datastructures/linkedlists/CircularDoublyLinkedList.java b/src/datastructures/linkedlists/CircularDoublyLinkedList.java
new file mode 100644
index 0000000..5e3ba89
--- /dev/null
+++ b/src/datastructures/linkedlists/CircularDoublyLinkedList.java
@@ -0,0 +1,42 @@
+/**
+ * Copyright © 2014  Mattias Andrée (maandree@member.fsf.org)
+ * 
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ * 
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU Affero General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package datastructures.linkedlists;
+
+
+/**
+ * Circular doubly linked list class. A linked list
+ * is a list constructed from nodes, which hold stored
+ * values, with references to each other, this is
+ * usally an ineffective data structure, especially
+ * on high-level object orientated languages. A
+ * doublely linked list stores nodes with references
+ * to both the following node and the previous node.
+ * Additionally, a circularly linked list, has stores
+ * no references nodes, you must keep track of at least
+ * one node yourself; instead the nodes form a circular
+ * chain, there is no beginning and no end. This
+ * implemention only implements methods that do not
+ * require iterating over all nodes for find a
+ * specific; all other methods' — those that are
+ * implemented — time complexity is Θ(1).
+ * 
+ * @param  <T>  The value stored in the structure
+ */
+public class CircularDoublyLinkedList<T>
+£>export with_head=0 with_tail=0 with_prev=1
+£>gpp -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d'
+
diff --git a/src/datastructures/linkedlists/CircularSinglyLinkedList.java b/src/datastructures/linkedlists/CircularSinglyLinkedList.java
new file mode 100644
index 0000000..0639083
--- /dev/null
+++ b/src/datastructures/linkedlists/CircularSinglyLinkedList.java
@@ -0,0 +1,42 @@
+/**
+ * Copyright © 2014  Mattias Andrée (maandree@member.fsf.org)
+ * 
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Affero General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ * 
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU Affero General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Affero General Public License
+ * along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ */
+package datastructures.linkedlists;
+
+
+/**
+ * Circular singly linked list class. A linked list
+ * is a list constructed from nodes, which hold stored
+ * values, with references to each other, this is
+ * usally an ineffective data structure, especially
+ * on high-level object orientated languages. A
+ * singly linked list only stores nodes with references
+ * to the following node. Additionally, a circularly
+ * linked list, has stores no references nodes, you
+ * must keep track of at least one node yourself;
+ * instead the nodes form a circular chain, there is
+ * no beginning and no end. This implemention only
+ * implements methods that do not require iterating
+ * over all nodes for find a specific; all other
+ * methods' — those that are implemented — time
+ * complexity is Θ(1).
+ * 
+ * @param  <T>  The value stored in the structure
+ */
+public class CircularSinglyLinkedList<T>
+£>export with_head=0 with_tail=0 with_prev=0
+£>gpp -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d'
+