@@ -0,0 +1,1612 @@
+/**%0A * Copyright %C2%A9 2014  Mattias Andr%C3%A9e (maandree@member.fsf.org)%0A * %0A * This program is free software: you can redistribute it and/or modify%0A * it under the terms of the GNU Affero General Public License as published by%0A * the Free Software Foundation, either version 3 of the License, or%0A * (at your option) any later version.%0A * %0A * This program is distributed in the hope that it will be useful,%0A * but WITHOUT ANY WARRANTY; without even the implied warranty of%0A * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the%0A * GNU Affero General Public License for more details.%0A * %0A * You should have received a copy of the GNU Affero General Public License%0A * along with this program.  If not, see %3Chttp://www.gnu.org/licenses/%3E.%0A */%0Apackage datastructures.linkedlists;%0A%0A%0A/**%0A * Doubly linked list class. A linked list is a%0A * list constructed from nodes, which hold stored%0A * values, with references to each other, this is%0A * usally an ineffective data structure, especially%0A * on high-level object orientated languages. A%0A * doublely linked list stores nodes with references%0A * to both the following node and the previous node.%0A * It also stores one refence nodes, the first node%0A * in the list. The implemention only implements%0A * methods that do not require iterating over all%0A * nodes for find a specific; all other methods' %E2%80%94%0A * those that are  * implemented %E2%80%94 time complexity%0A * is %CE%98(1).%0A * %0A * @param  %3CT%3E  The value stored in the structure%0A */%0Apublic class TaillessDoublyLinkedList%3CT%3E%0A%C2%A3%3Eexport with_tail=0 with_prev=1%0A%C2%A3%3Egpp -s %C2%A3 %3C src/datastructures/linkedlists/template %7C sed -e '/%5E%5B/ %5D%5C*/d'%0A%0A

add tailless doubly linked list