From ee6fa2e0bf2dcd6cdd833aa2f19fd30e9c23770b Mon Sep 17 00:00:00 2001 From: Mattias Andrée Date: Thu, 23 Jan 2014 15:50:29 +0100 Subject: xor-linked array linked lists MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Mattias Andrée --- .../ArrayTaillessXORDoublyLinkedList.java | 37 ++++++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 src/datastructures/linkedlists/ArrayTaillessXORDoublyLinkedList.java (limited to 'src/datastructures/linkedlists/ArrayTaillessXORDoublyLinkedList.java') diff --git a/src/datastructures/linkedlists/ArrayTaillessXORDoublyLinkedList.java b/src/datastructures/linkedlists/ArrayTaillessXORDoublyLinkedList.java new file mode 100644 index 0000000..6984c19 --- /dev/null +++ b/src/datastructures/linkedlists/ArrayTaillessXORDoublyLinkedList.java @@ -0,0 +1,37 @@ +/** + * 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 . + */ +package datastructures.linkedlists; + + +/** + * Array tailless XOR doubly linked list class. An array + * linked list is a linked list constructed by parallel + * arrays. In an XOR doubly linked list each node as a + * reference that is the bitwise exclusive-or or the + * address to both the next and the previous node. In this + * implementation, when a node is removed the value stored + * that that position is not removed before that position + * is reused. Insertion methods have constant amortised + * time complexity, and constant amortised memory + * complexity, removal methods have constant time + * complexity and constant memory complexity. + * + * @param The value stored in the structure + */ +£>export name=ArrayTaillessXORDoublyLinkedList array=1 with_sentinel=0 with_head=1 with_tail=0 with_prev=1 with_xor=1 +£>$GPP -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d' -e '/^$/d' + -- cgit v1.2.3-70-g09d2