diff options
author | Mattias Andrée <maandree@operamail.com> | 2014-01-22 12:05:10 +0100 |
---|---|---|
committer | Mattias Andrée <maandree@operamail.com> | 2014-01-22 12:05:10 +0100 |
commit | 2a552de5840eb3ccf94e9462ec936a95adf5780e (patch) | |
tree | 8beb6b2fdc7adf2f7deee9ceca7357bb0288dec1 /src | |
parent | add doubly linked list (diff) | |
download | algorithms-and-data-structures-2a552de5840eb3ccf94e9462ec936a95adf5780e.tar.gz algorithms-and-data-structures-2a552de5840eb3ccf94e9462ec936a95adf5780e.tar.bz2 algorithms-and-data-structures-2a552de5840eb3ccf94e9462ec936a95adf5780e.tar.xz |
add tailless doubly linked list
Signed-off-by: Mattias Andrée <maandree@operamail.com>
Diffstat (limited to 'src')
-rw-r--r-- | src/datastructures/linkedlists/TaillessDoublyLinkedList.java | 40 |
1 files changed, 40 insertions, 0 deletions
diff --git a/src/datastructures/linkedlists/TaillessDoublyLinkedList.java b/src/datastructures/linkedlists/TaillessDoublyLinkedList.java new file mode 100644 index 0000000..bcc680c --- /dev/null +++ b/src/datastructures/linkedlists/TaillessDoublyLinkedList.java @@ -0,0 +1,40 @@ +/** + * 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; + + +/** + * 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. + * It also stores one refence nodes, the first node + * in the list. The 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 TaillessDoublyLinkedList<T> +£>export with_tail=0 with_prev=1 +£>gpp -s £ < src/datastructures/linkedlists/template | sed -e '/^[/ ]\*/d' + |