diff options
author | Mattias Andrée <maandree@operamail.com> | 2014-01-23 10:25:39 +0100 |
---|---|---|
committer | Mattias Andrée <maandree@operamail.com> | 2014-01-23 10:25:39 +0100 |
commit | 462bb1bb37d8ab9226f563852e4a53f670237d9c (patch) | |
tree | ab8b2c701f56b2f06977327f2642498102dfdd93 /src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java | |
parent | add sentinel doubly linked list (diff) | |
download | algorithms-and-data-structures-462bb1bb37d8ab9226f563852e4a53f670237d9c.tar.gz algorithms-and-data-structures-462bb1bb37d8ab9226f563852e4a53f670237d9c.tar.bz2 algorithms-and-data-structures-462bb1bb37d8ab9226f563852e4a53f670237d9c.tar.xz |
add array linked lists
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to '')
-rw-r--r-- | src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java | 31 |
1 files changed, 31 insertions, 0 deletions
diff --git a/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java new file mode 100644 index 0000000..7e059bd --- /dev/null +++ b/src/datastructures/linkedlists/ArrayCircularDoublyLinkedList.java @@ -0,0 +1,31 @@ +/** + * 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; + + +/** + * Array circular doubly linked list class. An array + * linked list is a linked list constructed by parallel + * arrays. In this implementation, when a node is + * removed the value stored that that position is not + * removed before that position is reused. + * + * @param <T> The value stored in the structure + */ +£>export name=ArrayCircularDoublyLinkedList with_head=0 with_tail=0 with_prev=1 +£>$GPP -s £ < src/datastructures/linkedlists/array-template | sed -e '/^[/ ]\*/d' + |